Tighter Bounds for the Minimum Energy Broadcasting Problem

Authors:
Alfredo Navarra
Affiliations:
University of LýAquila
Venue:
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2005

Citing 5
Cited 13

Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
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

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

Journal of Experimental Algorithmics (JEA)
Sharing the cost of multicast transmissions in wireless networks

Theoretical Computer Science
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion

Computer Communications
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

Ad Hoc Networks
3-Dimensional minimum energy broadcasting problem

Ad Hoc Networks
Tightening the upper bound for the minimum energy broadcasting

Wireless Networks
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
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
Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space: (the α ≤d case)

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
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
Energy and time efficient broadcasting in known topology radio networks

DISC'07 Proceedings of the 21st international conference on Distributed Computing

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) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the2-dimensional case, thus decreasing the previously known 7.6 upper bound [3].