基于ZigBee无线网络路由协议研究与优化

发布时间：2018-04-11 20:56

本文选题：ZigBee网络 + Cluster-Tree　；参考：《西华大学》2017年硕士论文

【摘要】：近年来,物联网技术得到了飞速发展,与此相关的一些技术如RFID、无线传感器网络和嵌入式技术相应地也得到了快速的发展。与此同时,各种短距离无线传感器网络协议标准也百家争鸣,大放其彩。其中ZigBee技术因其具有低成本、低功耗、低复杂度、高可靠性等特点目前被广泛应用在无线传感器网络中。目前随着ZigBee技术应用范围越来越广,对ZigBee技术的研究也在不断的推进。其中ZigBee网络路由协议对整个ZigBee网络的性能有着重大意义,如何设计出一个能量高效、低传输时延算法成为了ZigBee网络路由算法研究热点。针对Cluster-Tree路由算法和现有的基于邻居表的树路由算法存在着跳数过大、节点流量负载不均衡和节点能量不均衡等问题,对原有的Cluster-Tree路由算法进行改进。通过设计节点之间维护邻居表的字段,比较无线传输范围内的邻居节点作为下一跳节点;其次通过引入能量分级机制,在节点使用邻居表进行跳数选择时对能量不达标的节点进行保护;理论分析表明,优化后的算法在保护能量较低节点的前提下能找到一条跳数更优的路径进行传输,对网络节点能量有一定自适应。仿真数据表明,改进的算法在平均时延、节点能耗均衡和降低丢包率上有所提升。针对AODVjr路由算法在进行路由发现和路由维护过程中,带来大量无效的路由控制开销,不仅会造成网络堵塞,还会增加整个网络能耗和传输时延等问题,对原有AODVjr路由算法从路由发现和路由修复两个阶段进行改进。首先根据节点加入网络时建立的父子关系自适应地设置RREQ请求帧的广播范围和方向,其次针对本地路由修复过程中会广播大量路由控制分组,改进路由表字段进行最小范围的本地路由维护。理论分析表明,改进后的算法有效限制了路由控制分组在网络中的数量。仿真数据表明,改进的算法能够减少路由控制分组在网络中的数量、降低了节点端到端的平均时延和降低了节点的能量消耗。
[Abstract]:In recent years, the Internet of things technology has been rapid development, and some related technologies such as RFID, wireless sensor networks and embedded technology have been developed rapidly.At the same time, all kinds of short-range wireless sensor network protocol standards are also controversial.ZigBee technology is widely used in wireless sensor networks because of its low cost, low power consumption, low complexity and high reliability.At present, with the application of ZigBee technology more and more widely, the research of ZigBee technology is also advancing.The routing protocol of ZigBee network is of great significance to the performance of the whole ZigBee network. How to design an energy-efficient and low-transmission delay algorithm has become a hotspot in the research of ZigBee network routing algorithm.In view of the problems of Cluster-Tree routing algorithm and existing tree routing algorithm based on neighbor table, such as too large hops, unbalanced node traffic load and unbalanced node energy, the original Cluster-Tree routing algorithm is improved.By designing the fields of maintaining neighbor table between nodes, the neighbor nodes in wireless transmission range are compared as the next hop nodes. Secondly, the energy classification mechanism is introduced.When nodes use neighbor table to select hops, the energy substandard nodes are protected. Theoretical analysis shows that the optimized algorithm can find a path with better hops for transmission under the premise of protecting the nodes with lower energy.It is adaptive to network node energy.The simulation results show that the improved algorithm improves the average delay, energy consumption equalization and packet loss rate.In the process of route discovery and route maintenance, AODVjr routing algorithm brings a lot of invalid routing control overhead, which will not only cause network congestion, but also increase energy consumption and transmission delay of the whole network.The original AODVjr routing algorithm is improved from two stages: route discovery and route repair.Firstly, the broadcast range and direction of RREQ request frames are set adaptively according to the parent-child relationship established when the nodes join the network. Secondly, a large number of routing control packets are broadcast during the local routing repair process.Improved routing table fields for minimal range local routing maintenance.Theoretical analysis shows that the improved algorithm effectively limits the number of routing control packets in the network.Simulation data show that the improved algorithm can reduce the number of routing control packets in the network, reduce the average end-to-end delay of nodes and reduce the energy consumption of nodes.
【学位授予单位】：西华大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN92

【参考文献】