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
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
RE2-CD: Robust and Energy Efficient Cut Detection in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
| 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. Our main result is that, by monitoring the status of just O(1/ϵ) nodes in the network, the base station can detect whenever an ϵ-cut occurs. Furthermore, this detection comes with a deterministic guarantee that every reported cut has size at least ϵn/2. 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 random sampling.