1·In the direct methods, the final destination node is selected in one step.
直接方法在一个步骤中选择最终目标节点。
2·By predicting the destination node channel, each node can communicate with each other.
利用预算出的目标节点的工作信道进行节点之间的通信。
3·This function takes the source node and copies it over as a child under the destination node.
此函数接受源节点，并将其作为子节点复制到目标节点下。
4·In the iterative methods, the final destination node is determined through several iteration steps.
迭代的方法通过几个迭代步骤确定最终目标节点。
5·The destination node may be in another document, in which case the subtree is copied between documents.
目标节点可以在另一个文档中，在这种情况下，在两个文档之间复制子树。
6·You create a pure vector-based drawing here and render a line here from source node to destination node.
您创建了一个纯粹基于矢量的绘图，并且显示了一条从源节点到目标节点的连线。
7·Data packet is transmitted from source node to multiple destination nodes in multicast communication.
多播是将同一信息从源节点传送到网络中多个目的节点。
8·Multicast algorithm is to build a multicast tree from the source node to destination nodes, and to assign wavelength.
组播算法就是要建立一棵从源节点到目的节点的组播树，并给这棵组播树分配波长。
9·Then the destination node jointly decodes the messages from the source and relay nodes. We call such a procedure as a network LDPC code.
目的节点可以利用源节点和中继节点的信息进行联合译码，我们称之为网络LDPC编码。
10·Those nodes who are in the repair area will receive the packets from the destination node to know the routing path to reach the destination node.
在该区域中的节点，将会收到目的节点的跳数报文，获得到达目的节点的路由。