Abstract: A routing method in a network with intermittent connectivity, characterized in that it includes, to determine the routing information, for an opportunistically defined routing, for a network comprising a number n of nodes, kmax being the maximum number of relays to be considered in the routing, and M1, a matrix of size n×n, iterative steps of estimating the delay with (k+1) hops and the list of corresponding relays from <?ij> matrix of the inverses of the average inter-contact times and of the estimates of delays with k hops present in Mk, storing the estimated inter-contact delays in the matrix M(k+1)(i,j) and the list of the corresponding relays Vi(d)k+1, (M(k+1)(i,j), Vi(d)k+1), where Vi(d)k+1) corresponds to the list of the relay nodes considered at the node i when a message must be transmitted to the destination d, for a number of relays k+1.

Abstract: A routing method in a network with intermittent connectivity, characterized in that it includes, to determine the routing information, for an opportunistically defined routing, for a network comprising a number n of nodes, kmax being the maximum number of relays to be considered in the routing, and M1, a matrix of size n×n, iterative steps of estimating the delay with (k+1) hops and the list of corresponding relays from <?ij> matrix of the inverses of the average inter-contact times and of the estimates of delays with k hops present in Mk, storing the estimated inter-contact delays in the matrix M(k+1)(i,j) and the list of the corresponding relays Vi(d)k+1, (M(k+1)(i,j), Vi(d)k+1), where Vi(d)k+1) corresponds to the list of the relay nodes considered at the node i when a message must be transmitted to the destination d, for a number of relays k+1.