Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/114168
35 Visitors
43 Hits
2 Downloads
- Title
- On space-time capacity limits in mobile and delay tolerant networks
- Related
- IEEE INFOCOM (29th : 2010) (14 - 19 March 2010 : San Diego, CA)
- Related
- INFOCOM 2010 : proceedings IEEE, 14-19 March 2010, San Diego, CA, USA, p.623-631
- DOI
- 10.1109/INFCOM.2010.5462164
- Related
- Infocum proceedings
- Publisher
- Piscataway, N.J : IEEE
- Date
- 2010
- FoR/RFCD Code(s)
-
080400 Data Format
- Author/Creator
- Jacquet, Phillippe
- Author/Creator
- Mans, Bernard
- Author/Creator
- Rodolakis, Georgios
- Description
- 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.
- Description
- 9 page(s)
- Subject Keyword
- 080400 Data Format
- Subject Keyword
- analytical bounds
- Subject Keyword
- capacity limit
- Subject Keyword
- data flow analysis
- Subject Keyword
- internet protocols
- Subject Keyword
- radio communication
- Subject Keyword
- speed
- Subject Keyword
- stochastic models
- Subject Keyword
- wireless networks
- Subject Keyword
- delay tolerant networks
- Subject Keyword
- information propagation
- Subject Keyword
- lower and upper bounds
- Subject Keyword
- mobile nodes
- Subject Keyword
- network domains
- Subject Keyword
- space and time
- Subject Keyword
- space-time informations
- Subject Keyword
- block codes
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/114168
- Identifier
- ISBN:9781424458387
- Identifier
- ISSN:0743-166X
- Identifier
- mq-rm-2010001558
- Language
- eng
- Rights
- Copyright 2010 IEEE. Reprinted from INFOCOM 2010 : proceedings IEEE, 14-19 March 2010, San Diego, CA, USA. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text
- Reviewed
-
-
