臺灣博碩士論文加值系統

本論文研究感知隨意網路上的路由（routing）協定。根據行動台是否配有GPS（全球定位系統），感知隨意網路上的路由協定可分為二類：一類是不具位置輔助的路由協定，另一類是具位置輔助的路由協定。不具位置輔助的路由協定通常是透過flooding的方式找尋最佳路徑。然而最佳路徑可能因網路環境變動的關係（例如某些主要使用者處在傳輸狀態的頻率增加）而不再是最佳路徑。這類路由協定的缺失之一是一旦找到最佳路徑後，即使網路環境變動了，只要路徑沒有斷裂，資料封包的傳送仍會固守在舊有的路徑。另一方面，在行動台配有GPS的情況下，具位置輔助的路由協定將變得很簡單。此時行動台不需要flooding，只需透過greedy forwarding即可找到路徑。然而greedy forwarding的方式未必能找到最佳路徑。為此，本論文提出新的具位置輔助的路由協定，稱為ant-based location-aided routing（簡稱ALR）。ALR具有二個優點：（一）ALR不需透過flooding即可找到最佳路徑。ALR將封包視為螞蟻，模擬螞蟻在移動後會留下費洛蒙的特性，使得往後行動台可以根據網路上的費洛蒙值選擇最佳鄰居來幫忙轉傳封包。（二）ALR可以根據網路環境調整最佳路徑。當網路環境變動而有更好路徑時，ALR利用費洛蒙蒸發的功能淘汰舊有的路徑。最後，模擬實驗結果顯示ALR勝過目前已知相關的具位置輔助的路由協定。

In this thesis, we address the issue of routing on a cognitive ad hoc network, where all secondary users are mobile stations. Based on whether mobile stations are equipped with GPS (global positioning system), routing protocols in a cognitive ad hoc network can be classified into two categories: location-free and location-aided. Location-free routing protocols typically employ flooding to find out the optimal routing path. One of the drawbacks of location-free routing protocols is that the data packets always travel through the fixed path even though the activities of primary users near to some mobile stations on the routing path become more frequent. Instead of using flooding, location-aided routing can adopt the greedy-forwarding strategy to find a routing path. However, such a routing path is typically not optimal. In this thesis, we propose a new location-aided routing protocol, called ant-based location-aided routing (ALR), which has two advantages: (1) ALR can find the optimal path without using flooding. In ALR, DATA packets and ACK packets mimic the behaviors of ants. Especially, ants can lay pheromone on each link along the current best path. When the amount of pheromone in a network becomes higher, the path of a DATA ant will converge to the optimal one. (2) ALR adapts well to the varying environment. Especially, ALR adopts the pheromone evaporation mechanism such that when the environment changes, the amount of pheromone on the outdated optimal path will become lower, and the path of a DATA ant will automatically converge to the new optimal one. The simulation results show that in terms of end-to-end routing delay, normalized routing overhead, and data delivery ratio, ALR outperforms existing related location-aided routing protocols.

論文審定書 i
誌謝 ii
摘要 iii
Abstract iv
目錄 v
圖次 vii
表次 ix
第一章 緒論 1
1.1 相關研究 2
1.2 論文貢獻 7
第二章 網路模型與媒介存取控制 9
第三章ALR協定 14
3.1 路徑選擇規則 14
3.2 費洛蒙更新規則 19
3.3 費洛蒙蒸發規則 21
3.4 路徑維護規則 22
第四章 模擬實驗 23
4.1 實驗環境及參數設定 23
4.2 模擬器設計與實作 26
4.3 模擬實驗結果 29
4.3.1 路由協定參數之驗證 29
4.3.2 主要使用者處在OFF state的平均時間對效能的影響 36
4.3.3 Licensed Channel個數對效能的影響 40
4.3.4 行動台移動速度對效能的影響 45
4.3.5 行動台個數對效能的影響 49
4.3.5 Flow個數對效能的影響 53
第五章 結論 57
參考文獻 58

[1]A. Abbagnale and F. Cuomo, “Leveraging the Algebraic Connectivity of a Cognitive Network for Routing Design,” IEEE Transactions on Mobile Computing, Vol. 11, No. 7, pp. 1163–1178, July 2012.
[2]S. Abdelaziz and M. ElNainay, “Survey of Routing Protocols in Cognitive Radio Networks,” Elsevier International Journal of Communications, Network and Systems, pp. 212–222, October 2012.
[3]I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty, “Next Generation/Dynamic Spectrum Access/Cognitive Radio Wireless Networks: A Survey,” Computer Networks, Vol. 50, No. 13, pp. 2127–2159, 2006.
[4]Z.-T. Chou, Y.-H. Lin, and R.-H. Jan, “Optimal Asymmetric and Maximized Adaptive Power Management Protocols for Clustered Ad Hoc Wireless Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 22, No. 12, pp. 1961–1968, Dec. 2011.
[5]G. Cheng, W. Liu, and Y. Li, “Joint On-demand Routing and Spectrum Assignment in Cognitive Radio Networks,” IEEE International Conference on Communications, pp. 6499–6503, June 2007.
[6]K. Chowdhury and M. Felice, “SEARCH: A Routing Protocol for Mobile Cognitive Radio Ad-Hoc Networks,” Elsevier Computer Communications, Vol. 32, pp. 1983–1997, April 2009.
[7]K. Chowdhury and I. Akyildiz, “CRP: A Routing Protocol for Cognitive Radio Ad Hoc Networks,” IEEE Journal of Selected Areas in Communications, Vol. 29, No. 4, pp. 794–804, April 2011.
[8]M. Dorigo and L. M. Gambardella, “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,” IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53–66, April 1997.
[9]S. M. Das, H. Pucha, and Y. C. Hu, “On the Scalability of Rendezvous-Based Location Services for Geographic Wireless Ad Hoc Routing,” Computer Networks, Vol. 51, pp. 3693–3714, 2007.
[10]Global Positioning System. [Online] http://en.wikipedia.org/wiki/GPS
[11]K. Habak, M. Abdelatif, H. Hagrass, K. Rizc, and M. Youssef, “A Location-Aided Routing Protocol for Cognitive Radio Networks,” IEEE International Conference on Computing, Networking and Communication (ICNC), pp. 729–733, January 2013.
[12]R.-H. Hwang, C.-C. Hoh, and C.-Y. Wang, “Swarm Intelligence-Based Anycast Routing Protocol in Ubiquitous Networks,” Wireless Communications and Mobile Computing, Vol. 10, pp. 875–887, 2009.
[13]IEEE 802.22. [Online] https://en.wikipedia.org/wiki/IEEE_802.22
[14]IEEE Standard 802.11, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, November 1999.
[15]S. S. Iyengar, H.-C. Wu, N. Balakrishnan, and Shih Yu Chang, “Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks,” IEEE System Journal, Vol. 1, No. 1, pp. 29–37, September 2007.
[16]C. Jiang, Y. Chen, K. J. Ray Liu, and Y. Ren, “Renewal-Theoretical Dynamic Spectrum Access in Cognitive Radio Network with Unknown Primary Behavior,” IEEE Journal of Selected Areas in Communications, Vol. 31, No. 3, pp. 406–416, April 2011.
[17]B. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” ACM International Conference on Mobile Computing and Networking (MobiCom’00) , pp. 243–254, 2000.
[18]James F. Kurose and Keith W. Ross, Computer Networking: A Top-Down Approach, 6th Edition, Pearson, March 2012.
[19]X. Li, Q. Zhao, X. Guan, and L. Tong, “Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints,” IEEE Journal of Selected Areas in Communications, Vol. 29, No. 4, pp. 746–756, April 2011.
[20]M. Gunes, U. Sorges, and I. Bouazizi, “ARA: The Ant-Colony Based Routing Algorithm for MANETs,” IEEE International Conference on Parallel Processing, pp. 79–85, August 2002.
[21]P. Nand and S. C. Sharma, “Routing Load Analysis of Broadcast based Reactive Routing Protocols AODV, DSR and DYMO for MANET,” International Journal of Grid and Distributed Computing, Vol. 4, No. 1, pp. 81–92, March 2011.
[22]Charles E. Perkins, Ad Hoc Networking, Addison-Wesley, USA, 2001.
[23]C.-F. Shih, W. Liao, and H.-L. Chao, “Joint Routing and Spectrum Allocation for Multi-Hop Cognitive Radio Networks with Route Robustness Consideration,” IEEE Transactions on Wireless Communications, Vol. 10, No. 9, pp. 2940–2949, September 2011.
[24]M. Timmers, S. Pollin, A. Dejonghe, L. Van der Perre, and F. Catthoor, “A Distributed Multichannel MAC Protocol for Multihop Cognitive Radio Networks,” IEEE Transactions on Vehicular Technology, Vol. 59, No. 1, pp. 446–459, January 2010.
[25]Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks, Vol. 8, No. 2/3, pp. 153–167, March-May 2002.
[26]TV White Spaces [Online] https://en.wikipedia.org/wiki/White_spaces_(radio)
[27]J. Wang, H. Yue, L. Hai, and Y. Fang, “Spectrum-Aware Anypath Routing in Multi-Hop Cognitive Radio Networks,” IEEE Transactions on Mobile Computing, Early Access, DOI: 10.1109/TMC.2016.2582173, June 2016.
[28]M. Youssef, M. Ibrahim, M. Abdelatif, L. Chen, and A. V. Vasilakos, “Routing Metrics of Cognitive Radio Networks: A Survey,” IEEE Communications Surveys & Tutorials, Vol. 16, No. 1, pp. 92–109, September 2014.