Design of Dead-End-Avoidance Method for Geographic Forwarding in MANET

摘要

Geographic forwarding is part of geographic routing in that each node only needs to know the location of its neighbors and the destination. This method can reduce the cost of table-driven routing which needs to maintain the whole path, even if the path is not in use. It also saves time when searching the path, as compared with reactive routing. When using geographic forwarding, it usually happens that the local maximum cannot forward the packet directly to the destination; this fundamental problem is called Dead End. We use the A star (A~*) algorithm, which is usually used in role-playing or strategic games, to detour around terrain that cannot be passed through directly. Nodes must vote on an agent in a specific area to be a decision-maker and find a reference route for the source node. When the route is decided, geographic forwarding is used according to this reference path to the destination to avoid the dead end.