Unreliable sensor grids: coverage, connectivity and diameter

By Sanjay Shakkottai, Rayadurgam Srikant, Ness B. Shroff. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003

685 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/76483adf7b4461864129de9ef00be59821a7f77c

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

Citations in the corpus

Coverage and connectivity issues in wireless sensor networks: A survey (2008, background): “In [56], the authors considered an unreliable sensor grid with n nodes placed over a unit area.”
Mobility improves coverage of sensor networks (2005, background): “Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.”
A survey of key management schemes in wireless sensor networks (2007, background): “Shakkottai et al. [ 23 ] determined the connectivity of a wireless network with unreliable nodes that can be used for random distribution.”
Handbook of Sensor Networks: Algorithms and Architectures (2005, background): “Calamari [68] Localization solutions for sensor networks CotsBots [69] Inexpensive and modular mobile robots built using offthe-shelf components to investigate distributed sensing and cooperation algorithms in large (.”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, neutral): “Hopefully, a fitting procedure in which only the order parameters and the chemical shielding parameters are varied leads to a correspondence between calculated and experimental spectra close enough to recognize a sufficient number of common features.”
On k-coverage in a mostly sleeping sensor network (2004, methodology): “The work closest to ours is [18], where necessary and sufficient conditions for 1-coverage and 1-connectivity are derived when n sensors are deployed in a √ n × √n grid and each sensor is allowed to fail independently with probability (1−p).”
Connected K-coverage problem in sensor networks (2004, background): “The communication subgraph induced by a set of sensors M is the subgraph of CG involving only the vertices/sensors in M .”
A minimum cost heterogeneous sensor network with a lifetime constraint (2005, methodology): “We also take into account the conditions for connectivity and coverage of the area by extending the results in [13].”
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks (2004, background): “More generally, assuming that a node is active with probability p, the necessary condition for connectivity and coverage is R(2)t c log n0 p n0 , where c 1⁄4 1 2 , and 0:5 [33].”
Node Placement for Connected Coverage in Sensor Networks (2003, background): “The problem of providing coverage to a given region, or a given set of points, and its variants, has received prior attention in the research community [1], [2], [3], [4].”