New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

Authors:
Joanna Bauer;Dag Haugland;Di Yuan
Affiliations:
Department of Informatics, University of Bergen, P.B. 7800, 5020 Bergen, Norway;Department of Informatics, University of Bergen, P.B. 7800, 5020 Bergen, Norway;Department of Science and Technology, Linköping University, 60174 Norrköping, Sweden
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 3

Introduction to Algorithms

Introduction to Algorithms
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks

Wireless Networks
Energy-efficient broadcasting in all-wireless networks

Wireless Networks
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion

Computer Communications
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

Center-oriented algorithms for the minimum energy broad and multicast problem in wireless ad hoc networks

Electronic Commerce Research and Applications
A fast local search method for minimum energy broadcast in wireless ad hoc networks

Operations Research Letters
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.89

Visualization

Abstract

The Broadcast Incremental Power (BIP) algorithm is the most frequently cited method for the minimum energy broadcast routing problem. A recent survey concluded that BIP has O(|V|^3) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O(|V|^2) and 4.598, respectively.