检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:滕志军[1] 张明儒[1] 张力[1] 许建军[1]
机构地区:[1]东北电力大学信息工程学院,吉林吉林132012
出 处:《哈尔滨工业大学学报》2016年第11期109-115,共7页Journal of Harbin Institute of Technology
基 金:国家自然科学基金(51277023)
摘 要:为解决ZigBee Cluster-Tree路由算法路径选择不优的问题,提出了一种能量感知的ZigBee树型路由EZTR(Energy-Aware ZigBee tree routing)算法.该算法利用每个节点感知的地址信息,按照ZigBee网络树型结构计算下一跳邻居节点到目的节点之间的跳数可避免网络的环路效应,通过引入认知概念,在跳数集合中选出最短路径以降低跳数.在ZigBee网络节点能量的感知过程中,当所选路径存在低能量节点时,及时启用备用节点,从而避免节点因能量过度消耗成为失效节点.NS2(Network simulator version 2)仿真实验表明,EZTR算法可提高网络分组递交率,有效减少节点转发跳数和平均网络延时,减小网络整体能耗,为提高网络的实时性和延长网络生命周期提供理论支持.To improve the problem of failing to well select optimal path for ZigBee Cluster-Tree routing algorithm,ZigBee routing based on Energy-Aware( EZTR) algorithm was proposed. Firstly,using each node perceiving its own address,this algorithm calculated packet forwarding hop-counts that the next hop of node to destination node according to tree structure for avoiding the loop response,by introducing the concept of cognitive for ZigBee network,and selected the shortest routing in hop-counts set to reduce hop-counts. Besides,in order to avoid excessive energy consumption of nodes,which caused nodes to be ineffective,through energy cognitive processing,when there is a low energy nodes selected path, EZTR algorithm timely adopted alternate node. Through comparative analysis of NS2 simulation experiments,packet delivery ratio is improved,hop-counts and average delay are reduced,and network energy consumption is saved,which can provide theoretical support for improving network real-time and extend network lifetime.
关 键 词:无线传感器网络 认知 能量感知 ZigBee树型路由算法
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15