【正文】 g 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。它限制了 在 AODV路由算法 中使用樹路由 算法使用的廣 播路由數(shù)據(jù)包。上述參數(shù)的減少會導(dǎo)致功耗 降低 。這種方法被命名為 有限洪泛的 AODVjr（ FLAODVjr）。當(dāng)目標(biāo)節(jié)點接收到 RREQ，它 會像 圖 2所示那樣 中 發(fā)送 RREP去 尋 找 它們之間的一個合適的節(jié)點到源節(jié)點。 公式如下 ：該式中， d是 網(wǎng)絡(luò)中路由節(jié)點的 深度 。這種差異減少 了 發(fā)送數(shù)據(jù)包的數(shù)量和功率消耗，但 AODVjr 類似在廣播 RREQ 分組 中的AODV，它消耗了 很高的 功率 。 為了找到最短路徑， ZigBee 采用基于 AODV 的 路由算法 [4]。從拓?fù)浣嵌葋砜矗?ZigBee 有三 種 拓?fù)浣Y(jié)構(gòu)，包括在圖 1 中所示的星形，樹形和網(wǎng)狀。這是對許多不需要高數(shù)據(jù)并有外接電源網(wǎng)絡(luò)的一個最佳選擇，比如自動化監(jiān)測中的應(yīng)用 [1]。其中之一是為尋找最短路徑而在網(wǎng)絡(luò)中發(fā)送的廣播路由請求（ RREQ）。兩者的其他功能都是相同的。由于這些特點被用在多種用處。另一種類型的節(jié)點， RFD， 只可以作為 網(wǎng)絡(luò)中的終端設(shè)備。因此，源 節(jié)點 和目標(biāo)節(jié)點 之間 可能存在 一些路徑 [3]。如果源節(jié)點接收到這個包，它可以 通過這條路線發(fā)送數(shù)據(jù)包 。 地址由 CSKIP（ D）和分配給他們 父 節(jié)點 數(shù)計算出 。 AODVjr 該算法 會像之前說的那樣 采用廣播數(shù)據(jù)包路由尋找源和目的地之間的路徑。因此，我們可以用它來限制廣播 RREQ包。此外，實現(xiàn)了 當(dāng)目的地節(jié)點是隨 機的 ， AODVjr 的耗能是超過 FLAODVjr 的 ，這是 實驗 的 預(yù)期 目標(biāo)。 圖 3 AODVjr 和 FLAODVjr 耗能比較圖 5 結(jié)論 本文提出一種 降低 ZigBee技術(shù)功耗的 方案 。 it reduces the lifetime of the work. For decreasing the number of sent routing packets in the work, a method that has suggested in [6] is applied to AODVjr. In this method, the information of tree routing is used for limiting the flooding of RREQ packet. This packet will be sent by nodes, if the amount of hop count is not 0. When each node transmits it, their amounts of hop count decrement one unit. Therefore, we can use it for limitation of broadcasting RREQ packet. This method is named Flooding Limitation AODVjr (FLAODVjr). Each node has a unique address based on Cskip addressing scheme. When a node wants to send its information to a destination, it set the amount of hop count based on information of tree routing. In the tree routing, when node A wants to send packet to node B, the packet send to the first mon ancestor of node A and B. Then, it sends the packet to node B. Hence, the number of hops between them Ht is equal with the sum of the number of hops from A until the first ancestor and between that ancestor and B. Ht can be calculated by finding the difference of depth A and B with the first mon ancestor. For finding the depth of nodes, if the address of sender is 0, it is coordinator with depth 0. If it is greater than 0, will start searching in the depth 0. If the parent of node is in that depth, its depth will be 1 else, will continue searching in next depth until Lm. when a node can find the depth of its parent dp, its depth is dp+1. For finding the depth of first mon ancestor, it starts searching from d=0 until Lm1 (because, nodes in the last depth is leaves of tree and cannot be parents of other nodes). At first, searching starts in the child of depth 0, namely, in the router child of the coordinator. It supposes the address of the first mon ancestor is 1. If the address of A and B are in the range of