On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks

Authors:
Andrea E. F. Clementi;Gurvan Huiban;Paolo Penna
Affiliations:
-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 14

Improved approximation results for the minimum energy broadcasting problem

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees

PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
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
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

Journal of Experimental Algorithmics (JEA)
3-Dimensional minimum energy broadcasting problem

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

Theoretical Computer Science
Tightening the upper bound for the minimum energy broadcasting

Wireless Networks
Minimum-energy broadcast with few senders

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
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
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a technique to evaluate the approximation ratio on random instances of the Minimum Energy Broadcast Problem in Ad-Hoc Radio Networks which is known to be NP-hard and approximable within 12. Our technique relies on polynomial-time computable lower bound on the optimal cost of any instance.The main result of this paper is that the approximation ratio has never achieved a value greater than 6.4. Furthermore, the worst values of this ratio are achieved for small network sizes. We also provide a clear geometrical motivation of such good approximation results.