【正文】 m based on AODV [4]. It can find the appropriate route by the use of broadcasting Route Request (RREQ). The destination node may receive RREQ packet from several , it sends Route Reply (RREP) through shortest path Fig. 1. Topologies of ZigBee Technology: (a). Star, (b). Mesh and (C). Tree. Also, this algorithm sends Hello message periodically for detecting active nodes. This feature consumes energy that is not suitable for ZigBee technology. Therefore, the use of AODVjr [5] is suggested in [3].The main difference between them is that sending Hello message and precursor list are eliminated in AODVjr and just destination node transmits connect message. It is for understanding the situation of a route. If source node receives this packet, it can send their packet from that route. This difference reduces the number of sent packets and power consumption but AODVjr is similar to AODV in broadcasting RREQ packet that it consumes a high level of energy. Thus, finding a suitable method for reduction in sending routing packets is very important that is suggested in this paper. It use information of tree routing in AODVjr. The paper is organized as follows: section 2 introduces the overview of ZigBee routing protocol, section 3 is about the suggested routing method, section 4 presents the simulations of the discussed issues and the results of them。跳數(shù) 根據(jù)樹算法對應(yīng)的參數(shù) 設(shè)置。 圖 3演示了這兩種方法的通信 耗能 。 每個節(jié)點都有一個 基于 CSKIP 解決方案 的 唯一地址。為 明確 這個路徑是 活躍 的，目的 節(jié)點 定期 傳送連接消息 至 源 節(jié)點 。 如果 CSKIP（ d）為 0，路由器節(jié)點可以不接受其他節(jié)點作為它 的子節(jié)點 。因此，本文提出 的 尋找一種合適的方法，以減少發(fā)送 的 路由信息包是非常重要的。通過使用廣播路由請求（ RREQ），它可以找到合適的路線。在星型拓?fù)浣Y(jié)構(gòu)中，有一個協(xié)調(diào) 器 和其他幾個節(jié)點連接到它。 ZigBee的物理（ PHY）層和介質(zhì)訪問控制（ MAC）層是基于 IEEE [2]， 是由 ZigBee 聯(lián)盟 [3]開發(fā)。它導(dǎo)致網(wǎng)絡(luò)中大量 功率 消耗。第三個不同的是，防止為檢測有源節(jié)點而周期性地發(fā)送 HELLO消息并且使用由目的節(jié)點傳送的連接信息。 關(guān)鍵詞 ： ZigBee，有限 洪泛 ， 簡化 源驅(qū)動 路由 協(xié)議 ，功率消耗 1 介紹 ZigBee 網(wǎng)絡(luò)是提供低數(shù)據(jù)速率，低功耗，低成本和可靠通信的無線網(wǎng)絡(luò)技術(shù)。此外， 它可以作為終端節(jié)點發(fā)送路由數(shù)據(jù)包 ，即發(fā)送它的信息到父節(jié)點。如果他們 的 覆蓋范圍 相同， FFD節(jié)點可以與 其他節(jié)點通信 。它是 為了 了解 一條 路線的情況。它 的 操作 是基于 三個參數(shù)的基礎(chǔ)上 ， 包括 路由器父節(jié)點下最大子節(jié)點數(shù) Lm， 網(wǎng)絡(luò)的最大深度和 父節(jié)點的 最大數(shù)目 Cm。如果目的地址是其子之間的地址，它會發(fā)送數(shù)據(jù)包 給其子節(jié)點 ，否則將發(fā)送給它的父 節(jié)點 。當(dāng)每個節(jié)點發(fā)送 完，其 跳數(shù)遞減一個單位 。節(jié)點的數(shù)目增加至 200 并且 Rm， Cm和 Lm的所有量是相同的，即 7。因此，發(fā)送路由數(shù)據(jù)包或通信 消耗 將攀升。 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 routin