Coverage for target localization in wireless sensor networks

ABSTRACT

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.

REFERENCES

• 1: Chi-Fu Huang , Yu-Chee Tseng, The coverage problem in a wireless sensor network, Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, September 19-19, 2003, San Diego, CA, USA [doi>10.1145/941350.941367]
• 2: B. Wang, W. Wang, V. Srinivasan, and K. C. Chua, "Information coverage and its applications in sensor networks," IEEE Communications Letters, vol. 9, no. 11, pp. 967--969, 2005.
• 3: S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.Srivastava, "Coverage problems in wireless ad-hoc sensor network," in Proceedings of the 20th IEEE INFOCOM, Mar 2001, pp. 1380--1387.
• 4: H. Zhang and J. Hou, "Maintaining coverage and connectivity in large sensor networks," in International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad hoc Wireless and Peer-to-Peer Networks, Feb 2004.
• 5: G. Wang, G. Cao, and T. L. Porta, "Movement-assisted sensor deployment," in Proceedings of the 23st IEEE INFOCOM, Mar 2004, pp. 2469--2479.
• 6: Seapahn Meguerdichian , Farinaz Koushanfar , Gang Qu , Miodrag Potkonjak, Exposure in wireless Ad-Hoc sensor networks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.139-150, July 2001, Rome, Italy [doi>10.1145/381677.381691]
• 7: Santosh Kumar , Ten H. Lai , Anish Arora, Barrier coverage with wireless sensors, Proceedings of the 11th annual international conference on Mobile computing and networking, August 28-September 02, 2005, Cologne, Germany [doi>10.1145/1080829.1080859]
• 8: Tian He , Chengdu Huang , Brian M. Blum , John A. Stankovic , Tarek Abdelzaher, Range-free localization schemes for large scale sensor networks, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA [doi>10.1145/938985.938995]
• 9: Nissanka B. Priyantha , Anit Chakraborty , Hari Balakrishnan, The Cricket location-support system, Proceedings of the 6th annual international conference on Mobile computing and networking, p.32-43, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345917]
• 10: A. Savvides, A. Sachin, W. Garber, R. Moses, and M. Srivastava, "On the error characteristics of multihop node localization in ad-hoc sensor networks," in Proceedings of 2nd International Workshop on Information Processing in Sensor Networks (IPSN), Apr 2003, pp. 317--332.
• 11: H. Wang, L. Yip, K. Yao, and D. Estrin, "Lower bounds of localization uncertainty in sensor networks," in IEEE International Conference on Acoustics, Speech (ICASSP), May 2004, pp. 917--920.
• 12: Jeffrey Hightower , Gaetano Borriello, Location Systems for Ubiquitous Computing, Computer, v.34 n.8, p.57-66, August 2001 [doi>10.1109/2.940014]
• 13: Lingxuan Hu , David Evans, Localization for mobile sensor networks, Proceedings of the 10th annual international conference on Mobile computing and networking, September 26-October 01, 2004, Philadelphia, PA, USA [doi>10.1145/1023720.1023726]
• 14: Adaptive Beacon Placement, Proceedings of the The 21st International Conference on Distributed Computing Systems, p.489, April 16-19, 2001
• 15: R. Nagpal, H. Shrobe, and J. Bachrach, "Organizing a global coordinate system from local information on an ad hoc sensor network," in Proceedings of 2nd International Workshop on Information Processing in Sensor Networks (IPSN), Apr 2003, pp. 333--348.
• 16: C. Liu, K. Wu, , and T. He, "Sensor localization with ring overlapping based on comparison of received signal strength indicator," in Proceedings of IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), Oct 2004, pp. 516--518.
• 17: D. Wells, The Penguin Dictionary of Curious and Interesting Geometry. London: Penguin, 1991.
• 18: P. Hall, Introduction to the theory of coverage processes. John Wiley & Sons, Inc, 1988.
• 19: J. F. Kenney and E. S. Keeping, Mathematics of Statistics. Princeton, 1962.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

General Terms:
Design, Performance

Keywords:
coverage, sensor networks, target tracking