一种基于相对移动性的Ad-hoc网络分簇算法  

AN AD-HOC NETWORK CLUSTERING ALGORITHM BASED ON RELATIVE MOBILITY

作　　者：王超[1] 李长庚[1] 

机构地区：[1]中南大学物理与电子学院,湖南长沙410083

出　　处：《计算机应用与软件》2016年第3期151-155,共5页Computer Applications and Software

摘　　要：针对Ad-hoc网络中节点移动而导致网络分层结构不稳定的问题,提出一种基于节点间的相对移动性的加权分簇算法RMCA（Relative Mobility Clustering Algorithm）。将局部节点的相关性运用到簇头的选举当中,并考虑距离因素的影响。运用层次分析法计算出各因素的权重,通过NS2仿真工具对该算法进行仿真,并与经典算法进行比较。结果显示该算法在簇头数目方面得到优化,在簇依附关系变化和簇头更新次数方面性能提升10%~15%左右,有效地提高了簇结构的稳定性。Aiming at the instability problem of network hierarchy structure caused by the movement of nodes in ad-hoc network,this paper proposes a weighted clustering algorithm which is based on relative mobility between nodes. The algorithm applies the correlation mobility between local nodes to clusters election,and considers the effect of distance factor as well. Through the analytic hierarchy process（ AHP） it calculates the weight of each factor. The algorithm is simulated using NS2 simulation tool and compared with the classical algorithms. Results show that this algorithm is optimised in numbers of the cluster head,the performance increases of about 10% ~ 15% in number of the cluster attachment changes and the number of cluster head update. It improves the stability of the cluster structure effectively.

关 键 词：AD-HOC网络 分簇 权值 相对移动性 平均距离 层次分析法 

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