A multicast routing tree algorithm with minimum energy in MANET

Author

Min, Yin ; Miao-yuan, Liang ; Yao, Tang

Author_Institution

Inst. of Meteorol., PLA Univ. of Sci. &Tech., Nanjing, China

fYear

2009

fDate

13-15 Nov. 2009

Firstpage

1

Lastpage

4

Abstract

MANET mesh-based multicast routing protocols cost much more overhead because of redundant packet forwarding. Considering limited energy of wireless nodes, this paper presents an energy efficient multicast routing tree algorithm, which had the least forwarding nodes. The algorithm was proved to be a minimum cost routing tree algorithm in wireless network. Also, a practical distributed version of the algorithm was presented. Simulation comparisons show that improved ODMRP by the distributed algorithm has a distinct decrease in transmission number, which is close relative to energy consumption. It is especially obvious when there are more multicast receivers in MANET.

Keywords

ad hoc networks; energy consumption; routing protocols; trees (mathematics); MANET; ODMRP; distributed algorithm; energy consumption; multicast receivers; multicast routing tree algorithm; packet forwarding; wireless network; wireless nodes; Broadcasting; Costs; Distributed algorithms; Mobile ad hoc networks; Multicast algorithms; Multicast protocols; Programmable logic arrays; Relays; Routing protocols; Tree graphs; Energy efficient; MANET; minimum cost; minimum forwarding; multicast routing tree algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4244-4856-2

Electronic_ISBN

978-1-4244-5668-0

Type

conf

DOI

10.1109/WCSP.2009.5371455

Filename

5371455