检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]后勤工程学院后勤信息工程系,重庆400016
出 处:《传感技术学报》2008年第9期1635-1639,共5页Chinese Journal of Sensors and Actuators
摘 要:针对多数无线传感器网络路由协议不能高效应对网络拓扑结构动态变化的问题,本文提出了一种基于最短路径的层次路由协议TVHRP。本协议把网络中所有节点按距离汇聚节点的远近分到若干逻辑层,节点只与其上一层和下一层中距离自身最近的节点(父节点和子节点)直接通信。在网络拓扑结构变化时首先触发距离拓扑变化层最近的节点响应,并针对子节点或父节点失效、新增节点和移动节点引发的网络拓扑变化制定了有效的应对机制。仿真结果表明,本协议能够高效应对拓扑结构动态变化,优化网络性能。As many routing protocols for wireless sensor network can't handle dynamic topological variation efficiently,a new hierarchical routing protocol (TVHRP) based on the shortest path is proposed. In this protocol, all of nodes are arranged to different logic layers according to their distance from the sink, and each node merely communicates with the nearest nodes in its upper and lower layer, that is to say, fathernode and son-nodes. Moreover, nodes in the layer nearest to the topological variation layer are first triggered to respond,and some mechanisms to deal with dynamic topological variation due to invalid farthernode or son-node, the newly joined nodes and the mobility of nodes are designed. Simulation results have shown that TVHRP routing protocol can efficiently deal with dynamic topological variation and optimize network performance.
关 键 词:动态拓扑变化 最短路径 无线传感器网络 层次路由协议
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3