检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学计算机科学与技术学院,重庆400065
出 处:《计算机工程与设计》2016年第1期12-15,20,共5页Computer Engineering and Design
基 金:重庆市教委科学技术研究基金项目(KJ134101)
摘 要:针对已有蚁群优化路由算法容易出现拥塞的"枢纽"节点的缺点,提出一种改进的基于蚁群优化的Ad Hoc网络QoS路由算法。通过综合考虑节点的拥塞情况和剩余能量,引入节点健康状况概念,即节点剩余能量越多、发送队列中数据包越少,该节点越健康,利用该概念修改信息素更新规则,快速增加与健康节点相关联的连接信息素,使算法更快找到性能好、稳定性高的路径。与已有路由算法ARMAN和AODV进行仿真比较,比较结果表明,该算法在一定程度上降低了端到时延,提高了分组投递率。Concerning the shortcomings of the existing ant colony optimization routing algorithm that congestion "hub"node emerges,an improved Ad Hoc network QoS routing algorithm based on ant colony optimization algorithm was proposed.Considering the congestion and the residual energy of nodes,the concept of the health of the node was introduced that while there is more node residual energy and less packets in transmit queue,the node is healthier.The pheromone update rule was then modified,so that the pheromone on the connection associated with the healthy node increased faster,the algorithm found the path with good performance and high stability quickly.The simulation results show that the algorithm reduces the end-to-end delay and improves the packet delivery ratio.
分 类 号:TP393.03[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38