Computational geometry: an introduction
Computational geometry: an introduction
The number of small semispaces of a finite set of points in the plane
Journal of Combinatorial Theory Series A
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless integrated network sensors
Communications of the ACM
Product Range Spaces, Sensitive Sampling, and Derandomization
SIAM Journal on Computing
A dual-space approach to tracking and sensor management in wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Taking a Walk in a Planar Arrangement
SIAM Journal on Computing
Proceedings of the 1st international conference on Embedded networked sensor systems
An evaluation of multi-resolution storage for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Network failure detection and graph connectivity
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Flexible power scheduling for sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
IEEE Transactions on Mobile Computing
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Query Processing in Sensor Networks
IEEE Pervasive Computing
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Distributed cut detection in sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
MWM: a map-based world model for wireless sensor networks
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Catching elephants with mice: Sparse sampling for monitoring sensor networks
ACM Transactions on Sensor Networks (TOSN)
An algorithm for reconnecting wireless sensor network partitions
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Asynchronous failed sensor node detection method for sensor networks
International Journal of Network Management
Efficient predictive monitoring of wireless sensor networks
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. An ε-cut, for any 0 n nodes in S from a distinguished node, the base station. We show that the base station can detect whenever an ε-cut occurs by monitoring the status of just O(1/ε) nodes in the network. Our scheme is deterministic and it is free of false positives: no reported cut has size smaller than 1/2 εn. Besides this combinatorial result, we also propose efficient algorithms for finding the O(1/ε) nodes that should act as sentinels, and report on our simulation results, comparing the sentinel algorithm with two natural schemes based on sampling.