因應近年智慧城市的概念漸漸的盛行，為了以各式傳感器有效的管理並收集城市中的各種資料，能適用於無線個人區域網路（Low-Rate Wireless Personal Area Networks, LR-WPANs）的無線路由演算法是目前資料收集網路的重要研究方向，而Chiu and Chen提出的具適切性之蟲洞串鍊式路由演算法，該演算法提出了低碰撞的無線路由協訂，適用於各式資料收集系統如智能路燈、智能電表、智慧家電等系統。因使用環境的干擾因素與其協訂上的適切度的不足，可能造成傳輸不穩定。因此本論文針對串鍊式架構的問題提出一蟲洞串鍊式無線網路之救援演算法（Rescuing Algorithm for Linked-List Wireless Network with Wormhole Mechanism）。本演算法承接串鍊式架構的低碰撞率優點，收集無法加入網路的孤立節點資訊，並以簡單的權重衡量機制選擇具急迫性的孤立節點將其以救援點的身分加入網路，完成快速且有效率的救援程序。本演算法並設計適用於串鍊式架構的封包傳遞機制，藉此來穩定資料傳輸路徑並修正指令的斷裂，試圖使資料收集效率不易受環境所干擾。而本演算法也修正了串鍊式網路的資料收集和寫入指令，使其在擁有救援點的情況下仍能迅速的收集資料。本論文以NS3網路模擬平台來驗證救援演算法的效能，並驗證加上救援演算法與封包傳遞機制後的串鍊式網路資料收集效能，從結果中可以得知本演算法能在各種多節點網路環境和有限的硬體設備下，快速的救援大部分的孤立節點，解決串鍊式架構路由不完整的問題；而穩定資料路徑機制也使網路能建立較穩定的蟲洞路徑，使得滿載資料的封包能順利的傳輸；最後，本論文以模擬修改過後的Gather和Scatter指令，驗證串鍊式架構在有救援點的架構下能達成快速且完整的多節點資料收集和寫入，建構穩定且迅速的資料收集系統。

Due to the concept of Smart City being gradually prevailed in recent years, the wireless routing algorithm for Low-Rate Wireless Personal Area Networks is an important research for data collecting network which is used for managing and collecting the several data in the city. Chiu and Chen proposed an adaptive linked list routing algorithm with wormhole mechanism. The algorithm is a low collision wireless protocol which is suitable for several kinds of data collection systems such as intelligent street lighting, smart meters, smart appliances and other systems. However, the algorithm may cause the unstable transmission because of environmental interference and the inappropriate design of the protocol. In this paper, we proposed a rescuing algorithm for linked-list wireless network with wormhole mechanism to solve the problems in the link-listed network. The algorithm has the efficient method which can collect the information of the isolated nodes which can’t join the network, and choose the urgent one to join the network as the save node rapidly with the advantage of the low collision. The algorithm also designs the mechanism to stabilize the data transmission path and fix the break of commands, tries to make the efficiency of the data collecting not to be affected easily by the environmental interference. In order to make the linked-list network can collect and write the data rapidly with the save nodes, the algorithm also fixes the related commands in the network. We use the network simulation-3 to verify the efficacy of the rescuing algorithm. First, we find that the algorithm can save most of the isolated nodes rapidly with the limited hardware device in the multi-nodes environment. We prove that the rescuing algorithm can solve the routing problem of the linked-list network. Then, we verify that the stable path of the data transmission mechanism can build the better wormhole data path for the packet with max payload. Finally, we simulate the Gather and Scatter commands and find that the linked-list network with the save nodes can completely and rapidly collect and write the multi-nodes data. The result of the simulation tells that the linked-list network with the save nodes can build a stable and rapid data collecting network system.

論文審定書 page i
論文公開授權書 page ii
誌謝 page iii
摘要 page iv
Abstract page v
目錄 page vii
圖次 page x
表次 page xiii
　第1章 簡介 page 1
1.1 研究動機 page 1
1.2 研究目的 page 2
1.3 論文架構 page 3
　第2章 背景知識與相關研究 page 4
2.1 相關無線網路路由策略 page 4
2.1.1 Zigbee mesh page 4
2.1.2 RPL路由協訂 page 6
2.1.3 無線網狀網路 page 9
2.1.4 Extremely Opportunistic Routing page 11
2.1.5 Bluetooth Low Energy – BLEmesh page 13
2.1.6 LORA Network - LORAWAN page 15
2.1.7 總結 page 17
2.2 具適切性之蟲洞串鍊式路由演算法 page 17
2.2.1 建網程序 page 18
2.2.2 路由維護 page 21
2.2.3 資料傳輸 page 23
2.2.4 演算法分析與探討 page 25
2.3 路由策略分析與探討總結 page 27
　第3章 蟲洞串鍊式無線網路之救援演算法 page 29
3.1 蟲洞串鍊式無線網路之救援演算法架構 page 29
3.1.1 基礎架構 page 29
3.1.2 節點角色定義 page 30
3.1.3 串鍊式網路封包傳遞機制 page 32
3.2 孤立節點選擇救援演算法 page 36
3.2.1 封包格式 page 36
3.2.2 救援機制 page 38
3.3 Gather和Scatter指令修正 page 47
3.3.1 Gather指令修正 page 47
3.3.2 Scatter指令修正 page 49
3.3.3 結論 page 50
　第4章 模擬平台介紹 page 51
4.1 Network Simulation-Version 3 page 51
4.2 Implementation Rescuing Algorithm in NS3 page 53
　第5章 模擬數據與探討 page 55
5.1 具救援機制對於串鍊式網路之模擬探討 page 55
5.1.1 Queue大小 page 55
5.1.2 距離 page 57
5.1.3 節點數 page 59
5.1.4 總結 page 60
5.2 救援效率分析 page 61
5.3 穩定傳輸路徑機制 page 63
5.3.1 封包傳輸 page 63
5.3.2 蟲洞建立 page 64
5.4 Gather和Scatter修正模擬 page 65
5.5 分析與結論 page 67
　第6章 總結 page 68
　參考文獻 page 69

[1] Hollands, R. G. (1991) , ”Will The Real Smart City Please Stand Up? Intelligent, Progressive, or Entrepreneurial? ”
[2] Jih-ching Chiu, Chien-Lung Chen, “Adaptive Linked-List Routing Algorithm With Wormhole Mechanism,” Taiwan Academic Network Conference(TANET), 2015
[3] Yu-Chee Tseng, Sze-Yao Ni, Yuh-Shyan Chen, Jang-Ping Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” COMPUTER SCIENCE Wireless networks, Volume 8, Page.153- Page.167, Numbers 2-3 ,2002.
[4] Nico Saputro, Kemal Akkaya, and Suleyman Uludag. "A survey of routing protocols for smart grid communications." Computer Networks 56.11, Page.2742-Page.2771, 2012
[5] Al-Gabri Malek, L. I. Chunlin, and Layuan Li. "Improving ZigBee AODV Mesh Routing Algorithm Topology and simulation analysis." Indonesian Journal of Electrical Engineering and Computer Science 12.2, Page.1528- Page.1535, 2014
[6] Jeong Gil Ko, "Evaluating the Performance of RPL and 6LoWPAN in TinyOS." Workshop on Extending the Internet to Low Power and Lossy Networks (IP+ SN). Vol. 80. 2011.
[7] Ian F. Akyildiz, Xudong Wang, and Weilin Wang, "Wireless mesh networks: a survey." Computer networks 47.4, Page.445- Page.487, 2005
[8] Biswas, Sanjit, and Robert Morris, "Opportunistic routing in multi-hop wireless networks." ACM SIGCOMM Computer Communication Review 34.1, Page.69- Page.74, 2004
[9] Hyun-soo Kim, JungYub Lee, and Ju Wook Jang, "Blemesh: A wireless mesh network protocol for bluetooth low energy devices." Future Internet of Things and Cloud (FiCloud), 2015 3rd International Conference on. IEEE, 2015.
[10] N Sornin, "LoRaWAN™ Specifications," LoRa™ Alliance, 2015
[11] Jih-ching Chiu, Wen-Shin Wang, “Linked List Routing Algorithm With Wormhole Mechanism For Data Collecting Wireless Network,” 2014 International Computer Symposium (ICS), 2014.
[12] Claro Noda, "On packet size and error correction optimisations in low-power wireless networks." 2013 IEEE International Conference on Sensing, Communications and Networking (SECON). IEEE, 2013.
[13] The Network Simulator-ns-3, [Online]. Available：https://www.nsnam.org/
[14] NS3-Low-Rate Wireless Personal Area Network (LR-WPAN) : https://www.nsnam.org/docs/models/html/lr-wpan.html
[15] LORA Alliance, https://www.lora-alliance.org/
[16] S.-M. Cheng, Phone Lin, D.-W Huang, “A Survey on Radio Resource and Mobility Management for Wireless Mesh Network,” Proceedings of Mobile Computing Workshop, Page.223- Page.231, March 2006
[17] Nick Baker, "ZigBee and Bluetooth strengths and weaknesses for industrial applications," Computing & Control Engineering Journal 16.2, Page.20- Page.25, 2005
[18] Singh, Chandramani Kishore, Anurag Kumar, and P. M. Ameer. "Performance evaluation of an IEEE 802.15. 4 sensor network with a star topology," Wireless Networks 14.4, Page.543- Page.568, 2008
[19] ZigBee Alliance, http://www.zigbee.org/
[20] Jih-Ching Chiu, Kai-Ming Yang, Yao-Chin Huang, Ming-Shiou Wu, "Dynamic Multi-channel Multi-path Routing Protocol for Smart Grid," The 3rd FTRA International Conference on Computer Science and its Applications (CSA 2011) at Korea, Dec. 2011
[21] Katayoun Sohrabi, "Protocols for self-organization of a wireless sensor network." IEEE personal communications 7.5, Page.16- Page.27, 2000
[22] Johnson B. David, A. Maltz. David, "Dynamic source routing in ad hoc wireless networks." Mobile computing. Springer US, Page.153- Page.181, 1996
[23] Park Vincent Douglas, M. Scott Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks." INFOCOM'97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1997.
[24] Al-Karaki, N. Jamal, and Ahmed E. Kamal. "Routing techniques in wireless sensor networks: a survey," IEEE wireless communications 11.6, Page 6- Page 28, 2004
[25] Taehong Kim, "Shortcut tree routing in ZigBee networks," 2007 2nd International Symposium on Wireless Pervasive Computing. IEEE, 2007.