This current work is the first to formally address the problem of routing in probabilistic graphs formed out of intermittently connected networks. This ...

Abstract: Given a probabilistic graph G representing an intermittently connected network and routing algorithm A, we wish to determine a delivery subgraph ...

Given a probabilistic graph G representing an intermittently connected network and routing algorithm A, we wish to determine a delivery subgraph G[A] of G ...

Topics · Intermittently Connected Networks · Probabilistic Graphs · semi-Markov Chain · Routing Protocol · Optimization Problem · Routing Algorithm ...

Given a probabilistic graph G and routing algorithm A, we wish to determine a delivery subgraph G(A) of G with at most k edges, such that the probability Conn2( ...

On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks. In INFOCOM 2007. 26th IEEE International ...

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 ...

We propose. PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations.

We propose PROPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol.

Dec 20, 2018 · PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize ...