Zigbee是一種低傳輸速率之無線通訊技術，屬於無基礎架構無線網路，並具網路自我修復能力。其網狀網路繞徑演算法有Tree及On Demand routing。當網路範圍較大，Tree routing參數設定不當將造成節點位址無法取得的問題，若採用On Demand routing繞徑方式在穩定具週期性的傳輸下，其效能表現與Tree routing相當，故本論文嘗試在對稱式路燈架構下採用On Demand routing建立資料傳送路徑。Zigbee On Demand routing類似AODV(Ad-hoc On-demand Distance Vector routing)，其在頻寬有限的網路下若要能夠有效的傳輸訊息，必須盡量減少找尋及維護路徑的控制訊號以解決碰撞造成的網路效能低下問題。本論文根據Sung-Ju Lee和Mario Gerla提出的AODV-BR (Backup route)方案，提出AODV-BN (Backup Node)來建置網狀網路備份多路徑。此演算法在不增加其他控制訊號負載(Overhead)前提下，使用原來AODV當中的RREP控制訊號來建置備份節點，並透過竊聽封包建立Neighbor table而不用週期性發送Hello Message，如此除可減少電力及頻寬的資源消耗，當有節點離開網路時，本演算法可使用非常少量的控制訊號即可使用備份節點修復路徑，如此可有效減少控制訊號在網路上造成碰撞，提高網路傳輸效能。最後我們經模擬來評估效能上的改善，AODV-BN確實可減少路徑搜尋控制封包的數量近而改善throughput。

Zigbee is a non-infrastructural wireless network which has low data rate and self-reconstruct capacity. There are two routing algorithms for Zigbee mesh network : Tree routing and On Demand routing. If the parameter is setting improperly in a large scale of network, Tree routing algorithm will cause the problem of device addressing. Some researches show that the efficiency of On Demand routing is as well as the Tree routing in periodic data transmition. Therefore, this paper attempts to using On Demand routing protocol to construct the data transfer path in symmetric street light structure. Like AODV(Ad-hoc On-demand Distance vector), we must reduce control message to find the route in limited bandwidth network. We propose AODV-BN(Backup Next) according to Sung-Ju Lee and Mario Gerla’s algorithm, “AODV-BR”. AODV-BN only use RREP message to find the back up node and get the neighbor table by eavesdropping instead of sending Hello Message. So we can use very small amount of control messages to fix the broken route and reduce the collision. Finally, we use NS-2(Network Simulation) to simulate the performance of AODV-BN. The simulation results present that our methods reduce the control message indeed and improve the throughput of the network.

摘要..............................................................................5
ABSTRACT.................................................................7
第一章 導論 ................................................................11
1.1簡介........................................................................11
1.2研究動機................................................................12
第二章 相關研究工作.................................................15
2.1 Zigbee 通訊協定簡介..........................................15
2.1.1 網路架構............................................................15
2.1.2 Zigbee定址模式................................................17
2.1.3 Superframe架構..............................................18
2.1.4 資料傳輸模型 (Data transfer model)............19
2.2 Zigbee路由演算法...............................................21
2.2.1樹狀網路.............................................................22
2.2.2網狀網路.............................................................23
第三章 AODV-BN改良機制介紹...............................29
3.1 基本構想............................................................. 29
3.2 Backup Node備份節點建置............................. 30
3.3備份節點使用........................................................32
3.4 單向路徑搜尋建立雙向路由.............................. 34
第四章 模擬與分析.....................................................35
4.1 ns2模擬環境的建構............................................35
4.2 模擬實驗...............................................................36
4.2.1 節點個數vs. 路徑搜尋次數..............................37
4.2.2 節點個數vs. RREQ廣播次數..........................38
4.2.3 節點個數vs. 訊息碰撞次數..............................39
4.2.4 節點個數vs. 端對端平均傳輸延遲..................40
4.2.5 節點個數vs.傳輸訊息數...................................41
第五章 結論 .................................................................42
參考文獻......................................................................43

[1] Zigbee Alliance, Network Layer Specification 1.0, Dec. 2004.
[2] AN965, Microchip Stack for the Zigbee Protocol, 2007
[3] “Wireless Medium Access Control and Physical Layer Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs),” IEEE Std 802.15.4-2003, IEEE Computer Society, 01 October 2003.
[4] Shortcut Tree Routing in Zigbee Networks, Taehong Kim, Daeyoung Kim, Noseong Park, Seong-eun Yoo, Tomás Sánchez López, 16 Apr 2007
[5] Introduction to Algorithms,Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Second Edition. MIT Press and McGraw-Hill, 2001. Section 24.3: Dijkstra's algorithm, pp.595–601.
[6] Dynamic source routing in ad hoc wireless networks, David B. Johnson David A. Maltz, 1996
[7] M. Marina and S. Das, “On-Demand Multi-Path Distance Vector Routing in Ad Hoc Networks,” Proceedings of IEEE International Conference on Network Protocols (ICNP’01), Nov. 2001.
[8] Ian D. Chakeres, Luke Klein-Verndt. AODVjr,AODV Simplified[J]. Mobile Computing and Communication Review,2002,6(3):100-101.
[9] C. E. Perkins, Ad Hoc Networking, Addison Wesley, 2001
[10]Best,P., Gundeti, S., Pendse, R., “Self-learning ad-hoc routing protocol” Vehicular Technology Conference, 2003. Vol. 5, pp. 2824-2828
[11] E. M. Royer and C. –K. Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Networks,” IEEE Personal Communications, vol. 6, no. 2, April 1999, pp. 46-55.
[12] S. Kim, W. Noh, and S. An, “Multi-Path Ad Hoc Routing Considering Path Redundancy”, Computers and Communication(ISCC’03), 2003, pp.45-50.
[13] S. J. Lee and M. Gerla, “Split Multi-Path Routing with Maximally Disjoint Paths in Ad Hoc Networks”, Proceedings of IEEE ICC”01, June 2001.
[14] S. J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks”, Proceedings of IEEE WCNC 2000, Chicago, IL, Sep. 2000.
[15] C. E. Perkins, Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, Internet Draft, draft-ietf-manet-aodv -13.txt, Februaty 2003.
[16] 翟雷，劉盛德，胡咸斌 編著，Zigbee 技術及應用， 北京航空航天大學出版社，2007
[17] ns2 simulation: http://www.isi.edu/nsnam/ns/
[18] Ran Peng, Sun Mao-heng, Zout You-min, “Zigbee Routing Selection Strategy Based on Data Services and Energy-balanced Zigbee Routing”, apscc, pp.400-404, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06), 2006
[19] Perkin, Charles E. and Bhagwat, Pravin, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobil Computers”, In Proc, ACM SIGCOMM Conference (SIGCOMM 94), pages 234-244, August 1993
[20] David B. Johnson. “Routing in Ad Hoc Networks of Mobile Hosts”, Proceddings of the Workshop on Mobile Computing Systems and Applications, pp. 158-163, IEEE Computer Society, Santa Cruz, CA, December 1994.
[21] Ian D. Chakeres, and Luke Klein-Berndt, “AODVjr, AODV Simplified”, Mobile Computing and Communications Review, Volumn 6, Number 3, pp. 1-2, July 2002.