Expected k-coverage in wireless sensor networks

We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that can be covered by at least k out of n sensors. Our results are important in predicting the degree of coverage a sensor network may provide and in determining related parameters (sensory range, number of sensors, etc.) for a desired level of coverage. We demonstrate the utility of our results by presenting a node scheduling scheme that conserves energy while retaining network coverage. Additional simulation results have confirmed the accuracy of our analysis. � 2005 Elsevier B.V. All rights reserved.

[1]  Deborah Estrin,et al.  Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems , 2001 .

[2]  Edward R. Dougherty,et al.  Probability and Statistics for the Engineering, Computing and Physical Sciences , 1990 .

[3]  Ellis Horowitz,et al.  Computer Algorithms / C++ , 2007 .

[4]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

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

[6]  Mihaela Cardei,et al.  Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

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

[8]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[9]  Christian Bettstetter,et al.  How to achieve a connected ad hoc network with homogeneous range assignment: an analytical study with consideration of border effects , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

[10]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[11]  Jun Lu,et al.  Coverage-aware self-scheduling in sensor networks , 2003, 2002 14th International Conference on Ion Implantation Technology Proceedings (IEEE Cat. No.02EX505).

[12]  Jean-Luc Gaudiot,et al.  Introducing the New Editor-in-Chief of the IEEE Transactions on Computers , 2003, IEEE Trans. Computers.

[13]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[14]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[15]  Jan Vitek,et al.  Coverage preserving redundancy elimination in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[16]  오병균,et al.  [서평]「Computer Algorithms/C++」 , 1998 .

[17]  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).

[18]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[19]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[20]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[21]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[22]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[23]  Li-Hsing Yen,et al.  Link probability, network coverage, and related properties of wireless ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[24]  Philippe Piret On the connectivity of radio networks , 1991, IEEE Trans. Inf. Theory.

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

[26]  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).

[27]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.