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 sa...

• Type: Journal
• Year: 2010
• Where: NAS
• Authors: Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu
• Keywords: Computer Networks, NAS 2010, Node, Relay Node, Routing