Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximation algorithms
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
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
Using relaxations to improve search in distributed constraint optimisation
Artificial Intelligence Review
Energy efficient all-to-all broadcast in all-wireless networks
Information Sciences: an International Journal
Hi-index | 0.02 |
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the same broadcast tree. Our approach differs from the most commonly used one where the determination of the broadcast tree depends on the source node, thus resulting in different tree construction processes for different source nodes. Using a single broadcast tree simplifies considerably the tree maintenance problem and allows scaling to larger networks. We first show that, using the same broadcast tree, the total power consumed for broadcasting from a given source node is at most twice the total power consumed for broadcasting from any other source node. We next develop a polynomial-time approximation algorithm for the construction of a single broadcast tree. The performance analysis of the algorithm indicates that the total power consumed for broadcasting from any source node is within 2H(n-1) from the optimal, where n is the number of nodes in the network and H(n) is the harmonic function. This approximation ratio is close to the best achievable bound in polynomial time. We also provide a useful relation between the minimum-energy broadcast problem and the minimum spanning tree, which shows that a minimum spanning tree may be a good candidate in sparsely connected networks. The performance of our algorithm is also evaluated numerically with simulations.