一种节点特征累积的自适应加权分簇算法  

An adaptive on-demand weighting clustering based on accumulation of nodes' characters

作　　者：丁春利[1] 朱敏[1] 黄建[1] 范量[1] 

机构地区：[1]四川大学计算机学院,成都610064

出　　处：《四川大学学报（自然科学版）》2010年第3期488-492,共5页Journal of Sichuan University(Natural Science Edition)

基　　金：四川省科技厅项目(2009JY0038)

摘　　要：本文针对Ad Hoc网络的稳定性问题,提出一种AOW-ANC分簇算法,该算法通过减少簇的更新次数来增强Ad Hoc网络的稳定性.其原理是通过节点的积累特征形成能适应变化环境的簇,并采用尽量避免机制和控制相应的因子来优化网络.仿真实验证明,该算法在实际应用环境中具有较好的稳定性和自适应性.A new method of AOW-ANC is put forward in allusion to the stability of Ad Hoc networks in this paper,it increases the stability of Ad Hoc networks by reducing the times of clustering. The elements is that clusters are formed based on accumulation of nodes ＇ characters for adapting variety environments,then, the measures of avoiding mechanism and mize the networks. The simulation results show that rolling corresponding factors are taken to optiproposed approach outperforms in practice.

关 键 词：AD HOC网络 分簇算法 特征累积 自适应加权 

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