On the Efficacy of Opportunistic Routing

Traditional routing schemes select the best path for each destination and forward a packet to the corresponding next hop. While such best-path routing schemes are considered well-suited for networks with reliable point-to-point links, they are not necessarily ideal for wireless networks with lossy broadcast links. Consequently, opportunistic routing schemes that exploit the broadcast nature of wireless transmissions and dynamically select a next-hop per-packet based on loss conditions at that instant are being actively explored. It is generally accepted that opportunistic routing performs substantially better than best-path routing for wireless mesh networks. In this paper, we analyze the efficacy of opportunistic routing. We define a new metric EAX that captures the expected number of any-path transmissions needed to successfully deliver a packet between two nodes under opportunistic routing. Based on EAX, we develop a candidate selection and prioritization method corresponding to an ideal opportunistic routing scheme. We then conduct an off-line comparison of best-path routing and opportunistic routing using our EAX metric and MIT Roofnet trace. We observe that while opportunistic routing offers better performance than best- path routing, the gain is not as high as commonly believed.

[1]  Lili Qiu,et al.  Simple opportunistic routing protocol for wireless mesh networks , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

[2]  Peter Larsson Selection diversity forwarding in a multihop packet radio network with fading channel and capture , 2001, MOCO.

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

[4]  Robert Tappan Morris,et al.  Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.

[5]  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.

[6]  Sachin Katti,et al.  MORE: A Network Coding Approach to Opportunistic Routing , 2006 .

[7]  Jan M. Rabaey,et al.  Modeling and analysis of opportunistic routing in low traffic scenarios , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

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

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

[10]  Jan M. Rabaey,et al.  When does opportunistic routing make sense? , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[11]  Kang G. Shin,et al.  Link-layer salvaging for making routing progress in mobile ad hoc networks , 2005, MobiHoc '05.

[12]  Starsky H. Y. Wong,et al.  ROMER : Resilient Opportunistic Mesh Routing for Wireless Mesh Networks , 2005 .

[13]  Cédric Westphal,et al.  Opportunistic Routing in Dynamic Ad Hoc Networks: the OPRAH protocol , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[14]  Edward W. Knightly,et al.  Opportunistic media access for multirate ad hoc networks , 2002, MobiCom '02.