在routing path 上若有節點發生擁塞，將會影響資料的傳輸效率。在文獻 [22] 所提出的方法（稱之為CRP）中，若routing path上的節點發生擁塞，便會將traffic分流給bypass path上的節點。在本論文中，我們提出以MIMO輔助之擁塞適應路由協定（簡稱MCRP），適用於行動隨意網路。在MCRP中，節點會監測自身buffer的空間存取情況，並定期告知上游節點。節點透過動態調整MIMO的傳輸方式（rate-link mode或range-link mode）來舒緩擁塞問題。另一方面，在MCRP中，節點紀錄著rate-link neighbors和range-link neighbors的相關資訊。若routing path有節點損毀或消失，MCRP可透過range-link neighbors來快速重建routing path。實驗結果顯示，就packet delivery ratio及end-to-end throughput來看，MCRP優於目前已知文獻的方法。

A packet will be dropped when it arrives at a congested node in a routing path. The authors of [22] proposed the CRP protocol that can alleviate the congestion problem by splitting the traffic to the bypass nodes. In this thesis, we propose a new routing protocol, called MIMO-assisted congestion-adaptive routing protocol (MCRP for short), for multi-hop mobile ad hoc networks (MANETs for short). In MCRP, nodes periodically record the information of their rate-link/range-link neighbors. MCRP alleviates the congestion problem by dynamically adjusting the MIMO antenna mode and splitting the traffic to the downstream range-link neighbors. In addition, MCRP can quickly reestablish the routing path when it is broken due to node failure or mobility. Simulation results show that MCRP outperforms the existing protocols in terms of packet delivery ratio and end-to-end throughput.

論文審定書 I
中文摘要 II
英文摘要 III
目錄 IV
圖目錄 VI
表目錄 VIII
第一章 緒論 1
1.1 擁塞問題與路由協定 1
1.2 MIMO 簡介 2
1.3 文獻回顧 3
1.4 貢獻 4
第二章 MCRP協定 5
2.1 ROUTING PATH DISCOVERY 5
2.2 CONGESTION MONITORING 6
2.3 TRAFFIC SPLITTING及CONGESTION ADAPTIVITY 7
2.4 FAILURE RECOVERY 8
第三章 MCRP模擬實驗 10
3.1 NS2無線網路架構簡介 10
3.2 MCRP實作 14
3.2.1 Route Agent 14
3.2.2 Interface Queue 15
3.2.3 Propagation Model 17
3.2.4 Failure Recover 18
3.3 MCRP天線模式切換 19
3.4 模擬環境及其他節點的產生 20
3.5 效能評估程式 20
第四章 MCRP效能分析 23
4.1 實驗參數設定環境： 23
4.2 實驗結果 25
4.2.1 Mobility對協定的影響 25
4.2.2 封包產生速度對協定的影響 29
第五章 結論 33
參考文獻 34

[1] An Awk Primer, http://www.vectorsite.net/tsawk.html
[2] J. Broch, D. Johnson, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, pp. 1--67, Oct. 1999.
[3] S. Corson and V. Park, “Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification,” Mobile Ad Hoc Network (MANET) Working Group, IETF, pp. 1--19, Oct. 1999.
[4] Yuh-Shyan Chen, Chih-Shun Hsu, and Po-Tsai Hsieh, “An Efficient Bow-based On-Demand QoS Routing Protocol for MIMO Ad Hoc Networks,” Journal of Computer Communications, Vol. 32, Issue 15, pp. 1577--1587, September, 2009.
[5] CMU, “The CMU Monarch Project Wireless and Mobility Extensions to ns,” http://www.monarch.cs.cmu.edu/cmu-ns.html, Oct. 1999.
[6] J. J. Garcia-Luna-Aceves and M. Spohn, “Source-Tree Routing in Wireless Networks,” IEEE International Conference on Network Protocols (ICNP), pp. 273--289, 1999.
[7] R. W. Heath Jr., and A. J. Paulraj, “Switching between Diversity and Multiplexing in MIMO Systems,” IEEE Transactions on Communications, Vol. 53, No. 6, pp. 962--968, June 2005.
[8] Teerawat Issariyakul and Ekram Hossain, “Introduction to Network Simulator NS2, ” Springer, pp. 38--39, July 2008.
[9] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Vol. 353, pp. 153--181, 1996.
[10] S.-J. Lee and M. Gerla, “Dynamic Load-Aware Routing in Ad Hoc Networks,” IEEE International Conference on Communications, pp. 3206--3210, June 2001.
[11] S.-J. Lee and M. Gerla, “Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks,” IEEE International Conference on Communications, pp. 3201--3205, June 2001.
[12] Y. Lu, W. Wang, Y. Zhong, and B. Bhargava, “Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks,” IEEE International Conference on Pervasive Computing and Communications (PerCom), pp. 187--194, Mar. 2003.
[13] M. Marina and S. Das, “On-Demand Multipath Distance Vector Routing in Ad Hoc Networks,” IEEE International Conference on Network Protocols (ICNP), pp. 14--23, 2001.
[14] A. Nasipuri, R. Castaneda, and S.R. Das, “Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks,” ACM/Baltzer Mobile Networks and Applications, Vol. 6, pp. 339--349, 2001.
[15] Nam: Network Animator, http://www.isi.edu/nsnam/nam/
[16] Network Simulator 2, http://nsnam.isi.edu/nsnam/index.php
[17] OTcl, http://otcl-tclcl.sourceforge.net/otcl/
[18] C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” IEEE Workshop on Mobile Computing Systems and Applications, pp. 90--100, Feb. 1999.
[19] C. E. Perkins, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM, pp. 234--344, 1994.
[20] C. E. Perkins, E. M. Belding-Royer, and I. Chakeres, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” IETF Internet draft, pp. 9--14, Oct. 2003.
[21] Karthikeyan Sundaresan and Raghupathy Sivakumar, “Routing in Ad-hoc Networks with MIMO Links,” IEEE International Conference on Network Protocols, pp. 11--21, Nov. 2005.
[22] Duc A. Tran and Harish Raghavendra, “Congestion Adaptive Routing in Mobile Ad Hoc Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No. 11, pp. 1294--1305, Nov. 2006.
[23] A. Valera, W. Seah, and S. Rao, “Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad Hoc Networks,” IEEE Infocom, Vol. 1, pp. 260--269, Apr. 2003.
[24] S. Vutukury and J. Garcia-Luna-Aceves, “MDVA: A Distance-Vector Multipath Routing Protocol,” IEEE Infocom, pp. 557--564, 2001.
[25] L. Zheng and D. Tse, “Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels,” IEEE Transactions on Information Theory, Vol. 49, pp. 1073--1096, May. 2003.