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

Zhang, Honghai; Hou, Jennifer C.

Permalink

https://hdl.handle.net/2142/11004 Copy

Description

Title

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

Author(s)

• Zhang, Honghai
• Hou, Jennifer C.

Issue Date

2005-04

Keyword(s)

wireless sensor networks

Abstract

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.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11004

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections