无线传感器网络中一种基于节点序列的覆盖算法

摘要

Coverage is a fundamental issue in wireless sensor networks (WSNs) where different applications require different coverage degrees. For the coverage problem, a coverage algorithm with node sequences (CNS) judging whether a region was covered and solving the coverage hole problem was proposed. Firstly, the method of judging whether a network was 1 -covered by using the CNS algorithm is discussed. Secondly, by adjusting the sensing radius of the sensor nodes which are nearest to the uncovered regions, the uncovered regions are 1-covered. At last, the CNS algorithm to solve the k-coverage problem is extended. The simulation results show that the proposed CNS algorithm has better performance than the existing coverage algorithms.%针对覆盖问题是无线传感器网络中的一个基本问题.不同的应用场景对网络的覆盖度有不同的要求,提出一种基于节点序列的覆盖算法(CNS)来判断网络的覆盖情况、消除覆盖漏洞.算法首先讨论如何判断网络1度覆盖情况,然后通过调整距离覆盖漏洞最近的传感器节点的感应半径来动态提高网络的1度覆盖率.同时,还对CNS算法进行扩展,用来解决多度覆盖问题.模拟结果表明:CNS算法在性能上要比现有覆盖算法优越.