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].
- Sanjit Biswas and Robert Morris. Exor: opportunistic multi-hop routing for wireless networks. In ACM SIGCOMM, 2005. Google ScholarDigital Library
- Szymon Chachulski, Michael Jennings, Sachin Katti, and DinaKatabi. Trading structure for randomness in wireless opportunistic routing. In ACM SIGCOMM, 2007. Google ScholarDigital Library
- 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 ScholarDigital Library
- Robin Kravets and P. Krishnan. Power management techniques for mobile communication. In ACM MobiCom, 1998. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- T.S. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996. Google ScholarDigital Library
- Volkan Rodoplu and Teresa H. Meng. Minimum energy mobile wireless networks. In IEEE ICC, volume 3, 1998.Google ScholarCross Ref
- Anand Srinivas and Eytan Modiano. Minimum energy disjoint path routing in wireless ad-hoc networks. In ACM MobiHoc, 2003. Google ScholarDigital Library
- 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 ScholarDigital Library
- Yu Wang, WeiZhao Wang, and Xiang-Yang Li. Distributed low-cost backbone formation for wireless ad hoc networks. In MobiHoc, 2005. Google ScholarDigital Library
- Henri Dubois-Ferriere, Deborah Estrin and Martin Vetterli. Packet Combining in Sensor Networks In ACM SENSYS, 2005. Google ScholarDigital Library
- Suman Banerjee and Archan Misra. Minimum energy paths for reliable communication in multi-hop wireless networks. In ACM MobiHoc, pages 146--156, 2002. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
Index Terms
- Energy efficient opportunistic routing in wireless networks
Recommendations
Highly stable and adaptive clustering with efficient routing in wireless ad hoc networks
The association and disassociation of mobile nodes to and from the clusters in wireless ad hoc networks disturb the stability of the network and, therefore, the reconfiguration of clusterheads is unavoidable. This paper proposes a Weight Based Adaptive ...
EEAODR: An energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks
Mobile ad hoc networks (MANETs) are characterized by random, multi-hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite ...
A novel solution for achieving anonymity in wireless ad hoc networks
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networksA mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of other intermediate nodes to establish communication channels. In such an ...
Comments