Paper Info
Title
Dynamic curve adaptation for geographic routing in Wireless Multihop Networks
Abstract
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.
Year
DOI
Venue
2014
10.1109/LCN.2014.6925754
Local Computer Networks
Keywords
Field
DocType
graph theory,radio networks,telecommunication network routing,cached curve,congested area,dynamic curve adaptation,geographic routing,greedy forwarding,greedy routing,guaranteed data delivery,local map construction,noncooperative node,planar graph routing,wireless multihop networks,geographic routing,local curve adaptation,robustness,scalability,wireless multihop networks
Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Computer network,Wireless Routing Protocol,Routing table,Geographic routing,Distributed computing
Conference
ISSN
Citations 
PageRank 
0742-1303
0
0.34
References 
Authors
20
3
Name
Order
Citations
PageRank
Adrian Loch18314.54
Wei-chih Hong2131.88
Matthias Hollick375097.29