freepeople性欧美熟妇, 色戒完整版无删减158分钟hd, 无码精品国产vα在线观看DVD, 丰满少妇伦精品无码专区在线观看,艾栗栗与纹身男宾馆3p50分钟,国产AV片在线观看,黑人与美女高潮,18岁女RAPPERDISSSUBS,国产手机在机看影片

正文內(nèi)容

外文翻譯—zigbee網(wǎng)絡(luò)中采取有限洪泛源驅(qū)動(dòng)路由協(xié)議減少功耗-外文文獻(xiàn)(參考版)

2025-05-17 05:28本頁(yè)面
  

【正文】 and the last section concludes this paper. 2 Overview of ZigBee Routing Protocols ZigBee technology has two main routing protocols. One of them is tree routing and another is AODV that AODVjr is introduced in this paper rather than it due to the above discussed reason. These approaches are explained as follow. Tree Routing Tree routing algorithm is based on addressing scheme that is named “Cskip”. It assigns an address to each joint node to the work. It operates based on three parameters including the maximum number of router children of a parent Rm, the maximum depth of work Lm and the maximum number of children of a parent Cm. The Addresses are calculated by Cskip(d) and assigned to nodes by their parents. It is calculated from below formula: In this formula , d is the depth of a router node in the work. If Cskip(d) is 0, the router node cannot accept other nodes as child of it. A router node can distribute addresses to its child, if its Cskip(d) is greater and equal than 1. The address of the first node that joins to a node is one more than its parent node and the next router children node will have an address that has Cskip(d) difference with previous router children node. If the address of parent node is supposed Ap, the address of its nth router child Arp will be: and the address of its mth enddevices will be : After the assigning address to all the nodes tree routing algorithm uses it and parent children relationships between nodes for sending packets. When a node receives a packet, it must send it based on destination address to its child or parent. If the address of destination is between the address of its child, it will send that packet to it else it will send it to its parent. AODVjr This algorithm uses broadcasting routing packets for finding a path between source and destination as it was said before. When destination node receives RREQ, it sends RREP to source node for creating a suitable node between them that is shown in figure 2. For understanding that the path is active, destination transmits connect message to source periodically . Fig. 2. Route Discovery in AODVjr 3 Using Limited Flooding in AODVjr Broadcasting the RREQ packet in the work consumes a high level of power and in the ZigBee technology which uses batteries as a power supply generally。此外,仿真的結(jié)果 驗(yàn)證 了上 述論證 方案 。做這方面的工作, 減少 源和目的 節(jié)點(diǎn) 之間 發(fā)送數(shù)據(jù)包的數(shù)量。它限制了 在 AODV路由算法 中使用樹(shù)路由 算法使用的廣 播路由數(shù)據(jù)包。因此,發(fā)送路由數(shù)據(jù)包或通信 消耗 將攀升。節(jié)點(diǎn)的數(shù)量太高 會(huì)導(dǎo)致網(wǎng)絡(luò)深度的上升。在這種情況下, FLAODVjr 發(fā)送通信開(kāi)銷小于 AODVjr。上述參數(shù)的減少會(huì)導(dǎo)致功耗 降低 。節(jié)點(diǎn)的數(shù)目增加至 200 并且 Rm, Cm和 Lm的所有量是相同的,即 7。 4 仿真及結(jié)果 進(jìn)行仿真, 要 使用 OPNET[7]模擬器。當(dāng)一個(gè)節(jié)點(diǎn)要發(fā)送信息到目的 節(jié)點(diǎn) , 它 會(huì) 基于樹(shù)路由信息 制定跳數(shù)。這種方法被命名為 有限洪泛的 AODVjr( FLAODVjr)。當(dāng)每個(gè)節(jié)點(diǎn)發(fā)送 完,其 跳數(shù)遞減一個(gè)單位 。在該方法中,樹(shù)路由的信息用于限制 RREQ 的 分組 洪泛 。 圖 2 AODVjr 中的路由發(fā)現(xiàn) 3 使用有限洪泛的 AODVjr 在網(wǎng)絡(luò)中廣播 RREQ 分組消耗 要很高的 功率 , 這 在一般使用電池作為電源的 ZigBee 技術(shù) 中 ,降低了網(wǎng)絡(luò)的生命周期。當(dāng)目標(biāo)節(jié)點(diǎn)接收到 RREQ,它 會(huì)像 圖 2所示那樣 中 發(fā)送 RREP去 尋 找 它們之間的一個(gè)合適的節(jié)點(diǎn)到源節(jié)點(diǎn)。如果目的地址是其子之間的地址,它會(huì)發(fā)送數(shù)據(jù)包 給其子節(jié)點(diǎn) ,否則將發(fā)送給它的父 節(jié)點(diǎn) 。如果父節(jié)點(diǎn)的地址 AP,第 n個(gè)路由器的 子節(jié)點(diǎn) ARP的地址是: 并且 它的第 m個(gè)終端設(shè)備的地址將是: 分配地址到所有節(jié)點(diǎn)后,樹(shù)路由 算法使用它和 父子 節(jié)點(diǎn) 之間關(guān)系發(fā)送數(shù)據(jù)包。如果其 CSKIP( D)大于等于 1, 一個(gè)路由器節(jié)點(diǎn)可以分配地址到其 子節(jié)點(diǎn) 。 公式如下 :該式中, d是 網(wǎng)絡(luò)中路由節(jié)點(diǎn)的 深度 。它 的 操作 是基于 三個(gè)參數(shù)的基礎(chǔ)上 , 包括 路由器父節(jié)點(diǎn)下最大子節(jié)點(diǎn)數(shù) Lm, 網(wǎng)絡(luò)的最大深度和 父節(jié)點(diǎn)的 最大數(shù)目 Cm。 2 ZigBee 路由協(xié)議概述 ZigBee技 術(shù)有兩個(gè)主要的路由協(xié)議 : 其一是樹(shù) 狀 路由 ,另一個(gè)則是 AODV 樹(shù)狀路由 樹(shù)路由算法是基于 被 稱 為 “CSKIP”的 解決方案。它使用 在 AODVjr 中的樹(shù)狀路由信息。這種差異減少 了 發(fā)送數(shù)據(jù)包的數(shù)量和功率消耗,但 AODVjr 類似在廣播 RREQ 分組 中的AODV,它消耗了 很高的 功率 。它是 為了 了解 一條 路線的情況。 圖 1 ZigBee技術(shù)的拓?fù)浣Y(jié)構(gòu):( a) 星形 ( b)網(wǎng) 狀 ( C) 樹(shù)形 此外,該算法 為 檢測(cè)活動(dòng)節(jié)點(diǎn)定期發(fā)送 Hello報(bào)文 , 此功能會(huì)消耗 功率 , 這對(duì) ZigBee 技術(shù)
點(diǎn)擊復(fù)制文檔內(nèi)容
畢業(yè)設(shè)計(jì)相關(guān)推薦
文庫(kù)吧 www.dybbs8.com
備案圖鄂ICP備17016276號(hào)-1