The Coverage Problem in a Wireless Sensor Network

By Chi-Fu Huang, Yu-Chee Tseng. ACM International Conference on Wireless Sensor Networks and Applications, 2003

1,483 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Media Technology

View Paper: https://www.semanticscholar.org/paper/bf7a99640c12fe530423b998b7060fb0930ebcf8

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

In Electrical and Electronic Engineering

In Media Technology

Citations in the corpus

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].”
Robots for Environmental Monitoring: Significant Advancements and Applications (2012, background): “communication aspects [35], deployments [36], [37], data gathering and processing [38], and energy efficiency [39].”
Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks (2014, methodology): “In such a deployment, the most common way of extending the network lifetime is by scheduling the sensor nodes such that only a subset of sensor nodes that is enough to satisfy coverage requirement need to be active at a time [3].”
A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, background): “Huang and Tseng [40] propose a series of algorithms to verify whether every point in the field is covered by at least the required number of sensor nodes.”
Barrier coverage with wireless sensors (2005, background): “This should be contrasted with the fact that for full k-coverage, it is possible to locally come up with a no answer to the question of whether the given region is fully k-covered [9].”
A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms, and Open Problems (2016, neutral): “Several coverage models [70]–[72] have been”
A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks (2006, background): “A sensor is k-perimeter-covered if all points on the perimeter of the sensor are covered by at least k sensors other than itself [20].”
Coverage and connectivity issues in wireless sensor networks: A survey (2008, background): “Based on the above definitions of k-DPC and k-MPC, it is proved in [31] that a sensor network is: (1) k-covered and 1-connected if and only if each sensor is k-MPC, and (2) k-covered and k-connected if each sensor is k-DPC.”
On k-coverage in a mostly sleeping sensor network (2004, background): “• Increasing the Probability of Coverage: After the network has been deployed, the k-coverage algorithms [13, 20] can be run on the motes to improve the probability of coverage.”
The holes problem in wireless sensor networks: a survey (2005, methodology): “[6] proposed polynomial-time algorithms to verify whether every point in the target area is covered by at least the required number of nodes.”
Strategies and techniques for node placement in wireless sensor networks: A survey (2008, background): “Some of the published papers, especially early ones, use the ratio of the covered area to the size of the overall deployment region as a metric for the quality of coverage [30].”
On coverage issues in directional sensor networks: A survey (2011, background): “Some of the published papers, especially early ones, use the ratio of the covered area to the overall deployment region as a metric for the quality of the coverage [69].”