In this paper we study the increase of coverage and connectivity in a sensor network with a view to improving coverage, while preserving the network’s coverage. We also examine the impact of on the related problem of coverage-boundary detection. We reduce both problems to the computation of Voronoi diagrams and intersectional point method prove and achieve lower bounds on the solution of these problems and present efficient distributed algorithms for computing and maintaining solutions in cases of sensor failures or insertion of new sensors. We prove the correctness and termination properties of our distributed algorithms, and analytically characterize the time complexity and the traffic generated by our algorithms. Our algorithms show that the increase coverage & Connectivity in wireless sensor density.
Patra, Rasmi Ranjan and Patra, Prashant Kumar
"Coverage and Connectivity Improvement Algorithms for the Wireless Sensor Networks,"
International Journal of Computer and Communication Technology: Vol. 2
, Article 4.
Available at: https://www.interscience.in/ijcct/vol2/iss4/4