A Hole Avoiding Routing protocol with relative neighborhood graph for wireless sensor network

In wireless sensor networks, “holes” are hardly to know its location and avoid either because of various actual geographical environments. A hole can be dynamically formed due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we hope to propose the RNG Hole Avoiding Routing protocol, RNGHAR which can model “holes” existed in wireless sensor network and event packets can avoid meeting a “hole” in advance instead of bypassing a hole when it meets the hole. This paper proposes a novel algorithm RNGHAR which uses RNG (relative neighborhood graph) modeling holes then we can collect hole information in order to construct in advance hole avoiding routing path. Hence event packets will be guided to overcome the hole and move along the shortest path from source node to the sink node. Simulation studies show that my proposed method achieves good performance in terms of average hop count, packet delivery success rate and power consumption in comparison with the existing protocols.