2009 | OriginalPaper | Chapter
Connected k-Coverage in Two-Dimensional Deployment Fields
Author : Habib M. Ammari
Published in: Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This chapter focuses on the problem of connected
k
-coverage in densely deployed wireless sensor networks. Precisely, it investigates how to achieve
k
-coverage of a two-dimensional deployment field with a minimum number of sensors while maintaining network connectivity. It considers static and homogeneous sensors under the assumption of a deterministic sensing model. Also, it proposes centralized, pseudo-distributed, and fully distributed sensor scheduling protocols, where the sensors are duty-cycled to save energy while ensuring connected
k
-coverage.