无线传感器网络异构驱动路由算法  

Wireless Sensor Network Heterogeneous Driven Routing Algorithm

作　　者：杨挺[1] 孙雨耕[1] 张志东[1,2] 杨郁[1] 

机构地区：[1]天津大学电气与自动化工程学院,天津300072 [2]天津市电力公司电力通信分公司,天津300010

出　　处：《计算机工程》2008年第19期12-14,43,共4页Computer Engineering

基　　金：教育部博士点基金资助项目(20030056007);博士后科学基金资助项目(2006040018)

摘　　要：融合表驱动路由和按需驱动路由的优点提出一种异构驱动的无线传感器网络路由算法,以实现无线传感器网络监测数据的高效汇集。算法将无线传感器网络的原有单一汇聚节点(Sink节点)扩充为一组无环连通点集,称为虚拟槽节点以覆盖全网。感知节点采用按需驱动路由策略将监测数据在短距离内传递给虚拟槽节点,随后数据在虚拟槽节点内部依照表驱动路由实现高速汇集。通过理论计算确定最优虚拟槽节点选取方式,并提出两跳邻居算法实现路由。经仿真实验,算法可保证网络内任意节点两跳可达虚拟槽节点,并通过分析仿真数据论证算法的有效性。Integrating the advantages of the table driven routing and the demand routing, this paper proposes a new wireless sensor network routing algorithm. Based on spanning tree theories, the algorithm extends the original single sink node to a set of connective nodes without loop, called the virtual sink, which overlays the whole networks. Monitoring data can be fast transmitted from the sensor nodes to the virtual sink in short-range with the demand routing. And then all of these data are effectively gathered to the real sink node by the table driven routing. The paper studies the optimal method to select the virtual sink, and proposes the ＂two-hop distance neighbor＂ algorithm to implement the routing. Using the simulation, each node must reach the virtual sink in two hops. The algorithm is feasible and preferable by computer simulation.

关 键 词：无线传感器网络 虚拟槽节点 按需路由 表驱动路由 生成树 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]