A Hole-Bypassing Routing Algorithm for WANETs

Abstract

In this paper, we propose a new geographic holebypassing routing algorithm based on virtual convex model in Wireless Ad hoc Networks (WANETs). Our method is to convert an actual hole into a basic virtual convex first and then use line segments that are parallel to the basic virtual convex to find candidates of anchor points. Later, among these candidates, we choose appropriate anchor points to be the turning points in the packet forwarding process. The advantage of using turning points to relay packets is that the problem of local minimum phenomenon can be avoided. Besides, packets will not be forwarded along the hole boundary. Thus, the hole-diffusion problem will not get worse, and the number of relay hop counts of packets can be effectively reduced.