Coverage algorithm with node sequences in wireless sensor networks

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.