A framework for assessing residual energy in wireless sensor network
International Journal of Sensor Networks
International Journal of Ad Hoc and Ubiquitous Computing
Self-managing energy-efficient multicast support in MANETs under end-to-end reliability constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Distributed computation of maximum lifetime spanning subgraphs in sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Lifetime maximization in wireless sensor networks by distributed binary search
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Scalable multicasting in energy aware mobile backbone based wireless ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
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
Adaptive multicast trees on static ad hoc networks: tradeoffs between delay and energy consumption
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.07 |
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 power 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 power schedule, the powers can be adjusted during operation. We show that while lifetime-maximizing static power assignments can be found in polynomial time, for dynamic schedules the problem becomes NP-hard. We introduce two approximation heuristics for the dynamic case, and experimentally verify that the lifetime of a dynamically adjusted multicast connection can be made several times longer than what can be achieved by the best possible static assignment.