By Topic

Joint source coding, routing and resource allocation for wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wei Yu ; Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada ; Jun Yuan

This paper presents an optimization framework for a wireless sensor network in which each sensor plays a dual role of sensing the environment and relaying the sensor information. The design of such a network involves two distinct aspects. First, as the observations of the underlying environment are often correlated, distributive source coding methods have the potential to greatly improve the efficiency of the sensor operation. Thus, information theoretical source coding methods are useful in the application layer. Second, as each sensor must send information individually to a central processor, routing and power allocation in the network and physical layers are also important issues. The main focus of this paper is an optimization framework that jointly solves the source coding, routing and power allocation problems in such a network. The main insight is the following: the joint optimization problem for a sensor network, when solved in the dual domain, provides a natural separation between the application layer, the network layer and the physical layer. The interface between the layers is precisely the dual optimization variables. The crucial observation that makes this possible is that the underlying source coding problem in the application layer and the channel coding problem in the physical layer can always be made convex via time-division or frequency-division multiplexing. Convexification in time or frequency enables dual algorithms to reach the global optimum of the overall network optimization problem efficiently.

Published in:

IEEE International Conference on Communications, 2005. ICC 2005. 2005  (Volume:2 )

Date of Conference:

16-20 May 2005