請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63246
標題: | 無線隨意網路上之有效率的地理路由協定與分析 Efficient Geographic Routing Protocols and Analyses in Mobile Ad-hoc Networks |
作者: | Chia-Chang Hsu 徐家昌 |
指導教授: | 雷欽隆(Chin-Laung Lei) |
關鍵字: | 無線接取網路,無信標路由,地理路由,位置服務,廣播, Wireless Ad-hoc network,Beacon-less routing,geographic routing,Location service,Broadcast, |
出版年 : | 2012 |
學位: | 博士 |
摘要: | 無線隨意網路是由一群無線移動主機自我組織而成。無線隨意網路在無固定或集中式管理的情況下也可良好運作並提供一經濟且方便之免基礎設施的通訊。此論文研究無線隨意網路上的路由協定,我們主要專注於地理路由上的一些重要議題,如路由、廣播以及地理位置維護。在論文的第一個部分,我們提出兩個新的地理路由協定,目的在於藉由降低網路控制負載並提高封包傳送率來改善路由效能。我們首先描述一個基於地理機制以及地理位置更新之點對點需求式路由協定,接著再提供在無線隨意網路中的一個輕量煙火搜尋協定以增強位置協助路由。基於一個位置估算的機制,此協定整合位置維護來避免使用位址服務所產生的額外負載。我們設計了一個基於無信標方式的演算法來克服地理路由上之重要問題,如繞洞路由以及死路問題,以保證封包能正確地傳遞。此外,我們也採用一個理論模式來提供一個不偏頗的效能分析以及施行模擬來驗證其結論。模擬及可擴展性的分析顯示我們提出的路由協定顯著的降低網路負載。在第二個部分我們建立一個數學模型來分析無信標路由方式之下的平均封包進展並提出封包複製的機率上限。此外,依據此分析結果我們也提出一方法來設定適當的延遲計時配置,以達到網路平均封包單跳以及點對點延遲限制同時避免提升網路封包複製機率。 Mobile Ad-hoc networks (MANETs) are self-organized by a group of wireless mobile hosts. MANETs can operate without a fixed or centralized administration and provide an economic and convenient infrastructure-free communication. This thesis is to design efficient routing protocols for MANETs. We especially focus on the critical issues such as routing, broadcasting, and location maintenance in geographic routing. In the first part of this thesis, we propose two novel geographic routing protocols. The main goal of the protocols is to improve the routing performance by reducing control overhead and providing high packet delivery ratio compared to existing state-of-the-art routing protocols. We first describe an ad-hoc on demand routing protocol based on a geographic scheme with location update. Then, a lightweight firework search protocol for location-aided routing enhancement in mobile ad-hoc networks is presented. Based on a location estimation scheme, the proposed protocols integrate location maintenance to prevent additional overhead produced by a location service. To ensure correct packet forwarding, an algorithm is designed to overcome the critical issues in geographic routing such as routing around a hole and a dead end problem. We use a theoretical model to provide an unbiased performance analyses on the proposed protocols and conduct simulations to validate the results. Our simulation and scalability analysis show that the proposed routing protocol dramatically decrease routing overhead. In the second part, we establish a mathematic model to analysis average packet progresses relative to node densities in a simplified beacon-less routing and provide an upper bound on the probability of the packet duplications. Furthermore, in accordance with the analysis result, we also provide a method to set a proper configuration of delay timers to achieve average one hop packet delay and end-to-end delay constraints in a network while prevent from increasing the probability of packet duplications. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63246 |
全文授權: | 有償授權 |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-101-1.pdf 目前未授權公開取用 | 1.7 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。