skip to main content
10.1145/1641804.1641847acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Energy efficient opportunistic routing in wireless networks

Authors Info & Claims
Published:26 October 2009Publication History

ABSTRACT

Opportunistic routing [1, 2] was shown to improve the network throughput greatly. The core idea is to allow any node in the forwarder list, which overhears the transmission and is closer to the destination to participate in forwarding the packet. The nodes in forwarder list are prioritized and the lower priority forwarder will discard the packet if it has been forwarded by a higher priority forwarder. One open problem is how to select and prioritize forwarder list efficiently. In the paper, we investigate how to select and prioritize forwarder list to minimize energy consumptions. We study the case where the transmission power of each node is fixed (known as non-adjustable transmission model) as well as the case where each node is able to adjust its transmission power for each transmission (known as adjustable transmission model). Energy optimum algorithms to select and prioritize forwarder list in both cases are presented and analyzed. Worth to mention that, our methods do not assume any geometrical properties or energy models, they apply to practical and dynamic wireless networks. In addition, we conducted extensive simulations in TOSSIM to study the performance of the proposed routing protocol by comparing it with ExOR [1].

References

  1. Sanjit Biswas and Robert Morris. Exor: opportunistic multi-hop routing for wireless networks. In ACM SIGCOMM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Szymon Chachulski, Michael Jennings, Sachin Katti, and DinaKatabi. Trading structure for randomness in wireless opportunistic routing. In ACM SIGCOMM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Qunfeng Dong, Suman Banerjee, Micah Adler, and Archan Misra. Minimum energy reliable paths using unreliable wireless links. In ACM MobiHoc, pages 449--459, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Robin Kravets and P. Krishnan. Power management techniques for mobile communication. In ACM MobiCom, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Xiang-Yang Li, Wen-Zhan Song, and Weizhao Wang. A unified energy-efficient topology for unicast and broadcast. In ACM MobiCom, pages 1--15, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Manki Min, Feng Wang, Ding-Zhu Du, and Panos M. Pardalos. A reliable virtual backbone scheme in mobile ad-hoc networks. In IEEE MASS, 2004.Google ScholarGoogle Scholar
  7. A. Nasipuri, R. Castaneda, and S. R. Das. Performance of multipath routing for on-demand protocols in ad hoc networks. ACM/Kluwer Mobile Networks and Applications (MONET), 6(4):339--349, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Raju and J. Garcia-Luna-Aceves. A new approach to on-demand loop-free multipath routing. In IEEE ICCCN, pages 522--527, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  9. T.S. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Volkan Rodoplu and Teresa H. Meng. Minimum energy mobile wireless networks. In IEEE ICC, volume 3, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  11. Anand Srinivas and Eytan Modiano. Minimum energy disjoint path routing in wireless ad-hoc networks. In ACM MobiHoc, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder. Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wireless Networks, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Yu Wang, WeiZhao Wang, and Xiang-Yang Li. Distributed low-cost backbone formation for wireless ad hoc networks. In MobiHoc, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Henri Dubois-Ferriere, Deborah Estrin and Martin Vetterli. Packet Combining in Sensor Networks In ACM SENSYS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Suman Banerjee and Archan Misra. Minimum energy paths for reliable communication in multi-hop wireless networks. In ACM MobiHoc, pages 146--156, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In ACM MobiCom, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Xiang-Yang Li, YanTai Shu, HaiMing Chen, XiaoWen Chu and YanWei Wu. Energy Efficient Routing With Unreliable Links in Wireless Networks. In The Third IEEE MASS, 2006.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Energy efficient opportunistic routing in 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
              MSWiM '09: Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
              October 2009
              438 pages
              ISBN:9781605586168
              DOI:10.1145/1641804

              Copyright © 2009 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: 26 October 2009

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              Overall Acceptance Rate398of1,577submissions,25%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader