一种基于节点位置和密度的非均匀分簇路由算法  

Uneven Cluster Routing Algorithm Based on Node Location and Node Density

作　　者：颜然[1] 杨云[1] 史庭俊[1] 孔秀平[1] 徐文春[1] 杨安驹 

机构地区：[1]扬州大学信息工程学院,扬州225009

出　　处：《计算机科学》2015年第8期65-69,105,共6页Computer Science

摘　　要：分析了现有分簇路由算法,提出了基于节点位置和密度的非均匀分簇路由算法。簇头选举阶段,考虑了节点的剩余能量,并引入竞争机制进行簇头选择;成簇阶段,综合考虑节点与基站的距离、节点密度以进行非均匀分簇,达到节点能耗均衡的效果,同时解决路由热区问题;簇间路由阶段,通过设立通信簇头节点,使簇间数据转发任务从簇头中分离,簇头节点只负责簇内的数据收集和融合,而通信簇头节点负责簇间数据传输,减少了簇头的能量消耗。实验结果表明,改进后的路由算法能够有效地均衡网络负载,并显著地延长网络的生命周期。By analyzing the existing cluster routing algorithms, we proposed an uneven cluster routing algorithm based on node location and node density. In the stage of cluster heads election, we considered the residual energy of nodes and introduced a competition mechanism to select the cluster head. In the stage of clustering, we considered the distance from the node to the base station and node density to complete the unequal cluster, which can achieve the effect of a ba- lanced energy consumption of nodes,and can solve the routing of hot spot problem. In the phrase of cluster routing, in order to separate inter-cluster data forwarding task from the cluster head, we chose the communication cluster heads. Cluster heads only collect and integrate data within the cluster, while the communication cluster heads transmit data between clusters. This reduces the energy consumption of the cluster head. Experimental results show that the improved routing algorithm can effectively balance the network load and significantly prolong the network lifetime.

关 键 词：无线传感器网络 路由算法 分簇 通信簇头 

分 类 号：TP393.17[自动化与计算机技术—计算机应用技术]