Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ammari, H.M. (2009). Connected k-Coverage in Two-Dimensional Deployment Fields. In: Challenges and Opportunities of Connected k-Covered Wireless Sensor Networks. Studies in Computational Intelligence, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01878-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01878-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01876-3
Online ISBN: 978-3-642-01878-7
eBook Packages: EngineeringEngineering (R0)