Probabilistic routing in intermittently connected networks

Abstract
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.Godkänd; 2003; Bibliografisk uppgift: POSTER SESSION: Summaries of MobiHoc 2003 posters Sider: 19 - 20; 20080313 (ysko

This publication has 2 references indexed in Scilit: