基于粒子群优化的非均匀分簇路由算法.docVIP

基于粒子群优化的非均匀分簇路由算法 摘 要:为了解决无线传感器网络分簇路由算法中存在的“热区”问题和簇头选取问题，设计了一种自适应粒子群优化的非均匀分簇路由算法。首先通过候选节点与汇聚节点之间的距离计算竞争半径并构造出大小不等的多个簇，然后根据簇规模引入优化的粒子群算法，评价节点剩余能量和节点之间的距离等因素选取最终簇头，以剩余能量较多的簇头作为下一跳，形成以汇聚节点为根节点的多跳路由。仿真结果表明，与leach算法和eeuc算法相比，所提算法网络生存期分别延长了34%和16%,平均能量消耗分别减少了22%和12%，有效地减少了网络节点的能量消耗。 关键词:无线传感器网络；非均匀分簇路由算法；粒子群优化算法；能量消耗；生存期 中图分类号: tp393.07 文献标志码:a abstract: to deal with the “hot area” problem and cluster heads selection in clustering routing algorithm of wireless sensor network (wsn), the paper designed an uneven clustering routing algorithm based on adaptive particle swarm optimization (pso). firstly, according to the distance between candidate nodes and sink node, the competitive radius was calculated and clusters of various sizes were constructed. then this paper introduced the pso according to the cluster size. the pso was used to select the final cluster heads by evaluating factors such as residual energy of nodes and distance between nodes. the cluster heads with more residual energy were chosen as the next hop to form multi-top route in which the sink node is the root. the simulation results show that compared with other two similar algorithms, leach and eucc, the proposed algorithm extends 34% and 16% of survival time of network separately, reduces 22% and 12% of average energy consumption respectively, and effectively decreases the network nodes energy consumption. key words: wireless sensor network (wsn); uneven clustering routing algorithm; particle swarm optimization (pso) algorithm; energy consumption; survival time  0 引言 无线传感器网络(wireless sensor network, wsn)是由部署在监测区域内的大量微型传感器节点形成的一种自组织网络［1］。由于传感节点通过自带电池供电且难以更新，因此，设计出一种能够高效地利用节点的能量且延长网络生存期的路由算法成为无线传感器网络路由研究的首要目标［2-3］。 经典的低能量自适应分簇路由算法(low-energy adaptive clustering hierarch, leach)［4］每个周期由分簇和数据传输两个阶段构成，但是簇头以随机概率选取且簇头与汇聚节点单跳通信，容易造成簇头能量耗尽过早死亡。文献［5-7］引入了粒子群优化（particle swarm optimization, pso）算法优化簇头选举，但簇头与汇聚节点单跳通信的方式仍然会造成簇头节点能量的快速消耗。文献［8-10］在簇头与汇聚节点之间采取多跳的通信方式，有利于节约簇头能量。但是，崔莉等［11］认为距离汇聚节点较近的簇头须转发大量其他簇头发送的数据而