Finding optimal paths in MREP routing

Authors:
Rudolf Fleischer;Mordecai Golin;Chin-Tau Lea;Steven Wong
Affiliations:
Department of Computer Science, HKUST, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, HKUST, Clear Water Bay, Kowloon, Hong Kong;Department of EEE, HKUST, Clear Water Bay, Kowloon, Hong Kong;Department of EEE, HKUST, Clear Water Bay, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2004

Citing 8
Cited 0

Data networks

Data networks
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
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
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Power-Aware Localized Routing in Wireless Networks

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Maximum Residual Energy Path (MREP) routing has been shown an effective routing scheme for energy conservation in battery powered wireless networks. Past studies on MREP routing are based on the assumption that the transmitting node consumes power, but the receiving node does not. This assumption is false if acknowledgment is required as occurs, for example, in some Bluetooth applications.If the receiving node does not consume power then the MREP routing problem for a single message is easily solvable in polynomial time using a simple Dijkstra-like algorithm. We further show in that when the receiving node does consume power the problem becomes NP-complete and is even impossible to approximate with an exponential approximation factor in polynomial time unless P = NP.