Worst-case latency of broadcast in intermittently connected networks

Asplund, MikaelLinköpings universitet,Programvara och system,Tekniska högskolan (författare)

Funding Agencies|Swedish Research Council (VR)|2008-4667|Science Foundation Ireland|10/CE/I1855|
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.

Nadjm-Tehrani, SiminLinköpings universitet,Programvara och system,Tekniska högskolan(Swepub:liu)simna73 (författare)
Linköpings universitetProgramvara och system (creator_code:org_t)

Ingår i:International Journal of Ad Hoc and Ubiquitous Computing: Inderscience11:2-3, s. 125-1381743-82251743-8233

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.