A Label Based Greedy Algorithm for Minimum Energy Consumption Multicast Routing in Ad Hoc Networks

Author

Lin, Lin ; Wu, Qiwu

Author_Institution

State Key Lab. of Wireless Mobile Commun., Beijing, China

fYear

2011

fDate

10-12 Oct. 2011

Firstpage

113

Lastpage

117

Abstract

We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n²) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.

Keywords

ad hoc networks; computational complexity; greedy algorithms; trees (mathematics); label based greedy algorithm; minimum energy consumption multicast routing; multicast trees; multihop wireless ad hoc networks; time complexity; Ad hoc networks; Algorithm design and analysis; Approximation algorithms; Complexity theory; Heuristic algorithms; Optimization; Steiner trees; Ad hoc networks; Algorithm; Energy; Multicast tree; Steiner tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2011 International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4577-1827-4

Type

conf

DOI

10.1109/CyberC.2011.28

Filename

6079412