Energy-efficient target coverage in wireless sensor networks

By Mihaela Cardei, My T. Thai, Yingshu Li, Weili Wu. Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005

1,091 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/76641805ed5f1a4c15493e41eb75d5d576603f3c

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

Citations in the corpus

Cooperative sensor deployment for multi‐target monitoring (2008, methodology): “Since the general ESCP is NP-complete [21], a large volume of existing work focuses on sub-optimal, polynomial-time solutions to the DSCP for various application scenarios [14, 17, 19, 20], for which a comprehensive survey can be found in [13, 16].”
On coverage issues in directional sensor networks: A survey (2011, background): “In some studies, researchers name the target coverage approach as point coverage [3].”
A survey on coverage and connectivity issues in wireless sensor networks (2012, methodology): “Definition of target coverage problem (Cardei et al., 2005a): Given m targets with known location and an energy-constrained WSN with n sensors randomly deployed in the closed proximity of the targets, schedule the sensor nodes activity such that all the targets are continuously observed and network…”
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks (2017, background): “Further debates on the subjects of sensing range and transmission range can be found in [20] and [93]–[96].”
An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks (2013, background): “most sensor network applications deal with a large number of sensors, many studies for efficient placement under various situations and environments have been conducted [3], [6], [8], [10], [15], [18], [22], [24], [35], [37], [38], [41], [46], [47], [49], [50], [54]–[57].”
On the lifetime of wireless sensor networks (2009, background): “… the time the area of interest is covered by at least k nodes [Mo et al. 2005]; (6) 100% coverage (a) the time each target is covered by at least one node [Cardei et al. 2005; Liu et al. 2005b]; (b) the time the whole area is covered by at least one node [Bhardwaj et al. 2001; Bhardwaj and…”
Coverage by directional sensors in randomly deployed wireless sensor networks (2006, methodology): “In this paper, rather than giving an LP-relaxation algorithm to this problem (similar to the approach in Cardei et al. (2005); Cheng et al. (2005)), we present here a greedy heuristic based polynomial-time algorithm for solving the MCMS problem approximately.”
Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks (2014, methodology): “Greedy-MSC was proposed to solve simple Fig.”