In today’s era, area coverage in WSN is one of the most important research areas due to its wide range of applications. There are several strategies for area coverage. Among those, the grid-based approach has been proposed in the recent past that provides a better way to select the active nodes from grids rather than randomly selected from the whole deployed area. Nevertheless, this approach undergoes several limitations like deciding the size of the grid and selection of nodes from grids. In this paper, the main objective of the proposed approach is to find a better way to divide the deployed area into a number of grids and select the nodes from those grids with a goal to avoid coverage hole. In this approach, the grids are of the same size depending upon the sensing radius of the sensor node, i.e. the diagonal of each grid is equal to the sensing radius. According to Pythagorean Theorem, the length of each grid is (l=r/√2). Based on grid division, several possibilities are taken into consideration in order to achieve the grid area coverage with the help of neighbor nodes present in the surrounding grids. Simulation studies show this approach performs better than the existing grid-based approaches.
Dash, S., Nayak, B. P., Mishra, B. S. P., & Swain, A. R. (2019). A grid-based node selection approach for complete area coverage in WSN. International Journal of Engineering and Advanced Technology, 8(5), 2551–2556.