Zigzag Coverage Scheme Algorithm & Analysis for Wireless Sensor Networks

The problem of having sufficient coverage is an essential issue in wireless sensor network (WSN).  A high coverage rate delivers a higher quality of service. The aim of coverage problem is to ensure a minimum number of nodes (at least one sensor) with little redundant data cover every point inside the interest area. In this paper, we provided an algorithm for WSN coverage based on Zigzag Pattern. The interest area divided into multiple Zigzag Patterns with multiple corners and lines segments, each node is deployed in a corner of Zigzag Pattern. Zigzag Pattern Scheme Deployment Algorithm expresses a very high coverage efficiency 91%, as well as, it expands and covers the whole interest area with minimum number of nodes, while it generates a very little coverage redundancy. We provided geometrical analysis to illustrate when the algorithm reaches the maximal and optimal coverage efficiency. The algorithm reaches the maximal and optimal coverage efficiency when the circumference of sensing range for each node is equal to the sum of its vertical Arcs length and horizontal Arcs length, while the optimal length of each line segment in Zigzag Pattern is approximatey root of three per r and the optimal angle of each corner is 60o.

[1]  Hongwu Zhang.  Energy-Balance Heuristic Distributed Algorithm for Target Coverage in Wireless Sensor Networks with Adjustable Sensing Ranges , 2009, 2009 Asia-Pacific Conference on Information Processing.

[2]  Bo Tang,et al.  Analysis of the Wireless Sensor Networks efficient coverage , 2010, The 2010 International Conference on Apperceiving Computing and Intelligence Analysis Proceeding.

[3]  J. Engel,et al.  CORAL: miniature acoustic communication subsystem architecture for underwater wireless sensor networks , 2005, IEEE Sensors, 2005..

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

[5]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[6]  Sandeep Mann,et al.  Coverage in Wireless Sensor Networks : A Survey , 2013 .

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

[8]  Jie Jia,et al.  On the Problem of Energy Balanced Relay Sensor Placement in Wireless Sensor Networks , 2013, Int. J. Distributed Sens. Networks.

[9]  Ammar Hawbani,et al.  Sensors Grouping Model for Wireless Sensor Network , 2013 .

[10]  Ammar Hawbani,et al.  Wireless Sensor Network Routing Based on Sensors Grouping , 2014 .

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

[12]  Wei Dong,et al.  An Efficient and Self-Adapting Localization in Static Wireless Sensor Networks , 2009, Sensors.

[13]  Jiming Chen,et al.  Novel Deployment Schemes for Mobile Sensor Networks , 2007, Sensors.

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