Journal
IEEE COMMUNICATIONS LETTERS
Volume 12, Issue 9, Pages 651-653Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2008.080729
Keywords
sensor networks; connected-k-coverage; critical conditions; percolation theorem
Categories
Funding
- Information Infrastructure Institute (iCube) of Iowa State University
- NSF [CNS 0716744]
Ask authors/readers for more resources
Connected-k-coverage has been recognized as an effective notion for prolonging the sensor network lifetime. It requires the monitored region to be k-covered by a connected component of active sensors, which is less demanding than requiring k-coverage and connectivity among all active sensors simultaneously. While critical conditions for k-coverage and connectivity have been studied separately before, there is a lack of fundamental understanding about connected-k-coverage. In this paper, as one of the first efforts in understanding the fundamental basics about connected-k-coverage, we analyze the critical conditions for connected-k-coverage using the percolation theorem and demonstrate their effectiveness using simulation results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available