Worst-case latency of broadcast in intermittently connected networks
2012 (English)In: International Journal of Ad Hoc and Ubiquitous Computing, ISSN 1743-8225, Vol. 11, no 2-3, 125-138 p.Article in journal (Refereed) Published
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.
latency, connectivity, partitioned networks, graph expansion, dynamic networks, real-time, delay-tolerant networks, analysis
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-86664DOI: 10.1504/IJAHUC.2012.050281ISI: 000311137300005OAI: oai:DiVA.org:liu-86664DiVA: diva2:580078
Funding Agencies|Swedish Research Council (VR)|2008-4667|Science Foundation Ireland|10/CE/I1855|2012-12-202012-12-202015-03-02