基于多分支虚拟槽节点的无线传感器网络路由算法研究  

New Wireless Sensor Network Routing Algorithm Based on Multiple Branching Virtual Sink

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

机构地区：[1]天津大学电气与自动化工程学院

出　　处：《传感技术学报》2007年第11期2456-2460,共5页Chinese Journal of Sensors and Actuators

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

摘　　要：基于生成树理论,本文提出一种基于多分支虚拟槽节点的无线传感器网络路由算法.算法将无线传感器网络的原有单一汇聚节点(Sink节点)扩充为一组无环连通点集,称为虚拟槽节点以覆盖全网.并融合表驱动路由和按需驱动路由的优点实现数据的高效汇集.本文通过理论计算确定最优虚拟槽节点选取方式,并提出两跳邻居算法实现路由.经仿真实验,算法可保证网络内任意节点两跳可达虚拟槽节点,并通过分析仿真数据论证算法的有效性.Based on spanning tree theory,the paper proposed a wireless sensor network routing algorithm.The algorithm extended the original single sink node to a set of connective nodes without loop,called the virtual sink, which overlays the whole networks.Moreover,integrating the advantages of the table driven routing and the demand routing,monitoring data can be effectively transmitted by this algorithm.The paper studied the optimal method to select the virtual sink,and proposed the 'two-hop distance neighbor' algorithm to implement the routing.Using the simulation,we find each node must reach the virtual sink in two hops.Finally,the paper proves the algorithm is feasible and preferable by computer simulation.

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

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置] TN393[自动化与计算机技术—控制科学与工程]