NAOW:一种改进的Ad Hoc网络AOW算法  

NAOW:An improved AOW algorithm for Ad Hoc network

作　　者：刘卫国[1] 石玉[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《中南大学学报（自然科学版）》2014年第6期1860-1866,共7页Journal of Central South University:Science and Technology

基　　金：国家自然科学基金资助项目(61073187)

摘　　要：针对Ad Hoc网络中异构网络节点的负载均衡问题和节点快速移动的稳定问题,提出一种改进的AOW算法即NAOW算法。通过增加节点处理能力属性,并赋予各节点不同的属性值,从而模拟异构网络中各种节点的性能,并用平均相对移动速度取代绝对移动速度,考虑整个簇而非单个节点的稳定性,从而减少统治集更新数。研究结果表明:在同构网络下,采用NAOW算法的负载均衡因子与其他算法相比有明显提高;在异构网络下,NAOW算法的负载均衡因子在不同传输范围内都有提高,且统治集更新数在实际应用网络的传输范围内有明显减少,增加了整个簇的稳定性。To solve load balancing problem in heterogeneous Ad Hoc network and stability problem in fast-moving state, an improved AOW algorithm named NAOW was proposed. This algorithm took the node processing capacity assessment indicator into account by giving different kinds of nodes’ different attribute values to simulate heterogeneous network node processing power. The calculation method of moving speed was adjusted by using an average relative moving speed to take the place of the average speed of movement and considering the whole cluster rather than the stability of a single node. Thus, the update number of the dominate set was reduced and the stability of the entire cluster was increased. The results show that load balancing factor using NAOW algorithm compared with other algorithms is significantly improved in homogeneous network. In heterogeneous network, load balancing factor using NAOW algorithm increases in different transmission ranges, and update number of the dominate set is reduced within the transmission scope of practical application of mobile network. As a result, the whole cluster is more stable.

关 键 词：AD HOC网络 分簇算法 AOW算法 网络仿真 

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