一种基于HEED的自适应负载均衡分群算法  

An Adaptive Load Balancing Clustering Algorithm Based on HEED

作　　者：李鑫[1] 张霞[1] 于宏毅[1] 

机构地区：[1]解放军信息工程大学通信工程系,郑州450002

出　　处：《计算机工程》2012年第17期87-90,共4页Computer Engineering

基　　金：国家科技重大专项基金资助项目(2010ZX03006-002;2011ZX03005-003-03)

摘　　要：针对HEED mini-degree均匀分群算法分群结果中,孤立节点群和节点数过多群影响群间均匀性和网络可用性的问题,提出一种自适应负载均衡分群算法(ALBCA)。该算法根据网络的连通情况自适应设置群规模门限,并将孤立成群节点加入到邻近的非孤立节点群,提高群间均匀性和非孤立节点群数量。仿真结果表明,与HEED mini-degree相比,ALBCA算法在不同的网络连通情况下均能获得更好的群均匀性能。An adaptive Load Balancing Clustering Algorithm（ALBCA） is proposed to resolve the problem that HEED mini-degree clustering algorithm has too many single-node clusters and too big clusters. The ALBCA adjusts reasonable bound of cluster size to connectivity status of the network adaptively and lets single node clusters join in non-single node clusters within two hops. Simulation results show that ALBCA gets more balanceable clusters than HEED mini-degree in different network connectivity circumstances.

关 键 词：无线传感器网络 HEED mini-degree算法 负载均衡分群 群规模门限 自适应 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]