Change search
ReferencesLink to record
Permanent link

Direct link
Probabilistic routing in intermittently connected networks
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2004 (English)In: Service Assurance with Partial and Intermittent Resources: First International Workshop, SAPIR 2004, Fortaleza, Brazil, August 1-6, 2004, Proceedings / [ed] Petre Dini; Pascal Lorenz; José Neuman De Souza, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2004, 239-254 p.Conference paper (Refereed)
Abstract [en]

In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2004. 239-254 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3126
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-39187DOI: 10.1007/978-3-540-27767-5_24Local ID: dd499280-16f1-11df-bae5-000ea68e967bISBN: 9783540225676OAI: diva2:1012696
International Workshop on Service Assurance with Partial and Intermittent Resource : 01/08/2004 - 06/08/2004
Validerad; 2004; 20100211 (andbra)Available from: 2016-10-03 Created: 2016-10-03Bibliographically approved

Open Access in DiVA

fulltext(139 kB)29 downloads
File information
File name FULLTEXT01.pdfFile size 139 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Lindgren, AndersDoria, AvriSchelén, Olov
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 29 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

Altmetric score

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link