片语

active destination node有效地址节点

DNA Destination Node Address目标结点地址

destination node leaving目的节点退出

destination E node目的节点

destination node address目标结点地址

nonadjacent destination node非相邻目的地节点

dn destination node目的单元节点

destination node joining目的节点加入

英汉例句

• then, an efficient adaptive cooperative transmission scheme was proposed. first, the destination node determines weather using relaying or not, then, it sends this result to the relay node.

  目的节点判断是否采用中继传输并将结果发送到中继节点，中继节点根据接收到的信息调整传输模式。

• only the source node and the destination node need operation of the asymmetric cryptographic algorithm once in a route computation.

  在一次路由计算中，只有源节点和目的节点需要进行一次非对称密码运算。

• 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.

  在该区域中的节点，将会收到目的节点的跳数报文，获得到达目的节点的路由。

• the destination node may be in another document, in which case the subtree is copied between documents.

  目标节点可以在另一个文档中，在这种情况下，在两个文档之间复制子树。

• in this paper, with the support of the qos based initial route setup algorithms, based on resource sharing principles, qos based destination node joining and leaving algorithms a.

  其中，基于服务质量的多媒体通信目的节点加入与退出算法是关键组成部分。

• by predicting the destination node channel, each node can communicate with each other.

  利用预算出的目标节点的工作信道进行节点之间的通信。

• the invention can realize the high-precision positioning within a local range (100-meter radius), and the power consumption of the positioned destination node is low.

  本发明能够在局部范围内（100米半径）实现高精度定位，并且被定位目标节点功耗低。

• 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编码。

• this algorithm was based on mph algorithm. it added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.

  该算法基于mph算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。

• with the new algorithm, a destination node could join the existing multicast tree by selecting the path whose cost was the least;

  该算法中每个目的节点通过最小代价路径加入当前多播树；

• then an efficient adaptive cooperative transmission scheme is proposed. first, the destination node determines whether or not relaying should be adopted and it sends the result to the relay node.

  目的节点判断是否采用中继传输并将结果发送到中继节点，中继节点根据接收到的信息调整传输模式。

• we hope ospf not only enable to find out the shortest path from the origin node to the destination node but also has the ability to allocate resource of the whole network by extending.

  因此，我们希望通过对ospf进行扩展，使它不仅能找到从源点到目的点数据传输的最短路径，而且具备调配整个网络资源的能力。

• to adapt to dynamical channel variation, joint feedback of instantaneous channel state information from both destination node and relay node is used.

  利用中继和信宿的联合信道状态反馈信息确定站点传输方式，较好地适应信道的瞬时变化；

• in the direct methods, the final destination node is selected in one step.

  直接方法在一个步骤中选择最终目标节点。

• using iterative and maximum a posteriori decoding method, the information can be obtained at the destination node by decoding the codes received in different time.

  目的节点采用迭代最大后验概率译码，利用多个时刻收到的码字恢复源节点发送信息。

• the former requires an existing link between source node and destination node when data forwarding.

  第一类路由协议要求在报文传输过程中，报文源节点与目标节点间存在有效的连接路径；