Capability Information: A Cost-Effective Information Model for Multi-Hop Routing of Wireless Ad Hoc Networks in the Real Environment
In greedy routing, each relay node forwards the message to a neighbor (also called the successor) that is closer to the destination. However, the Successor Candidate Set (SCS) is different every time the relative location of the relay node to the destination changes. The configuration in the entire network, when all succeeding paths from a relay node are blocked by local minima, is irregular and its concern region cannot be determined unless the routing actually initiates. In the real deployment environment of the wireless ad hoc networks, the link quality also changes dynamically. This brings a challenge for the local decision of the greedy advance to precisely adjust its SCS for the flip-flop of link quality that blocks the non-detour path ahead.