一种用于移动Ad hoc网络的自适应分布式权值分簇算法  

An adaptive distributed weighted clustering algorithm for mobile Ad hoc networks

作　　者：臧寿红[1] 臧春华[1] 孙铭媚[2] 

机构地区：[1]南京航空航天大学信息科学与技术学院,江苏南京210016 [2]解放军理工大学图书馆,江苏南京210018

出　　处：《苏州科技学院学报（自然科学版）》2010年第2期43-47,共5页Journal of Suzhou University of Science and Technology （Natural Science Edition）

基　　金：江苏省自然科学基金资助项目(BK2007192)

摘　　要：利用分簇算法得到的分层结构可以提高移动Ad hoc网络性能。为有效解决Ad hoc网络簇结构的稳定性问题,在现有分簇算法基础上提出一种自适应分布式权值分簇算法。通过计算每个节点的移动性、平均邻居距离、节点度以及能量消耗4个因素的加权和而实现对随机分布节点自适应动态分簇,同时利用可用度优化簇内节点数。仿真结果表明,新分簇算法相对于已有的分簇算法具有更好的稳定性和负载均衡的优点。The hierarchical structure obtained by utilizing the clustering algorithm is able to improve the performance of mobile Ad hoc networks.To solve the stability problem of Ad hoc networks,an adaptive distributed weighted clustering algorithm is proposed based on existing clustering algorithms.The weighted sum of mobility,average distance to its all neighbors,degree and consumed energy for each node was calculated.In this way,the adaptive dynamic clustering for random distributed nodes was realized.Clusters were optimized according to the scalable degree.Simulation results show that the proposed clustering algorithm is much more stable and loadbalanced than the existing.

关 键 词：AD HOC 自适应 分簇算法 权值 

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