传感器网络中基于最短路径树的低延时节能路由算法  

A Routing Algorithm with Low-Delay Energy-Efficient Based on SPT-In Sensor Networks

作　　者：姚仲欢[1] 王高才[1] 孙野[1] 邱军林[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《微电子学与计算机》2007年第9期174-177,180,共5页Microelectronics & Computer

摘　　要：借助图论中最短路径和最小生成树的原理,在无线传感器网络中构建若干棵以Sink节点为根的最短路径源路由树。与最小生成树相比,最短路径树能保证路径上大部分节点找到节点间RSSI较强的通讯路径并以较少的跳数把数据传输给Sink节点,而最小生成树中的节点则需较多跳数。因此,提出的算法在一定程度上降低了延时。算法通过事先设定最低RSSI和节点最大剩余能量MRE来构建路由树,并修改已存在的路由算法,从而保证节点通讯的可靠性和网络的节能。In this paper, the theory of Minimum Spanning Tree and Shortest Path Tree are applied to construct some Shortest Path Routing Trees by make the Sink node as a tree root in wireless sensor networks. Compare to Minimum Spanning Tree, the Shortest Path Routing Trees can make most nodes finding the stronger RSSI communication route between node and transmitting data to the Sink node only using a little hops, while the node of Minimum Spanning Tree needs more hops. So, the delay of data is decreased in the algorithm. The algorithm constructs a routing tree through the set RSSI and the MRE of the nodes in advance, and we modify some proposed routing algorithms to guarantee the reliability of communication and energy-efficient of network.

关 键 词：无线传感器网络 最短路径树 节能路由算法 RSSI 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]