An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

  • Authors:

  • Ioannis Caragiannis;Michele Flammini;Luca Moscardelli

  • Affiliations:

  • Computer Technology Institute and Press "Diophantus" and the Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, L'Aquila, Italy;Department of Economic Studies, University of Chieti-Pescara, Pescara, Italy

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new approximation algorithm for the Minimum Energy Broadcast Routing (MEBR) problem in ad hoc wireless networks that achieves an exponentially better approximation factor compared to the well-known Minimum Spanning Tree (MST) heuristic. Namely, for any instance where a minimum spanning tree of the set of stations is guaranteed to cost at most ρ ≥ 2 times the cost of an optimal solution for MEBR, we prove that our algorithm achieves an approximation ratio bounded by 2 ln ρ - 2 ln 2 +2. This result is particularly relevant for its consequences on Euclidean instances where we significantly improve previous results. In this respect, our experimental analysis confirms the better performance of the algorithm also in practice.