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.
2003 (English)Conference paper, Poster (Other academic)
Abstract [en]

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 exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.

Place, publisher, year, edition, pages
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-31517DOI: 10.1145/961268.961272Local ID: 5b5e7500-f110-11dc-ba03-000ea68e967bOAI: diva2:1004751
ACM International Symposium on Mobilde Ad Hoc Networking and Computing, MobiHoc 2003 : 01/06/2003 - 03/06/2003
Godkänd; 2003; Bibliografisk uppgift: POSTER SESSION: Summaries of MobiHoc 2003 posters Sider: 19 - 20; 20080313 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(73 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 73 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
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

ReferencesLink to record
Permanent link

Direct link