Failure filtrations for fenced sensor networks

International Journal of Robotics Research

Volumn 31, Issue 9, 2012, Pages 1044-1056

  Munch, Elizabeth ^a   Shapiro, Michael ^b   Harer, John ^a  

^a DUKE UNIVERSITY   (United States)

^b TUFTS UNIVERSITY   (United States)

Author keywords

Computational topology; Coverage; Persistent homology; Sensor networks

Indexed keywords

COMPUTATIONAL TOPOLOGY; COVERAGE; DETERMINISTIC ALGORITHMS; DYNAMIC ALGORITHM; EARLY WARNING; FAST ALGORITHMS; NETWORK COVERAGE; PERSISTENT HOMOLOGY; SPECIFIC PROBLEMS; TWO-DIMENSIONAL DOMAIN;

PROBABILITY DISTRIBUTIONS; SENSOR NETWORKS; TOPOLOGY;

ALGORITHMS;

EID: 84864674640     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364912451671     Document Type: Article

References (18)

1. Agarwal PK, Edelsbrunner H, Harer J, Wang Y. Extreme elevation on a 2-manifold. Discrete and Computational Geometry. 2006 ; 36: 553-572 (Pubitemid 44631970)
2. Ban Y-EA, Edelsbrunner H, Rudolph J. Interface surfaces for protein-protein complexes. Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB '04) ; 2004 ; 2004. 205.
3. Carlsson G. Topology and data. Bulletin of the American Mathematical Society. 2009 ; 46: 255-308
4. Carlsson G, Ishkhanov T, de Silva V, Zomorodian A. On the local behavior of spaces of natural images. International Journal of Computer Vision. 2008 ; 76: 1-12 (Pubitemid 350234084)
5. Chambers EW, Silva V, Erickson J, Ghrist R. Vietoris-Rips complexes of planar point sets. Discrete and Computational Geometry. 2009 ; 44: 75-90
6. Chazal F, Guibas LJ, Oudot SY, Skraba P. Analysis of scalar fields over point cloud data. Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms ; 2009 ; 2009. 1021.
7. Cohen-Steiner D, Edelsbrunner H, Morozov D. Vines and vineyards by updating persistence in linear time. Proceedings of the Twenty-second Annual Symposium on Computational Geometry ; 2006 ; 2006. 119.
8. Colbourn CJ The Combinatorics of Network Reliability. Oxford: Oxford University Press ; 1987 :
9. de Silva V, Ghrist R. Coordinate-free coverage in sensor networks with controlled boundaries via homology. The International Journal of Robotics Research. 2006 ; 25: 1205-1222 (Pubitemid 44745892)
10. de Silva V, Ghrist R. Coverage in sensor networks via persistent homology. Algebraic and Geometric Topology. 2007 ; 7: 339-358
11. Edelsbrunner H, Harer J Modelling the Physiological Human Lecture Notes in Computer Science. Magnenat-Thalmann N, ed. Berlin: Springer ; 2009: 36-50.
12. Edelsbrunner H, Harer J Computational Topology: An Introduction. Providence, RI: American Mathematical Society ; 2010 :
13. Garey MR, Johnson DS Computers and Intractibility: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Co ; 1979 :
14. Ghrist R, Muhammad A. Coverage and hole-detection in sensor networks via homology. Fourth International Symposium on Information Processing in Sensor Networks ; 2005 ; 2005. 254.
15. Headd JJ, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. Protein-protein interfaces: Properties, preferences, and projections. Journal of Protein Research. 2007 ; 6: 2576-2586 (Pubitemid 47122352)
16. Tahbaz-Salehi A, Jadbabaie A. Distributed coverage verification in sensor networks without location information. IEEE Transactions on Automatic Control. 2010 ; 55: 1837-1849
17. Valiant LG. The complexity of computing the permanent. Theoretical Computer Science. 1979 ; 8: 189-201
18. Yick J, Mukherjee B, Ghosal D. Wireless sensor network survey. Computer Networks. 2008 ; 52: 2292-2330