sink nodes 中文意思是什麼
sink nodes
解釋
阱節點-
Network nodes are divided into clusters in geocrp, sensor nodes send data to their cluster heads and these data are transferred between cluster heads until they reach the sink node, such a hierarchical network structure can increase scalability of the network
Geocrp將網路中的節點劃分成簇，感知節點採集的數據首先傳送到其所在簇的簇頭，再通過簇頭之間的通信進行簇間中繼，直到到達匯聚節點。 -
Considering the limited energy and transmission range of sensor nodes in sensor networks, an innovative routing algorithm named self - adaptive flooding based on delay is proposed. in this algorithm, sources deliver route request packets ( rreq ) and sink answers route reply packets ( rrep ) to build routes. in order not to miss optimum routes with the best metrics, the algorithm is to wait a specific amount of time to ensure that almost the rreq near the best metrics is received
為此本文在無線傳感器網路中研究了基於自適應的路由演算法，主要工作如下:針對傳感器節點能量及傳輸范圍有限等特點，提出了一種基於延遲的自適應洪泛路由演算法，首先通過源節點在網內用較小的路由請求報文和路由回復報文來建立路由，路由建立的過程中自適應地確定等待時間以使更優的路由請求報文得到轉發，然後源節點再沿著建立好的路徑轉發較大的數據報文。 -
Abstract by setting up a network model of data aggregation and using a bit - hop metric to quantify energy costs in wireless sensor networks, we formally analyze the problem of area - based data aggregation and obtain that data aggregation will definitely be energy efficient when the relative difference between the average lengths of the two shortest paths, which are from source sensor nodes to the sink and to the aggregation node respectively, is not less than the ratio of data correlation to the number of source sensor nodes
摘要通過抽象出無線傳感器網路中區域數據回傳的網路模型，定量研究了區域數據聚合的節能條件，證明了先聚合再回傳比直接進行數據回傳所節省的相對路徑長度，如果大於等於數據相關性與源節點個數的比值時，區域數據聚合一定可以節省能耗，並進一步給出了當數據聚合點在網路的不同位置，或數據的空間相關性不同時，區域數據聚合的節能條件。 -
Geocrp incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the sink node, it also utilizes rotation of cluster - heads to evenly distribute the energy load among the sensors nodes in the network
分層的結構有利於網路的擴展，同時，感知節點發送到簇頭的數據會進行融合，以減少傳輸的數據量，提高節點的能源利用率。 -
Lengthened the life of wireless sensor network has become critical to widely apply it. the network considered in this paper consists of tiny energy - constrained sensors massively deployed, along with one or more sink nodes providing interface to the outside world. our contribution is to propose a scalable energy - efficient routing protocol in their working process for nodes that are initially anonymous, unaware of their location based on researching predecessor ’ s routing protocols and profiting from their designed thought
本文針對由大量的能量有限的傳感器組成的通過一個或多個sink節點作為介面與外界通訊的無線傳感器網路進行研究，分析了現有的無線傳感器網路網路層路由協議，借鑒現有網路層路由協議的設計思想，在無線傳感器網路網路層路由方面提出了一種改進協議，此協議能使初始不確定的，不知具體位置的傳感器節點在工作過程中能量相對均勻消耗。 -
Finally, in order to resolve the problem that energies of nodes near the sink deplete too fast, the influence of redundant sensor nodes distribution is researched. layered network architecture based on regular hexagonal cells is introduced. taking cells as the minimum working units instead of sensor nodes, optimal distribution of redundant nodes is investigated so that network lifetime can be prolonged as much as possible
介紹了基於正六邊形網格的分層網路結構;以網格作為網路的最小工作單元，研究了如何分配無線傳感器網路的冗餘節點來延長網路壽命;通過對網路壽命的分析，獲得了由各層網格的冗餘節點倍數向量rn 、 1 - n層節點倍增值rt和分配剩餘冗餘節點的概率密度函數f （ k ）共同構成的網路冗餘節點最優分佈條件。
分享友人