Critical density thresholds for coverage in wireless sensor networks

Sensor networks are deployed to monitor the physical world and to provide relevant data to the users. An important question in such networks is to estimate the number of sensors required to achieve complete coverage of the desired region. The number of sensors required would depend upon the physical characteristics of the individual sensors as well as the nature of the target. In this paper, we address the problem of finding the critical density of sensors for complete coverage. We use an exposure-based model to find the number of sensors required to cover an area for given sensor and target characteristics. The accuracy of the results is established via simulations.

[1]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[2]  Li Wei.  Coverage Problems in Wireless Sensor Networks , 2005 .

[3]  Massimo Franceschetti,et al.  A Geometric Theorem for Wireless Network Design Optimization , 2002 .

[4]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

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

[7]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[8]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.