Least-Cost Opportunistic Routing

In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the packet further. If no candidate receives the packet, then the current sender re-transmits. If multiple candidates receive the packet, then the link layer chooses a single receiver to be the relay. This choice could be made at random, or it could be driven by information coming from the routing layer, for example to use the best receiver as the relay. This paper addresses the least-cost opportunistic routing (LCOR) problem: how to assign and prioritize the set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. We solve this problem with a distributed algorithm that provably computes the optimal assignment of candidate relays that each node should allow to reach a particular destination. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff, and as a result make choices which are not always optimal.

[1]  Matthew C. Valenti,et al.  Practical relay networks: a generalization of hybrid-ARQ , 2005 .

[2]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[3]  Samir Ranjan Das,et al.  Exploiting path diversity in the link layer in wireless ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[4]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[5]  J. J. Garcia-Luna-Aceves,et al.  Loop-free multipath routing using generalized diffusing computations , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Peter Larsson.  Selection diversity forwarding in a multihop packet radio network with fading channel and capture , 2001, MobiHoc '01.

[7]  Koen Langendoen,et al.  Guesswork: robust routing in an uncertain world , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[8]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[9]  H. Dubois-Ferriere,et al.  TinyNode: a comprehensive platform for wireless sensor network applications , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[10]  Mahesh K. Marina,et al.  Ad hoc on-demand multipath distance vector routing , 2006, Wirel. Commun. Mob. Comput..

[11]  Srihari Nelakuditi,et al.  On selection of candidates for opportunistic anypath forwarding , 2006, MOCO.

[12]  Nitin H. Vaidya,et al.  MAC-layer anycasting in ad hoc networks , 2004, Comput. Commun. Rev..

[13]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[14]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[15]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..