【摘要】 分簇是延长无线传感网络寿命的有效技术之一,然而现有的簇状传感网络的路由技术没有考虑障碍物环境。为此,提出了面向障碍物的簇状传感网络的Dijkstra最短路径路由DSPR(Dijkstra shortest path-based routing)算法。DSPR算法首先利用能量有效的同质簇EHC(energy-efficient homogeneous clustering)技术周期地选举簇头CH(cluster head)。每周期定义一帧,每帧利用EHC技术选举簇头CH。簇头CHs构成数据传输的主干路径,并利用Dijkstra最短路径DSP(Dijkstra shortest path)算法选择最优路径,当遭遇障碍物时,将障碍物的顶点作为中间终点,再运行DSP,从而缩短数据传输路径。仿真结果表明,提出的DSPR有效减少传输路径和能量消耗,并提高了数据传输效率。更多还原

【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 transmission path.The simulation results show that the proposed DSPR effiectively reduces the transmission path and energy consumption,and improves the data transmission efficiency.更多还原