By Topic

Critical Conditions for Connected-k-Coverage in Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guanqun Yang ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA ; Qiao, D.

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.

Published in:

Communications Letters, IEEE  (Volume:12 ,  Issue: 9 )