CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment

In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is different every time when the relative location of relay node to the destination changes. The configuration in the entire network when all the 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 this paper, we introduce a new information model to determine the pattern of SCS under the impact of local minima by sacrificing little routing flexibility. As a result, each 1-hop advance can avoid those unsafe situations in order to stay along a non-detour path. In our model, each node prepares the information in a proactive model, but can use it for all different paths passing through, saving the cost and delay in the reactive model. We focus on an ``everyone" model, in which each node will apply the same generic process in a fully distributed manner, in order to achieve a reliable solution in real applications where the communication link is constituted irregularly and its quality changes dynamically. In details, we discuss how in a sample realistic environment the pattern of SCS can be interpreted in a single safety descriptor in at each node. It indicates the maximum probability of a successful non-detour path from this node to the edge of networks. The larger value the more likely the non-detour routing will be successful and the more reliable the path will be. We illustrate the effectiveness of this indirect reference information in the corresponding routing, in terms of the cost of information construction and update propagation, and the success of non-detour path constitution, compared with the best results known to date.