计算机应用与软件2016，Vol.33Issue(3)：151-155,5.DOI:10.3969/j.issn.1000-386x.2016.03.034
一种基于相对移动性的 Ad-hoc 网络分簇算法
AN AD-HOC NETWORK CLUSTERING ALGORITHM BASED ON RELATIVE MOBILITY
王超 1李长庚1
作者信息
- 1. 中南大学物理与电子学院 湖南 长沙 410083
- 折叠
摘要
Abstract
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 be-tween local nodes to clusters election,and considers the effect of distance factor as well.Through the analytic hierarchy process (AHP)it cal-culates 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网络/分簇/权值/相对移动性/平均距离/层次分析法Key words
Ad-hoc network/Clustering/Weights/Relative mobility/Average distance/AHP分类
计算机与自动化引用本文复制引用
王超,李长庚..一种基于相对移动性的 Ad-hoc 网络分簇算法[J].计算机应用与软件,2016,33(3):151-155,5.
