Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1374618.1374668acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Using persistent homology to recover spatial information from encounter traces

Published: 26 May 2008 Publication History

Abstract

In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiments which collect encounter data. Most analyses of these data have focused on isolated statistical properties such as the distribution of node inter-encounter times and the degree distribution of the connectivity graph.
On the other hand, new developments in computational topology, in particular persistent homology, have made it possible to compute topological invariants from noisy data. These homological methods provide a natural way to draw conclusions about global structure based on collections of local information.
We use persistent homology techniques to show that in some cases encounter traces can be used to deduce information about the topology of the physical space the experiment was conducted in, and detect certain changes in the space. We also show that one can distinguish between simulated encounter traces generated on a bounded rectangular grid from traces generated on a grid with the opposite edges wrapped (a toroidal grid). Finally, we have found that nontrivial topological features also appear in real experimental encounter traces, and we speculate on types of node behavior that could produce these results. This demonstrates the ability of persistent homology to detect topological features in encounter data that could be diffcult to describe using traditional statistical and geometric methods.

References

[1]
A. Abrams. Configuration Spaces and Braid Groups of Graphs. PhD thesis, UC Berkeley, 2000.
[2]
M. Balazinska and P. Castro. Characterizing Mobility and Network Usage in a Corporate Wireless Local-Area Network. In 1st International Conference on Mobile Systems, Applications, and Services (MobiSys), San Francisco, CA, May 2003.
[3]
G. E. Bredon. Topology and Geometry. Springer, 1993.
[4]
H. Cai and D. Y. Eun. Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet. In MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pages 159--170, ACM.
[5]
E. Carlsson, G. Carlsson, and V. D. Silva. An algebraic topological method for feature identification. Int. J. Comput. Geometry Appl., 16(4):291--314, 2006.
[6]
G. Carlsson, T. Ishkhanov, V. de Silva, and A. Zomorodian. On the local behavior of spaces of natural image. International Journal of Computer Vision, 7:339--358, 2007.
[7]
L.-J. Chen, Y.-C. Chen, T. Sun, P. Sreedevi, K.-T. Chen, C.-H. Yu, and H.-H. Chu. Finding self-similarities in opportunistic people networks. In INFOCOM, pages 2286--2290, 2007.
[8]
V. de Silva. Plex: Simplicial complexes in matlab. http://comptop.stanford.edu/programs/.
[9]
V. de Silva. A weak characterization of the delaunay triangulation. http://pages.pomona.edu/ vds04747/public/papers/deSilva_WeakDelaunay.pdf.
[10]
V. de Silva and G. Carlsson. Topological estimation using witness complexes. In Sympos. Point-Based Graphics, pages 157--166, 2004.
[11]
V. de Silva and R. Ghrist. Coverage in sensor networks via persistent homology. Algebraic & Geometric Topology, 7:339--358, 2007.
[12]
N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, V10(4):255--268, May 2006.
[13]
H. Edelsbrunner and J. Harer. Twenty Years After, chapter Persistent Homology - A Survey. AMS, to appear.
[14]
H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 454, Washington, DC, USA, 2000. IEEE Computer Society.
[15]
C. D. et al. Haggle: A european union funded project in situated and autonomic communications. http://www.haggleproject.org.
[16]
A. Hatcher. Algebraic Topology. Cambridge University Press, 2002.
[17]
T. Henderson, D. Kotz, and I. Abyzov. The changing usage of a mature campus-wide wireless network. In MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networking, pages 187--201, New York, NY, USA, 2004. ACM.
[18]
W.-J. Hsu and A. Helmy. On nodal encounter patterns in wireless lan traces. In Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006), 2006.
[19]
P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot. Pocket switched networks and human mobility in conference environments. In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pages 244--251, New York, NY, USA, 2005. ACM Press.
[20]
T. Karagiannis, J.-Y. L. Boudec, and M. Vojnovic. Power law and exponential decay of inter contact times between mobile devices. In MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pages 183--194, New York, NY, USA, 2007. ACM.
[21]
M. Kim, D. Kotz, and S. Kim. Extracting a mobility model from real user traces. In IEEE INFOCOM06, Barcelona, Spain, 2006.
[22]
M. Mcnett and G. M. Voelker. Access and mobility of wireless pda users. SIGMOBILE Mob. Comput. Commun. Rev., 9(2):40--55, April 2005.
[23]
S. Milgram. The small world problem. Psychology Today, 2(1):60--67, 1967.
[24]
S. Shakkottai. Technical report on bluetooth mote encounter experiments. Technical report, UT-Austin, in preparation.
[25]
E. Yoneki, P. Hui, and J. Crowcroft. Visualizing community detection in opportunistic networks. In CHANTS '07: Proceedings of the second workshop on Challenged networks CHANTS, pages 93--96, New York, NY, USA, 2007. ACM.
[26]
E. Yoneki, P. Hui, and J. Crowcroft. Visualizing community detection in opportunistic networks. In CHANTS '07: Proceedings of the second workshop on Challenged networks CHANTS, pages 93--96, New York, NY, USA, 2007. ACM.
[27]
A. Zomorodian and G. Carlsson. Computing persistent homology. In SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pages 347--356, New York, NY, USA, 2004. ACM.

Cited By

View all

Index Terms

  1. Using persistent homology to recover spatial information from encounter traces

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
      May 2008
      474 pages
      ISBN:9781605580739
      DOI:10.1145/1374618
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 26 May 2008

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. delay-tolerant network
      2. encounter trace
      3. persistent homology

      Qualifiers

      • Research-article

      Conference

      MobiHoc08
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 296 of 1,843 submissions, 16%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)8
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 20 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2018)Fast track articlePervasive and Mobile Computing10.1016/j.pmcj.2010.11.0017:2(206-222)Online publication date: 24-Dec-2018
      • (2017)A framework for mapping with biobotic insect networksRobotics and Autonomous Systems10.1016/j.robot.2016.11.00488:C(79-96)Online publication date: 1-Feb-2017
      • (2013)Topological mapping of unknown environments using an unlocalized robotic swarm2013 IEEE/RSJ International Conference on Intelligent Robots and Systems10.1109/IROS.2013.6697160(5545-5551)Online publication date: Nov-2013
      • (2011)Beyond graphs: Capturing groups in networks2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)10.1109/INFCOMW.2011.5928935(870-875)Online publication date: Apr-2011

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media