Multicast forwarding group routing protocol for ad hoc

被引:0
作者
Zhang, Quan-Xin [1 ]
Niu, Zhen-Dong [1 ]
Zheng, Jian-Jun [2 ]
Jin, Fu-Sheng [1 ]
机构
[1] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
[2] PLA, Unit 63961, Beijing 100012, Peoples R China
来源
PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2008年
基金
美国国家科学基金会;
关键词
on-demand; forwarding group; multicast;
D O I
10.1109/ICMLC.2008.4621010
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.,cry well in ad hoe 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.
引用
收藏
页码:3503 / +
页数:2
相关论文
共 8 条
[1]  
[Anonymous], 1975, ADAPTATION NATURE AR
[2]  
BAO YR, 2007, J COMPUTER APPL
[3]  
CHEN GL, 1996, GENETIC ALGORITHM AP
[4]  
CHEN SP, 2002, GEOGRAPHY INFORM SYS
[5]  
COMER DE, 1998, INTERNETWORKING TCP
[6]  
HOLLAND JH, 1962, J ASSOC COMPUT MACH, P297
[7]  
ZHENG K, 2006, J COMMUNICATIONS, P132
[8]  
ZHENG XQ, 2003, J U ELECT SCI TECHNO