2009 | OriginalPaper | Buchkapitel
Connected k-Coverage in Two-Dimensional Deployment Fields
verfasst von : Habib M. Ammari
Erschienen in: Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.