The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2012 vol.11)
pp: 631-643
Yigal Bejerano , Bell-Labs, Alcatel-Lucent, Murray Hill
ABSTRACT
Wireless sensor networks (WSNs) have recently emerged as a prominent technology for environmental monitoring and hazardous event detection. Yet, their success depends considerably on their ability to ensure reliable event detection. Such guarantees can be provided only if the target field monitored by a WSN does not contain coverage holes that are not monitored by any sensor. Currently, the coverage hole detection solutions require accurate knowledge of the sensors locations, which cannot be easily obtained, or they cannot provide guarantees on the coverage quality. In this study, we address the challenge of designing an accurate k-coverage verification scheme, without using location information, for a predefined k\ge 1. To this end, we present two efficient, distributed, and localized k-coverage verification schemes with proven guarantees on their coverage detection quality. Our simulations show that the schemes accurately detect coverage holes of various sizes.
INDEX TERMS
Coverage verification, coordinate-free, wireless, sensor networks.
CITATION
Yigal Bejerano, "Coverage Verification without Location Information", IEEE Transactions on Mobile Computing, vol.11, no. 4, pp. 631-643, April 2012, doi:10.1109/TMC.2011.85
REFERENCES
[1] F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach. Morgan Kaufmann, 2004.
[2] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc. IEEE INFOCOM, Apr. 2001.
[3] N. Ahmed, S.S. Kanhere, and S. Jha, “The Holes Problem in Wireless Sensor Networks: A Survey,” Mobile Computing and Comm. Rev., vol. 9, no. 2, pp. 4-18, 2005.
[4] M. Cardei and J. Wu, “Coverage in Wireless Sensor Networks,” Handbook of Sensor Networks, CRC Press, 2004.
[5] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable Sensor Grids: Coverage, Connectivity and Diameter,” Proc. IEEE INFOCOM, Apr. 2003.
[6] S. Kumar, T.H. Lai, and J. Balogh, “On k-Coverage in a Mostly Sleeping Sensor Network,” Proc. ACM MobiCom, 2004.
[7] P. Balister, Z. Zheng, S. Kumar, and P. Sinha, “Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks,” Proc. IEEE INFOCOM, Apr. 2009.
[8] Q. Fang, J. Gao, and L. Guibas, “Locating and Bypassing Routing Holes in Sensor Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[9] G. Wang, G. Cao, and T. La-Porta, “Movement-Assisted Sensor Deployment,” Proc. IEEE INFOCOM, Mar. 2004.
[10] A. Man-Cho So and Y. Ye, “On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams,” Proc. Workshop Internet and Network Economics (WINE '05), pp. 584-593, 2005.
[11] C-F. Huang and Y.-C Tseng, “The Coverage Problem in a Wireless Sensor Network,” Proc. ACM Int'l Conf. Wireless Sensor Networks and Applications (WSNA '03), Sept. 2003.
[12] H. Zhang and J.C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Int'l J. Wireless Ad Hoc and Sensor Networks, vol. 1, nos. 1/2, pp. 89-123, Jan. 2005.
[13] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), Nov. 2003.
[14] D. Niculescu, “Positioning in Ad Hoc Sensor Networks,” IEEE Network, vol. 18, no. 4, pp. 24-29, July/Aug. 2004.
[15] X. Ji and H. Zha, “Robust Sensor Localization Algorithm in Wireless Ad-Hoc Sensor Networks,” Proc. 12th Int'l Conf. Computer Comm. and Networks (ICCCN), July/Aug. 2004.
[16] N. Patwari, J.N. Ash, S. Kyperountas, A.O. Hero, R.L. Moses, and N.S. Correal, “Locating the Nodes: Cooperative Localization in Wireless Sensor Networks,” IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 54-69, July 2005.
[17] D.K. Goldenberg, P. Bihler, Y.R. Yang, M. Cao, J. Fang, A.S. Morse, and B.D.O. Anderson, “Localization in Sparse Networks Using Sweeps,” Proc. ACM MobiCom, Sept. 2006.
[18] Q. Shi, S. Kyperountas, N.S. Correal, and F. Niu, “Performance Analysis of Relative Location Estimation for Multihop Wireless Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 23, no. 4, pp. 830-838, Apr. 2005.
[19] R. Ghrist and A. Muhammad, “Coverage and Hole-Detection in Sensor Networks via Homology,” Proc. Int'l Symp. Information Processing in Sensor Networks (IPSN '05), Apr. 2005.
[20] X. Li, D.K. Hunter, and K. Yang, “Distributed Coordinate-Free Hole Detection and Recovery,” Proc. IEEE Global Telecomm. Conf. (GlobeCom '06), Nov. 2006.
[21] Y. Wang, J. Gao, J.S.B. Mitchell, “Boundary Recognition in Sensor Networks by Topological Methods,” Proc. ACM MobiCom, 2006.
[22] C. Zhang, Y. Zhang, and Y. Fang, “Detecting Coverage Boundary Nodes in Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Networking, Sensing and Control (ICNSC '06), Apr. 2006.
[23] R.R. Choudhury and R. Kravets, “Location-Independent Coverage in Wireless Sensor Networks,” technical report, Univ. of Illinois at Urbana-Champaign, 2004.
[24] Y. Bejerano, “Simple and Efficient k-Coverage Verification without Location Information,” Proc. IEEE INFOCOM, Apr. 2008.
[25] G. Kasbekar, Y. Bejerano, and S. Sarkar, “Generic Coverage Verification without Location Information Using Dimension Reduction,” Proc. Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT '09), June 2009.
[26] B. Alavi and K. Pahlavan, “Modeling of the TOA-Based Distance Measurement Error Using UWB Indoor Radio Measurements,” IEEE Comm. Letters, vol. 10, no. 4, pp. 275-277, Apr. 2006.
[27] C.Y. Wen, R.D. Morris, and W.A. Sethares, “Distance Estimation Using Bidirectional Communications without Synchronous Clocking,” IEEE Trans. Signal Processing, vol. 55, no. 5, pp. 1927-1939, May 2007.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool