An information-theoretic view of connectivity in wireless sensor networks

Author

Xin Lin ; Srikant, R.

Author_Institution

Dept. of Comput. Sci., California Univ., Davis, CA, USA

fYear

2004

fDate

4-7 Oct. 2004

Firstpage

508

Lastpage

516

Abstract

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.

Keywords

information theory; probability; telecommunication network topology; wireless sensor networks; information-theoretic view; linear network; network-topology; one-dimensional network; planar network; two-dimensional network; wireless sensor network; Ad hoc networks; Computer science; Intelligent networks; Interference; Network topology; Protective relaying; Signal to noise ratio; Sufficient conditions; Wireless networks; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Print_ISBN

0-7803-8796-1

Type

conf

DOI

10.1109/SAHCN.2004.1381953

Filename

1381953