无线传感器网络拓扑控制技术的研究

发布时间：2018-04-18 05:13

本文选题：无线传感器网络 + 拓扑控制　；参考：《沈阳理工大学》2016年硕士论文

【摘要】：无线传感器网络(WSN)是集信息采集、传输以及处理于一体的智能信息管理系统,应用前景广阔,是目前比较活跃的一个领域。WSN是一种由大量微传感器节点组成的自组织网络,网络组织方式通常多种多样,为提高路由协议效率、降低网络能耗,以延长网络生存周期,需要有一个良好的网络拓扑结构。拓扑控制作为无线传感器网络研究中的核心问题,能够为数据融合、路由协议以及目标定位等提供技术支撑。基于分簇机制的拓扑控制算法是目前常用的一类拓扑控制算法。本文在对现有分簇算法进行分析的基础上,着重研究了非均匀分簇算法,并针对非均匀分簇算法中存在的不足,设计了一种基于非均匀分簇的拓扑控制算法LEUC,主要成果如下:首先,针对现有非均匀分簇算法在分簇过程中未考虑剩余能量、节点密度等因素而导致网络能耗不均、网络生存周期缩短的问题设计了LEUC算法,该算法在选举候选簇首时,引入节点的剩余能量,使剩余能量大的节点成为候选簇首的概率增大;在计算竞争半径时,引入节点密度,使节点密集的区域形成规模较小的簇,而稀疏区域则形成大簇;为避免簇内偏远节点与簇首通信时能耗过大,在正式簇首产生之前,通过判断簇首节点与簇质心之间的距离,以决定是否需要重新选举簇首,从而降低节点能耗,均衡网络能耗,延长网络生存周期。其次,针对现有簇间通信机制中簇首间单跳距离过长,造成远距离传输数据能耗过大的问题,本文设计了簇间多跳通信策略,即在簇内选举一个簇首助理节点作为中继节点,簇间利用中继节点转发,以避免簇首节点能耗过大;同时,在选择下一跳中继节点时,综合考虑距离、剩余能量、链路代价因素,以避免单个节点能耗较大,从而延长网络生存周期。最后,利用OPNET仿真工具对本文提出的LEUC算法进行了仿真测试,测试结果表明,与LEACH、EEUC算法相比较,LEUC算法能够有效均衡网络节点能耗,延长网络生存周期。
[Abstract]:Wireless Sensor Network (WSN) is an intelligent information management system which integrates information collection, transmission and processing. It has a broad application prospect. WSN is an active field. WSN is a self-organized network composed of a large number of micro-sensor nodes.In order to improve the efficiency of routing protocols, reduce network energy consumption and prolong the network lifetime, a good network topology is needed.Topology control, as the core problem in wireless sensor network research, can provide technical support for data fusion, routing protocol and target location.The topology control algorithm based on clustering mechanism is a kind of commonly used topology control algorithm.Based on the analysis of the existing clustering algorithms, this paper focuses on the non-uniform clustering algorithm, and aims at the shortcomings of the non-uniform clustering algorithm.In this paper, a topology control algorithm based on non-uniform clustering is designed. The main results are as follows: firstly, the existing non-uniform clustering algorithms do not consider the remaining energy, node density and other factors which lead to uneven network energy consumption.LEUC algorithm is designed to shorten the lifetime of the network. When the candidate cluster head is elected, the residual energy of the node is introduced to increase the probability that the node with large residual energy becomes the candidate cluster head, and the node density is introduced when calculating the competition radius.In order to avoid the energy consumption of communication between remote nodes and cluster heads, the distance between cluster head node and cluster centroid is judged before the formal cluster head is produced.In order to decide whether the cluster head needs to be re-elected, the node energy consumption is reduced, the network energy consumption is balanced, and the network lifetime is prolonged.Secondly, aiming at the problem that the single hop distance between cluster heads is too long, which results in too much energy consumption for long-distance data transmission, a multi-hop communication strategy is designed in this paper, in which a cluster head assistant node is elected as a relay node in the cluster.In order to avoid the excessive energy consumption of the cluster head node, the distance, residual energy and link cost factors are considered in the selection of the next hop relay node, so as to avoid the high energy consumption of a single node.Thus prolongs the network life cycle.Finally, the OPNET simulation tool is used to simulate the proposed LEUC algorithm. The test results show that compared with the Leech EEUC algorithm, the proposed algorithm can effectively equalize the energy consumption of the network nodes and prolong the network lifetime.
【学位授予单位】：沈阳理工大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TP212.9;TN929.5

【相似文献】