一种基于簇的移动Ad hoc路由算法

A Cluster-based Routing Algorithm for MANET

在大规模MANET中采用分簇的方法进行路由是解决网络可扩展性问题的一个有效方法,该文提出的CBRP算法在选取簇首节点时,引入了节点的带权ID,簇的分布更加均衡,改善了大规模MANET的路由计算效率。路由过程中使用数字签名,增强了CBRP路由的安全性。最后的仿真结果显示,与现有的协议相比,CBRP算法能提供更好的Qos性能,适合于结点较多、节点的移动速度受到一定限制的MANET。

Cluster-based routing algorithm operated in large Mobile Ad hoc networks can successfully solves the problem of scalability. The paper proposes a new cluster-based routing algorithm which introduced the Weight_ID of node when the head of cluster is selected. It provided a more balance of cluster in Ad hoc networks,and enhances the efficiency of routing in large Ad hoc network. The security is improved for signature is included in routing. The simulation result shows that compared with some protocols in mobile Ad hoc network,CBRP can increase the network performance and easy operation in large mobile Ad hoc network which its nodes moving at restrict speed.