发明名称 ROUTING METHOD INTENDED FOR INTERMITTENTLY CONNECTED NETWORKS
摘要 The invention relates to a routing method intended for intermittently connected networks. The inventive method is characterised in that, in order to determine routing information for an opportunistically defined routing, it includes at least the following steps: for a network comprising a number n of nodes, wherein kmax is the maximum number of relays to be considered in the routing and M<SUB>1</SUB> is a matrix of size nxn, initialisation M<SUB>1</SUB> = <T<SUB>ij</SUB>> of the estimations of the average inter-contact times for nodes i and j. If k+1 corresponds to the number of relays considered for the routing, k=0 is initialised. And at step k, for each pair of nodes (i, j) (with 1<=i<=n, 1 <=j<=n, i?j), estimation of the delay at (k+1) jumps and the list of corresponding relays from <?<SUB>ij</SUB>> matrix of the inverses of the average inter-contact times and estimations of the delays at k jumps present in M<SUB>k</SUB>and storing of the estimated inter-contact delays in matrix M<SUB>(k+1)</SUB>(i,j) and the list of corresponding relays V<SUB>i</SUB>(d)<SUP>k+1</SUP>, (M<SUB>(k+1 )</SUB>(i,j), V<SUB>i</SUB>(d)<SUP>k+1</SUP>), where V<SUB>j</SUB>(d)<SUP>k+1</SUP>corresponds to the list of relay nodes considered at node i when a message must be transmitted to d for a number of relays k+1. If k+1 = kmax, the steps are stopped, otherwise k=k+1 is implemented. <SUP/>
申请公布号 WO2008077936(A1) 申请公布日期 2008.07.03
申请号 WO2007EP64438 申请日期 2007.12.21
申请人 THALES;CONAN, VANIA;LEGUAY, JEREMIE;FRIEDMAN, TIMUR 发明人 CONAN, VANIA;LEGUAY, JEREMIE;FRIEDMAN, TIMUR
分类号 H04L12/56 主分类号 H04L12/56
代理机构 代理人
主权项
地址