To solve the common-link and common-node problem, disjoint multi-path routing (DMPR) is employed where sensors send data to the sink through link-disjoint or node-disjoint path.
提出了一种不相交路径路由算法，可以将感知节点采集到的数据通过不相交路径传送到汇聚节点，提高路由的可靠性。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
Based on the basic ideas of the K-shortest path and partial link-disjoint protection, DCSP can provide differentiated services for customers according to their SLA-parameters.
DCSP同时考虑用户提出的上述两个SLA参数要求，利用K路由和部分链路分离保护思想为它们动态提供区分服务。
And in order to select stable multiple routes similar with the shortest path, RNDMRA USES similarity factor to select similar stable node-disjoint multipath routes.
同时为了选择与最短路径相似的稳定多路由，RNDMRA应用相似性因子选择相似的稳定节点不相交多路径路由。
Constructing disjoint minimal path set is an important approach for reliability analysis of network.
网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径。
Constructing disjoint minimal path set is an important approach for reliability analysis of network.
网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径。
应用推荐