以資料優先權為基礎之高效能無線隨意網路繞徑通訊協定

An Efficient Data Priority Routing Protocol for Wireless Mobile Ad-Hoc Networks

曾俊儒(Jiun-Ru Tseng)

指導教授 ： 賴國華

元智大學/資訊學院/資訊工程學系/碩士(2004年)

摘要

發展一個有效率的繞徑協定是無線隨意網路的重要議題之一。尤其是如何提供QoS和解決節點的移動性更是必須解決的迫切課題。目前有許多的研究在解決這些問題，但是還沒有任何高效的演算法能適合每一種網路型態。在本論文中，我們提出了一個以資料優先權為基礎之高效能無線隨意網路繞徑通訊協定 (DPR)。我們定義了四個資料描敘檔(Data Profile)和使用一個有彈性的評估方程式、斷線預防機制和繞徑修補程序以減少斷線率和重新繞徑的時間，並且增加實用性和提供QoS能力。
QoS能力是指網路能夠對用戶承諾提供一套預設的服務品質。一般提供QoS最常用的機制有擁擠控制、錯誤控制和封包排程。這些機制通常包含在TCP協定中。然而，由於TCP的本身擁有的封包重送策略，所以TCP並不適合用於多媒體即時通信的應用。在現有能提供 QoS能力的繞徑通訊協定僅提供QoS保留協定(RSVP)和基本的重新繞徑能力。 在本論文中，我們為定義的四種資料描敘檔產生不同的繞徑並用一個動態重新繞徑機制建立有QoS能力的的繞徑通訊協定。
從模擬的結果來看，與AODV、AODV-BR和AODV-QoS等演算法相比，DPR
有良好的效能表現。我們的方法能在資料傳輸率上比AODV提高把19%。能夠在大多數環境下讓呼叫成功率(CAR)保持在93%以上。並且減少斷線率達15~30%。

關鍵字

無線隨意網路 ； 繞徑通訊協定

並列摘要

One of the most important issues in MANET is the development of efficient routing protocols. Mobility and Quality of Service (QoS) are the major challenges in MANET routing. There are several algorithms proposed to solve these problems, but there is no efficient algorithm to suit every kind of networks. In this thesis, an Efficient Data Priority Routing Protocol (DPR) is proposed. We define four Data Profiles and use a flexible Utility Function, Link-broken Prevention Mechanism, and Path Repair Procedure to reduce the connection broken rate and reestablish the connection time for increasing practicability and provide QoS effect. While current QoS routing protocols only provide QoS Reservation Protocol and basic re-route scheme, our DPR can establish difference delivery path for various kind of data profiles and use a dynamic re-route mechanism.
The simulation results show that the DPR with QoS has satisfiable performance. To compare with the AODV, AODV-BR, and QoS over AODV algorithms, the average data transmission rate of our algorithms can be improved by 19% from AODV. It can also keep the Call Acceptance Ratio over 93% at most of the time, and the link broken rate can be reduced by 15~30%.

並列關鍵字

Mobile Ad hoc Networks ； QoS-aware Routing

參考文獻

[Aung-Ju 2002] Aung-Ju Lee, and Mario Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Netwoks and Application 7, pp.441-453, 2002.

[Baldi 2002] Baldi Pierre, De Nardis, Luca; Di Benedetto, Maria-Gabriella, “Modeling and Optimization of UWB Communication Networks Through a Flexible Cost Function,” IEEE Journal on Selected Areas in Communications, v 20, n 9, December, pp.1733-1744, 2002.

[Basagni 1998] S. Basagni, “A Distance Routing Effect Algorithm for Mobility (DREAM),” ACM/IEEE International Conference, Mobile Computing and Networking, pp.76-84, 1998.

[Charles 1994] Charles E. Perkins, and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIMCOMM, pp. 234-244, 1994.

[Charles 1999] Charles E. Perkins and Elizabeth .M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proceedings of IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, 1999.