Routing in intermittently connected networks using a probabilistic approachReport as inadecuate




Routing in intermittently connected networks using a probabilistic approach - Download this document for free, or read online. Document in PDF available to download.

Doria, Avri Schelén, Olov 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.

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-30Bibliographically approved



Author: Lindgren, Anders

Source: http://ltu.diva-portal.org/







Related documents