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

1、<p><b>　　中文2505字</b></p><p>　　Zigbee網(wǎng)絡(luò)中采取有限洪泛源驅(qū)動路由協(xié)議減少功耗</p><p>　　Arman Zare, Hasan Taheri, and Meisam Nesary Moghaddam</p><p>　　電氣工程學(xué)院，Amirkabir科技大學(xué)，德黑蘭，伊朗</p&g

2、t;<p>　　{arman .zare , htaheri,nesari}@aut.ac.ir</p><p>　　摘要：ZigBee網(wǎng)絡(luò)采用源驅(qū)動路由（AODV）的簡化版本，被稱為AODV簡化協(xié)議（AODVjr）。和AODV相比有三個主要的區(qū)別：它沒有目的節(jié)點(diǎn)的序列號并且在一個節(jié)點(diǎn)崩潰時可以消除發(fā)送錯誤分組信息。第三個不同的是，防止為檢測有源節(jié)點(diǎn)而周期性地發(fā)送HELLO消息并且使用由目的節(jié)點(diǎn)傳送

3、的連接信息。兩者的其他功能都是相同的。其中之一是為尋找最短路徑而在網(wǎng)絡(luò)中發(fā)送的廣播路由請求（RREQ）。它導(dǎo)致網(wǎng)絡(luò)中大量功率消耗。其結(jié)果是，由電池供電的ZigBee節(jié)點(diǎn)會過早衰竭。因此，本文提出了一種ZigBee網(wǎng)絡(luò)中采取有限洪泛的AODVjr（flaodvjr）協(xié)議。這種方法使用的是限制RREQ分組廣播樹路由算法的信息。仿真結(jié)果表明這種方法有其先進(jìn)性。</p><p>　　關(guān)鍵詞：ZigBee，有限洪泛，簡化源

4、驅(qū)動路由協(xié)議，功率消耗</p><p><b>　　1 介紹</b></p><p>　　ZigBee網(wǎng)絡(luò)是提供低數(shù)據(jù)速率，低功耗，低成本和可靠通信的無線網(wǎng)絡(luò)技術(shù)。由于這些特點(diǎn)被用在多種用處。這是對許多不需要高數(shù)據(jù)并有外接電源網(wǎng)絡(luò)的一個最佳選擇，比如自動化監(jiān)測中的應(yīng)用[1]。</p><p>　　ZigBee的物理（PHY）層和介質(zhì)訪問控制（M

5、AC）層是基于IEEE 802.15.4 [2]，是由ZigBee聯(lián)盟[3]開發(fā)。該技術(shù)工作在868MHz、915MHz和2.4GHz無證頻率范圍，數(shù)據(jù)速率20-250kbps還具有10米[2]的覆蓋范圍。</p><p>　　節(jié)點(diǎn)可分為全功能設(shè)備（FFD）和精簡功能設(shè)備（RFD）兩種類型。一個FFD節(jié)點(diǎn)可以作為協(xié)調(diào)器、路由器和終端設(shè)備。事實(shí)上，如果它作為一個協(xié)調(diào)器，它可以形成一個網(wǎng)絡(luò)，并指定加入節(jié)點(diǎn)的地址。此外

6、，它可以作為終端節(jié)點(diǎn)發(fā)送路由數(shù)據(jù)包，即發(fā)送它的信息到父節(jié)點(diǎn)。另一種類型的節(jié)點(diǎn)，RFD，只可以作為網(wǎng)絡(luò)中的終端設(shè)備。從拓?fù)浣嵌葋砜?，ZigBee有三種拓?fù)浣Y(jié)構(gòu)，包括在圖1中所示的星形，樹形和網(wǎng)狀。在星型拓?fù)浣Y(jié)構(gòu)中，有一個協(xié)調(diào)器和其他幾個節(jié)點(diǎn)連接到它。樹結(jié)構(gòu)是基于父、子節(jié)點(diǎn)關(guān)系構(gòu)成的。有一個協(xié)調(diào)器為根的樹和其他子加入的節(jié)點(diǎn)。如果一個子節(jié)點(diǎn)是路由器，它能在某些情況下接受一些子節(jié)點(diǎn)。最后一種拓?fù)浣Y(jié)構(gòu)是網(wǎng)狀的，這種拓?fù)浣Y(jié)構(gòu)有一個協(xié)調(diào)器、一些路由器

7、和終端設(shè)備。如果他們的覆蓋范圍相同，F(xiàn)FD節(jié)點(diǎn)可以與其他節(jié)點(diǎn)通信。因此，源節(jié)點(diǎn)和目標(biāo)節(jié)點(diǎn)之間可能存在一些路徑[3]。</p><p>　　為了找到最短路徑，ZigBee采用基于AODV的路由算法[4]。通過使用廣播路由請求（RREQ），它可以找到合適的路線。目的節(jié)點(diǎn)可能會收到RREQ路徑的包數(shù)。然后，它通過最短路徑發(fā)送路由回復(fù)（RREP）。</p><p>　　圖1 ZigBee技術(shù)的拓

8、撲結(jié)構(gòu)：（a）星形 （b）網(wǎng)狀 （C） 樹形</p><p>　　此外，該算法為檢測活動節(jié)點(diǎn)定期發(fā)送Hello報(bào)文，此功能會消耗功率，這對ZigBee技術(shù)而言是不適合的。他們之間的主要區(qū)別是在AODVjr中不再發(fā)送Hello消息和前體的列表，只是目的節(jié)點(diǎn)發(fā)送連接消息。它是為了了解一條路線的情況。如果源節(jié)點(diǎn)接收到這個包，它可以通過這條路線發(fā)送數(shù)據(jù)包。這種差異減少了發(fā)送數(shù)據(jù)包的數(shù)量和功率消耗，但AODVjr類似在

9、廣播RREQ分組中的AODV，它消耗了很高的功率。因此，本文提出的尋找一種合適的方法，以減少發(fā)送的路由信息包是非常重要的。它使用在AODVjr中的樹狀路由信息。 本文的組織如下：第2節(jié)介紹了ZigBee路由協(xié)議，第3條是有關(guān)建議的路由方法的概述，第4節(jié)給出了所討論的問題的模擬及結(jié)果，最后一節(jié)總結(jié)本文。</p><p>　　2 ZigBee路由協(xié)議概述</p><p>　　ZigB

10、ee技術(shù)有兩個主要的路由協(xié)議：其一是樹狀路由，另一個則是AODV 2.1樹狀路由 樹路由算法是基于被稱為“CSKIP”的解決方案。它分配一個地址到每個加入網(wǎng)絡(luò)中的節(jié)點(diǎn)。它的操作是基于三個參數(shù)的基礎(chǔ)上，包括路由器父節(jié)點(diǎn)下最大子節(jié)點(diǎn)數(shù)Lm，網(wǎng)絡(luò)的最大深度和父節(jié)點(diǎn)的最大數(shù)目Cm。地址由CSKIP（D）和分配給他們父節(jié)點(diǎn)數(shù)計(jì)算出。公式如下：該式中，d是網(wǎng)絡(luò)中路由節(jié)點(diǎn)的深度。</p><p>　　如果CSKIP（

11、d）為0，路由器節(jié)點(diǎn)可以不接受其他節(jié)點(diǎn)作為它的子節(jié)點(diǎn)。如果其CSKIP（D）大于等于1，一個路由器節(jié)點(diǎn)可以分配地址到其子節(jié)點(diǎn)。連接到一個節(jié)點(diǎn)的第一個節(jié)點(diǎn)的地址是一個超過它的父節(jié)點(diǎn)的地址并且下一個子節(jié)點(diǎn)將有一個與以前的路由器子節(jié)點(diǎn)相比具有CSKIP（d）差異的地址。如果父節(jié)點(diǎn)的地址AP，第n個路由器的子節(jié)點(diǎn)ARP的地址是：</p><p>　　并且它的第m個終端設(shè)備的地址將是：</p><p&g

12、t;　　分配地址到所有節(jié)點(diǎn)后，樹路由算法使用它和父子節(jié)點(diǎn)之間關(guān)系發(fā)送數(shù)據(jù)包。當(dāng)一個節(jié)點(diǎn)接收到一個數(shù)據(jù)包時，它必須基于目標(biāo)地址將它發(fā)送到父子節(jié)點(diǎn)。如果目的地址是其子之間的地址，它會發(fā)送數(shù)據(jù)包給其子節(jié)點(diǎn)，否則將發(fā)送給它的父節(jié)點(diǎn)。</p><p>　　2.2 AODVjr</p><p>　　該算法會像之前說的那樣采用廣播數(shù)據(jù)包路由尋找源和目的地之間的路徑。當(dāng)目標(biāo)節(jié)點(diǎn)接收到RREQ，它會像圖2所

13、示那樣中發(fā)送RREP去尋找它們之間的一個合適的節(jié)點(diǎn)到源節(jié)點(diǎn)。為明確這個路徑是活躍的，目的節(jié)點(diǎn)定期傳送連接消息至源節(jié)點(diǎn)。</p><p>　　圖 2 AODVjr中的路由發(fā)現(xiàn)</p><p>　　3 使用有限洪泛的AODVjr </p><p>　　在網(wǎng)絡(luò)中廣播RREQ分組消耗要很高的功率，這在一般使用電池作為電源的ZigBee技術(shù)中，降低了網(wǎng)絡(luò)的生命周期。為減小

14、發(fā)送的網(wǎng)絡(luò)中路由數(shù)據(jù)包的數(shù)目，提出一種方法，該方法[6]被施加到AODVjr中。在該方法中，樹路由的信息用于限制RREQ的分組洪泛。此數(shù)據(jù)包將被跳數(shù)不為0的節(jié)點(diǎn)發(fā)送。當(dāng)每個節(jié)點(diǎn)發(fā)送完，其跳數(shù)遞減一個單位。因此，我們可以用它來限制廣播RREQ包。這種方法被命名為有限洪泛的AODVjr（FLAODVjr）。</p><p>　　每個節(jié)點(diǎn)都有一個基于CSKIP解決方案的唯一地址。當(dāng)一個節(jié)點(diǎn)要發(fā)送信息到目的節(jié)點(diǎn)，它會基于

15、樹路由信息制定跳數(shù)。樹路由中，當(dāng)節(jié)點(diǎn)A想要發(fā)送數(shù)據(jù)包到節(jié)點(diǎn)B，該數(shù)據(jù)包發(fā)送到節(jié)點(diǎn)A和B的第一個共同的源然后，它發(fā)送數(shù)據(jù)包到節(jié)點(diǎn)B，因此，它們之間的跳數(shù)Ht的是與從源到A的跳數(shù)的總和相等，并且源和B Ht之間，可以計(jì)算出通過尋找甲乙與所述第一共同的源的深度的差異。</p><p><b>　　4仿真及結(jié)果</b></p><p>　　進(jìn)行仿真，要使用OPNET[7]模

16、擬器。在這種情況下，區(qū)域范圍為100m×100m并且工作頻率是2.4GHz與250Kbps的。節(jié)點(diǎn)的數(shù)目增加至200并且Rm，Cm和Lm的所有量是相同的，即7。此外，實(shí)現(xiàn)了當(dāng)目的地節(jié)點(diǎn)是隨機(jī)的， AODVjr 的耗能是超過FLAODVjr的，這是實(shí)驗(yàn)的預(yù)期目標(biāo)。上述參數(shù)的減少會導(dǎo)致功耗降低。 圖3演示了這兩種方法的通信耗能。在這種情況下，F(xiàn)LAODVjr發(fā)送通信開銷小于AODVjr。這種差異會隨著網(wǎng)絡(luò)中的節(jié)點(diǎn)的數(shù)目增加

17、而上升。節(jié)點(diǎn)的數(shù)量太高會導(dǎo)致網(wǎng)絡(luò)深度的上升。源和目的節(jié)點(diǎn)之間的跳數(shù)也會隨之增加。因此，發(fā)送路由數(shù)據(jù)包或通信消耗將攀升。</p><p>　　圖3 AODVjr 和 FLAODVjr耗能比較圖</p><p><b>　　5結(jié)論</b></p><p>　　本文提出一種降低ZigBee技術(shù)功耗的方案。它限制了在AODV路由算法中使用樹路由算法使

18、用的廣播路由數(shù)據(jù)包。跳數(shù)根據(jù)樹算法對應(yīng)的參數(shù)設(shè)置。做這方面的工作，減少源和目的節(jié)點(diǎn)之間發(fā)送數(shù)據(jù)包的數(shù)量。由此，因發(fā)送數(shù)據(jù)包而節(jié)省的功率有助于增加網(wǎng)絡(luò)的生命周期。此外，仿真的結(jié)果驗(yàn)證了上述論證方案。</p><p><b>　　參考文獻(xiàn)</b></p><p>　　1. Lin, S.: ZigBee Based Wireless Sensor Networks and

19、 Its Applications in Industrial. In: IEEE International Conference on Automation and Logistics, pp. 1979–1983. IEEE Xplore, Jinan (2007)</p><p>　　2. IEEE Standard 802.15.: Standard for Information Technology

20、-telecommunications and information exchange Systems between systems - Local and metropolitan area networks(2006), http://www.standards.ieee.org/</p><p>　　3. Li, J., Zhu, X., Tang, N., Sui, J.: Study on ZigB

21、ee Network Architecture and Routing Algorithm. In: International Conference on Signal Processing Systems, pp. 389–393. IEEE Xplore, Dalian (2010)</p><p>　　4. Perkins, C.E., Royer, E.M.: Ad Hoc On-Demand Dist

22、ance Vector Routing. In: Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90–100. IEEE Xplore, New Orleans (1999)</p><p>　　5. Chakeres, I.D., Klein-Berndt, L.: AODVjr, AODV Simplified. ACM

23、 Mobile Computing and Communications Review, 100–101 (2002)</p><p>　　6. Lin, Z., Meng, Q.H., Liang, H.: A Route Discovery Method Based on Limited Flooding in ZigBee Network. In: IEEE International Conference

24、 on Automation and Logistics, Qingdao, pp. 3039–3044 (2008)</p><p>　　7. OPNET Network Simulator Software, http://www.opnet.com</p><p>　　Using Limited Flooding in On-Demand Distance Vector Junior

25、 for Reduction Power Consumption in ZigBee Networks</p><p>　　Arman Zare, Hasan Taheri, and Meisam Nesary Moghaddam</p><p>　　Electrical Engineering Faculty, Amirkabir University of Technology, Te

26、hran, Iran</p><p>　　{arman .zare , htaheri,nesari}@aut.ac.ir</p><p>　　Abstract. ZigBee network uses the simplified version of on-demand distance vector (AODV) routing which is named AODV junior

27、(AODVjr). There are three main differences between it and AODV. It does not have sequence number of destination and eliminates the sending error packet when a node crashes. The third difference is preventing form sending

28、 Hello messages periodically for detecting the active nodes and use connect message that it sends by destination node. The other features are the same in bo</p><p>　　Keywords: ZigBee, Limited Flooding, AODVj

29、r, Power Consumption.</p><p>　　1 Introduction </p><p>　　ZigBee network is a wireless network technology which provides low data rate, low power consumption, low cost and reliable communications.

30、 It is used in a variety ofapplications due to these features. It is one of the best choices for many networks that they do not need to high data and have restrictions in the accessing in power supplies such as automatio

31、n and monitoring applications [1].</p><p>　　The Physical (PHY) and Medium Access Control (MAC) layers of ZigBee are based on IEEE 802.15.4 [2]. It is developed by ZigBee Alliance [3]. This technology operate

32、s in unlicensed frequency range of 868MHz, 915MHz and 2.4GHz with data rate 20-250kbps and also has a coverage range of 10-100m [2].</p><p>　　The nodes are divided into two types that include Full Function D

33、evice (FFD) and Reduced Function Device (RFD). A FFD node can act as a coordinator, router and end-device. In fact, it can form a network and specify address to joint nodes, if it acts as a coordinator. Also, it enables

34、to route the packets and plays the role of end-device, namely, send its information to parent node. Another type of node, RFD, can just be end-device in the network. From topological point of view, ZigBee has three </

35、p><p>　　certain circumstances. The last topology is mesh. This topology has a coordinator and some routers and end-devices. The FFD nodes can communicate with others, if they are in the coverage range of togeth

36、er. Thereby, there are maybe some paths between source and destination [3].</p><p>　　For finding shortest path, ZigBee uses routing algorithm based on AODV [4]. It can find the appropriate route by the use o

37、f broadcasting Route Request (RREQ). The destination node may receive RREQ packet from several paths.Then, it sends Route Reply (RREP) through shortest path</p><p>　　Fig. 1. Topologies of ZigBee Technology:

38、(a). Star, (b). Mesh and (C). Tree.</p><p>　　Also, this algorithm sends Hello message periodically for detecting active nodes. This feature consumes energy that is not suitable for ZigBee technology. Therefo

39、re, 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 unde

40、rstanding the situation of a route. If source node receives this packet, it can send their packet from that route. Thi</p><p>　　The paper is organized as follows: section 2 introduces the overview of ZigBee

41、routing protocol, section 3 is about the suggested routing method, section 4 presents the simulations of the discussed issues and the results of them; and the last section concludes this paper.</p><p>　　2 Ov

42、erview of ZigBee Routing Protocols</p><p>　　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

43、 above discussed reason. These approaches are explained as follow.</p><p>　　2.1 Tree Routing</p><p>　　Tree routing algorithm is based on addressing scheme that is named “Cskip”. It assigns an ad

44、dress 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 paren

45、t 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</p><p>　　and the a

46、ddress of its mth end-devices will be : </p><p>　　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

47、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

48、. </p><p>　　2.2 AODVjr</p><p>　　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

49、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 .</p><p>

50、;　　Fig. 2. Route Discovery in AODVjr</p><p>　　3 Using Limited Flooding in AODVjr</p><p>　　Broadcasting the RREQ packet in the network consumes a high level of power and in the ZigBee technology

51、which uses batteries as a power supply generally; it reduces the lifetime of the network.</p><p>　　For decreasing the number of sent routing packets in the network, a method that has suggested in [6] is a

52、pplied 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, the

53、ir 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).</p><p>　　Each node has a unique ad

54、dress 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 pack

55、et to node B, the packet send to the first common 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 firs

56、t ancestor and between that ancesto</p><p>　　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 th

57、e 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 common ances

58、tor, it starts searching from d=0 until Lm-1 (because, nodes in the last depth is leaves of tree and cannot be parents</p><p>　　After calculating the Ht and setting the hop count equal to it, destination nod

59、e receives RREQ packet. Sometimes the optimal hop count is not Ht. Because, in tree routing, it is possible that source and destination are in the coverage range of together or destination can receive packets, if it is i

60、n the coverage range of a router node that is not its parent but it can ensure that packets receive to their destinations. It can reduce the number of sent RREQ packet. As a consequence, the amount of </p><p&g

61、t;　　4 Simulations and Results</p><p>　　For simulation, OPNET [7] simulator is used. In this case, area is considered100m×100m and operational frequency is 2.4GHz with 250Kbps. Also, the number of nodes

62、increases up to 200 and the all amounts of Rm, Cm and Lm are the same, namely, 7. Also, achieving to comparison of the amounts of sent overhead is the goal of experiments in the AODVjr and FLAODVjr methods when the desti

63、nation node is random. Reduction in mentioned parameter causes reduction in power consumption.</p><p>　　Figure 3 demonstrates the amount of communication overhead of both approaches. In this case, FLAODVjr s

64、ends communication overhead less than another. This difference rises with increasing the number of node in the network. The high number of nodes causes the rising in the depth of the network. It increases the number of h

65、ops between source and destination. Thereby, sent routing packets or communication overhead will climb .</p><p>　　Fig. 3. Comparison of Overhead in AODVjr and FLAODVjr</p><p>　　5 Conclusion</

66、p><p>　　In this paper, a method is suggested for reducing in power consumption of ZigBee Technology. It limits the broadcasting routing packets that use in AODV routing algorithm by the use of tree routing’s al

67、gorithm. The amount of hop count is set based on counterpart parameter in tree algorithm. Doing this work decreases the number of sent packets for finding the path between source and destination. Thereby, the consumed en

68、ergy for sending mentioned packets is reduced and it helps to increase the lif</p><p>　　References</p><p>　　1. Lin, S.: ZigBee Based Wireless Sensor Networks and Its Applications in Industrial.

69、In: IEEE International Conference on Automation and Logistics, pp. 1979–1983. IEEE Xplore, Jinan (2007)</p><p>　　2. IEEE Standard 802.15.: Standard for Information Technology-telecommunications and informati

70、on exchange Systems between systems - Local and metropolitan area networks(2006), http://www.standards.ieee.org/</p><p>　　3. Li, J., Zhu, X., Tang, N., Sui, J.: Study on ZigBee Network Architecture and Routi

71、ng Algorithm. In: International Conference on Signal Processing Systems, pp. 389–393. IEEE Xplore, Dalian (2010)</p><p>　　4. Perkins, C.E., Royer, E.M.: Ad Hoc On-Demand Distance Vector Routing. In: Second I

72、EEE Workshop Mobile Computing Systems and Applications, pp. 90–100. IEEE Xplore, New Orleans (1999)</p><p>　　5. Chakeres, I.D., Klein-Berndt, L.: AODVjr, AODV Simplified. ACM Mobile Computing and Communicati

73、ons Review, 100–101 (2002)</p><p>　　6. Lin, Z., Meng, Q.H., Liang, H.: A Route Discovery Method Based on Limited Flooding in ZigBee Network. In: IEEE International Conference on Automation and Logistics, Qin