An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

Authors:
Christoph Ambühl
Affiliations:
Department of Computer Science, The University of Liverpool
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 11
Cited 35

Multiple communication im multihop radio networks

SIAM Journal on Computing
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Wireless information networks

Wireless information networks
Packet-radio routing

Routing in communications networks
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
Power consumption in packet radio networks

Theoretical Computer Science
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Improved approximation results for the minimum energy broadcasting problem

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Tighter Bounds for the Minimum Energy Broadcasting Problem

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks

Computers and Operations Research

The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

Journal of Experimental Algorithmics (JEA)
Sharing the cost of multicast transmissions in wireless networks

Theoretical Computer Science
Weighted broadcast in linear radio networks

Information Processing Letters
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

Ad Hoc Networks
3-Dimensional minimum energy broadcasting problem

Ad Hoc Networks
Minimum-Energy Broadcast and disk cover in grid wireless networks

Theoretical Computer Science
Energy-optimal distributed algorithms for minimum spanning trees

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours

DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Novel Algorithms for the Network Lifetime Problem in Wireless Settings

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
On construction of minimum energy k-fault resistant topologies

Ad Hoc Networks
Nested Partitioning for the Minimum Energy Broadcast Problem

Learning and Intelligent Optimization
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

Information Processing Letters
Low-energy fault-tolerant bounded-hop broadcast in wireless networks

IEEE/ACM Transactions on Networking (TON)
MANETS: High Mobility Can Make Up for Low Transmission Power

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Homogeneous 2-hop broadcast in 2D

Computational Geometry: Theory and Applications
Energy-efficient algorithms

Communications of the ACM
Maximum-residual multicasting and aggregating in wireless ad hoc networks

Wireless Networks
Maximizing the number of broadcast operations in static random geometric ad-hoc networks

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Evolutionary local search for the minimum energy broadcast problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Efficient k-shot broadcasting in radio networks

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Minimum energy broadcast on rectangular grid wireless networks

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Novel algorithms for the network lifetime problem in wireless settings

Wireless Networks
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours

Ad Hoc Networks
Minimum energy broadcast and disk cover in grid wireless networks

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
3-D minimum energy broadcasting

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space: (the α ≤d case)

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Equilibria for broadcast range assignment games in ad-hoc networks

ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
A weight-value algorithm for finding connected dominating sets in a MANET

Journal of Network and Computer Applications
Energy and time efficient broadcasting in known topology radio networks

DISC'07 Proceedings of the 21st international conference on Distributed Computing
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Interference-free energy efficient scheduling in wireless ad hoc networks

Ad Hoc Networks
Collecting information by power-aware mobile agents

DISC'12 Proceedings of the 26th international conference on Distributed Computing
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.02

Visualization

Abstract

Computing energy efficient broadcast trees is one of the most prominent operations in wireless networks. For stations embedded in the Euclidean plane, the best analytic result known to date is a 6.33-approximation algorithm based on computing an Euclidean minimum spanning tree. We improve the analysis of this algorithm and show that its approximation ratio is 6, which matches a previously known lower bound for this algorithm.