基于Dijkstra的无线传感器网络分簇路由算法

发布时间：2018-01-17 03:19

本文关键词：基于DIJKSTRA的无线传感器网络分簇路由算法　出处：《计算机工程与设计》2010年17期 　论文类型：期刊论文

【摘要】：提出一种基于Dijkstra的无线传感器网络分簇路由算法——DEUC。该算法将改进的Dijkstra算法应用到簇间路由机制中,寻找簇头到基站的最短路径,使得离SINK较远的簇头节点沿着最短路径传输信息,从而有效减少传输路径长度与相应的网络延时。该算法还将传感器网络进行区域划分,使得距离SINK较近的簇头拥有少量成员节点,因此,靠近SINK的簇首可以为簇间的数据转发预留能量,达到均衡簇头能量消耗的目的。仿真结果表明,该算法在延长网络生存周期方面相比低功耗自适应分簇路由协议(LEACH)和能量高效的非均匀分簇算法(EEUC)分别提高约35%和25%。
[Abstract]:A clustering routing algorithm based on Dijkstra for wireless sensor networks (WSN) is proposed. The improved Dijkstra algorithm is applied to the inter-cluster routing mechanism. To find the shortest path from cluster head to base station, make the cluster head node which is far from SINK transmit information along the shortest path. In order to effectively reduce the transmission path length and the corresponding network delay, the algorithm also divides the sensor network area, so that the cluster head closer to SINK has a small number of member nodes. The cluster head near SINK can reserve energy for data forwarding between clusters to achieve the goal of equalizing cluster head energy consumption. The simulation results show that. Compared with the low power adaptive clustering protocol (LEACH) and the energy-efficient non-uniform clustering algorithm (EEUC), the proposed algorithm improves the network lifetime by about 35% and 25, respectively.
【作者单位】：桂林电子科技大学网络中心;
【基金】：广西教育厅立项基金项目(200911LX111) 2009年广西研究生教育创新计划基金项目(2009105950812M26)
【分类号】：TN929.5;TP212.9
【正文快照】： 0引言由于分簇路由能够有效地进行网内数据融合,减少冗余数据量,延长网络寿命等优点,已经成为无线传感器网络(wire-less sensor network,WSN)[1-2]的热门研究领域。近年来,研究学者提出了很多种WSN分簇路由协议来解决“hotspots”问题。文献[3]第一次提出了运用非均匀分簇的

【参考文献】