无线传感器网络中连通与覆盖控制算法研究

【作者】 常光强；

【导师】 樊晓平；

【作者基本信息】 中南大学 ， 控制科学与工程， 2011， 硕士

【摘要】 连通与覆盖控制是无线传感器网络的两个最基本的问题。连通是指网络中任意两个节点可以进行通信,这是节点自组织形成网络的前提。覆盖是指利用网络中的传感器节点对整个目标区域进行监测,从而达到信息采集的目的。本文首先对无线传感器网络的基本理论及国内外的研究进行了简要介绍。由于无线传感器网络中存在着大量冗余节点,且传感器节点能量有限,为了减少整个网络的能耗,本文提出了一种最小连通覆盖集求解算法,算法降低了网络覆盖冗余,减少了网络检测过程中的能量消耗,在不满足通信半径大于2倍感知半径的情况下,进一步提出了两种求解最小连通集的算法,虚拟半径调整的连通算法和基于最小生成树的连通算法。保证了通信半径和感知半径在任何比例下网络覆盖集的连通性。仿真实验表明,通过本文算法求解的连通覆盖集的节点数目相对较少了,并保证了整个工作节点网络的连通性。目前,大部分的无线传感器网络连通与覆盖算法都是依赖节点位置信息对节点进行冗余判断,忽略了节点的定位也需要浪费很多能耗的问题。为此,本文提出了一种无位置无关的覆盖控制算法,分析讨论了节点时钟异步对网络覆盖强度的影响,并通过在生成树中广播时间同步算法保证了工作节点网络的时间同步,减少了时间异步对网络覆盖强度的影响。通过实验仿真比较表明,该算法不依赖节点的位置信息,可以减少网络中工作节点,并保持网络的连通性。更多还原

【Abstract】 Two of the most fundamental problems in Wireless Sensor Network (WSN) are connectivity and coverage. Connectivity indicates that every node can communicate with any other nodes in WSN, which is the precondition to create a self-organization network. Coverage means that overall area should be sensed by all nodes so that the observer can obtain the whole information.In the thesis, the basic principle and the research status worldwide of wireless sensor network are introduced briefly. Since there are many redundant nodes in WSN, and the sensor node energy is limited, in order to reduce the energy consumption of the entire network, this thesis proposes a minimum connected cover set algorithm, which reduces the coverage redundancy, reduce network energy consumption in the testing process. When the communication radius is less than the two times of the perception radius, it further proposes two algorithms to solve the minimum connected set, i.e., the connected algorithm to adjust the virtual radius and the connected algorithm based on minimum spanning tree. So the communication radius and perception radius of coverage in any proportion connectedness of the set can be ensured. Simulation results show that this algorithm needs a small number of nodes to the connected cover set, and ensures the work of the node network connectivity.Currently, most algorithms are dependent on node location information to determine redundant nodes, ignoring the positioning of the nodes need to waste a lot of energy problems. To this end, we propose a non-position independent coverage control algorithm, and analyze and discuss the affection of the node clock asynchronous on the strength of network coverage. By the broadcasting algorithm in the spanning tree, the time synchronization of working node network can be ensured, and the affection of the time asynchronization on network coverage intensity be reduced. Simulation results show that the algorithm is independent of node location information and can reduce the work of the network nodes and maintain the network connectivity.更多还原