Randomized Grid-Based Approach for Complete Area Coverage in WSN

Abstract

Wireless Sensor Network (WSN) mainly composed of a number of sensor nodes whose prime responsibility is to sense various events from the surrounding, do the processing on top of it and finally propagate the meaningful information to the observer through multiple intermediate nodes. Area coverage is one of the issues in WSN that guarantees the selected active nodes among all the deployed nodes should cover each point of the deployed area. The objective of complete area coverage is to find out redundant nodes and deactivate them, so that the remaining active nodes can cover the deployed area. Among the various existing approaches for area coverage in WSN, a grid-based approach has been proposed that provides a better way to select the active nodes or deactivate the redundant nodes from the grid rather than choosing the nodes from the deployed area. The existing approach goes with certain limitations such as how many numbers of grids need to be made in a certain deployed area with a certain number of nodes and how much percentage of nodes need to be selected from each grid. In order to avoid these limitations, in this paper, we propose a randomized grid-based approach that splits the intended area into small grids depending upon the density of nodes in a different location of the deployed area. At the same time, rather than selecting a certain percentage of nodes from each grid, here we select only one node from each grid and repeat the process till selected nodes satisfy the whole area coverage. Matlab simulator is used to study the simulation results of the proposed work, and it is found that the proposed randomized grid-based approach outperforms the existing grid-based approach both with respect to energy as well as throughput.