SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Asplund Mikael)
 

Search: WFRF:(Asplund Mikael) > Worst-case latency ...

Worst-case latency of broadcast in intermittently connected networks

Asplund, Mikael (author)
Linköpings universitet,Programvara och system,Tekniska högskolan
Nadjm-Tehrani, Simin (author)
Linköpings universitet,Programvara och system,Tekniska högskolan
 (creator_code:org_t)
Inderscience, 2012
2012
English.
In: International Journal of Ad Hoc and Ubiquitous Computing. - : Inderscience. - 1743-8225 .- 1743-8233. ; 11:2-3, s. 125-138
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Keyword

latency
connectivity
partitioned networks
graph expansion
dynamic networks
real-time
delay-tolerant networks
analysis
TECHNOLOGY
TEKNIKVETENSKAP

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

Find more in SwePub

By the author/editor
Asplund, Mikael
Nadjm-Tehrani, S ...
Articles in the publication
International Jo ...
By the university
Linköping University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view