A Hole Avoiding Routing Protocol in Wireless Sensor Networks

In wireless sensor networks, an important challenge often faced in geographic greedy forwarding is the local minimum phenomenon which is caused by holes. For solving this problem, most hole-avoiding protocols route packets along the perimeter of holes or forbidden regions. Thus, sensor nodes on the perimeter of holes and forbidden regions exhaust their energy faster than others, which enlarge the hole size, called growing hole problem. In this paper, we propose an energy-efficient hole avoiding routing protocol (HARP) for growing hole problem in multi-hole environments.