臺灣博碩士論文加值系統

在無線隨意網路（Wireless Ad Hoc Network）中，如何提升頻寬的使用率又同時考慮服務品質（QoS），是一個受到注目的問題。為了在有限的頻寬中，提升頻寬使用率，我們想要利用隨意網路中零碎的剩餘頻來達到這個目的，但是單一路徑的剩餘頻寬又無法滿足服務品質的要求，因此我們以多重路徑的方式，將網路中數條單一路徑，結合成一條可以滿足服務品質的多重路徑。在本篇論文中，我們提出一套如何建立，維護，並重新建立在無線隨意網路網路上之的虛擬路線（Virtual Circuit）的策略，這是一個多重路徑且有支援服務品質保證的演算法。由模擬的結果得知，我們所提出的方法的確可以提升無線隨意網路的頻寬使用率，但是分散的情況亦會增加連線的負荷，也對於移動狀況的強制終止連線數量和資料流失數量都有很大的影響。

In an ad hoc networks, it is an important problem about how to increase the bandwidth utilization and guarantee Quality-of-Service. In order to increase the bandwidth utilization under the situation of limited bandwidth, we want to achieve the target by using the bitty residual bandwidth in the ad hoc networks. Hence we integrate several single paths into a multi-path that satisfies QoS requirement. In this paper, we present a policy to look up, maintain, and reroute the virtual circuit in the ad hoc networks. From the result of simulation, we obtain that our proposal indeed can increase the bandwidth utilization of ad hoc networks. But the condition of splitting also increases the overhead of connection, and affects the forced terminated ratio and packets lost ratio under mobility.

中文摘要1
Abstract2
目錄3
圖目錄6
表目錄7
第1章導論8
1.1.研究動機8
1.2.相關研究探討9
第2章系統模型14
2.1.隨意無線網路模型14
2.2.QoS狀態的量測15
2.3.QoS繞徑問題的描述15
2.4.虛擬路線繞徑(Virtual Circuit Routing)15
第3章路徑的建立與重建19
3.1.路徑的建立19
3.2.資料結構22
3.3.分散策略23
3.3.1.分散策略A25
3.3.2.分散策略B26
3.3.3.分散策略C27
3.3.4.分散策略D29
3.4.路徑的重建30
3.5.Soft State32
第4章模擬與結果34
4.1.頻寬使用35
4.2.連線狀態36
4.2.1.建立連線所需之訊息數量總和比較36
4.2.2.路徑分岔之比較38
4.3.移動環境下的測試40
4.3.1.強迫終止比例的比較41
4.3.2.封包遺失比例的比較42
第5章結論與未來工作44
參考文獻46
附錄50

[1]D. Bertsekas and R. Gallager, "Data Networks," Petice-Hall, Inc., 1987[2]J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad-hoc network routing protocols”, proceedings of IEEE ACM 1998[3]J. -H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-hoc Networks”, proceedings of IEEE INFOCOM 2000[4]T. Chen, M. Gerla, and J. T. Tsai, “QoS routing performance in a multi-hop, wireless networks”, proceedings of IEEE ICUPC 1997[5]S. Chen, and K. Nahrstedt, “Distributed quality-of-service routing in ad hoc network”, IEEE Journal on Selected Areas on Communications, August 1999, pp. 1488-1505[6]I. Cidon, R. Rom, and Y. Shavitt, “Multi-path routing combined with resource reservation”, proceedings of IEEE INFOCOM ''97, pp. 92-100[7]E. S. Elmallah, H. S. Hassanein, and H. M. AboElFotoh, “Supporting QoS routing in mobile ad hoc networks using probabilistic locality and load balancing”, proceedings of IEEE GLOBECOM 2001, pp. 2901-2906[8]M. Gerla, X. Hong, and G. Pei, “Landmark routing for large ad hoc wireless networks”, Proceedings of IEEE GLOBECOM 2000, pp. 1702-1706[9]R. Guerin and A. Orda, “QoS-based routing in networks with inaccurate information: Theory and alrotithms”, Proceedings of IEEE INFOCOM 1997, pp. 75-83[10]C. Hou, “Routing virtual circuits with timing requirements in virtual path based ATM networks”, Proceedings of IEEE INFOCOM 1996, pp. 320-328[11]D. B. Johnson, “Routing in ad hoc networks of mobile host,” Proceedings of IEEE WMCSA 1994, Dec. 1994[12]D. Johnson and D. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, Norwell, MA: Kluwer, 1996[13]S.-J. Lee and M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks”, Proceedings of IEEE ICC 2001, pp. 3201-3205[14]C. R. Lin, “Admission Control in Time-Slotted Multihop Mobile Networks,” IEEE Journal on Selected Areas in Communications, October 2001[15]C. R. Lin, "On-Demand QoS Routing in Ad Hoc Wireless Networks", IEICE Transactions on Communications, July 2000[16]C. R. Lin and J. -S. Liu, “QoS Routing in Ad Hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, August 1999[17]V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks”, Proceedings of IEEE INFOCOM 1997, pp. 1405-1413[18]C. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance vector routing （DSDV） for mobile computers”, Proceedings of ACM SIGCOMM ''94, pp. 234-244[19]C. E. Perkins and E. M. Royer “Ad-hoc on-demand distance vector routing”, Proceedings of IEEE WMCSA 1999, pp. 90-100[20]G. Pei, M. Gerla, and T. Chen, “Fisheye state routing: a routing scheme for ad hoc wireless networks”, Proceedings of IEEE ICC 2000, pp. 70-74[21]C.-K. Toh, “Associativity-based routing for ad-hoc mobile networks,” Wireless Personal Commun., vol. 4, pp. 103-139, 1997[22]Z. Wang and J. Crowcroft, “QoS routing for supporting resource reservation”, IEEE Journal on Selected Areas on Communications, Sept. 1996[23]L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, “RSVP: A new resource reservation protocol,” IEEE Network, Sept. 1993, pp. 8-18