无线Ad Hoc网络中一种基于簇结构的多播路由算法

A Clustering-based Multicast Routing Algorithm for Ad Hoc Networks

在无线 Ad Hoc网络中 ,采用分簇的方法将移动自组网进行簇划分 ,形成由簇头、簇间节点和簇内节点构成的分簇网络结构 ,从而提供对无线 Ad Hoc网络资源进行管理的一种简便构架 .文中基于无线 Ad Hoc网络簇结构的特点 ,提出了一种在无线 Ad Hoc网络中实现的多播路由算法 .该算法通过对无线 Ad Hoc网络分簇 ,形成由簇头和簇间节点构成的虚拟骨干网 ,再对其进行回路检测和冗余剪枝算法处理 ,最终得到一个能满足多播要求的多播树 .通过对仿真实验结果的分析 ,该算法具有稳定的数据包发送率 ,较低的路由建立时间 .

An Ad Hoc network is a collection of mobile nodes forming a temporary network without the aID of any centralized administration or standard support services regularly available in conventional networks. It has good prospect of wIDely application in the field of disaster recovery, forward-deployed military networks, sensor network, distributed mobile computing and so on. In an Ad Hoc network, clustering provides a convenient framework for resource management. In this framework, a node may act as clusterhead, cluster gateway node or cluster member node. According to the characteristic of clustering structure in Ad Hoc networks, a clustering structure based on multicast routing algorithm for Ad Hoc networks is proposed. After partitioning the Ad Hoc network into clusters, virtual skeleton networks that are composed of clusterhead and cluster gateway nodes can be formed. Multicast tree that meets the demand of multicast is obtained through looping test and redundant pruning algorithm to acquire the virtual skeleton networks. Simulating results show that steady packet delivery rate is achieved and routing time is also improved.