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

DOI10.1016/J.IPL.2009.02.012MaRDI QIDQ987839zbMATH OpenOpenAlexFDO

Authors Joanna Bauer, Dag Haugland, Di Yuan

Publication date 16 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18149

zbMATH Keywords

analysis of algorithmsapproximation algorithmsminimum energy broadcastwireless ad hoc network

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• A fast local search method for minimum energy broadcast in wireless ad hoc networks
• On approximation ratios of minimum-energy multicast routing in wireless networks
• Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem
• An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
• Minimum-energy broadcasting in static ad hoc wireless networks

Cites work

• Automata, Languages and Programming
• Introduction to algorithms
• Minimum-energy broadcasting in static ad hoc wireless networks

Cited in

(2)

• A fast local search method for minimum energy broadcast in wireless ad hoc networks
• Shared multicast trees in ad hoc wireless networks

This page was built for publication: New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987839)