By Topic

An information-theoretic view of connectivity in 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)
Xin Lin ; Dept. of Comput. Sci., California Univ., Davis, CA, USA ; R. Srikant

In this paper, we study the connectivity properties of a wireless sensor network from an information-theoretic viewpoint. We consider both regular linear (one-dimensional) and planar (two-dimensional) networks with unreliable sensor nodes, i.e., each node is inactive/dead with a certain probability. We study the following problems: 1) what is the fundamental limit on the data rate that such a network can support for a single sensor node to the destination under transmission power and network-topology constraints? 2) What are the constraints on the network topology such that any (single) sensor can communicate with the destination at a desired rate? For problem 1), we provide upper and lower bounds on the achievable data rate, and for problem 2), we provide upper and lower bounds on the distance between the nodes required for communication at the desired rate.

Published in:

Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on

Date of Conference:

4-7 Oct. 2004