Introduction to algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
IEEE Transactions on Computers
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
IEEE Transactions on Mobile Computing
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Back Propagation Neural Network Based Lifetime Analysis of Wireless Sensor Network
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
The minimum-energy broadcast problem in symmetric wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Energy-Efficient aggregate query evaluation in sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
ActiSen: Activity-aware sensor network in smart environments
Pervasive and Mobile Computing
Pathbook: Cross-layer optimization for full-duplex wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.