Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?

Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintaining k-coverage depends on the area of the monitored region, the probability that a node fails or powers off (to save energy), and the deployment strategy. In this paper, we derive the density required to maintain k-coverage under three deployment strategies: (i) nodes are deployed as a Poisson point process, (ii) nodes are uniformly randomly distributed, (iii) nodes are deployed on regular grids. Our results show that under most circumstances, grid deployment renders asymptotically lower node density than random deployment. These results override a previous conclusion that grid deployment may render higher node density than random node distributions.

[1]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[2]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[3]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[4]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[5]  Mohammad Ilyas,et al.  Smart Dust , 2006 .

[6]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[7]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[8]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Peng-Jun Wan,et al.  Coverage by randomly deployed wireless sensor networks , 2005, IEEE Transactions on Information Theory.

[10]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[11]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.

[12]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.