基于按需路由的MPRN多播算法  

A Multicast Algorithm Based on On-Demand Routing for MPRN

作　　者：原达[1] 宋瀚涛[1] 

机构地区：[1]北京理工大学计算机科学与工程系,北京100081

出　　处：《计算机工程与应用》2002年第19期17-18,27,共3页Computer Engineering and Applications

基　　金："十五"部委规划项目

摘　　要：文章提出了采用按需路由发现策略的移动分组无线网多播路由算法。在算法中不需要维护全局的路由信息,通过按需路由发现过程,动态更新路由信息和建立多播转发组。多播数据包在转发组成员间进行有限泛洪,能够降低带宽的占用及减少路由更新信息的传播。模拟实验显示多播算法在带宽较低、多播组成员数量变化较大的移动分组无线网环境中,具有较好的可靠性和工作效率。This paper proposes a multicast algorithm utilizing on-demand routing strategy for mobile packet radio net-work.The algorithm does not maintain permanent route tables with full topological views.Instead,it applies on-demand procedures to dynamically discover routes and build multicast forwarding group.The multicast packets are propagated by each forwarding group member via scoped flooding,so the algorithm can reduce network bandwidth overhead and avoid the propagation of potentially large routing updates throughout the network.Simulation results show that the multicast al-gorithm is robust to mobility,has low bandwidth overhead,scales well with membership group size,and can be used ef-fectively for Mobile Packet Radio Networking.

关 键 词：按需路由 MPRN多播算法 移动分组无线网 转发群组 通信网络 无线通信 

分 类 号：TN929.5[电子电信—通信与信息系统]