查询词典 routing

Vehicle routing problem is a typical combinatorial optimization problem, which is a simplified form of various complex problems.

车辆路径问题( Vehicle routing problem，简记VRP)是一个经典的组合优化问题，是多种复杂问题的一种简化形式。

The method comprises the following steps: acquiring the parallel link information between a first routing device and a second routing device; selecting at least one link from the parallel links between the first routing device and the second routing device as a main link according to the parallel link information; and transmitting the message between the first routing device and the second routing device through the main link.

本发明方法包括：获取第一路由设备与第二路由设备之间的并行链路信息；根据所述并行链路信息在第一路由设备与第二路由设备之间的并行链路中选择出至少一条链路作为主链路；通过所述主链路传输所述第一路由设备与第二路由设备之间的报文。

Finally, the programme of design for routing protocols is chose in the thesis. Secondly, improved algorithms are introduced in detail. In order to achieve to reduce duplication of data sent in, save energy, prolong the network lifetime and balance the network load, improved algorithms are based on the minimum hops algorithm which is one of the energy-aware routing, When the characters of the minimum hops algorithm are analysed in detail,multi-path routing, adaptive dynamic routing, routing reliability are designed.Then a new algorithm based on minimum hops in plane routing protocol and a new algorithm based on minimum hops in clustering routing protocol are designed in the thesis.

接著详细介绍了本文的改进路由算法，为实现减少数据的重复发送量、节约能量、延长网络寿命、平衡网络负载的目标，本文以能量感知路由之一的最小跳数算法为基础，详细分析了最小跳数算法的特点，设计了多路径修正路由，自适应动态路由，路由可靠性机制三方面的改进方案，并且结合改进方案设计了基于最小跳数的改进平面路由协议和基于最小跳数的改进分簇路由协议，将两种类型算法的优点相结合，提高网络的健壮性与可扩展性。

In mobile Ad Hoc networks, geographical routing protocol was a kind of important routing protocols, which requires the underlying topology be planar, sparse, connected and t-spanner in order to guarantee the delivery of message and bound the routing length. A new topology control algorithm named ODT, which constructed the geometry structure named ODT graph, was proposed.

基于移动Ad Hoc网络的特性，提出了一种适用于移动Ad Hoc网络的路由协议PAGPSR(Power-Aware Greedy Perimeter Stateless Routing)，该协议在原有的基于地理位置的路由协议GPSR的基础上增加了节点能量感知和负载均衡算法，修改了GPSR的转发策略，使网络中能量消耗和网络负荷分布更加均匀，从而延长了整个网络的生存时间。

Ant routing use Swarm-Intelligence for route discovery and also have multi-paths for backup and balance. However, the efficiency of ant routing can more and more go down in large-scale mobile ad hoc networks. For solving such condition, improving the efficiency of ant routing, this research proposes the algorithm that combines both the GRID and ant routing, called grid-based ant routing algorithm. GARA can improve efficiency of ant routing in large-scale mobile ad hoc networks.

对於解决路由上的一些问题，也因此有各种不同类别的路由方法被探讨，蚂蚁路由演算法利用群体智慧(swarm-intelligence)找寻路径，而且同时能够找到多条备援路径，但是，蚂蚁路由演算法会因为行动主机数目愈来愈多情况下，而导致路由演算法效率降低，因此本论文以GRID为概念，融入蚂蚁演算法中，让蚂蚁是采用网格对网格(grid-by-grid)方式传输，改善蚂蚁路由演算法在行动主机数目愈来愈多情况下的效率与效能。

Firstly, this paper studied on the existing technologies in the field of wireless sensor networks, then introduced the existing routing protocols such as Beaconed Tree Mode Routing Protocol, LEACH, AODV and so on.

首先，本文讨论了无线传感器网络的发展概况，进而引出了低功耗和相应的基于Beacon~1的树状路由、LEACH(Low-energy adaptive clustering hierarchy)、AODV(Ad hoc On demand Distance Vector Routing Protocol)等路由协议。

A genetic algorithm for multicast routing and wavelength assignment is proposed in the WDM delaminating network.

在WDM网络中建立连接包括路由选择和波长分配两个过程，简称为RWA ROuting

This paper analyzes the key ideas of Minimum InterferenceRouting Algorithm for LSP routing and then surveys the current improved schemes of MIRA. According totheir technical methods, they are classified as reconfirming critical links class, utilizing traffic profile informationclass, adding admission control class, and solving multiple Quality of Service constraints class.

深入剖析了LSP选路算法中的最小干扰选路算法(minimum interference routing algorithm，简称MIRA)的关键思想，综述了对MIRA的各种改进方案，并依据其实现方案将现有主要最小干扰选路算法分为4类：关键链路的重新定位类、利用流量特征信息类、增加准入控制类和解决多服务质量受限类。

According to the energy efficient requirements and characteristics of HDRWSN, a Load Balanced and energy aware routing protocol considering both energy consumption status and load congestion levels of sensor nodes has been proposed. LBEAR protocol equipoises network energy and load distribution, therefore, it can prolong the lifetime of HDRWSN through resource equilibrium.

根据高数据率无线传感器网络的能量高效需求和大数据量的特点，本论文提出了一种新型的LBEAR(Load Balanced and Energy Aware Routing)协议，LBEAR协议综合考虑了节点能量消耗状态和节点的负载拥塞程度，均衡了网络能量分布和负载分布，通过均衡网络资源延长了网络生存周期，从而提高网络的节能特性。

In order to solve the above problems, a scalable multicast routing protocol with QoS constraints is proposed in this dissertation at first. It could absolutely make distributed computering into realization and then solve the problems successfully by the integration with local search and global search、single-branch search and multi-branch search.

本文从研究现有多播通信模型以及QoS约束的多播路由协议和算法出发，首先提出了可扩展的QoS多播路由协议MRPQoS(Multicast Routing Protocol with QoS constraints)，它将局部搜索与全局搜索、多分支搜索与单分支搜索有机的结合在一起，有效解决了同类协议消息复杂度高、寻路成功率低以及连接建立时间比较长等问题。

Methods: Five patients with parkinsonism or dystonia were assigned to general anesthesia using an modified endotracheal tube.

本实验依照人体实验之相关规定进行，五位患有帕金森氏症或肌张力异常的病人接受神经立体定位手术。

If you can benefit from this book, it is our honour.

如果您能从本书获益，这将是我们的荣幸。