检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国人民解放军理工大学指挥自动化学院,南京210007
出 处:《小型微型计算机系统》2013年第9期2014-2017,共4页Journal of Chinese Computer Systems
基 金:国家"九七三"重点基础研究发展计划项目(2012CB315806)资助;国家自然(61070173)资助;江苏省自然科学基金项目(BK2009058;BK2010133)资助
摘 要:ZigBee的拓扑树路由算法设计的目标是应用于拓扑简单的、低负载的及低功耗的无线传感器网络环境,伴随着物联网技术及应用的广泛发展,物联网应用数据流可能会对ZigBee网络产生较大的负载,而现有ZigBee拓扑逻辑树构建方法无法兼顾链路配置和节点繁忙程度,需要优化ZigBee选路算法以提升网络整体性能.针对上述问题,本文在兼顾了节点繁忙程度、链路质量以及跳数等因素的基础上,提出一种基于链路综合加权的优化网络性能的选路算法.该算法在NS2平台上设计实现并通过了大量的模拟试验,结果表明该算法提高了分组到达率,减小了分组端到端时延,均衡了节点能量消耗,是一种适合于ZigBee网络环境的选路算法.The ZigBee tree routing is a low-overhead routing protocol designated for simple, low-load and low-power wireless sensor networks, however, with the rapidly developing of the IoT technologies and applications, various IoT applications' flow may incur larger traffic on a ZigBee network, the existing constructing ZigBee topology tree method fail to consider both the link configuration and the busy-degree of the node, and its routing algorithm should be optimized to advance the performance of the whole network. Ai- ming at the above problems, this paper takes the busy-degree of the node, link quality and hops into account, and proposes a compo- sitive weighted routing algorithm based on link and node stats. The algorithm had been designed and implemented on the NS2 plat- form, and experimental results on NS2 show us that the algorithm can improve the packet average arriving rate, decrease the packet average end-to-end delay and keep energy balance among nodes, it is thus more appropriate for ZigBee network environment.
关 键 词:物联网 ZIGBEE 选路算法 综合加权 NS2仿真平台
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222