Incremental Model for Complete Area Coverage in Wireless Sensor Networks

Abstract

Wireless Sensor Network (WSN) consists of hundreds of sensor nodes, which are tiny, low cost, low power radio devices. These nodes are dedicated to perform certain functions such as sensing the environment, collecting the sensed data from the surrounding area, processing those data and send the information to the observer. One of the major challenges in WSN is to cover the desired area which is used to determine the quality of service(QoS) of the Network. Before the sensor nodes get deployed, one may want to know, among hundreds of nodes, which are the nodes that need to active so that every point in the deployment area is covered by at least one of the active sensor nodes and the total number of active nodes should be minimum. We call this requirement as complete area coverage. One of the important aspects of complete area coverage algorithm is to remove the redundant nodes and then check for the sensing coverage of the desired area. Various algorithms have already been proposed for the complete area coverage. In this paper, we use an incremental model using the 2-voronoi method to remove the redundant nodes and find the minimum number of nodes to cover the desired area. Extensive simulation studies of the proposed work have been carried out using Mat lab simulator. The simulation studies clearly show that the number of active nodes to cover the whole intended area is quite less.