Abstract
In wireless ad-hoc networks, routing and power consumption are intrinsically connected since the transmit power level is adjusted depending on the location of the next hop node. Our objective is to route the traffic such that the system lifetime is maximized. In the previous works, we have formulated the problem and proposed heuristic algorithms. In this paper, fast approximate algorithms are proposed both in single commodity case and in the multicommodity case along with the analysis which enables us to control the trade-off between the performance bound and the running time. The problem is then extended to have an additional constraint on the delay.
Prepared through collaborative participation in the Advanced Telecommunications/Information Distribution Research Program (ATIRP) Consortium sponsored by the U.S. Army Research Laboratory under the Federated Laboratory Program, Cooperative Agreement DAAL01-96-2-0002.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
Dennis J. Baker and Anthony Ephremides. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, COM-29(11):56–73, January 1981.
Jae-Hwan Chang and Leandros Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM2000, Tel Aviv, Israel, March 2000.
Wai-Kai Chen. Theory of Nets: Flows in Networks. Wiley, 1990.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill and MIT Press, 1990.
Anthony Ephremides, Jeffrey E. Wieselthier, and Dennis J. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, 75(1):56–73, January 1987.
M. Ettus. System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless networks. In Proceedings of IEEE Radio and Wireless Conference (RAWCON) 98, pages 55–58, Colorado Springs, CO, August 1998.
R.G. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum weight spanning trees. Technical Report LIDS-P-906-A, Lab. Inform. Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, October 1979.
Naveen Garg and Jochen Koenemann. Faster and simpler algorithms for multicommmodity flow and other fractional packing problems. In Proceedings 39th Annual Symposium on Foundations of computer science, pages 300–309, Palo Alto, CA, November 1998.
D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Tomasz Imielinski and Hank Korth, editors, Mobile Computing, chapter 5, pages 153–181. Kluwer Academic Publishers, 1996.
Teresa H. Meng and Volkan Rodoplu. Distributed network protocols for wireless communication. In Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, ISCAS’98, volume 4, pages 600–603, Monterey, CA, June 1998.
A. Michail and A. Ephremides. A distributed routing algorithm for supporting connection-oriented service in wireless networks with time-varying connectivity. In Proceedings Third IEEE Symposium on Computers and Communications, ISCC’98, pages 587–591, Athens, Greece, June 1998.
S. Murthy and J.J. Garcia-Luna-Aceves. An efficient routing protocol for wireless networks. Journal of Special Topics in Mobile Networks and Applications (MONET), 1(2):183–197, 1996.
Vincent D. Park and M. Scott Corson. A highly distributed routing algorithm for mobile wireless networks. In Proc. IEEE INFOCOM’97, pages 1405–1413, Kobe, Japan, 1997.
C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers. In ACM SIGCOMM, pages 234–244, London, England, August 1994.
Volkan Rodoplu and Teresa H. Meng. Minimum energy mobile wireless networks. In Proceedings of the 1998 IEEE International Conference on Communications, ICC’98, volume 3, pages 1633–1639, Atlanta, GA, June 1998.
Timothy Shepard. Decentralized channel management in scalable multihop spread spectrum packet radio networks. Technical Report MIT/LCS/TR-670, Massachusetts Institute of Technology Laboratory for Computer Science, July 1995.
S. Singh, M. Woo, and C.S. Raghavendra. Power-aware routing in mobile ad hoc networks. In Proceedings of Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 181–190, Dallas, TX, October 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, JH., Tassiulas, L. (2000). Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_59
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive