Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Routing in intermittently connected networks using a probabilistic approach
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2003 (English)In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper, Published paper (Other academic)
Abstract [en]

In this paper we consider 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 do 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 such networks. We propose PROPHET, a probabilistic routing protocol for such 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
Stockholm, 2003.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-28003Local ID: 1a4ed3d0-980e-11dc-8ccb-000ea68e967bOAI: oai:DiVA.org:ltu-28003DiVA: diva2:1001196
Conference
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Note
Godkänd; 2003; 20071121 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-11-25Bibliographically approved

Open Access in DiVA

fulltext(171 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 171 kBChecksum SHA-512
433e9f28b8be1fc0cafdd67a4d29418c81f29069939eae5577a3ff62f2bb2ad27132174b474ef60c7a2343757d09ce9f9711843b284b5588d8b533de5c9f1d86
Type fulltextMimetype application/pdf

Authority records BETA

Lindgren, AndersDoria, AvriSchelén, Olov

Search in DiVA

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

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 7 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf