• DocumentCode
    2335285
  • Title

    On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks

  • Author

    Jacquet, Philippe ; Mans, Bernard ; Rodolakis, Georgios

  • Author_Institution
    INRIA, Rocquencourt, France
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes´ encounters, we study the properties of journeys that maximize the space-time information propagation capacity, in bit-meters per second. More specifically, we provide theoretical lower and upper bounds on the information propagation speed, as a function of the journey capacity. In the particular case of random way-point-like models (i.e., when nodes move for a distance of the order of the network domain size before changing direction), we show that, for relatively large journey capacities, the information propagation speed is of the same order as the mobile node speed. This implies that, surprisingly, in sparse but large-scale mobile DTNs, the space-time information propagation capacity in bit-meters per second remains proportional to the mobile node speed and to the size of the transported data bundles, when the bundles are relatively large. We also verify that all our analytical bounds are accurate in several simulation scenarios.
  • Keywords
    mobile radio; telecommunication network routing; delay tolerant networks; mobile networks; mobile node speed; space-time capacity limits; space-time information propagation capacity; store-carry-forward routing; Ad hoc networks; Communications Society; Delay effects; Disruption tolerant networking; Information analysis; Large-scale systems; Peer to peer computing; Routing; Stochastic processes; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2010 Proceedings IEEE
  • Conference_Location
    San Diego, CA
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-5836-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2010.5462164
  • Filename
    5462164