【正文】 and the last section concludes this paper.2 Overview of ZigBee Routing ProtocolsZigBee 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 RoutingTree routing algorithm is based on addressing scheme that is named “Cskip”. It assigns an address to each joint node to the network. It operates based on three parameters including the maximum number of router children of a parent Rm, the maximum depth of network 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 network. 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. AODVjrThis 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 AODVjr3 Using Limited Flooding in AODVjrBroadcasting the RREQ packet in the network consumes a high level of power and in the ZigBee technology which uses batteries as a power supply generally。此外，仿真的結(jié)果驗證了上述論證方案。做這方面的工作，減少源和目的節(jié)點之間發(fā)送數(shù)據(jù)包的數(shù)量。它限制了在AODV路由算法中使用樹路由算法使用的廣播路由數(shù)據(jù)包。因此，發(fā)送路由數(shù)據(jù)包或通信消耗將攀升。節(jié)點的數(shù)量太高會導(dǎo)致網(wǎng)絡(luò)深度的上升。在這種情況下，F(xiàn)LAODVjr發(fā)送通信開銷小于AODVjr。上述參數(shù)的減少會導(dǎo)致功耗降低。節(jié)點的數(shù)目增加至200并且Rm，Cm和Lm的所有量是相同的，即7。4仿真及結(jié)果進行仿真，要使用OPNET[7]模擬器。當一個節(jié)點要發(fā)送信息到目的節(jié)點，它會基于樹路由信息制定跳數(shù)。這種方法被命名為有限洪泛的AODVjr（FLAODVjr）。當每個節(jié)點發(fā)送完，其跳數(shù)遞減一個單位。在該方法中，樹路由的信息用于限制RREQ的分組洪泛。圖 2 AODVjr中的路由發(fā)現(xiàn)3 使用有限洪泛的AODVjr 在網(wǎng)絡(luò)中廣播RREQ分組消耗要很高的功率，這在一般使用電池作為電源的ZigBee技術(shù)中，降低了網(wǎng)絡(luò)的生命周期。當目標節(jié)點接收到RREQ，它會像圖2所示那樣中發(fā)送RREP去尋找它們之間的一個合適的節(jié)點到源節(jié)點。如果目的地址是其子之間的地址，它會發(fā)送數(shù)據(jù)包給其子節(jié)點，否則將發(fā)送給它的父節(jié)點。如果父節(jié)點的地址AP，第n個路由器的子節(jié)點ARP的地址是：并且它的第m個終端設(shè)備的地址將是：分配地址到所有節(jié)點后，樹路由算法使用它和父子節(jié)點之間關(guān)系發(fā)送數(shù)據(jù)包。如果其CSKIP（D）大于等于1，一個路由器節(jié)點可以分配地址到其子節(jié)點。公式如下：該式中，d是網(wǎng)絡(luò)中路由節(jié)點的深度。它的操作是基于三個參數(shù)的基礎(chǔ)上，包括路由器父節(jié)點下最大子節(jié)點數(shù)Lm，網(wǎng)絡(luò)的最大深度和父節(jié)點的最大數(shù)目Cm。2 ZigBee路由協(xié)議概述ZigBee技術(shù)有兩個主要的路由協(xié)議：其一是樹狀路由，另一個則是AODV 樹路由算法是基于被稱為“CSKIP”的解決方案。它使用在AODVjr中的樹狀路由信息。這種差異減少了發(fā)送數(shù)據(jù)包的數(shù)量和功率消耗，但AODVjr類似在廣播RREQ分組中的AODV，它消耗了很高的功率。它是為了了解一條路線的情況。圖1 ZigBee技術(shù)的拓撲結(jié)構(gòu)：（a）星形 （b）網(wǎng)狀 （C） 樹形此外，該算法為檢測活動節(jié)點定期發(fā)送Hello報文，此功能會消耗功率，這對ZigBee技術(shù)而言是不適合的。目的節(jié)點可能會收到RREQ路徑的包數(shù)。為了找到最短路徑，ZigBee采用基于AODV的路由算法[4]。如果他們的覆蓋范圍相同，F(xiàn)FD節(jié)點可以與其他節(jié)點通