稳定且负载均衡的移动Ad Hoc网络加权分簇算法  

Stable and Load balanced Weighted Clustered Algorithm in Ad Hoc

作　　者：唐翠微 

机构地区：[1]雅安职业技术学院,雅安625000

出　　处：《计算机系统应用》2016年第5期129-134,共6页Computer Systems & Applications

基　　金：四川省高等教育人才培养质量和教学改革项目(川教函[2014]156号)

摘　　要：针对移动Ad Hoc网络中传统加权分簇算法(WCA)的缺陷,提出一种稳定且负载均衡的改进型WCA(SLB-WCA).在节点组合权值计算中,增加了考虑节点的稳定性,并提出一种"相对典型节点度"代替传统WCA中的单纯节点度因素,同时根据各个节点的节点度制定本地簇大小约束,代替传统算法中的全局约束.SLB-WCA能够更加合理的计算节点权值和控制簇大小,均衡网络负载.通过实验与传统WCA相比,SLB-WCA形成的簇数目较少且具有良好的覆盖率,提高了网络的生命周期.For the issues of the defects of traditional weighted clustering algorithm（WCA） in Mobile Ad Hoc Networks, a safe and load balanced WCA（SLB-WCA） is proposed. SLB-WCA take nodes stability into consideration of the combination weights computing of nodes, and a ＂relatively typical node degree＂ is proposed to substitute the simple node degree factors in traditional WCA. In the meantime, according to the degree of each node, SLB-WCA formulates local cluster size constraints instead of global constraints in traditional algorithm. SLB-WCA can make node weights calculation and cluster size control more reasonably, and make the network load more balanced. Compared with traditional WCA, SLB-WCA has less number of cluster heads, better network coverage, which improves the network lifetime effectively.

关 键 词：移动AD HOC网络 加权分簇算法 负载均衡 网络覆盖率 

分 类 号：TN929.5[电子电信—通信与信息系统]