Exposure in wireless Ad-Hoc sensor networks

By Seapahn Meguerdichian, Farinaz Koushanfar, Gang Qu, Miodrag Potkonjak. ACM/IEEE International Conference on Mobile Computing and Networking, 2001

713 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/6d6e4c92401f60682f00777238d4afeb729340bc

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

Coverage in Wireless Sensor Networks (2004, background): “Node Density -based Coverage [15] Barrier Coverage Find the critical node density, above which a penetrating path will be detected almost surely Minimum Exposure Path Algorithm [18] Barrier Coverage Find the path of minimum exposure Critical Node Density for Complete Coverage in the Exposure Model [”
Integrated coverage and connectivity configuration in wireless sensor networks (2003, methodology): “Several coverage models [10][11][12] have been proposed for different application scenarios.”
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.”
Connected K-coverage problem in sensor networks (2004, background): “Meguerdichian et al. ([5]) consider a slightly different deﬁnition of coverage and address the problem of ﬁnding maximal paths of lowest and highest observabilities in a sensor network.”
A study of the coverage of large-scale sensor networks (2004, methodology): “In this work, we adopt the following general sensing model, which has been widely used in the literature [7], [9], [11], [12], [13], and is reasonable for radio, acoustic and seismic signals.”
Range-free localization schemes for large scale sensor networks (2003, background): “Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches.”
Worst and best-case coverage in sensor networks (2005, background): “Some of the benefits of the newer, more capable sensor nodes are their abilities to form largescale networks, implement sophisticated protocols, reduce the amount of communication (wireless) required to perform tasks by distributed and local computations, and implement complex power saving modes of…”
Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, background): “Such a concept of exposure has been defined in [22] albeit in a different context.”
Wireless sensor networks: a survey (2002, background): “Post-deployment phase After deployment, topology changes are due to change in sensor nodes’ [39,50]”
Computing aggregates for monitoring wireless sensor networks (2003, background): “Recently, different protocols are proposed to discover node deaths [21], [22], compute the coverage and exposure bounds of wireless sensor networks [23], [24], provide remaining energy supply indication [15] or discover the topology of the network [25].”
Strong barrier coverage of wireless sensor networks (2008, background): “In [10], the notion of path exposure is introduced to measure the likelihood that an intruder is detected when moving along a given path.”
Sensor deployment strategy for target detection (2002, methodology): “Also, one can use higher order grids such as in [5] instead of the rectangular grid we use in this paper.”
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet (2002, background): “While coverage issues in celluar networks have been well studied, issues of connectivity and "critical mass" for mobile ad hoc networks are still open topics in both theory and systems [11, 23, 24].”
A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks (2005, background): “Wireless sensor nodes perform collaborative sensing [34] via wireless communication channels to retrieve information about targets that appear in the sensor field.”