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

Authors:
Michele Flammini;Alfredo Navarra;Stephane Perennes
Affiliations:
Computer Science Department, University of L'Aquila, L'Aquila, Italy;Computer Science Department, University of L'Aquila, L'Aquila, Italy;MASCOTTE project, I3S-CNRS/INRIA/University of Nice, Sophia Antipolis, France
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 6
Cited 4

Minimum-energy broadcasting in static ad hoc wireless networks

Wireless Networks
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
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)
Tightening the upper bound for the minimum energy broadcasting

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
Minimum energy broadcast and disk cover in grid wireless networks

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with one of the most studied problems during the last years in the field of wireless communications in Ad-Hoc networks. The problem consists in reducing the total energy consumption of wireless radio stations randomly spread on a given area of interest to perform the basic pattern of communication given by the Broadcast. Recently an almost tight 6.33-approximation of the Minimum Spanning Tree heuristic has been proved [8]. While such a bound is theoretically close to optimum compared to the known lower bound of 6 [10], there is an evident 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, that is, instances with a number of nodes more representative of practical purposes.