Tightening the upper bound for the minimum energy broadcasting

Authors:
Michele Flammini;Ralf Klasing;Alfredo Navarra;Stephane Perennes
Affiliations:
Computer Science Department, University of L'Aquila, Italy;LaBRI, Université Bordeaux 1, CNRS, Talence Cedex, France;Computer Science Department, University of L'Aquila, Italy;MASCOTTE, CNRS, INRIA, University of Nice-Sophia Antipolis, France
Venue:
Wireless Networks
Year:
2008

Citing 9
Cited 3

Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
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
On Minimum-Energy Broadcasting in All-Wireless Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
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
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Iterated Local Optimization for Minimum Energy Broadcast

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

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

Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks

Journal of Parallel and 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
Minimum power multicast algorithms for wireless networks with a Lagrangian relaxation approach

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new upper bound on the approximation ratio of the Minimum Spanning Tree heuristic for the basic problem on Ad-Hoc Networks given by the Minimum Energy Broadcast Routing (MEBR). We introduce a newanalysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound [4], almost closing the gap with the lower bound of 6 [12].