Probabilistic routing in intermittently connected networks
2003 (English)Conference paper, Poster (Other academic)
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
IdentifiersURN: urn:nbn:se:ltu:diva-31517DOI: 10.1145/961268.961272Local ID: 5b5e7500-f110-11dc-ba03-000ea68e967bOAI: oai:DiVA.org:ltu-31517DiVA: 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)2016-09-302016-09-30Bibliographically approved