Destination-Region-Based Local Minimum Aware Geometric Routing
Source: Florida Atlantic University
Geometric routing algorithms in Mobile Ad hoc NETworks (MANETs) contain two forwarding modes: greedy forwarding and face forwarding. It is well known that face forwarding is inefficient and fails frequently in practical situations. A previous work, NEAR, avoids switching to face forwarding by predicting local minima and not forwarding messages to them. However, NEAR predicts excessive local minima, which degrades routing performance. Also, NEAR is not localized due to its bridge detection scheme.