node connectivity 中文意思是什麼

node connectivity 解釋
點連通度
  • node : n 1 節；結；瘤；【蟲類】結脈。2 【植物；植物學】莖節；【醫學】硬結腫；結，節結；【天文學】交點。3...
  • connectivity : 對外連系
  1. Facilitating the configuration of protocol parameters, optimization of protocol operations, and more exact estimation of protocol performance, etc. basing on combinatorial theory and asymptotic method, we analyzed the properties of manets with nodes uniformly distributed in rectangular region. mathematical formulas of some basic properties of manets are obtained, such as the expected number of wireless links, mean node degree, the relation between network connectivity and radio range

    因此本文第二章基於組合學方法和極限思想研究了矩形區域內節點均勻分佈的無線自組網的幾項基本屬性，網路中鏈路總數的期望值，網路中節點度數分佈情況，以及網路連通性與無線信號傳輸半徑的關系等，得出了其解析描述。
  2. By computer simulation, we compare the channel performance under different node distributions. objects we examined includes connectivity, hop count, collisons on channel and channel capacity

    包括不同分佈情況下的網路連通性、鏈路跳數、通道沖突情況和通道容量。
  3. The second advance is the widespread use of the internet for communication, file transfer, and world wide web connectivity. this thesis describes how to resolve the routing problem in mobile ip using genetic algorithms including optimized routing and routing via a designated node such as triangle routing and reverse tunneling routing and how to evaluate the performance of mobile ip based on wireless lan

    提出了基於矩陣編碼的遺傳演算法來解決帶負載和時延的下一跳路由，解決了下一跳路由中不考慮網路負載和時延可能產生擁塞的問題，優化了網路的性能，使得網路中的帶寬得到合理分配； 2
  4. In addition, our scheme tends to form a scatternet with higher connectivity, communicating between piconets is more efficient, reducing the scatternet formation time and decreasing the number of piconets in the scatternet whenever as possible and aftsf with self - healing capability which solves the node failed or link disconnected problem

    另外，我們為了達成散網擁有更高的連接性，使得在微網之間交流能更有效率，透過降低散網形成的時間並且降低微網在散網中的數量。
  5. The connectivity of the paths is established by the components ' node connections

    這些路徑通過各設備的介面相連接。
  6. The algorithm is composed of two sections. in the first section the nodes in a circuit are arranged in linear time order to preserve simulation validity. in the second section, the nodes in order are divided into several sets whose root is primary input node and nodes in which can be reached by path ; then these sets are united by connectivity among sets into some larger sets, the number of which is equal to that of processors ; at last the sets are assigned to each processor by connectivity among sets

    該演算法主要分為兩個部分，第一部分是將電路中的節點按線性時間順序排序，這樣就保證了模擬過程的正確性；第二部分是將有序節點劃分到以不同原始輸入為根節點的子節點集中，並將這些子節點集按其連接量的大小合併為與處理器數目相等的子節點集合，最後將這些子節點集合按連接量分配到各個處理器上。
  7. This paper presents a fast tracking method of network topology based on a width priority search. only depend on the node numbers of graphic devices and the status of switches, the method can deal with every status of network connectivity quickly

    本文提出了一種基於廣度優先的拓撲演算法，該演算法僅根據圖形設備的節點號和開關的開合狀態，可以對任何結線方式的電力網路進行拓撲。
分享友人
分享到 Line

分享到臉書