Dynamic curve adaptation for geographic routing in Wireless Multihop Networks

Geographic routing yields scalable operation in Wireless Multihop Networks. Nodes forward packets to the destination either in a greedy manner, or along arbitrary curves from source to destination. The latter allows for higher robustness, as paths are adjusted to avoid, for instance, congested areas or non-cooperative nodes. However, determining working curves is either based on unreliable trial-and-error approaches or requires global network knowledge. We propose two local schemes that dynamically adapt the curve defining the packet forwarding at node level. Our first procedure uses cached curves, and the second one builds local maps at each node. We implement them for the case of planar graph routing with guaranteed delivery but they can also be easily adapted to greedy routing. We evaluate our schemes by means of simulation in constrained multihop networks, and show that they reduce transmissions up to 74% compared to existing solutions.