移动Ad Hoc网络的一种自适应权值分簇算法  

Adaptive-weighted clustering algorithm based on flow balance for mobile ad hoc networks

作　　者：张丽[1] 余镇危[1] 张扬[2] 

机构地区：[1]中国矿业大学机电学院 [2]空军第一航空学院航空电子工程系,河南信阳464000

出　　处：《西安电子科技大学学报》2008年第3期572-576,共5页Journal of Xidian University

基　　金：国家博士点基金资助(20030290003);河南理工大学自然科学(青年)基金资助(646138)

摘　　要：为有效解决移动Ad Hoc网络簇结构的稳定性问题,提出了一种分簇算法.在流量均衡的基础上,综合考虑节点所处的网络环境和本身状态,根据适应性权值选择簇首,实现对随机分布的移动节点自适应动态分簇,并通过可用度来优化簇内的节点数.仿真测试表明,该算法在不增加开销的情况下,能适应性均衡簇首负载,有效防止簇首成为瓶颈.To solve the stability issue of clustered mobile ad hoc networks, a weighted clustering algorithm is proposed, based on the theory of the network flow balance. The algorithm chooses cluster heads relying on the adaptive weight, and dynamically clusters the mobile nodes distributed randomly and clinging to the network conditions and nodes＇ state. Clusters are optimized according to the scalable degree. Simulation results show that, in the condition of maintaining the former expenses, the algorithm could balance the load of cluster heads, and prevent the cluster heads from becoming the bottleneck effectively.

关 键 词：AD Hoe网络 体系结构 分簇算法 流量均衡 动态自适应 

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