A fast local search method for minimum energy broadcast in wireless ad hoc networks

Authors:
Joanna Bauer;Dag Haugland;Di Yuan
Affiliations:
Department of Informatics, University of Bergen, PB. 7803, N-5020 Bergen, Norway;Department of Informatics, University of Bergen, PB. 7803, N-5020 Bergen, Norway;Department of Science and Technology, Linköping University, SE-601 74 Norrköping, Sweden
Venue:
Operations Research Letters
Year:
2009

Citing 7
Cited 1

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
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
Energy-efficient broadcasting in all-wireless networks

Wireless Networks
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks

Mobile Networks and Applications
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

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

Information Processing Letters

Static and dynamic minimum energy broadcast problem in wireless ad-hoc networks: A PSO-based approach and analysis

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. For a classic method, sweep, the best available time complexity result is O(|V|^4). We present an O(|V|^2)-time method, which exhaustively removes unnecessary transmissions yielding a solution comparable to that of sweep.