A GIS Based Wireless Sensor Network Coverage Estimation and Optimization: A Voronoi Approach

Recent advances in sensor technology have resulted in the design and development of more efficient and low cast sensor networks for environmental monitoring, object surveillance, tracking and controlling of moving objects, etc. The deployment of a sensor network in a real environment presents several challenging issues that are often oversimplified in the existing solutions. Different approaches have been proposed in the literatures to solve this problem. Many of these approaches use Voronoi diagram and Delaunay triangulation to identify sensing holes in the network and create an optimal arrangement of the sensors to eliminate the holes. However, most of these methods do not consider the reality of the environment in which the sensor network is deployed. This paper presents a survey of the existing solutions for geosensor network optimization that use Voronoi diagram and Delaunay triangulation and identifies their limitations in a real world application. Next, it proposes a more realistic approach by integrating spatial information in the optimization process based on Voronoi diagram. Finally the results of two cases studies based on the proposed approach in natural area and urban environment are presented and discussed.

[1]  Anthony Man-Cho So,et al.  On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams , 2005, WINE.

[2]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[4]  Deborah Estrin,et al.  Habitat monitoring with sensor networks , 2004, CACM.

[5]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

[6]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Sven Skyum.  A simple algorithm for computing the smallest enclosing circle , 1990 .

[8]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[9]  Di Ma,et al.  A survey of movement strategies for improving network coverage in wireless sensor networks , 2009, Comput. Commun..

[10]  Antonio Alfredo Ferreira Loureiro,et al.  Scheduling nodes in wireless sensor networks: a Voronoi approach , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[11]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[12]  Cyrus Shahabi,et al.  Supporting spatial aggregation in sensor network databases , 2004, GIS '04.

[13]  A. Ghosh,et al.  Estimating coverage holes and enhancing coverage in mixed sensor networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[14]  Qingfeng Huang.  Solving an Open Sensor Exposure Problem using Variational Calculus , 2003 .

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

[16]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[17]  Liu Wenyu,et al.  A coverage algorithm for three-dimensional large-scale sensor network , 2007, 2007 International Symposium on Intelligent Signal Processing and Communication Systems.

[18]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[19]  Yeh-Ching Chung,et al.  A Delaunay Triangulation based method for wireless sensor network deployment , 2007, Comput. Commun..

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

[21]  Antonio Alfredo Ferreira Loureiro,et al.  MANNA: a management architecture for wireless sensor networks , 2003, IEEE Commun. Mag..

[22]  Rung-Hung Gau,et al.  A Dual Approach for The Worst-Case-Coverage Deployment Problem in Ad-Hoc Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[23]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

[24]  Maja J. Matarić,et al.  Cover Me! A Self-Deployment Algorithm for Mobile Sensor Networks , 2001 .

[25]  Sajal K. Das,et al.  Coverage and connectivity issues in wireless sensor networks: A survey , 2008, Pervasive Mob. Comput..

[26]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[27]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

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

[29]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[30]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[31]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

[33]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[34]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[35]  Michael F. Worboys,et al.  Monitoring qualitative spatiotemporal change for geosensor networks , 2006, Int. J. Geogr. Inf. Sci..

[36]  Miodrag Potkonjak,et al.  Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[37]  Silvia Nittel,et al.  A Survey of Geosensor Networks: Advances in Dynamic Environmental Monitoring , 2009, Sensors.

[38]  Bhaskar Krishnamachari,et al.  Efficient Distributed Topology Control in 3-Dimensional Wireless Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[39]  Kamarulzaman Ab. Aziz,et al.  Coverage Strategies for Wireless SensorNetworks , 2009, Journal of Science and Technology.

[40]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[41]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[42]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[43]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[44]  ZouYi,et al.  Sensor deployment and target localization in distributed sensor networks , 2004 .

[45]  W.B. Heinzelman,et al.  On the coverage problem in video-based wireless sensor networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[46]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

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

[48]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.