相邻节点

xiānɡ lín jié diǎn
  • adjacent node
相邻节点相邻节点
  1. 其中,qn表示当前节点缓冲区中发往相邻节点n的数据包数量;

    Of which , qn refers to the number of packets sent to the adjacent node nin the buffer zone of current node ;

  2. 在激光信令交互阶段,水声网络是多跳式的,通过建立相邻节点位置表和MAC地址转发表,利用三次查表的机制实现信令的中继转发。

    The stage of signaling interaction is a multi-hop network based on blue-green laser . A three look-up mechanisms is performed to achieve laser signaling forwarding with the established of both adjacent node table and the MAC address forwarding table .

  3. 使用landmark技术定位节点,减少逻辑层相邻节点间的物理距离。

    It uses landmark to reduce the distance between two tree nodes .

  4. 该模型用Delaunay三角剖分和Voronoi图描述相邻节点的几何关系。

    The model uses Delaunay triangulation and Voronoi diagram to describe the geometric relationship between adjacent nodes .

  5. adhoc网络是一种特殊的对等式自组网络,它利用无线通信技术,通过相邻节点的转发实现通信。

    Ad Hoc network is a kind of self-organized network with point-to point style and special purpose . It use the technology of wireless communication and relay on the neighborhood node to implement communication .

  6. 针对相邻节点间通过一个共享密钥建立安全通信链路存在的不足,将相邻节点间建立安全通信链路需要的共享密钥个数增加到q个,提高网络的安全性。

    In the view of the shortcomings that adjacent nodes establish a secure communication chain by a shared key , the scheme increased the amount of keys that needed to build a safe communication chain to q.3 .

  7. NameNode比较负载,然后将有关最空闲相邻节点的详细信息发送到特定的DataNode。

    Loads are compared by the NameNode and then the details about the free-est neighbor nodes are sent to the specific DataNode .

  8. 多跳通信路径上的相邻节点不可避免的面临流内竞争问题,制约了MAC协议的性能。

    To fulfill the forwarding of the received packets , the neighboring nodes on a multihop route will contend with each other inevitably . This is the so called intra-flow contention problem , which limits the performance of the MAC protocol .

  9. 您可以通过访问解析树的节点以及合并相似的相邻节点(例如,actor=“TomCruise”和actor=“KellyMcGillis”)来完成该工作。

    You could accomplish this by visiting the nodes of the parse tree and consolidating similar adjacent nodes ( actor = " Tom Cruise " and actor = " Kelly McGillis ", for example ) .

  10. 无线Mesh网络中只有一个或多个节点充当网关节点接入基础设施网络,其他节点通过相邻节点中继连接到网关,再接入到互联网。

    In Wireless Mesh Networks ( WMNs ), only one or several nodes play the role of the network gateway , accessing to Infrastructure / Backbone Networks , and other nodes access Internet in the way of the neighbor nodes relaying them to gateway nodes and then accessing to Internet .

  11. ERP注重通过内部资源集成提高运作效率,SCM强调通过对外部资源的管理来获得效益,而电子商务为SCM中相邻节点的贸易和管理提供了强有力的辅助。

    ERP pays attention to the improvement of operational efficiency with the inside integration of the resource ; SCM obtains benefit by managing outside resource ; the application of e-Business can offer SCM effective assistance in the trade and management of adjacent nodes on the supply chain .

  12. 该算法可以使用机载ADS-B系统所提供的飞机位置信息建立单跳相邻节点的路由表,有效地减少由于路由广播所造成的网络开销。

    In this scheme , we establish routing table for next hop selection by using the position and velocity of aircraft provided by airborne ADS-B system so that the network overhead could be reduced effectively .

  13. 链路群中的所有链路必须拥有同一个相邻节点。

    All the links in a linkset must have the same adjacent node .

  14. 一种相邻节点协作的无线传感器网络可靠传输方案

    Reliable Delivery Scheme for Wireless Sensor Networks Based on Cooperation among Neighboring Nodes

  15. 传感器节点的重要性主要由其相邻节点(包括自己)决定。

    The importance of sensor node reflected from all its neighbors ( including itself ) .

  16. 如果有相邻节点,那么释放的节点与树中的节点合并。

    If so , the freed node is joined with the node in the tree .

  17. 此外,其他节点要保存相邻节点和链路的信息。

    And in addition , other nodes must conserve message of neighborhood nodes and links .

  18. 模型中,每个节点的行为只与其一跳相邻节点和其所处环境有关。

    In the model , each node acts only according to its neighboring nodes and environment .

  19. 树中除根以外的每个节点都代表一个用户,每一条相邻节点之间的路径代表着一个委托关系。

    Each node in the tree refers to a user and each edge to a delegation relation .

  20. A算法利用节点安全级,除了考虑相邻节点的安全状况外,还充分利用了局部扭曲立方体自身特有的结构,使得信息尽可能沿最优路径传递。

    Algorithm A routes messages along optimal paths by utilizing safety levels and the structure of locally twisted cube .

  21. 方法筛选硬膜脑相邻节点,在节点之间增设弹簧单元,模拟硬膜下腔,对模型加载冲击载荷,计算分析硬膜、脑对应节点的相对位移。

    Methods Two-dimensional springs were placed between the nearby nodes of the dura and brain to model the subdural space .

  22. 多个计算节点被安排在三维格点处并与格点的相邻节点形成链路。

    The plurality of calculating nodes is configured on3-d lattice points and forming link with adjacent nodes of the lattice point .

  23. 传递概率在算法中被用来推断相邻节点之间的联系,反映扩展到新节点的权重。

    The transmissive probabilities are used to infer relationships between neighborhood vertices and reflect the weights of getting to newly-expanded vertices .

  24. 该技术通过哈希方式分布元数据对象、自侦测自适应和连续相邻节点备份的方法,实现了元数据的动态扩展和高可用。

    The solution has achieved the goals of high availability and dynamic scalability by means of the Self-Detect-Self-Adopt and Neighboring Node Backup .

  25. 异构无线传感器网络中基于选择分集的节点协作策略一种相邻节点协作的无线传感器网络可靠传输方案

    Selection diversity scheme with node cooperation in heterogeneous WSN Reliable Delivery Scheme for Wireless Sensor Networks Based on Cooperation among Neighboring Nodes

  26. 然而节点关闭射频导致它不能感知周围的通信,因此必须对相邻节点的休眠进行同步。

    If a node turns off radio , it will not realize surrounding communication ; therefore nodes must coordinate on their sleep schedules .

  27. 算法通过建立传感器网络节点运作模型,及相邻节点剩余能量预测机制,优化路由选择。

    Constructing the running model of sensor nodes , predicting the remaining energy of its neighbor nodes , the routing selection was optimized .

  28. 移动无线网相邻节点间匿名通信策略结果表明,相邻格点电子间的库仑排斥在计算超导转变温度时,不能忽略。

    The results show that the coulomb repulsion of electrons between nearest neighbour sites is not negligible in the calculation of superconducting transition temperature .

  29. 这一协议在转发数据包时,首先向相邻节点广播该数据包,然后再在正确接收到数据包的节点中选择一个合适的节点转发。

    CORP forwards data packet by broadcasting it firstly , then selects the most appropriate node among the nodes received this packet to forward it further .

  30. 当改为基于通路搜索后,原来汇聚到一个节点的处理,分散到多个相邻节点进行并行处理,有效地加快了配置速度。

    With the path-based searching techniques , searching tasks originally for a node can be distributed to multiple adjacent nodes , so as to speed up the searching process .