Coverage for target localization in wireless sensor networks

Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consider the coverage problem from the perspective of target localization. In this paper, we propose two methods to estimate the necessary sensor density which can guarantee a localization error bound over the sensing field. In the first method, we convert the coverage problem for localization to a conventional disk coverage problem, where the sensing area is a disk centered around the sensor. Our results show that the disk coverage model requires 4 times more sensors for tracking compared to detection applications. We then introduce the idea of sector coverage, which can satisfy the same coverage conditions with 2 times less sensors over the disk coverage approach. This shows that conventional disk coverage model is insufficient for tracking applications, since it overestimates the sensor density by two times. Simulation results show that the network density requirements derived through sector coverage are close to the actual need for target tracking applications

[1]  Kui Wu,et al.  Sensor localization with Ring Overlapping based on Comparison of Received Signal Strength Indicator , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[2]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

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

[4]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[5]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

[6]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[7]  Wei Wang,et al.  Information coverage for wireless sensor networks , 2005, IEEE Communications Letters.

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

[9]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[10]  David Evans,et al.  Localization for mobile sensor networks , 2004, MobiCom '04.

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

[12]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[13]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

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

[15]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[16]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

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

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

[19]  Mani B. Srivastava,et al.  On the Error Characteristics of Multihop Node Localization in Ad-Hoc Sensor Networks , 2003, IPSN.

[20]  David Wells,et al.  The Penguin Dictionary of Curious and Interesting Geometry , 1992 .

[21]  Radhika Nagpal,et al.  Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network , 2003, IPSN.

[22]  Deborah Estrin,et al.  Lower bounds of localization uncertainty in sensor networks , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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