Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

By Krishnendu Chakrabarty, S. Iyengar, Hairong Qi, E. Cho. IEEE Trans. Computers, 2002

988 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/029f28073ac385973c59331fc417e4178836182e

How researchers see this paper

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

In Aerospace Engineering

In Computer Networks and Communications

Citations in the corpus

Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks (2004, methodology): “We begin with a short introduction to some of the prior work in the area of wireless sensor networks before proceeding to discuss the event region detection problem and our solution in greater detail.”
Sensor placement for grid coverage under imprecise detections (2002, methodology): “Sensor placement on two- and three-dimensional grids was formulated as a combinatorial optimization problem, and solved using integer linear programming [6, 7].”
Coverage problems in sensor networks: A survey (2011, background): “A generalization of the previous ILP problem is to minimize the network cost, if different sensor nodes have different costs and coverage capabilities [Chakrabarty et al. 2002; Patel et al. 2005; Wang and Zhong 2006; Xu and Sahni 2007; Altinel et al. 2008].”
Information fusion for wireless sensor networks: Methods, models, and classifications (2007, background): “Spatial coverage in WSNs [Meguerdichian et al. 2001b] has been explored in different scenarios, such as target tracking [Chakrabarty et al. 2002], node scheduling [Tian and Georganas 2002], and sensor placement [Dhillon et al.”
Integrated coverage and connectivity configuration in wireless sensor networks (2003, methodology): “Both [2] and [12] apply linear programming techniques to select the minimal set of active nodes for maintaining coverage.”
Algorithms and Protocols for Wireless Sensor Networks (2008, methodology): “Coverage (spatial) comprises the problem of determining the area covered by the sensors in the network [13, 14, 56, 57].”
Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “In [18], the authors investigate linear programming techniques to optimally place a set of sensors on a sensor field (three dimensional grid) for a complete coverage of the field.”
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].”
Sensor placement for effective coverage and surveillance in distributed sensor networks (2003, positive): “Sensor placement on two- and three-dimensional grids has been formulated as a combinatorial optimization problem, and solved using integer linear programming [2, 3].”
Sensor deployment and target localization in distributed sensor networks (2004, methodology): “Sensor placement on two- and three-dimensional grids has been formulated as a combinatorial optimization problem, and solved using integer linear programming in [Chakrabarty et al. 2002; 2001].”
Sensor deployment and target localization based on virtual forces (2003, methodology): “Sensor placement on two- and three-dimensional grids has been formulated as a combinatorial optimization problem, and solved using integer linear programming in [3], [4].”