Research On Coverage Algorithms In Wireless Sensor Networks

Wireless Sensor Networks (WSNs), whose development is based on the progress of computing, communication and sensing, is a hot research area in recent years. As one of the fundamental issues in WSNs, coverage is one of the key points which affect the network performance and the quality of service (QoS). Coverage aims to solve the problem that an area is able to be monitored by the sensors deployed in the area.In this thesis, we propose a coverage algorithm called CNS with node sequences (nodes in the node sequences are ordered by increasing distance at each position point) to judge whether a region is covered and solve the coverage hole problem. First, we discuss the method of judging whether a network is 1-covered by using the CNS algorithm. Second, by adjusting the sensing radius of the sensor nodes, uncovered regions will be 1-covered by the nodes which are nearest to them. At last, we extend the CNS algorithm to solve the k-coverage problem. The simulation results show that the proposed CNS algorithm has better performance than existing coverage algorithms.Node scheduling is a commonly used way for large-scale WSNs to extend the lifetime. We propose an energy-efficient connective coverage protocol (ECCP) for coverage and connectivity configuration in WSNs. The proposed protocol adopts the RDA algorithm for detecting redundant sensor nodes and then scheduling the duties of sensor nodes accordingly. The RDA algorithm which is based on the CNS algorithm is proposed to detect redundancy of sensor nodes. The proposed protocol can maintain 1-coverage and 1-connectivity of WSNs. The simulation results show that the ECCP protocol is energy efficient, and achieves the desired purposes.Finally, it is the summarization of the thesis and research expectation of coverage algorithms in wireless sensor networks.