Based on the hypergraph model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sen.
并基于超图模型提出同步无线传感器网络最小生成超树路由算法，以建立数据汇聚的最小能耗树。
This will be more wireless data transmissions from broadcast functional perspective is divided into two parts part guarantee Zubo tree routing and guarantee data transmission.
本文将无线多播数据传输从功能的角度分成两部分：保证组播树的路由部分和保证数据传输部分。
A binary tree routing topology is designed for propagating the system clock and trigger signal and the accurate timing and synchronization between sensors are provided by CPLD.
设计了二进制树型拓扑结构传播统一的系统时钟和触发信号，采用CPLD提供传感器间的精确时序和同步。
Companies traditionally have gained basic resiliency for their metropolitan Ethernet networks through a Layer 2 mechanism such as Spanning Tree or Layer 3 routing protocols.
传统上，各个公司是通过第二层机制(如生成树)或第三层路由协议，获得城域以太网的基本弹性。
For example, you can modify the connections routing style to use the tree style routing, and you can right-click in the workspace to bring up a context menu and then click Arrange all.
例如，您可以修改连接路径样式以使用树状样式路径，并且您可以通过在工作区右键点击来打开内容菜单然后点击arrangeall。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
The paper proposes a distributed algorithm for part message delay-constrained multicast routing directed at ensuring quality of service of multicast tree.
为保证受限多播树的服务质量，提出了一种利用局部信息的时延受限多播路由算法。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
Then, a hierarchical routing tree with base station as the root is established according to the hop and energy-level of.
然后，以基站为树根，各簇首节点根据跳数和能量级别建立层次路由树。
ASTR combines the merits of proactive routing protocol and on-demand routing protocol because subarea tree has the function of routing selection.
由于分区树具有路由选择功能，所以ASTR结合了先应式路由协议和按需路由协议的优点。
The second one is multicast routing algorithm based on Clone Selection algorithm, Clone Selection algorithm is a global optimization algorithm and can improve the performance of multicast tree.
第二种是基于免疫克隆选择算法的组播路由算法，该算法利用了免疫克隆选择算法全局搜索能力，提高组播树的性能。
This paper classifies the routing strategy of multistage interconnection network, and analyses whether fat-tree fits with these classifications.
本文对多级互连网的路由策略进行了分类，并根据这些分类是否适用于胖树进行了分析。
To improve the performance of multicast tree, a rearrangement dynamical multicast routing based on Clone Selection is proposed.
为了改善组播树的性能，本章提出了基于免疫克隆选择的重构动态组播路由算法。
The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.
研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。
It forwards packets based on the relative position of the grids rather than a routing tree.
数据的转发可以不用建立路由树，而是直接根据网格的相对位置关系转发。
KTR is a dynamic wireless routing protocol based on the tree structure.
核心树路由协议是一种基于树状路由结构的动态无线路由协议。
In chapter 4, we have proposed a multicast routing algorithm on the basis of minimum tree algorithm.
在第四章中，我们提出了一种基于最小树算法的组播路由算法。
ASTR belongs to hierarchical routing protocol: it divides the whole network into many subareas logically through establishing subarea trees and each subarea is composed of a tree.
ASTR属于分级路由协议，通过建立分区树，在逻辑上将网络划分为多个分区，每个分区由一棵树组成。
In the third part, basing on the actual requirements of the project, a tree based energy efficient routing protocol TREES is designed.
第三部分根据项目的实际需求，设计了一种基于树型结构网络的能量高效的无线传感器网络路由协议TREES。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.
仿真结果表明：与传统的LEO卫星网络组播路由算法相比，该算法具有较低的计算复杂度，生成的组播路由树具有较小的开销。
The features of this routing structure are:(1) Combining tree and flow structure, which not only can lookup fast, but also can adapt to the dynamic node join or leave;
该路由结构的特点是：（1）结合了树结构和流结构，使该路由结构不仅能够快速查找，而且还能够适应动态的节点加入或离开；
The features of this routing structure are:(1) Combining tree and flow structure, which not only can lookup fast, but also can adapt to the dynamic node join or leave;
该路由结构的特点是：（1）结合了树结构和流结构，使该路由结构不仅能够快速查找，而且还能够适应动态的节点加入或离开；
应用推荐