An Efficient Coverage Hole Patching Algorithm Based on Intersection Knowledge

Abstract

Aiming at the phenomenon of coverage holes because of energy depletion and random nodes deployment in wireless sensor networks (WSN), a principle for hole coverage was proposed. Based on the triangular geometry knowledge, firstly, determined the optimal patching station in basis of the benchmark-intersection, and then active inactive nodes to patch the hole. The simulation experiments demonstrate that this algorithm makes full of energy resources in the premise of complete coverage to patch coverage hole, and has a better performance in the number of the mobile nodes、resource utilization rate and algorithm running time efficiency compared with the existing DACHP and PATT algorithm.