Patching Method for Coverage Holes with Distance-istant in Wireless Sensor Networks

Abstract

-An effective approach for coverage holes was proposed, called Distance-assistant Coverage Hole Parching (DACHP) strategy. DACHP strategy would achieve the purpose of patching coverage holes using redundant sensor nodes within the wireless sensor networks. Simulation results show, compared with DFNFP and random algorithm, for the same size and shape coverage hole, DACHP can awaken five redundant nodes to patch 92.19% of hole, yet DFNFP needs awaken nine redundant nodes and just patch 90.28%. It can be seen that DFNFP not only awaken four extra nodes, but also is lower 1.19% in patching rate of hole than DACHP. In addition, DACHP is more stable in utilization of redundant nodes and does not produce additional cost.

HACH: Healing Algorithm of Coverage Hole in a Wireless Sensor Network

“…This solution did not treat the case of multiple faulty nodes. In [11], each boundary node determines the best location of new node which completely covers the hole boundary arc of this boundary node. Then, this boundary node has to find the optimal redundant node which has the minimum distance to this location and awaken it to patch coverage hole.…”

An Efficient Coverage Hole Patching Algorithm Based on Intersection Knowledge

“…To evaluate CPA from such several views as coverage ratio, the activate number of nodes, the utilization rate of nodes, the average computation time of a single node, the two related mobile node repairing algorithms mentioned in [3] and [6] will be compared with CPA. All the results of the experiments our paper uses are the average of 20 times repeated experiments in a randomly deployed network.…”

“…Aiming at the above problems, some solutions have been proposed. Guo et al [6] has proposed a Patching Method for Coverage Holes with Distance-Assistant in Wireless Sensor Networks (DACHP) algorithm, which can repair holes and achieve completely coverage aside from ignoring utilizing the redundant nodes .…”