Macquarie Home | Course Handbook | Library | Campus Map | Macquarie Contacts
Home page

Macquarie University ResearchOnline

Home
Add
-List Of Titles -Information propagation speed in mobile and delay tolerant networks

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/118798

32 Visitors 33 Hits 0 Downloads
FileDescriptionSizeFormat
DS01Publisher version (open access)542 KBAdobe Acrobat PDFView/Open
Title
Information propagation speed in mobile and delay tolerant networks
Related
IEEE INFOCOM 2009 (19 - 25 April 2009 : Rio de Janeiro)
Related
2009 Proceedings IEEE INFOCOM : 19-25 April 2009, Rio de Janeiro, Brazil, p.244-252
DOI
10.1109/INFCOM.2009.5061927
Publisher
Piscataway, N. J : IEEE
Date
2009
FoR/RFCD Code(s)
080201 Analysis of Algorithms and Complexity
Author/Creator
Jacquet, Phillippe
Author/Creator
Mans, Bernard
Author/Creator
Rodolakis, Georgios
Description
The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and delay tolerant networks (DTNs), where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. We use analytical tools to derive generic theoretical upper bounds for the information propagation speed in large scale mobile and intermittently connected networks. In other words, we upper-bound the optimal performance, in terms of delay, that can be achieved using any routing algorithm. We then show how our analysis can be applied to specific mobility and graph models to obtain specific analytical estimates. In particular, when nodes move at speed v and their density v is small (the network is sparse and surely disconnected), we prove that the information propagation speed is upper bounded by (1 + O(v²))v in the random way-point model, while it is upper bounded by O(radic(vv)v) for other mobility models (random walk, Brownian motion). We also present simulations that confirm the validity of the bounds in these scenarios.
Description
9 page(s)
Subject Keyword
080201 Analysis of Algorithms and Complexity
Resource Type
conference paper
Organisation
Macquarie University. Dept. of Computing

Identifier
http://hdl.handle.net/1959.14/118798
Identifier
ISBN:9781424435135
Identifier
ISSN:0743-166X
Identifier
mq-rm-2009004507
Language
eng
Rights
Copyright 2009 IEEE. Reprinted from 2009 Proceedings IEEE INFOCOM : 19-25 April 2009, Rio de Janeiro, Brazil. 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
Full Text
Reviewed
Reviewed
 
Image Thumbnail
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"2009 Proceedings IEEE INFOCOM : 19-25 April 2009, Rio de Janeiro, Brazil"
 
OR
  • Show All  
  • Show My Selections 
Advanced Search

Search

Jacquet, Phillippe
conference paper

Browse

  • By Title 
  • By Author/Creator 
  • By Department/Centre 
  • By Subject Keyword 
  • By Journal/Conference 
  • By FoR/RFCD codes 
  • By Resource Type 
  • By Date 

Highlights

  • Most Accessed Objects 
  • Recent Additions 
  • Pending Publications 
  • Author Profiles 

Resources

  • About ResearchOnline 
  • FAQ 
  • Open Access 
  • Open Access-FAQs 
  • Copyright 
  • Contribute 
  • Help 
  • Contact
  • Terms and Conditions 
Valid XHTML 1.0 Strict Powered by VITAL

Copyright Macquarie University | Privacy Statement | Accessibility Information

ABN 90 952 801 237 | CRICOS Provider No 00002J

Library Staff Sign In