在RFID和WSN融合网中的能耗优化研究

发布时间：2018-04-27 02:01

本文选题：融合网络 + 能耗优化　；参考：《南京邮电大学》2017年硕士论文

【摘要】：RFID(Radio Frequency Identification)具有非接触身份识别的技术优势,WSN(Wireless Sensor Networks,WSN)具有自组织拓扑结构的技术优势,而将两者融合后的网络具有强大的功能和广阔的应用前景。它对农业生产、物流仓储、食品检测、环境检测等领域产生深远的影响,现在已有一些基于融合网络的智能化的系统被探索应用。融合网络的能耗较高的问题一直是制约网络发展的关键问题之一,也是融合网络中一个重要的研究课题。本文首先对RFID、WSN、以及RFID和WSN融合的技术背景、发展历程、研究现状等进行简单介绍,然后分别从网络覆盖、分簇路由协议方面对融合网络进行分析研究,并提出新的解决方法。本文从以下方面进行了探讨:(1)分析RFID和WSN融合的融合方式,对网络的结构、系统、工作方式以及技术标准进行了总结。(2)在研究网络覆盖策略时,对网络覆盖中的网络轮换休眠策略进行详细的研究,分别对普通的轮换休眠策略、随机退避时间轮换休眠策略、基于能量的退避时间轮换休眠策略进行了分析。研究发现,轮换休眠的休眠判定条件存在着的问题,基于此提出新的轮换休眠判定条件,并对其进行了论证。(3)对均匀分簇路由协议进行了梳理,重点分析了LEACH、HEED、PEGASIS等路由协议的主要思想、算法流程、优缺点。基于这些对路由算法的分析和前文中覆盖策略研究,提出一种基于覆盖和路由的分簇路由协议算法。它将轮换休眠策略中的盲休眠节点作为簇首选择的一个影响因子,同时针对融合网络的特点提出父子簇首的策略。仿真实验表明,改进后的算法具有更长的生存时长和更好的能耗均衡性。(4)对非均分簇路由协议中非均匀分簇的成因和现有的非均匀路由算法进行了分析和总结。针对LDUC路由算法中节点的邻居节点的范围不迎合竞争半径的需要,提出新的节点密度计算方法。同时基于候选簇首选择的随机性问题,提出改进的基于时间广播的竞争算法。仿真实验表明,改进后的有更好的生存时长,更低的网络能耗系数。
[Abstract]:RFID(Radio Frequency Identification has the technical advantage of contactless identification. WSNN Wireless Sensor Networks (WSNN) has the technical advantage of self-organization topology, but the network after merging the two has powerful function and broad application prospect. It has a profound impact on agricultural production, logistics warehousing, food detection, environmental detection and other fields. Now, some intelligent systems based on integrated network have been explored and applied. The problem of high energy consumption in fusion networks is one of the key problems restricting the development of networks, and it is also an important research topic in convergence networks. In this paper, the technical background, development history and research status of RFID-WSNand RFID and WSN fusion are introduced briefly. Then, the network coverage and clustering routing protocol are analyzed and studied respectively, and a new solution is put forward. This paper discusses the fusion of RFID and WSN from the following aspects, summarizes the network structure, system, working mode and technical standard. The network rotation dormancy strategy in network coverage is studied in detail. The general rotation sleep strategy, the random Backoff time rotation sleep strategy and the energy based Backoff time rotation sleep strategy are analyzed respectively. It is found that there are some problems in the sleep determination condition of rotation sleep. Based on this, a new decision condition of rotation dormancy is proposed and demonstrated. (3) the uniform clustering routing protocol is combed out. The main idea, algorithm flow, merits and demerits of the routing protocols, such as Leech, Hedo, PEGASIS and so on, are analyzed in detail. Based on the analysis of these routing algorithms and the study of the coverage strategy in the previous paper, a clustering routing protocol algorithm based on overlay and routing is proposed. The blind sleep node in the rotation sleep strategy is regarded as a factor of cluster head selection, and the parent and son cluster head strategy is proposed according to the characteristics of the fusion network. Simulation results show that the improved algorithm has longer survival time and better energy balance. It analyzes and summarizes the causes of non-uniform clustering and the existing non-uniform routing algorithms. In order to solve the problem that the range of neighbor nodes in LDUC routing algorithm does not meet the need of competition radius, a new method for calculating node density is proposed. At the same time, an improved competition algorithm based on time broadcast is proposed based on the randomness of the selection of candidate cluster heads. The simulation results show that the improved network has better survival time and lower energy consumption coefficient.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5;TP212.9;TP391.44

【参考文献】