Multicast forwarding group routing protocol for ad hoc

Author

Zhang, Quan-Xin ; Niu, Zhen-Dong ; Zheng, Jian-Jun ; Jin, Fu-Sheng

Author_Institution

Sch. of Comput. Sci. & Technol., Beijing Inst. of Technol., Beijing

Volume

6

fYear

2008

fDate

12-15 July 2008

Firstpage

3503

Lastpage

3507

Abstract

The multicast routing protocols used in wire network, such as distance vector multicast routing protocol(DVMRP), multicast open shortest path first(MOSPF), core based tree(CBT), do not run very well in ad hoc network because the dynamic net topology may destroy the distribution tree. Besides, distribution tree usually needs global routing structure. Which produces extra processing cost because the dynamic topology will introduce frequent exchange of routing vector or routing state between nodes. To deal with these problems multicast forwarding group routing protocol (MFGRP) which is based on route grid is designed on basis of dynamic source routing protocol (DSR). MFGRP ensures the multicast packets are sent to destination through dynamic topology network using multicast route grid.

Keywords

ad hoc networks; multicast protocols; routing protocols; ad hoc network; core based tree; distance vector multicast routing protocol; dynamic net topology; dynamic source routing protocol; forwarding group; multicast open shortest path first; Bandwidth; Broadcasting; Computer science; Costs; Cybernetics; Machine learning; Multicast protocols; Network topology; Programmable logic arrays; Routing protocols; Forwarding group; Multicast; On-demand;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2008 International Conference on

Conference_Location

Kunming

Print_ISBN

978-1-4244-2095-7

Electronic_ISBN

978-1-4244-2096-4

Type

conf

DOI

10.1109/ICMLC.2008.4621010

Filename

4621010