Responsive image
博碩士論文 etd-0701114-120427 詳細資訊
Title page for etd-0701114-120427
論文名稱
Title
應用於資料蒐集無線網路之具蟲洞之串鏈式路由演算法
Linked List Routing Algorithm with Wormhole Mechanism for Data Collecting Wireless Network
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
81
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2014-07-25
繳交日期
Date of Submission
2014-08-20
關鍵字
Keywords
資料蒐集、串鏈式網路、蟲洞網路、物聯網
Wormhole, Linked list network, data collecting, Internet of Things
統計
Statistics
本論文已被瀏覽 5697 次,被下載 1386
The thesis/dissertation has been browsed 5697 times, has been downloaded 1386 times.
中文摘要
由於物聯網的時代來臨,各種應用在物聯網通訊的協定及演算法也跟著被提出。物聯網是由大量無線網路嵌入式裝置所組成,網路拓樸變化大,如何能穩定且正確的在短時間內存取各節點的資料是物聯網的一個很重要的課題。目前存在的路由協定均是用於節點間的資料傳輸,如要用於資料蒐集就必須使用polling的方式,無法一次蒐集完全部節點資料,導致蒐集時間過大,較沒效率。故本論文提出應用於資料蒐集無線網路之具蟲洞之串鏈式路由演算法(Linked List Routing Algorithm with Wormhole Mechanism for Data Collecting Wireless Network),利用串鏈式網路其拓樸方式建構出資料蒐集網路,再利用資料融合的技術可將路徑上的資料一次蒐集回來,如此,資料蒐集的運作即可在同一條路徑上一次完成。另外,當處於節點數量大且密度高的環境中時,需要更加龐大的路由表及鄰居表來維持路由資訊,這對受限於嵌入式硬體記憶體大小的無線感測裝置來說是一個挑戰,串鏈式網路具有極簡易的鄰居表,除了不需要花很多時間尋找路由外,不受限於記憶體大小,網路範圍可不斷延伸,具有高度擴展性是適用於物聯網的特色,加上蟲洞網路的建立,改變傳統串鏈式網路跳躍數過多的問題,提升資料蒐集效率。本論文路由協定開發了網路佈建方式、新節點如何加入、路徑斷裂的資料跳躍與斷裂節點修復,並開發出一套完整指令並說明如何利用該指令有效地蒐集資料。我們利用硬體實作來驗證我們的路由協定確實可以用在無線感測網路並蒐集資料,並由NS2模擬工具來對具蟲洞之串鏈式路由進行效能測試並和AODV做比較,由測試結果可發現當節點數大幅提升時,我們的路由協定在資料蒐集時間上相比AODV之下有大幅的減少。未來我們希望利用此路由演算法在資料存取上的優勢,能應用在任何需要資料蒐集的環境如醫院或安養院老人的健康狀況監控、路燈電力監控、數位家庭等,讓物聯網的實現往前邁進一大步。
Abstract
Due to the development of the Internet of Things(IOT), many communications protocols and routing algorithm used in IOT have been proposed. IOT is composed of numerous wireless embedded systems and its topology changes a lot. How to collect data stably within a short time is an important issue. However, the existing routing protocols are mostly used for data transmission and it’s inefficient if used in data collection with polling manner. Therefore, we proposed a Linked List Routing Algorithm with Wormhole Mechanism for Data Collecting Wireless Network. Using linked list topology to construct a data collecting network, in which data collecting behavior can be completed on the same path so that we can gather data at one time by data fusing operation. Moreover, when the number of node rise, we need a larger neighbor table and routing table to keep routing information correct, it will become a challenge due to the embedded system’s memory. Linked list network has simple routing table and neighbor table, we won’t spend too much time in path finding and it won’t limit by embedded system’s memory so that the extensibility is high. In traditional linked list network, the hop count is a big problem, so we add wormhole in our network to improve data collection efficiency. In our protocol, we develop some function such as how to construct a linked list network, how a new node join network, data routing when link failure and node repair. Besides, we develop an instruction and tell you how to collect data by this instruction. In this paper, we implement the routing protocol to verify a data collection in wireless sensor network. The performance of the Linked List Routing Algorithm with Wormhole Mechanism and AODV is compared and simulated by NS2. The simulation results reveal that the mechanism is more efficient than AODV. In the future, we expect that our proposed routing protocol can be used in health monitoring in hospital and sanatorium or power monitoring.
目次 Table of Contents
目錄
論文審定書 i
致謝 ii
摘要 iii
Abstract iv
目錄 vi
圖目錄 viii
表附錄 xi
第一章 簡介 1
1-1 研究動機與目的 1
1-2 論文架構 2
第二章 相關研究 3
2-1 Zigbee路由演算法 3
2-1-1 樹狀網路 3
2-1-2網狀網路 6
2-1-3 路由比較/是否適用於資料蒐集 15
2-2 蟲洞概念 17
2-3 物聯網 18
2-3-1 物聯網簡述 18
2-3-2 6LowWPAN 18
2-3-3 RPL路由協定 19
2-3-4 整體分析與探討 26
2-4 Modbus協議 28
第三章 具蟲洞之串鏈式無線網路 30
3-1 封包格式 31
3-2 路由建立 34
3-2-1 串鏈式網路架構 34
3-2-2 串鏈式網路建立 34
3-2-3 蟲洞網路建構 38
3-3 路由維護 40
3-3-1 節點斷裂-資料跳躍 40
3-3-2 斷裂節點重啟及新節點加入 44
3-4 資料傳輸 45
3-4-1 Modbus延伸指令 49
3-5 資料蒐集延遲分析 51
第四章 實作平台與模擬平台介紹 58
4-1 實作分析 58
4-2 模擬平台 60
4-2-1 NS2介紹 60
4-2-2 NS2上實現串鏈式具蟲洞路由協定 62
第五章 資料分析與探討 64
5-1 資料蒐集時間 64
第六章 結論 66
參考文獻 67
參考文獻 References
參考文獻
[1]Lotf, J.J.; Nazhad, S.H.H.; Alguliev, R.M.,“A Survey of Wireless Sensor Networks,” in Proc. Application of Information and Communication Technologies Conf.AICT’11,Baku, AZE,12~14 Oct. 2011.
[2]Ran Peng, Sun Mao-heng, Zout You-min, “Zigbee Routing Selection Strategy Base on Data Services and Energy-balanced Zigbee Routing,” apscc, pp.400-404, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06), 2006.
[3]T. Kim, D. Kim, N. Park, S. E. Yoo, T. S. Lopez, "Shortcut tree routing in ZigBee networks," in Proc. IEEE International Symposium on Wireless Pervasive Computing, San Juan, Puerto Rico, Feb. 2007.
[4]范世安, “Zigbee 網路之捷徑式樹狀路由改進演算法,” 大同大學通訊工程研究所,台北市,2008.
[5]C.-Y. Zheng; Y.-C. Huang; J.-C. Chiu, “Design and Implementation of Sequential Repair Backup Routing Protocol for Wireless Mesh Network,” In Proc. National Computer Symposium Conf. NCS’11, Chia-Yi, Taiwan, ROC, Dec. 2011.
[6]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.
[7]David B. Johnson, David A. Maltz, and Yih-Chun Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc etworks(DSR),” <draft-ietf-manet-dsr-10.txt> Internet-draft, 19 July 2004.
[8]C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[9]C. E. Perkins, Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv -13.txt, February 2003.
[10]V.D. Park and M.S. Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1,” IETS Internet draft (draft-ietfmanet-tora-spec-04.txt), July 2001.
[11]V.D. Park, J.P. Macker and M.S. Corson, “Applicability of the temporally-ordered routing algorithm for use in mobile tactical networks[C],” Proceedings of MILCOM 98. Boston Marseilles: IEEE, 1998: 426-430.
[12]Z. J. Haas and M. R. Pearlman, “The Zone Routing Protocol(ZRP)for Ad Hoc Networks,” Internet draft, draft-zone-routing-protocol-01.txt, Aug, 1998.
[13]M. R. Pearlman, Z. J. Haas and Syed I. Mir, “Using Routing Zones to Support Route Maintenance in Ad Hoc Networks,” Wireless Communications and Networking Conference, 2000. WCNC. 2000 IEEE, 2000.
[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]Tsung-Chuan Huang, Sheng-Yu Huang and Lung Tang, “AODV-Based Backup Routing Scheme in Mobile Ad Hoc Networks,” in proc. IEEE 2010 International Conference on Communications and Mobile Computing, 2010 IEEE.
[16]Y. C. Hu, A. Perrig, and D. B. Johnson, “Wormhole attacks in wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 2, pp. 370-380, 2006.
[17]M. Dohler, “RFC 5548-Routing Requirement for Urban Low-Power and Lossy Networks,” Internet engineering task force, 2009.
[18]T. Winter, “RFC 6550-RPL:IPv6 Routing Protocol for Low Power and Lossy Networks,” Internet engineering task force, 2012.
[19]Microchip . (2010). dsPIC30F3014/4013Data Sheet [Online]. Available: http:// http://ww1.microchip.com/downloads/en/devicedoc/70138c.pdf
[20]Texas Instruments. (2007, Jun 06). A True System-on-Chip solution for 2.4 GHz IEEE 802.15.4 / ZigBee(TM) (Rev. F) [Online]. Available: http://focus.ti.com/lit/ds/symlink/cc2430.pdf.
[21]曾百由, “數位訊號控制器原理與應用”, 2009年12月.
[22]The Network Simulator-ns-2, [Online]. Available:http://www.isi.edu/nsnam/ns/.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code