A Recovery Method for Greedy Routing Protocols in Web Communications
Greedy Perimeter Stateless Routing (GPSR) protocol is an appropriate and the most well-known routing protocol for high mobile vehicular ad-hoc networks. The protocol includes two routing modes, the greedy mode and the recovery mode, and utilizes a neighbor list to make a route decision. However, not only does the neighbor list in the protocol involve stale neighbor information, but also the stale nodes inherit a higher selection priority in the greedy mode according to the routing policy; besides, the useful redundant route information can be eliminated during planarization in the recovery mode. To overcome those problems, the authors propose a new recovery mode, named as Greedy Border Superiority Routing (GBSR), along with an Adaptive Neighbor list Management (ANM) scheme.