基于CS优化的双簇头分簇路由算法研究

摘要

为了减少无线传感器网络(WSNs)分簇路由中簇头的能量消耗,提出了一种基于布谷鸟搜索(CS)优化的双簇头分簇路由算法.CS通过采用节点的剩余能量和节点之间的位置关系来构造适应值函数并选举出最优双簇头.其中,主簇头将数据进行融合,副簇头将融合的数据发送给基站,缓解了以往单簇头同时负责数据融合和传输的双重压力,使得整体能耗在各个节点的分配更均衡.仿真实验表明:与LEACH算法、粒子群优化(PSO)算法相比,CS算法在减小网络能耗以及延长网络生存周期上更具优势.%In order to reduce the energy consumption of cluster head in wireless sensor networks (WSNs) clustering routing,a dual-cluster beads clustering routing algorithm based on cuckoo search (CS) optimization is proposed.The CS algorithm construct fitness function by using residual energy of nodes and relationship of position between nodes and elects optimal dual-cluster heads.In which,the main cluster head fuse data and the vice cluster head sends the fused data to the base station.It relieves dual pressure of data fusion and transmission beared by single cluster head in the past,so that distribution of the overall energy consumption in each node is more balanced.Simulation experiment show that compared with LEACH algorithm,PSO optimization algorithm,CS algorithm has more advantages in reducing network energy consumption and prolonging network lifetime.