| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 93 === 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%.
|
|---|
