Worst-case latency of broadcast in intermittently connected networks

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: WFRF:(Asplund Mikael) > Worst-case latency ...

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		02606naa a2200409 4500
001		oai:DiVA.org:liu-86664
003		SwePub
008		121220s2012 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-866642 URI
024	7	a https://doi.org/10.1504/IJAHUC.2012.0502812 DOI
040		a (SwePub)liu
041		a engb eng
042		9 SwePub
072	7	a ref2 swepub-contenttype
072	7	a art2 swepub-publicationtype
100	1	a Asplund, Mikaelu Linköpings universitet,Programvara och system,Tekniska högskolan4 aut0 (Swepub:liu)mikas34
245	1 0	a Worst-case latency of broadcast in intermittently connected networks
264	1	b Inderscience,c 2012
338		a electronic2 rdacarrier
500		a Funding Agencies\|Swedish Research Council (VR)\|2008-4667\|Science Foundation Ireland\|10/CE/I1855\|
520		a 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.
653		a latency
653		a connectivity
653		a partitioned networks
653		a graph expansion
653		a dynamic networks
653		a real-time
653		a delay-tolerant networks
653		a analysis
653		a TECHNOLOGY
653		a TEKNIKVETENSKAP
700	1	a Nadjm-Tehrani, Siminu Linköpings universitet,Programvara och system,Tekniska högskolan4 aut0 (Swepub:liu)simna73
710	2	a Linköpings universitetb Programvara och system4 org
773	0	t International Journal of Ad Hoc and Ubiquitous Computingd : Inderscienceg 11:2-3, s. 125-138q 11:2-3<125-138x 1743-8225x 1743-8233
856	4	u https://liu.diva-portal.org/smash/get/diva2:580078/FULLTEXT01.pdfx primaryx Raw objecty fulltext:postprint
856	4 8	u https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-86664
856	4 8	u https://doi.org/10.1504/IJAHUC.2012.050281

Hitta via bibliotek

International Journal of Ad Hoc and Ubiquitous Computing (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Asplund, Mikael; Nadjm-Tehrani, S ...

Artiklar i publikationen: International Jo ...

Av lärosätet: Linköpings universitet

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

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.

LIBRIS.kb.se