WSN中一种基于EE-CPK-means的簇头选举改进算法  

An improved cluster head election algorithm based on EE-CPK-means in WSN

作　　者：汪岩 徐利亚 周梦玲 Wang Yan;Xu Liya;Zhou Mengling(School of Computer and Big Data Science,Jiujiang University,Jiujiang 332005,China)

机构地区：[1]九江学院计算机与大数据科学学院,江西九江332005

出　　处：《无线互联科技》2023年第8期17-19,共3页Wireless Internet Technology

基　　金：江西省自然科学基金,项目编号:20202BAB202023。;江西省教育厅科技项目,项目编号:GJJ211842。

摘　　要：无线传感器网络被广泛应用于各个领域,如环境监控、自然灾害预警、公共卫生等。网络中的节点由电池提供能源,节点能量有限。无线传感器网络中簇头的传统选择是随机的,无法控制簇头节点的位置分布,导致节点能量消耗不均,出现节点过早死亡的问题。EE-CPK-means算法通过各节点与基站之间的距离来决定簇头节点,能够使簇头节点避免出现过于集中或分散的问题,但是低能量节点多次充当簇头从而过早死亡的问题仍然存在。文章提出了一种基于EE-CPK-means算法的簇头选举改进算法。当簇头进行选举时,检测出所有节点剩余能量,根据能量设定阈值,筛选出低于阈值的节点,避免其过早成为簇头节点,从而延长节点生命周期。Wireless sensor networks are widely used in various fields,such as environmental monitoring,natural disaster early warning,public health,etc.The nodes in the network are powered by batteries,and the node energy is limited.The traditional selection of cluster heads in wireless sensor networks is random,and the location distribution of cluster head nodes cannot be controlled,resulting in uneven energy consumption of nodes and premature death of nodes.The EE-CPK-means algorithm determines the cluster head node by the distance between each node and the base station.It can prevent cluster head nodes from being too centralized or decentralized.However,the problem that low energy nodes act as cluster heads for many times and thus die prematurely still exists.This paper proposes an improved cluster head election algorithm based on EE-CPK-means algorithm.When selecting the cluster head,the residual energy of all nodes is detected,and the threshold value is set according to the energy to screen the nodes below the threshold value,so as to avoid them becoming cluster head nodes prematurely,thus prolonging the node life cycle.

关 键 词：无线传感器网络 簇头选举算法 节点生命周期 

分 类 号：TN711.1[电子电信—电路与系统]