Opportunistic routing in multi-hop wireless networks

This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the choice of each node in the sequence until after the previous node has transmitted the packet on its radio. ExOR then determines which node, of all the nodes that successfully received that transmission, is the node closest to the destination. That closest node transmits the packet. The result is that each hop moves the packet farther (or average) than the hops of the best possible pre-determined route.The ExOR design addresses the challenge of choosing a forwarding node after transmission using a distributed algorithm. First, when a node transmits a packet, it includes in the packet a simple schedule describing the priority order in which the potential receivers should forward the packet. The node computes the schedule based on shared measurements of inter-node delivery rates. ExOR then uses a distributed slotted MAC protocol for acknowledgements to ensure that the receivers agree who the highest priority receiver was.The efficacy of ExOR depends mainly on the rate at which the reception probability falls off with distance. Simulations based on measured radio characteristics [6] suggest that ExOR reduces the total number of transmissions by nearly a factor of two over the best possible pre-determined route.

[1]  DravesRichard,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004 .

[2]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[3]  John B. Nicholas,et al.  Exploiting Distributed Spatial Diversity in Wireless Networks , 2000 .

[4]  Gregory W. Wornell,et al.  Energy-efficient antenna sharing and relaying for wireless networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[5]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

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

[7]  Voon Chin Phua,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1999 .

[8]  Paramvir Bahl,et al.  A rate-adaptive MAC protocol for multi-Hop wireless networks , 2001, MobiCom '01.

[9]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[10]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[11]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

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

[13]  Sang Hyuk Son,et al.  IGF: A State-Free Robust Communication Protocol for Wireless Sensor Networks , 2003 .

[14]  Jitendra Padhye,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004, SIGCOMM 2004.

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

[16]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[17]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

[18]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[19]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[20]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[21]  van der MeulenE..  A Survey of Multi-Way Channels in Information Theory: , 1977 .

[22]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[23]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[24]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[25]  Anna Scaglione,et al.  Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distances , 2003, IEEE Trans. Signal Process..

[26]  Edward W. Knightly,et al.  Opportunistic traffic scheduling over multiple network paths , 2004, IEEE INFOCOM 2004.

[27]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[28]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

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

[30]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2005, Wirel. Networks.