Grid Coverage Algorithm & Analyzing for wireless sensor networks

Abstract

The problem of having sufficient coverage is an essential issue in wireless sensor networks (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. This paper addresses the problems of coverage in WSN by proposing two grid-based algorithms: Grid Square Coverage (1) and Grid Square Coverage (2). Moreover, we have analyzed the performance of both algorithms and provided a compression between them. The results present that the Grid Square Coverage (1) algorithms has 78% coverage efficiency while the Grid Square Coverage (2) has 73%.