The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks

Coverage redundancy problem is one of the significant problems in wireless sensor networks. To reduce the energy consumption that arises when the high number of sensors is active, various coverage control protocols (sleep scheduling algorithms) have been proposed. In these protocols, a subset of nodes necessary to maintain sufficient sensing coverage are kept active while the others are put into a sleep mode to reduce the energy consumption. In this paper, we study the coverage redundancy problem in a sensor network where the locations of nodes and the distances between nodes are neither known nor could be easily calculated. We define a neighbor graph as the graph formed by the neighbors of a node and analyze the effect of different levels of connectivity in neighbor graphs on the coverage redundancy of sensor nodes. Moreover, we apply our results to a lightweight deployment-aware scheduling algorithm and demonstrate the improvement in the performance of the algorithm.