无线传感网能量感知的QoS路由协议研究

发布时间：2018-06-07 07:24

本文选题：无线传感器网络 + 分簇　；参考：《安徽农业大学》2014年硕士论文

【摘要】：随着信息技术的快速发展,无线传感器网络成为了当前国际上一个备受关注的研究热点。无线传感器网络的一个主要任务是收集网络中的数据,不同类型的传感器节点可以收集不同类型的数据。如何在资源有限节点密集的无线传感器网络中,为用户提供更好的服务是一个重要的问题需要研究人员去探索。因此,设计一个公平可靠能够节约节点能量,保证服务质量(Quality of Server, QoS)需求的传输路由是很必要的。目前,国内外学者基于无线传感器网络提出了很多QoS路由协议,为无线传感器网络的发展做出了巨大贡献。本文在学习前人的基础上做了如下工作：1.概述了无线传感器网络的背景和意义,介绍了无线传感器网络QoS路由协议的特性需求和面临的挑战。分析了QoS路由协议的发展趋势。2.在能量均衡方面提出了一种切实有效的非均匀分簇方法,运用新的簇头竞争参数来设定簇头竞争方法。通过仿真分析证明该方法可行并将其和经典协议LEACH作比较,得出该方法能更好地解决节点能量问题,避免能量异构网络中能量空洞现象,降低了节点死亡率。3.在已提出的非均匀分簇算法的基础上,设计了一种能量感知的QoS路由协议。该协议作为簇间路由,在发送每个包之前会先考虑它的实时性,如果是实时包,则会优先于非实时包进入发送队列。如果一个实时数据包的紧迫程度过大,即在最优的情况下都不能在其生存时限内到达目的节点,则会直接将其丢弃。紧迫程度越大,则会用最小的跳数、最优的线路来将其送至目的节点,而不考虑传输节点的能量。紧迫程度低的数据包,则会在其实时性得以保证的情况下,尽可能考虑节点能量的因素。这种设计不仅保证了数据包的实时性,还充分将能量利用到最大化。最后,我们通过仿真实验对设计的协议进行性能评估,将实验结果与经典的路由算法进行对比,得出设计协议的优越性与鲁棒性。实验结果表明,本文所设计的分簇算法和能量感知的QoS路由协议在节点死亡率、路由开销、端到端时延和分组转发率方面均优于对比的经典算法和协议。
[Abstract]:With the rapid development of information technology, wireless sensor networks (WSN) have become a hot research topic in the world. One of the main tasks of wireless sensor networks is to collect data from the network. Different sensor nodes can collect different types of data. How to provide better services for users in resource-intensive wireless sensor networks is an important issue for researchers to explore. Therefore, it is necessary to design a fair and reliable transmission route that can save energy and ensure quality of service (QoS) of Server, QoS). At present, scholars at home and abroad have proposed many QoS routing protocols based on wireless sensor networks, which have made great contributions to the development of wireless sensor networks. This paper does the following work on the basis of previous studies: 1. This paper summarizes the background and significance of wireless sensor networks (WSN), and introduces the characteristic requirements and challenges of QoS routing protocols in WSN. The development trend of QoS routing protocol is analyzed. In the aspect of energy balance, an effective and effective clustering method is proposed, which uses new cluster head competition parameters to set cluster head competition. The simulation results show that this method is feasible and compared with the classical protocol LEACH. It is concluded that this method can solve the energy problem of nodes better, avoid the energy hole in the energy heterogeneous network, and reduce the node mortality. 3. Based on the proposed non-uniform clustering algorithm, an energy-aware QoS routing protocol is designed. As an inter-cluster routing protocol, the real-time performance of each packet is considered before it is sent, and if it is a real-time packet, it will take precedence over non-real-time packets to enter the sending queue. If a real-time packet is too urgent to reach the destination node in the optimal case, it will be discarded directly. The greater the urgency, the minimum hops and the optimal line will be used to send it to the destination node, regardless of the energy of the transmission node. The data packet with low urgency will take into account the factor of node energy as far as possible under the condition that its real time can be guaranteed. This design not only guarantees the real-time data packet, but also maximizes the energy. Finally, we evaluate the performance of the designed protocol through simulation experiments, compare the experimental results with the classical routing algorithm, and obtain the superiority and robustness of the design protocol. Experimental results show that the proposed clustering algorithm and energy-aware QoS routing protocol are superior to the classical algorithms and protocols in node mortality, routing overhead, end-to-end delay and packet forwarding rate.
【学位授予单位】：安徽农业大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5;TP212.9

【相似文献】