Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks: Quasi-grid Based Cooperative Coverage Algorithm for Wireless Sensor Networks

A new algorithm named QGCC (Quasi-Grid based Cooperative Coverage) is proposed in this paper, which employs virtual quasi-grid structure and cooperative sensing model to reduce the number of active nodes, and to prolong the coverage lifetime. In QGCC, a low-complexity distributed method is designed to determine the vertexes of grid, and an energy efficient node scheduling scheme is presented. QGCC also introduces a new metric named irregularity to analyze the impact of the deviation between keeper and its ideal vertex. Simulations show that, compared to the reference algorithms, QGCC can efficiently reduce the number of active nodes, and prolong the coverage lifetime. Another notable feature of QGCC is that, the coverage lifetime is approximate linear related to the number of nodes, which means this algorithm can make good use of redundant nodes.