skip to main content
10.1145/1287853.1287875acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
Article

Power law and exponential decay of inter contact times between mobile devices

Published:09 September 2007Publication History

ABSTRACT

We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of inter-contact times between mobile devices. Using a diverse set of measured mobility traces, we find as an invariant property that there is a characteristic time, order of half a day, beyond which the distribution decays exponentially. Up to this value, the distribution in many cases follows a power law, as shown in recent work. This powerlaw finding was previously used to support the hypothesis that inter-contact time has a power law tail, and that common mobility models are not adequate. However, we observe that the time scale of interest for opportunistic forwarding may be of the same order as the characteristic time, and thus the exponential tail is important. We further show that already simple models such as random walk and random way point can exhibit the same dichotomy in the distribution of inter-contact time ascin empirical traces. Finally, we perform an extensive analysis of several properties of human mobility patterns across several dimensions, and we present empirical evidence that the return time of a mobile device to its favorite location site may already explain the observed dichotomy. Our findings suggest that existing results on the performance of forwarding schemes basedon power-law tails might be overly pessimistic.

References

  1. J.-Y. L. Boudec and M. Vojnović. The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation. IEEE/ACM Trans. on Networking, 14(6):1153--1166, Dec 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms. In INFOCOM, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  3. E. Cinlar. Introduction to Stochastic Processes. Prentice Hall, 1 edition, 1975.Google ScholarGoogle Scholar
  4. N. Eagle and A. Pentland. CRAWDAD data set mit/reality (v. 2005-07-01), July 2005.Google ScholarGoogle Scholar
  5. N. Eagle and A. Pentland. Reality mining: Sensing complex social systems. In Journal of Personal and Ubiquitous Computing, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah. Optimal Throughput-delay Scaling in Wireless Networks - Part I: The Fluid Model. IEEE Trans. on Information Theory, 52(6):2568--2592, June 2006.Google ScholarGoogle ScholarCross RefCross Ref
  7. M. Grossglauser and D. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 10(4):477--486, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Intelligent Transportation Systems Standards Program. Dedicated Short Range Communications, April 2003. http://www.standards.its.dot.gov/Documents/advisories/dsrc_advisory.htm.Google ScholarGoogle Scholar
  9. D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In Mobile Computing. 1996.Google ScholarGoogle Scholar
  10. T. Karagiannis, J.-Y. L. Boudec, and M. Vojnovic. Power law and exponential decay of inter contact times between mobile devices. Technical Report MSR-TR-2007-24, Microsoft Research, March 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Krumm and E. Horvitz. The Microsoft Multiperson Location Survey, August 2005. Microsoft Research Technical Report, MSR-TR-2005-13.Google ScholarGoogle Scholar
  12. N. F. Maxemchuk. Routing in the Manhattan Street Network. In IEEE Trans. on Comm., volume 35, pages 503--512, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  13. M. McNett and G. M. Voelker. Access and mobility of wireless pda users. In Mobile Computing Communications Review, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-01-31), Jan. 2006.Google ScholarGoogle Scholar
  15. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD trace cambridge/haggle/imote/infocom (v. 2006-01-31), Jan. 2006.Google ScholarGoogle Scholar
  16. E. Seneta. Non-Negative Matrices. Wiley and Sons, 1 ed., 1973.Google ScholarGoogle Scholar
  17. G. Sharma and R. R. Mazumdar. Delay and Capacity Trade-off in Wireless Ad Hoc Networks with Random Waypoint Mobility, 2005. Preprint, School of ECE, Purdue University, 2005.Google ScholarGoogle Scholar
  18. F. Spitzer. Principles of Random Walk, Graduate Texts in Mathematics. Springer, 2nd edition, 1964.Google ScholarGoogle Scholar
  19. W. Zhao, Y. Chen, M. Ammar, M. D. Corner, B. N. Levine, and E. Zegura. Capacity Enhancement using Throwboxes in DTNs. In Proc. IEEE Intl Conf on Mobile Ad hoc and Sensor Systems (MASS), Oct 2006.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Power law and exponential decay of inter contact times between mobile devices

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking
        September 2007
        370 pages
        ISBN:9781595936813
        DOI:10.1145/1287853

        Copyright © 2007 ACM

        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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 9 September 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate440of2,972submissions,15%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader