Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power consumption in packet radio networks
Theoretical Computer Science
Ad hoc networking: an introduction
Ad hoc networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
Energy concerns in wireless networks
IEEE Wireless Communications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Packing Steiner trees with identical terminal sets
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Performance of distributed algorithms for maximizing multicast lifetime in mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
IEEE Transactions on Mobile Computing
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Maximizing system lifetime in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
EURASIP Journal on Wireless Communications and Networking
Maximum-lifetime routing: system optimization & game-theoretic perspectives
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Approximation algorithms for longest-lived directional multicast communications in WANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
International Journal of Sensor Networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
HiPC'08 Proceedings of the 15th international conference on High performance computing
Maximum lifetime broadcasting in cooperative multi-hop wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Distributed approximation algorithms for longest-lived multicast in WANETs with directional antennas
IEEE Transactions on Wireless Communications
A distributed algorithm for min-max tree and max-min cut problems in communication networks
IEEE/ACM Transactions on Networking (TON)
On maximizing network lifetime of broadcast in WANETs under an overhearing cost model
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Packing element-disjoint steiner trees
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Hi-index | 0.00 |
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g. battery-operated) nodes, by choosing ideal transmission power levels for the nodes relaying the connection. We distinguish between two basic operating modes: In a static assignment, the power levels of the nodes are set at the beginning and remain unchanged until the nodes are depleted of energy. In a dynamic assignment, the powers can be adjusted during operation.We show that lifetime-maximizing static power assignments can be found in polynomial time, whereas for dynamic assignments, a quantized-time version of the problem is NP-hard. We then study the approximability of the quantized dynamic case and conclude that no polynomial time approximation scheme (PTAS) exists for the problem unless Ptime = NP. Finally, by considering two approximation heuristics for the dynamic case, we show experimentally that the lifetime of a dynamically maintained multicast connection can be made several times longer than what can be achieved by the best possible static assignment.