On k-coverage in a mostly sleeping sensor network

By Santosh Kumar, Ten-Hwang Lai, Jozsef Balogh. ACM/IEEE International Conference on Mobile Computing and Networking, 2004

590 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/1cfb9b7bfa6cf31721bf5ffdf0c137b53cd8341c

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. Yang Xiao
2. Yi Liang
3. Xiaofang Li
4. Yanchao Zhang
5. Wenjing Lou
6. Yuguang Fang
7. Ravi Prakash
8. Roberto Baldoni

Citations in the corpus

• Coverage problems in sensor networks: A survey (2011, methodology): “One is to exploit the property of the sensing disk model [Hall 1988; Zhang and Hou 2004, 2005b]; The other is based on a grid approach [Kumar et al. 2004, 2008].”
• A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, methodology): “adopted a simple state scheduling algorithm, Randomized Independent Scheduling (RIS) in [14].”
• Topology control for wireless sensor networks (2003, unknown): “[19] Kumar S, Lai TH, Balogh J.”
• A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol (2010, background): “The active periods of nodes could be scheduled such that within any duration of time T for each pair of neighboring nodes, their active periods overlap long enough to enable at least one message to be sent by one node to another.”
• A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks (2006, methodology): “Some papers also use the two-dimensional Poisson distribution [22].”
• Location-based compromise-tolerant security mechanisms for wireless sensor networks (2006, methodology): “We refer interested readers to [30] about how to strike a good balance between these two competing metrics.”
• Energy Harvesting Sensor Nodes: Survey and Implications (2011, methodology): “Traditional techniques rely on redundant and dense placement of nodes [18], [19], with nodes coordinating and operating in subsets to address coverage and lifetime requirements.”