Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Distributed obstacle localization in large wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Tracking objects with networked scattered directional sensors
EURASIP Journal on Advances in Signal Processing
Efficient computation of continuous skeletons
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Apply geometric duality to energy-efficient non-local phenomenon awareness using sensor networks
IEEE Wireless Communications
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Distributed active sensing is a new sensing paradigm, where active sensors (aka actuators) as illuminating sources and passive sensors as receivers are distributed in a field, and collaboratively detect events of interest. In this paper, we study the fundamental properties of distributed actuator and sensor networks (DASNs) in detecting and localizing obstacles. A novel notion of “exposure” is defined, which quantifies the dimension limitations in detectability. Using simple geometric constructs, we propose polynomial-time algorithms to compute the exposure and bounding regions where the center of the obstacles may lie.