Strategy for complete hole patching based on greedy algorithm in wireless sensor network

In Wireless sensor network, node error, energy depletion and other factors will lead to the appearance of hole which will cause network failure. So it´s necessary to activate some inactive nodes to patch hole. In order to select the right nodes from the set of inactive nodes to patch hole efficiently, a strategy for complete hole patching based on greedy algorithm is proposed in this paper. Firstly, the strategy analysis its feature by detecting hole. Secondly, according to the characteristics of hole greedy algorithm is used to select the appropriate nodes from an inactive set of nodes to patch hole. In the algorithm, choose an inactive node which can cover the most arc intersections of hole first. Then select the following nodes by the same rule. When a new node is selected, at least one arc intersection of hole must be covered. Repeat this procedure until the hole is complete patched. Finally, through the simulation experiments to prove the proposed strategy is effective, and analysis the performance of the strategy based on the comparison of the experiment results. Using the proposed strategy can realize complete hole patching, and enhance the coverage ability and utilization of patching node.