This paper proposes a cluster director path multipath routing algorithm on the research of other multipath routing algorithm(CDPMR).
在研究了一些分簇算法和多路径路由算法基础上，提出基于簇指挥路径的多路径路由算法（CDPMR）。
A routing path selected algorithm based on the minimization product of packet delay and packet energy consumption is proposed.
提出了一种基于平均分组时延与分组能量消耗乘积最小的路由路径选择算法。
A routing path selected algorithm based on the minimization of total delay is proposed.
提出了一种基于网络总时延最小的路由路径选择算法。
Combined the characteristic of sensor network and the properties of ant algorithm to quickly identify optimal path, an ant routing algorithm based on deflection Angle is proposed.
根据传感器网络的特性，结合蚂蚁算法能够快速找出最优路径的特点，提出了一种基于偏转角的蚂蚁路由算法。
The performance comparison between VTBR and traditional position based routing protocols shows that VTBR algorithm has a much higher packet delivery success rate and a shorter average path length.
通过仿真，文中给出了VTBR算法与传统位置辅助路由协议的性能对比分析，对数据包传输成功率和平均路径长度这两个性能参数进行了评价。
This paper discusses the NP-complete multi-constrained path problem, and a precomputation source routing algorithm based on limited selective flooding is presented.
该文研究了多限制路径选择问题，提出了一种基于有限选择洪泛的源路由预计算的服务质量路由算法。
An energy balance path selecting algorithm was proposed in order to avoid local "hotspots" which may be formed by many existing routing protocols used in wireless sensor networks.
针对现有无线传感器网络中路由协议产生“热点区域”问题，提出了一种能量平衡的路径选择算法。
In this paper, a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.
针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。
Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.
仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
A routing path selection algorithm selects the routing path with lower flow and less number of intermediate nodes. OFRA can distribute routing paths more evenly.
路径选择理论则选择拥有较低流量以及较少中继点的路径最为传输的路径。
Existing routing protocol implementations are monolithic, bundling together a database with an optimal path calculation algorithm and a network state distribution mechanism.
现有路由协议的实现是单一的，并且将数据库、最优路径计算和网络状态分发机制捆绑在一起。
The results indicate that "the longest covered-time" routing algorithm can improve the system performance compared with "the shortest path" one.
结果表明：“最长覆盖时间”算法与“最短路径”算法相比，能更有效地改善系统的性能。
The M-Commerce platform USES a message path finding algorithm to create a message queue in XML message engine for routing.
此平台采用分布式消息路径选择算法生成消息交换路径树，便于XML消息引擎生成一个队列和路由策略。
This paper analyzes the functional model and algorithms used for proportional routing. (Among) proportional routing algorithms, we focus on LDM (load distribution over multi-path) algorithm.
分析了实现均衡路由的功能模型和算法，重点研究了LDM(多路径负载分配)算法。
This paper analyzes the functional model and algorithms used for proportional routing. (Among) proportional routing algorithms, we focus on LDM (load distribution over multi-path) algorithm.
分析了实现均衡路由的功能模型和算法，重点研究了LDM(多路径负载分配)算法。
应用推荐