基于簇头质量的移动无线传感器网络分簇算法  

Clustering algorithm for mobile wireless sensor networks based on cluster head quality

作　　者：王炳庭[1] 林其斌[1] 梁辉[1] 倪受春[1] 石永华[1] 庞军[1] 胡艳军[2] 

机构地区：[1]滁州学院机械与电子工程学院,安徽滁州239000 [2]计算智能与信号处理教育部重点实验室(安徽大学),合肥230039

出　　处：《计算机应用》2014年第A02期27-30,58,共5页journal of Computer Applications

基　　金：安徽省高校省级自然科学研究重点项目(KJ2014A188);滁州学院自然科学研究项目(2012kj007B;2012kj010B);滁州学院本科教学质量与教学改革工程项目(2013jyy006;2012jyy012)

摘　　要：在部分节点移动的网络环境下,分析了传统静态无线传感器网络分簇算法对节点移动环境下成簇的失效性,给出了影响簇头质量的性能参数集,并提出了基于簇头质量的移动无线传感器网络分簇算法。该算法根据节点活动性、平均邻居距离、节点度偏差及信道质量等簇头性能的影响因子,通过加权的方法计算出簇头质量,在分布式传感网区域内簇头质量最大的节点将竞争成为簇头。通过理论分析和仿真对比表明,与LEACH算法相比该分簇算法降低了平均延迟,延长了网络生命期,并验证了该算法对动态拓扑具有适应性。Concerning the failure of traditional static clustering algorithm to the mobile environment, this paper gave a set of parameters that affected the performance of cluster header quality and proposed a Clustering Algorithm based on Cluster Head Quality（ CA-CHQ） in mobile wireless sensor networks with partial nodes moving. Cluster head quality was calculated by weighting method from the impact factors of cluster head performance, which are node activity, average neighbor distance,deviation of node degree and channel quality. In a distributed sensor area, the node with the biggest cluster head quality would become a cluster head. Through theoretical analysis and simulation, this algorithm can reduce average delay, improve network life time, and has the adaptability to dynamic topology compared with the Low-Energy Adaptive Clustering Hierarchy（ LEACH） algorithm.

关 键 词：移动节点 动态拓扑 分簇算法 影响因子 簇头质量 

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