移动AdHoc网络基于蚁群需求的分群路由算法研究  

Research of Clustering Routing Arithmetic Based on Ant Colony Demand for Mobile AdHoc Network

作　　者：刘军华 蔡卫红 雷超阳 

机构地区：[1]湖南邮电职业技术学院,长沙410015

出　　处：《湖南城市学院学报（自然科学版）》2017年第2期59-62,共4页Journal of Hunan City University:Natural Science

基　　金：湖南省教育科学规划课题(XJK013CZY055);湖南省教育厅科研项目(14C0834)

摘　　要：针对移动AdHoc网络因受带宽和电量等因素影响而造成封包遗失机率较高的现象,提出了一种移动AdHoc网络基于蚂蚁算法的需求式群集路由算法.该路由算法利用弱连接支配集群概念,从每个群集广播给其它群集节点,算法中网络上的状态信息通过前行的蚂蚁获得,回退的蚂蚁采用伪随机比例选择策略并根据节点剩余电量、网络平均剩余电量以及路径平均剩余电量来评估从源节点到目的地节点的最佳路径.仿真结果表明:随着网络信息流量的增加,AOCR路由算法在封包抵达率、延迟时间均比AODV和AntSence算法有较大改善,因此,基于蚁群需求的群集路由算法在网络效能上比基于距离矢量路由AODV算法及传统的蚁群路由算法效率更高.For mobile Ad Hoc networks due to affected by factors such as bandwidth and power phenomenon of packet loss probability higher, a mobile Ad Hoc network demand type clustering routing algorithm based on ant algorithm is proposed. The routing algorithm uses weak links to dominate the cluster concept, from each cluster broadcast to other cluster nodes, the state information of the network access arithmetic through the forward ants, regression of ants using pseudo random proportional selection strategy according to the residual energy and network average residual energy and average residual energy to evaluate from the path the best path to the source node to the destination node. The simulation results show： With the increase of network traffic, the AOCR routing algorithm in packet arrival rate, delay time than AODV and AntSence algorithm are greatly improved, so the cluster routing algorithm in the network performance requirements of ant colony based on distance vector routing AODV algorithm and the traditional ant colony routing algorithm based on higher efficiency.

关 键 词：移动网络 ADHOC网络 分群 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]