Zigzag Coverage Scheme Algorithm & Analysis for Wireless Sensor Networks

Abstract

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 60º.