Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks-Reference-Cited by-同舟云学术

Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks

Published:2000 Issue: Volume: Page:702-713
ISSN:0302-9743
Container-title:Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks
language:
Short-container-title:

Author:

Chang Jae-Hwan,Tassiulas Leandros

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45551-5_59

Reference18 articles.

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.

2. 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.

3. Jae-Hwan Chang and Leandros Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM2000, Tel Aviv, Israel, March 2000.

4. Wai-Kai Chen. Theory of Nets: Flows in Networks. Wiley, 1990.

5. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill and MIT Press, 1990.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Energy-Efficient Adaptive Routing and Context-Aware Lifetime Maximization in Wireless Sensor Networks;International Journal of Distributed Sensor Networks;2014-11-01

2. Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks;Wireless Networks;2014-09-23

3. Pathbook: Cross-layer optimization for full-duplex wireless networks;Computer Networks;2013-06

4. : Activity-aware sensor network in smart environments;Pervasive and Mobile Computing;2012-10

5. Quality of Service in Wireless Networks Over Unlicensed Spectrum;Synthesis Lectures on Mobile and Pervasive Computing;2011-11-30