测控技术2017，Vol.36Issue(4)：103-108,6.
基于DSP的障碍物环境的簇状传感网络路由算法
Routing Algorithm of Cluster Sensor Networks Among Obstacles Based on Dijkstra Shortest Path
摘要
Abstract
Clustering is one of the effective techniques for prolonging the lifetime of wireless sensor networks (WSNs).In most of the traditional routing in clustered WSNs,it is assumed that there is no obstacle in a field of interest.Therefore,Dijkstra shortest path-based routing(DSPR) algorithm in cluster wireless sensor networks among obstacles is proposed.DSPR algorithm periodically selects the cluster heads(CH) by energy-efficient homogeneous clustering(EHC) technique.The lifetime of WSNs is divided into frames,CH is selected by EHC technique in each frame.CHs constitue the backbone path for data transmitting.Moreover,the optimal path is created by DSP(Dijkstra shortest path).When an obstacle is encounted,the view-vertices are taken as the intermediate destinations,and to run the DSP,thereby shortening the data transrnission path.The simulation results show that the proposed DSPR effectively reduces the transmission path and energy consumption,and improves the data transmission efficiency.关键词
无线传感网/路由/簇/Dijkstra最短路径/障碍物/能量Key words
wireless sensor network/routing/clustering/Dijkstra shortest path/obstacle/energy分类
信息技术与安全科学引用本文复制引用
陈中良,魏长宝..基于DSP的障碍物环境的簇状传感网络路由算法[J].测控技术,2017,36(4):103-108,6.基金项目
河南省科技攻关计划项目(122102210430) （122102210430）
