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

Authors:
Joanna Bauer;Kemal Altinkemer;Dag Haugland
Affiliations:
Department of Informatics, University of Bergen, P.O. Box 7800, 5020 Bergen, Norway;Krannert School of Management, Purdue University, 403 W. State Street, West Lafayette, IN 47907, USA;Department of Informatics, University of Bergen, P.O. Box 7800, 5020 Bergen, Norway
Venue:
Electronic Commerce Research and Applications
Year:
2010

Citing 11
Cited 0

Distributed computation on graphs: shortest path algorithms

Communications of the ACM
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
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
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
On Minimum-Energy Broadcasting in All-Wireless Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Minimum-power multicast routing in static ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
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
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks

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

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quickly finding low-energy multicast routings is vital for a wireless system's energy efficiency. Therefore, key aspects of heuristics for the minimum energy multicast problem (MEMP) are low time complexity (measured in the numbers |V| and |A| of networking devices and their possible power assignments, respectively) and low deviation from the optimal energy consumption. Following a center-oriented approach, we develop the STSuS and STESuS algorithms (time complexity O(|V|^2) and O(|V|^2log|V|), respectively), and analyze their performance in numerical simulations. They deviate from the optimal energy consumption by only ~11% and ~7.5%, respectively, and thereby outperform the well-known MIP (O(|V|^2), ~22% deviation) and many other algorithms significantly.