摘要
针对无线传感器网络中不均匀分簇引起能量空洞的问题,提出了改进的无线传感器网络非均匀分簇路由算法。该算法先根据节点剩余能量、节点到基站的距离、节点"度"和节点到簇头的距离等因素选举簇头;没有成为簇头的节点选择加入到距离最近的簇头所在的簇中,从而将整个网络划分为大小不等的簇;然后簇头再根据簇头剩余能量、簇头到基站的距离构造基于最小生成树的最优传输路径;通过簇内节点单跳、树内簇头多跳通信的方式将数据最终传输到基站。仿真结果表明,该路由算法能有效节约能量和均衡节点能耗,从而延长网络的生命周期。
In order to solve the problem of energy hole in wireless sensor networks caused by uneven clustering protocol, an improved uneven clustering routing algorithm is proposed. In the cluster heads selection stage, the algorithm selects the cluster heads based on several factors, including the residual energy of node, the distance between node and base station, the ＂ degree＂ of the node, and the distance between node and cluster head. Other nodes that can＇t be cluster heads select to join the cluster nearest to complete the process of clustering and the net- work is divided into clusters with different size. In the stage of data transmission, the algorithm constructs the optimal transmission path based on minimum spanning tree, according to the residual energy of cluster heads, and the distance between cluster heads and base station as well. The ordinary nodes of a cluster sends the data to cluster head through a single jump, and cluster heads send the data to base station through the nodes of the tree by the more jumping communication. The simulation shows that the routing algorithm ean efficiently reduce and balance the en- ergy consumption, and prolong the wireless sensor network survival period.
出处
《传感技术学报》
CAS
CSCD
北大核心
2015年第5期739-743,共5页
Chinese Journal of Sensors and Actuators
基金
科技部国家星火计划项目(2013GA780003)
关键词
无线传感器网络
能量均衡
非均匀分簇
最小生成树
wireless sensor networks
energy balance
uneven clustering
minimum spanning tree
