Impact of Holes on Geometric Ad-hoc Routing Protocols

All geometric routing protocols use Greedy Forwarding strategy to forward messages towards their destinations. When messages reach their local minima, all routing protocols use Face Traversal strategy to guide messages around holes to their next recovery points using either left hand rule or right hand rule. Often non-optimal rule is chosen and as a result, path-quality is degraded. In this paper, we study the impact of the use of non-optimal rule during Face Traversal strategy that is an essential part of all geometric routing protocol. We also analyze the cost of approximating network holes so that optimal rules can be used in all cases.