liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Worst-case latency of broadcast in intermittently connected networks
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1916-3398
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
2012 (English)In: International Journal of Ad Hoc and Ubiquitous Computing, ISSN 1743-8225, E-ISSN 1743-8233, Vol. 11, no 2-3, 125-138 p.Article in journal (Refereed) Published
Abstract [en]

Worst-case latency is an important characteristic of information dissemination protocols. However, in sparse mobile ad hoc networks where end-to-end connectivity cannot be achieved and store-carry-forward algorithms are needed, such worst-case analyses have not been possible to perform on real mobility traces due to lack of suitable models. We propose a new metric called delay expansion that reflects connectivity and reachability properties of intermittently connected networks. Using the delay expansion, we show how bounds on worst-case latency can be derived for a general class of broadcast protocols and a wide range of real mobility patterns. The paper includes theoretical results that show how worst-case latency can be related with delay expansion for a given mobility scenario, as well as simulations to validate the theoretical model.

Place, publisher, year, edition, pages
Inderscience , 2012. Vol. 11, no 2-3, 125-138 p.
Keyword [en]
latency, connectivity, partitioned networks, graph expansion, dynamic networks, real-time, delay-tolerant networks, analysis
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-86664DOI: 10.1504/IJAHUC.2012.050281ISI: 000311137300005OAI: oai:DiVA.org:liu-86664DiVA: diva2:580078
Note

Funding Agencies|Swedish Research Council (VR)|2008-4667|Science Foundation Ireland|10/CE/I1855|

Available from: 2012-12-20 Created: 2012-12-20 Last updated: 2017-12-06

Open Access in DiVA

fulltext(546 kB)238 downloads
File information
File name FULLTEXT01.pdfFile size 546 kBChecksum SHA-512
689d5b3c6e124eaab2b02a8c3c271867495aa1e7d95e29a0b08d06731ec95fb4edd0a01d74605e7f19393e41c95a7ca11db99a4bb090b6cc985588722f8c56ee
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Asplund, MikaelNadjm-Tehrani, Simin

Search in DiVA

By author/editor
Asplund, MikaelNadjm-Tehrani, Simin
By organisation
Software and SystemsThe Institute of Technology
In the same journal
International Journal of Ad Hoc and Ubiquitous Computing
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 238 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 153 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf