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

Authors:
Michele Flammini;Alfredo Navarra;Stephane Perennes
Affiliations:
University of L'Aquila, Italy;University of L'Aquila, Italy;University of Nice, Sophia Antipolis, France
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2007

Citing 10
Cited 5

Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
An on-demand minimum energy routing protocol for a wireless ad hoc network

ACM SIGMOBILE Mobile Computing and Communications Review
Minimum-energy broadcasting in static ad hoc wireless networks

Wireless Networks
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
Physicomimetics for Mobile Robot Formations

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
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
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

3-Dimensional minimum energy broadcasting problem

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

Theoretical Computer Science
3-D minimum energy broadcasting

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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
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.00

Visualization

Abstract

This paper deals with one of the most studied problems in the last few years in the field of wireless communication in ad-hoc networks. The problem consists of reducing the total energy consumption of wireless radio stations distributed over a given area of interest in order to perform the basic pattern of communication by a broadcast. Recently, a tight 6-approximation of the minimum spanning tree heuristic has been proven. While such a bound is theoretically optimal if compared to the known lower bound of 6, there is an obvious gap with practical experimental results. By extensive experiments, proposing a new technique to generate input instances and supported by theoretical results, we show how the approximation ratio can be actually considered close to 4 for a “real-world” set of instances. We consider, in fact, instances more representative of common practices. Those are usually composed by considerable number of nodes uniformly and randomly distributed inside the area of interest.