Self organization of sensor networks for energy-efficient border coverage

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

[1]  Jan Vitek,et al.  Distributed and dynamic voronoi overlays for coverage detection and distributed hash tables in ad-hoc networks , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[2]  Erkki Laitinen,et al.  Radio coverage optimization with genetic algorithms , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[3]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[4]  Zhihua Qu,et al.  Coverage control for a mobile robot patrolling a dynamic and uncertain environment , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[5]  D. Kottwitz.  The densest packing of equal circles on a sphere , 1991 .

[6]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[7]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

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

[9]  P. R. Kumar,et al.  Internets in the sky: The capacity of three-dimensional wireless networks , 2001, Commun. Inf. Syst..

[10]  H. Coxeter.  The problem of packing a number of equal nonoverlapping circles on a sphere , 1962 .

[11]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[12]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[13]  Kristofer S. J. Pister,et al.  MEMS for distributed wireless sensor networks , 2002, 9th International Conference on Electronics, Circuits and Systems.

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

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

[16]  Jan M. Rabaey,et al.  Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks , 2002, USENIX Annual Technical Conference, General Track.

[17]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[18]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.

[19]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[20]  Sesh Commuri,et al.  Coverage Strategies in Wireless Sensor Networks , 2006, Int. J. Distributed Sens. Networks.

[21]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[22]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

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

[24]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[25]  Dario Pompili,et al.  Three-dimensional routing in underwater acoustic sensor networks , 2005, PE-WASUN '05.

[26]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

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

[28]  Leonidas J. Guibas,et al.  Lightweight sensing and communication protocols for target enumeration and aggregation , 2003, MobiHoc '03.

[29]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[30]  Sesh Commuri,et al.  An energy efficient and self-healing 3-dimensional sensor cover , 2007, Int. J. Ad Hoc Ubiquitous Comput..

[31]  S. Verblunsky.  On the Least Number of Unit Circles Which Can Cover a Square , 1949 .

[32]  Milica Stojanovic,et al.  Shallow water acoustic networks , 2001, IEEE Commun. Mag..

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