无线传感器网络分层路由算法研究

发布时间：2018-01-05 09:19

本文关键词：无线传感器网络分层路由算法研究　出处：《山东师范大学》2014年硕士论文　论文类型：学位论文

【摘要】：无线传感器网络（Wireless Sensor Network，WSN）是由传感器节点和基站组成的自组织网络。传感器节点负责感知和处理监测区域内的信息，然后协作地以无线通信方式将收集的信息传输给基站。它们通常由电池供电，且部署后不再补给能量，因此能源有效性是WSN研究的核心问题。能源的有限性限制了传感器节点的存储能力、处理能力及通信能力。基于分簇的分层路由协议与平面路由协议相比更适用于无线传感器网络，能够有效地提高能源有效性。因而，本文对无线传感器网络分层路由算法展开了深入的研究。本文的主要工作和创新点可概括如下： 1、首先，深入地研究和系统地概括了WSN的体系结构、涉及的关键技术及实际应用情况。然后，概述了WSN路由协议的设计目标，研究了节能策略，对现有的WSN路由协议进行了分类，详细地分析了经典的无线传感器网络路由协议，并深入地分析了分层路由协议的优势。 2、针对以往的异构无线传感器网络分层路由算法存在的不足，提出了EDU（Unequal Clustering Algorithm Based on Energy Distribution）算法。EDU算法借鉴了EDBCA算法的计算簇头竞争参数的方法。EDU算法具有以下创新：首先，EDU算法使满足一定条件的距离基站近的传感器节点直接与基站通信，在一定程度上节约了能源；其次，传感器节点根据自身与基站的距离计算竞选簇头的半径，在网络中构造非均匀的簇，削弱了“热点”效应；再者，簇成员节点根据簇头节点的剩余能量、与基站的距离及通信代价选择合适的簇头加入簇，而不是根据收到信号的强弱；最后，，与基站通过多跳数据传输方式通信的簇头节点，在选择中继节点时，综合考虑候选节点的剩余能量、与基站的距离及通信代价。 3、提出了基于能量和距离的无线传感器网络自适应分层路由算法EDA（Energy-based and Distance-based Adaptive Clustering Algorithm）。EDA算法从簇头的竞选、簇半径的计算及簇间路由树的建立三个方面改进了以往的分层路由算法。EDA算法引入基于能量和距离的概率模型产生候选簇头，减少了网络中竞选簇头的传感器节点的数量和用于信息交换的消息包的数量，节约了能量；EDA算法根据剩余能量设置定时器，使得局部区域内剩余能量多的候选簇头成为簇头，能够合理地控制簇头的分布；EDA算法在计算簇头的竞争半径时不仅考虑候选簇头节点的位置，还考虑候选簇头节点的剩余能量，能够有效地均衡网络负载；EDA算法根据簇头节点与基站的距离计算最优转发跳数，结合剩余能量和通信代价等信息选择最优的中继节点。 4、在OMNET++仿真平台上搭建了仿真环境。在相同的仿真环境下，实现了EDU算法与异构无线传感器网络路由算法DEEC、EDBCA的仿真实验。实验结果表明，EDU算法与DEEC、EDBCA算法相比，能够有效地均衡网络负载，延长网络生命周期。在相同的仿真环境下，实现了EDA算法与I-LEACH、DEBUC的仿真实验。实验结果表明，EDA算法与I-LEACH、DEBUC算法相比，具有更好的稳定性，能够更好地平衡网络能量消耗，提高能源有效性，延长网络生命周期。
[Abstract]:Wireless sensor network (Wireless Sensor Network, WSN) is a self-organizing network composed of sensor nodes and the base station. The sensor node is responsible for sensing and processing monitoring information in the region, and then cooperate with wireless communication transmit the collected information to the base station. They are usually powered by batteries, and after the deployment of energy supply is no longer so. Energy efficiency is a key problem in WSN research. The limited energy limited storage capacity of sensor nodes, processing ability and communication ability. Hierarchical routing protocol clustering compared with the flat routing protocol is suitable for wireless sensor networks based on, can effectively improve the energy efficiency. Therefore, this paper conducts an in-depth research on the hierarchical routing algorithm for wireless sensor networks. The main work and innovation points can be summarized as follows:
1, first of all, in-depth research and systematic summarization of the architecture of the WSN, the key technique and practical application. Then, summarizes the design goal of WSN routing protocol, the energy saving strategy, on the existing WSN routing protocols are classified and analyzed in detail by the wireless sensor network routing protocol code, and deeply analyze the advantages of hierarchical routing protocol.
2, to solve the problems existing in heterogeneous hierarchical wireless sensor network routing algorithm in the past, the EDU (Unequal Clustering Algorithm Based on Energy Distribution).EDU algorithm from the calculation method of cluster head competition parameter EDBCA algorithm.EDU algorithm has the following innovations: firstly, EDU algorithm to meet certain conditions from the sensor nodes near base station the direct communication with the base station, to a certain extent, saving energy; secondly, the sensor node calculation for cluster head according to their distance from the base station radius, construct the non-uniform clusters in the network, weakened the "hot spot" effect; moreover, the member nodes according to the residual energy of the cluster head nodes, the distance from the base station the communication cost and select a proper cluster head to join the cluster, rather than according to the received signal strength; finally, the cluster head and the base station through the multi hop data transmission communication Nodes, when selecting relay nodes, the residual energy of the candidate nodes, the distance from the base station and the communication cost are considered.
3, put forward the EDA adaptive wireless sensor network routing algorithm based on energy and distance (Energy-based and Distance-based Adaptive Clustering Algorithm) for the.EDA algorithm from the cluster head, cluster radius calculation and routing tree establishment three aspects to improve the hierarchical routing algorithm.EDA algorithm is introduced to generate candidate cluster head probability model based on energy and distance, reduce the number of nodes in the cluster head election in sensor networks for information exchange and message packet number, saving energy; EDA algorithm based on the residual energy setting timer, the local area in the remaining candidate cluster head energy to be the cluster head, can reasonably control the distribution of cluster head the EDA algorithm; not only consider the candidate cluster head node position in competition radius calculation of cluster head, also considering the residual energy of candidate cluster head node, effectively all The EDA algorithm calculates the optimal forwarding hops according to the distance between cluster head nodes and base stations, and selects the optimal relay nodes combined with residual energy and communication cost information.
4, build a simulation environment in OMNET++ simulation platform. In the same simulation environment, the realization of the EDU algorithm and DEEC routing algorithm for heterogeneous wireless sensor networks, EDBCA simulation experiments. The experimental results show that EDU algorithm and DEEC EDBCA algorithm, can effectively balance network load, prolong the network life cycle. The same simulation environment, the realization of the EDA algorithm and I-LEACH DEBUC simulation experiments. The experimental results show that EDA algorithm and I-LEACH DEBUC algorithm, it has better stability, better able to balance the network energy consumption, improve energy efficiency, prolong the network life cycle.

【学位授予单位】：山东师范大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5

【引证文献】