Node Placement for Connected Coverage in Sensor Networks

By K. Kar, Suman Banerjee. 2003

344 citations recorded by the source corpus.

How researchers see this paper

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

Near-optimal sensor placements: maximizing information while minimizing communication cost (2006, background): “Existing work on sensor placement under communication constraints [11, 13, 6] has considered the problem mainly from a geometric perspective: Sensors have a fixed sensing region, such as a disc with a certain radius, and can only communicate with other sensors which are at most a specified distance ”
Energy-efficient target coverage in wireless sensor networks (2005, background): “The sensor scheduling mechanism can be accomplished as follows: 1) sensors send their location information to the BS 2) BS executes the sensor scheduling algorithm and broadcasts the schedule when each node is active 3) every sensor schedules itself for active/sleep intervals.”
Strategies and techniques for node placement in wireless sensor networks: A survey (2008, background): “Kar and Banerjee have considered sensor placement for complete coverage and connectivity [35].”
Coverage in Wireless Sensor Networks (2004, background): “The goal is to have each location in the physical space of interest within the sensing range of at least one sensor.”
Coverage problems in sensor networks: A survey (2011, background): “Some researchers [Kar and Banerjee 2003; Lyengar et al. 2005; Wang et al. 2005c; Bai et al. 2006; Han et al. 2008] have proposed and analyzed a kind of strip-based node placement pattern to address v the network connectivity for Rc < 3Rs.”