ACM Home Page
Please provide us with feedback. Feedback
Minimum energy paths for reliable communication in multi-hop wireless networks
Full text PdfPdf (189 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing table of contents
Lausanne, Switzerland
SESSION: Energy Awareness and Power Control table of contents
Pages: 146 - 156  
Year of Publication: 2002
ISBN:1-58113-501-7
Authors
Suman Banerjee  University of Maryland at College Park, College Park, MD
Archan Misra  IBM T J Watson Research Center, Hawthorne, NY
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 101,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513800.513818
What is a DOI?

ABSTRACT

Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimum-hop path is selected. In situations where the transmission power can be varied with the distance of the link, the link cost is higher for longer hops; the energy-aware routing algorithms select a path with a large number of small-distance hops. In this paper, we argue that such a formulation based solely on the energy spent in a single transmission is misleading --- the proper metric should include the total energy (including that expended for any retransmissions necessary) spent in reliably delivering the packet to its final destination.We first study how link error rates affect this retransmission-aware metric, and how it leads to an efficient choice between a path with a large number of short-distance hops and another with a smaller number of large-distance hops. Such studies motivate the definition of a link cost that is a function of both the energy required for a single transmission attempt across the link and the link error rate. This cost function captures the cumulative energy expended in reliable data transfer, for both reliable and unreliable link layers. Finally, through detailed simulations, we show that our schemes can lead to upto 30-70% energy savings over best known current schemes, under realistic environments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J.-H. Chang and L. Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of Infocom, Mar. 2000.
 
2
S. Corson, S. Papademetriou, P. Papadopoulos, V. Park, and A. Qayyum. An Internet MANET encapsulation protocol (IMEP) specification, draft-ietf-manet-imep-spec02. txt. IETF, Aug. 1999.
3
 
4
 
5
J. Gomez and A. Campbell. Power-aware routing optimization for wireless ad hoc networks. In High Speed Networks Workshop (HSN), June 2001.
 
6
J. Gomez-Castellanos, A. Campbell, M. Naghshineh, and C. Bisdikian. PARO: A power-aware routing optimization scheme for mobile ad hoc networks, draft-gomez-paro-manet-00.txt, work in progress. IETF, Mar. 2001.
 
7
D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, pages 153--181, 1996.
 
8
 
9
G. Malkin. RIP version 2, RFC 2453. IETF, Nov. 1998.
10
 
11
J. Moy. OSPF version 2, RFC 2328. IETF, Apr. 1998.
 
12
 
13
K. Scott and N. Bamboos. Routing and channel assignment for low power transmission in PCS. In Proceedings of ICUPC, Oct. 1996.
14
15
 
16
C. Toh, H. Cobb, and D. Scott. Performance evaluation of battery-life-aware routing schemes for wireless ad hoc networks. In Proceedings of ICC, June 2001.

CITED BY  26

Collaborative Colleagues:
Suman Banerjee: colleagues
Archan Misra: colleagues