html5-img
1 / 70

Persistent Homology and Sensor Networks

Persistent Homology and Sensor Networks. Persistent homology motivated by an application to sensor nets. Outline. A word about sensor nets Basic coverage criterion Better coverage criterion using persistence Introduce Persistent Homology Correspondence Theorem Computing the groups!

baker-york
Télécharger la présentation

Persistent Homology and Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Persistent Homology and Sensor Networks Persistent homology motivated by an application to sensor nets

  2. Outline • A word about sensor nets • Basic coverage criterion • Better coverage criterion using persistence • Introduce Persistent Homology • Correspondence Theorem • Computing the groups! • Other Applications

  3. A Word About Sensor Nets

  4. August 29, 2005 Hurricane Katrina hits New Orleans

  5. Power and Communications Knocked Out

  6. Broken Levees

  7. City Flooded

  8. Inaccessible from the ground

  9. Law Enforcement

  10. Rescue Workers

  11. Replace live turkey with a parachute

  12. Result: Useful sensor network • Measure conditions on the ground at many locations • Relay messages to and from rescue workers • Instant infrastructure • Low power/auto-power • Cheap!?

  13. Other uses of sensor networks • Environmental monitoring • Security systems • Battlefield monitoring and communications • Large mechanical systems • Find Sarah Connor

  14. Hole in sensor coverage area Sarah Connor escapes!

  15. Identifying holes in the network • De Silva and Ghrist have developed a method for identifying gaps in sensor coverage • Method is based on Algebraic Topology • Computing and examining Simplical Homology groups • Theoretical underpinings allow you to do so much more

  16. Basic Coverage Criterion Part 1.2

  17. The problem to be solved: rb rc Each node has sensors that can cover a circular region of radius rc Each node can detect other nodes Within its broadcast radius rb rc ≥ rb/√(3)

  18. The problem to be solved: Each node has sensors that can cover a circular region of radius rc Each node can detect other nodes Within its broadcast radius rb rc ≥ rb/√(3) Nodes lie in compact connected planar domain with piecewise linear boundary. Fence nodes at the vertices All fence nodes know their neighbors’ identities and are no more than rb apart

  19. What we don’t have: • Nodes don’t know their absolute or relative positions • All we get is the connectivity graph

  20. 3-simplex It would be nice to have the Cech Complex Def: For a collection of sets U={Ua}, the Cech ComplexC(U) is the simplical complex where each non-empty intersection of (k+1) of the Ua correspond to a k-simplex.

  21. We have just enough to build the Rips Complex • Let X be a collection of points in a metric space • Rips complexRe(X) contains a simplex for every collection of points that are pairwise within distance e • Even though our domain is planar, a dense graph can lead to simplices with arbitrary dimension • In our case, we are building Rrb(X) • Every complete k-subgraph of the communication graph becomes a simplex in the Rips Complex • Also, it’s the maximal simplicial complex that has the connectivity graph as its 1-skeleton

  22. Picture of a Rips Complex

  23. Recap: X= { set of nodes } rc = sensor radius rb = broadcast radius D = domain to be covered ∂D = boundary of D Xf= { fence nodes that lie on dD } U= Region covered by the sensors R= Rips complex of the communication graph F= Fence subcomplex  R

  24. Theorem (De Silva & Ghrist): For a set of nodes X in a planar domain D satisfying the assumptions (rc, rb, fence nodes etc), the sensor cover Uc contains D if there exists [a]  H2(R,F) such that ∂a ≠ 0

  25. What about a generator of H2(R,F)? A generator will look like some linear combination of 2-simplices i.e. Some triangulation of the domain D

  26. Theorem (De Silva & Ghrist): For a set of nodes X in a planar domain D satisfying the assumptions (rc, rb, fence nodes etc), the sensor cover Uc contains D if there exists [a]  H2(R,F) such that ∂a ≠ 0 But why require ∂a ≠ 0 ?? Why not “if and only if” ??

  27. Pitfalls of the Rips complex Bound was rc ≥ rb/√(3) 1/√ (3) ≈ 0.57 rb rb Therefore it’s possible to have a rectangle that is completely covered, but not triangulated in the communication graph So the conditions of the theorem are sufficient, but not necessary, to guarantee coverage.

  28. Pitfalls of the Rips complex It’s possible to have an arrangement of nodes whose Rips complex is the surface of an octahedron. This has non-zero H2, but its boundary is zero!

  29. Better coverage criterion using persistence Part 1.3

  30. Eliminating the fence subcomplex • The assumption of the nice fence sub-complex is unrealistic • Can we replace it with some other assumptions?

  31. The new situation: rw rs rc Each node has sensors that can cover a circular region of radius rc Each node can detect its neighbors via a strong signal (rs) or a weak signal (rw). rc ≥ rs/√(2) rw ≥ rs √(10) Remember: strong <---> “short” weak <---> “wlong”

  32. The new situation (cont…): rc ≥ rs/√(2) rw ≥ rs √(10) Nodes lie in a compact connected domain D in Rd Nodes can detect the presence of ∂D within distance rf The restricted domainD-C is connected, where C = {x D  ||x-∂D|| ≤ rf + rs/√(2) • The fence-detection hypersurface • = {x D  ||x-∂D|| = rf} Has internal injectivity radius ≥ rs/√(2) external injectivity radius ≥ rs

  33. The new situation (cont…): Domain D The fence “collar”, C The boundary ∂D rf restricted domain D-C S

  34. New complexes • We get two communication graphs now, corresponding to rs and rw • One gives us the “strong” Rips Complex, Rs • The other gives the “weak” Rips complex Rw • Note that RsRw

  35. (more) New complexes • We also get a subcomplex based on the nodes that lie within rf of ∂D • Build this as a subcomplex of Rs • Call it the (strong) fence subcomplexFs rf

  36. What we’d like to see Conjecture: For a set of nodes X in a domain DRd satisfying the new assumptions (rc, rs, rw, rf, fence subcomplex etc), the sensor cover U contains D-C if there exists [a]  Hd(Rs,Fs) such that ∂a ≠ 0

  37. Why it fails • It’s possible to get “phantom” d-cycles in the relative homology that have non-zero boundary By comparing to the “weak” Rips complex, we can see which of these cycles are phantom and which are legitimate rf

  38. Theorem (De Silva & Ghrist): For a set of nodes X in a domain D in Rd satisfying the new assumptions (rc, rs, rw, rf, fence subcomplex etc), the sensor cover U contains D-C if the homomorphism i*: Hd(Rs,Fs) ----> Hd(Rw,Fw) induced by the inclusion i: (Rs,Fs) ----> (Rw,Fw) is nonzero.

  39. The “Squeezing” Theorem For a set of points X in a domain DRd Re(X)Ce(X) Re(X) whenever e/e ≥ √(2d/(d+1)) • Note that for d=2 this means e ≥ 1.15 e • This means that if you can enlarge (or shrink) the radius of your Rips complex a little, and the complex doesn’t change, then you actually have a Cech complex

  40. Persistence Part 2

  41. ∂ ∂ ∂ ∂ ∂ ∂ Ck(X) Ck-1(X) C1(X) C0(X) 0 The Usual Homology • Have a single topological space, X, and a PID, R • Get a chain complex • For k=0, 1, 2, … compute Hk(X) • Hk=Zk/Bk

More Related