Detecting cuts in sensor networks

2005 4th International Symposium on Information Processing in Sensor Networks, IPSN 2005

Volumn 2005, Issue , 2005, Pages 210-217

  Shrivastava, Nisheeth ^a   Suri, Subhash ^a   Tóth, Csaba D ^b  

^a University of California   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; MATHEMATICAL MODELS; SENSORS; TWO DIMENSIONAL;

BASE STATIONS; DETECTING CUTS; SENSOR NETWORKS; SENTINEL ALGORITHM;

TELECOMMUNICATION NETWORKS;

EID: 33744908031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPSN.2005.1440927     Document Type: Conference Paper

References (32)

1. P. K. Agarwal, M. de Berg, J. Matousek, and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput. 21, 654-667, 1998.
2. N. Alon and E. Gÿori. The number of small semispaces of a finite set of points in the plane. J. Combin. Theory Ser. A 41, 154-157, 1986.
3. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.
4. H. Brönnimann, B. Chazelle, and J. Matoušek. Product range spaces, sensitive sampling, and derandomization. SLAM J. Comput. 28, 1552-1575, 1999.
5. A. Cerpa and D. Estrin. ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies. IEEE Transactions on Mobile Computing, 3, 2004.
6. C-Y. Chong and S. P. Kumar. Sensor Networks: Evolution, opportunities and challenges. Proc. of the IEEE, 91, 1247-1256, 2003.
7. D. Culler, D. Estrin and M. Srivastava. Overview of Sensor Networks. IEEE Computer, 41-49, 2004.
8. T. K. Dey. Improved bounds for planar k-sets and related problems. Discrete & Computational Geometry, 373-382, 1998.
9. P. Erdos, L. Lovász, A.Simmons, and E. G. Straus. Dissection graphs of planar point sets. In A Survey of Combinatorial Theory, 139-149, 1973.
10. H. Edelsbrunner and E. Welzl. Constructing Belts in two-dimensional arrangements with applications. SIAM J. Computing 15, 271-284, 1986.
11. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. Proc. of 5th Annual Mobicom, ACM, 1999.
12. D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin and J. Heidemann. An evaluation of multi-resolution storage for sensor networks. Proc. SenSys, 2003.
13. J. Gehrke and S. Madden. Query processing in sensor networks. Pervasive Computing, 2004.
14. S. Har-Peled. Taking a walk in a planar arrangement. SIAM J. Computing 30, 1341-1367, 2000.
15. J. Hellerstein, W. Hong, S. Madden, and K. Stanek. Beyond Average: Toward Sophisticated Sensing with Queries. Proc. IPSN, 2003.
16. B. Hohlt, L. Doherty and E. Brewer. Flexible power scheduling for sensor networks. Proc. IPSN, 205-214, 2004.
17. J. Kleinberg. Detecting network failure. Internet Mathematics 1, 37-56, 2003.
18. J. Kleinberg, M. Sandler, and A. Slivkins. Network failure detection and graph connectivity. Proc. 15th Sympos. on Discrete Algorithms, ACM Press, 76-85, 2004.
19. J. Lifton, M. Broxton and J. Paradiso. An Implementation of Distributed Unconnected Graph Determination in Sensor Networks. Project paper for MIT 6.978 course.
20. J. Liu, P. Cheung, F. Zhao and L. Guibas. A dual-space approach to tracking and sensor management in wireless sensor networks. Proc. of International Workshop on Wireless Sensor Networks and Applications, 2002
21. J. Matoušek. Construction of ε-nets. Proc. 5th Symp. Computational Geometry, ACM Press, 1-10, 1989.
22. J. Matoušek. ε-nets and computational geometry. New Trends in Discrete and Computational Geometry, Vol. 10, Algorithms and Combinatorics, 69-89, 1993.
23. S. Nath, P. Gibbons, Z. Anderson and S. Seshan. Synopsis Diffusion for Robust Aggregation in Sensor Networks. Proc. ACM SenSys, 2004.
24. J. Newsome and D. Song. GEM: Graph Embedding for Routing and Data Storage in Sensor Networks without Geographic information. Proc. ACM SenSys, 76-88, 2003.
25. G. J. Pottie and W. J. Kaiser. Wireless integreated network sensors. Communications of the ACM 43, 51-58, 2000.
26. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
27. N. Sadagopan and B. Krishnamachari. Maximizing data extraction in energy-lmited sensor networks. Proc. IEEE INFOCOM, 2004.
28. N. Shrivastava, C. Buragohain, D. Agrawal and S. Suri. Medians and Beyond: New Aggregation Techniques for Sensor Networks. Proc. ACM SenSys, 2004.
29. G. Tóth. Sets of points with many halving lines. Discrete and Computational Geometry 26, 187-194, 2001.
30. G. T. Toussaint. A simple linear algorithm for intersecting convex polygons. The visual computer 1, 118-123, 1985.
31. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16, 264-280, 1971.
32. F. Zhao, J. Liu, J. Liu, L. Guibas and J. Reich. Collaborative signal and information processing: An information directed approach. Proc. of the IEEE, 2003.