Redundancy and coverage detection in sensor networks Article

Cǎrbunar, B, Grama, A, Vitek, J et al. (2006). Redundancy and coverage detection in sensor networks . ACM TRANSACTIONS ON SENSOR NETWORKS, 2(1), 94-128. 10.1145/1138127.1138131

cited authors

  • Cǎrbunar, B; Grama, A; Vitek, J; Cǎrbunar, O

authors

abstract

  • We study the problem of detecting and eliminating redundancy in a sensor network with a view to improving energy efficiency, while preserving the network's coverage. We also examine the impact of redundancy elimination on the related problem of coverage-boundary detection. We reduce both problems to the computation of Voronoi diagrams, 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 traffic generated by our algorithms. Using detailed simulations, we also quantify the impact of system parameters such as sensor density, transmission range, and failure rates on network traffic. © 2006 ACM.

publication date

  • June 28, 2006

published in

Digital Object Identifier (DOI)

start page

  • 94

end page

  • 128

volume

  • 2

issue

  • 1