...） | max ( , ) min ( , ) | ( , ) i j i j Delay s v Delay s v v v M δ − ≤ ∀ ∈ （2） 2 时延受限最小代价路径算法(DCMCA) 时延受限最小代价路径算法(Delay Constraint Minimum Cost Algorithm,DCMCA)是基于文献[10]的 思想对 Dijkstra’s 算法的一种改...
基于8个网页-相关网页
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
应用推荐