skip to main content
10.1145/1080091.1080108acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

ExOR: opportunistic multi-hop routing for wireless networks

Authors Info & Claims
Published:22 August 2005Publication History

ABSTRACT

This paper describes ExOR,an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet's route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually received the transmission. This deferred choice gives each transmission multiple opportunities to make progress. As a result ExOR can use long radio links with high loss rates, which would be avoided by traditional routing. ExOR increases a connection's throughput while using no more network capacity than traditional routine.ExOR's design faces the following challenges. The nodes that receive each packet must agree on their identities and choose one forwarder.The agreement protocol must have low overhead, but must also be robust enough that it rarely forwards a packet zero times or more than once. Finally, ExOR must choose the forwarder with the lowest remaining cost to the ultimate destination.Measurements of an implementation on a 38-node 802.11b test-bed show that ExOR increases throughput for most node pairs when compared with traditional routing. For pairs between which traditional routing uses one or two hops, ExOR's robust acknowledgments prevent unnecessary retransmissions,increasing throughput by nearly 35%. For more distant pairs, ExOR takes advantage of the choice of forwarders to provide throughput gains of a factor of two to four.

References

  1. D. Aguayo, J. Bicket, S. Biswas, G. Judd, and R. Morris. Link-level measurements from an 802.11b mesh network. In ACM SIGCOMM 2004, August 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Cetinkaya and E. Knightly. Opportunistic traffic scheduling over multiple network paths. In Proc. IEEE Infocom IEEE, September 2004.Google ScholarGoogle ScholarCross RefCross Ref
  3. R. Roy Choudhury and N. Vaidya. MAC layer anycasting in wireless networks. In Second workshop on Hot Topics in Networks (HotNets II), November 2003.Google ScholarGoogle Scholar
  4. D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proc. ACM/IEEE MobiCom, September 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Draves, J. Padhye, and B. Zill. Comparison of routing metrics for static multi-hop wireless networks. In Proc. ACM SIGCOMM Conference (SIGCOMM 2004), September 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. ACM Mobile Computing and Communications Review 5(4), October 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Holland, N. Vaidya, and P. Bahl. A rate-adaptive MAC protocol for multi-hop wireless networks. In ACM Mobicom 2001, September 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Jain and S. Das. Exploiting path diversity in the link layer in wireless ad hoc networks. In Proc. of the 6th IEEE WoWMoM Symposium, June 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D.B. Johnson. Routing in ad hoc networks of mobile hosts. In Proc. of the IEEE Workshop on Mobile Computing Systems and Applications pages 158--163,December 1994.Google ScholarGoogle Scholar
  10. Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, and M. Frans Kaashoek. The Click modular router. ACM Transactions on Computer Systems 18(3):263--297, August 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J.N. Laneman, D. Tse, and G. Wornell. Cooperative diversity in wireless networks: Efficient protocols and outage behavior. In IEEE Transactions on Information Theory, December 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J.N. Laneman and G. Wornell. Exploiting distributed spatial diversity in wireless networks. In Proc. Allerton Conference on Communications, Control, and Computing October 2000.Google ScholarGoogle Scholar
  13. P. Larsson. Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mob. Comput. Commun. Rev., 5(4):47--54, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R.U. Nabar, H.Bölcskei,and F.W.Kneubühler. Fading relay channels: Performance limits and space-time signal design. IEEE Journal on Selected Areas in Communications, June 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C.E. Perkins and P. Bhagwat. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV)for mobile computers. In Proc. ACM SIGCOMM Conference (SIGCOMM '94), pages 234--244, August 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C.E. Perkins and E.M. Royer. Ad hoc On-Demand Distance Vector Routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Sadeghi, V. Kanodia, A. Sabharwal, and E. Knightly. Opportunistic media access for multirate ad hoc networks. In Proceedings of ACM Mobicom 2002, September 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Scaglione and Y.W. Hong. Opportunistic large arrays: Cooperative transmission in wireless multihop ad hoc networks to reach far distances. In IEEE transactions on Signal Processing volume 8, pages 2082--2092, August 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Tsirigos and Z. Haas. Analysis of multipath routing - Part I: The effect on the packet delivery ratio. IEEE Transactions on Wireless Communications 3(1), January 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. E.C. Van der Meulen. A survey of multi-way channels in information theory. IEEE Transactions on Information Theory IT-23:1--37, 1977.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Zorzi and R. Rao. Geographic Random Forwarding (GeRaF)for ad hoc and sensor networks: multihop performance. IEEE Transactions on Mobile Computing 2(4), October 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. ExOR: opportunistic multi-hop routing for wireless networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
          August 2005
          350 pages
          ISBN:1595930094
          DOI:10.1145/1080091
          • cover image ACM SIGCOMM Computer Communication Review
            ACM SIGCOMM Computer Communication Review  Volume 35, Issue 4
            Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
            October 2005
            324 pages
            ISSN:0146-4833
            DOI:10.1145/1090191
            Issue’s Table of Contents

          Copyright © 2005 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 22 August 2005

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate554of3,547submissions,16%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader