Connected K-coverage problem in sensor networks

By Zongheng Zhou, Samir R Das, Himanshu Gupta. Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969), 2004

345 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Mechanical Engineering

View Paper: https://www.semanticscholar.org/paper/025591b804fcd1c9a25b78e5498480d278606420

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Sajal K. Das
2. Amitava Ghosh
3. Samir R Das
4. Quinyi Gu
5. Himanshu Gupta
6. Bang Wang
7. Mahesh K. Marina
8. Christian Bettstetter

In Mechanical Engineering

1. Amitava Ghosh
2. Sajal K. Das

Citations in the corpus

• Coverage and connectivity issues in wireless sensor networks: A survey (2008, background): “However, this has been extended in some recent works [25,71] to the k-connected-coverage problem, where the goal is again to choose a minimum subset of sensors such that each point in the region is covered by at least k sensors and the network is connected.”
• Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “The k-coverage problem, wherein each point in the query region is required to be covered by at least k sensors, has been recently addressed in [19, 20].”