无线传感器网络基于节点能量的簇内多跳树型路由算法  

Cluster multi hop tree routing algorithm based on node energy in Wireless Sensor Networks

作　　者：刘睿琼[1] 侯爱华[1] 黄振波[1] Liu Ruiqiong;Hou Aihua;Huang Zhenbo(High-Tech College,Xi＇an University of Technology,Xi＇an Shaanxi,710082,China)

机构地区：[1]西安理工大学高等技术学院,陕西西安710082

出　　处：《现代科学仪器》2018年第3期47-50,共4页Modern Scientific Instruments

摘　　要：无线传感器网络中,传统LEACH算法采用分簇结构,其选举簇头的方式由于随机性,未考虑簇头节点均匀分布的问题,会造成网络的不完全连通.如果网络中节点密集处产生多个簇头,收集到的数据也会产生冗余,造成能量不合理消耗.针对这些问题,设计了基于节点能量的簇内多跳树型路由算法,簇头间采用最短路径Dijkstra路由算法.在最佳分簇情况下有效选取簇头,将簇内节点的路由加入能量权值设计为最小生成树,使得节点能耗均衡.通过仿真实验对比,当网络的规模和节点之间的距离增大时,基于节点能量的簇内多跳树型传输路由算法的效果要明显优于单跳传输LEACH算法,有效节省了网络能耗,延长了网络的生存周期.In Wireless Sensor Networks, the conventional LEACH algorithm adopts the clustering structure, whose selecting approach does not consider the issue of even distribution of the clustering nodes for its randomness, causing the incomplete connection of the network. Provided several clustering heads are generated at the dense nodes in the network, the data collected will be redundant, resulting in the irrational consumption of energy. Regarding these issues, the algorithm of multi-hop tree route inside the clusters based on the node energy is designed, adopting the Dijkstra route algorithm for the shortest distance. Selecting the cluster heads effectively under the optimal conditions, the smallest generating trees are worked out for the route inside the cluster nodes with the energy weight added, making the energy consumption even at the nodes. A contrast was made via simulated experiments, the effectiveness of the algorithm of multi-hop tree route inside the clusters based on the node energy is apparently superior to the LEACH algorithm of the mono-hop transmission when the network scale and the distance between nodes are enlarged, thus saving the energy consumption in the network effectively and prolonging the living period of the network.

关 键 词：无线传感器网络 分簇 簇内多跳 路由协议 LEACH DIJKSTRA算法 

分 类 号：TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]