Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
Maximum lifetime broadcasting in wireless networks
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks
IEEE Transactions on Mobile Computing
EECHE: an energy-efficient cluster head election algorithm in sensor networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Power consumption in wireless sensor networks
Proceedings of the 7th International Conference on Frontiers of Information Technology
Network lifetime optimization in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies
Computer Networks: The International Journal of Computer and Telecommunications Networking
A site-specific indoor link model for realistic wireless network simulations
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
Mobile wireless ad hoc networks need to maximize their network lifetime (defined as the time until the first node runs out of energy). In the broadcast network lifetime problem, all nodes are sending broadcast traffic, and one asks for an assignment of transmit powers to nodes, and for sets of relay nodes so that the network lifetime is maximized. The selection of a dynamic relay set consisting of a single node (the 'master'), can be regarded as a special case, providing lower bounds to the optimal lifetime in the general setting. This paper provides a preliminary analysis of such a 'dynamic master selection' algorithm, comparing relaying to direct routing.