Routing method intended for intermittently connected networks

摘要

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.

主权项

1. A routing method for routing a message transmitted from a source node s to a destination node d in a network comprising n nodes that are intermittently connected to each other and that act as relays for each other, the method comprising the following steps:
for each node, measuring average inter-contact times with other nodes and providing the average inter-contact times to other nodes in the network; for each node, receiving and storing average inter-contact time information from other nodes of the network; generating an n×n matrix <λij> corresponding to inverses of average inter-contact times between nodes i and j, wherein i is an index value ranging from 1 to n and j is an index value ranging from 1 to n; generating an n×n matrix corresponding to an estimation of average inter-contact times between nodes i and j; setting k=1, wherein k indicates a number of relays used in a routing of a message from the source node s to the destination node d, and wherein kmax is a maximum number of relays to be considered in the routing; setting an n×n matrix Mk equal to ; computing an opportunistically defined routing method comprising the following steps:
for a pair of nodes (i, j) within the network, with 1<=i<=n, 1<=j<=n, i≠j, utilizing <λij> and Mk to generate estimated inter-contact delays with (k+1) hops and a list of the corresponding relays;storing the estimated inter-contact delays in a matrix M(k+1) and the list of the corresponding relays in a list Vi(d)k+1;wherein Vi(d)k+1 corresponds to a list of the relay nodes in the network considered at the node i when a message is transmitted to the destination node d using k+1 relays;terminating computing of the opportunistically defined routing method if k+1=kmax or Mk=M(k+1); andincrementing k by a predetermined value; and using Vi(d)k for routing the messages to said destination node d.