English  |  正體中文  |  简体中文  |  Items with full text/Total items : 73032/73032 (100%)
Visitors : 23230262      Online Users : 351
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9298

    Title: 行動隨意網路可調適及可延展之位置服務協定;SEEKER: An Adaptive and Scalable Location Service for Mobile Ad Hoc Networks
    Authors: 凌瑋駿;Wei-Jiun Ling
    Contributors: 資訊工程研究所
    Keywords: 延展性;位置管理;位置服務;行動隨意網路;調適性;location service;location management;mobile ad hoc network (MANET);scalability;adaptive
    Date: 2006-07-05
    Issue Date: 2009-09-22 11:44:55 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 以位址資訊為基礎的繞徑協定使用地理資訊做輔助,相較於以拓撲為基礎(topology-based) 的繞徑協定,如 AODV 以及 DSR…等,能使得行動隨意式網路(MANET)具備更好的規模可變性與更低的路由負載。然而,以位址資訊為基礎的繞徑協定在遞送封包之前,首先需依賴位置服務法 (location services scheme)來提供他們目的地點的位置,然後他們才能將封包正確地遞送至目的地。因此,保持以位址資訊為基礎的繞徑協定的優點便是設計一個位置服務法,其需要具備有越高的規模可變性(Scalability)以及越低的協定控制負擔(Protocol overhead)。本篇論文提出 SEEKER來完成上述的目標。SEEKER的基本想法是使用群聚更新(aggregate update) 的方式整合一群行動主機(mobile nodes)並使他們能同時更新他們目前的位置。使用此種方法,我們嘗試去減低大部分的位址更新或維護的負擔(update overhead),同時保持很高的查詢成功率 (query success rate)。除此之外,SEEKER可改變位置更新的間隔時間來適應行動主機移動速度的改變,這樣能使SEEKER 節省更多位置更新的負擔。我們使用四種衡量方式來模擬 SEEKER:位置維護成本(Location maintenance cost),位置查詢成本(Location query cost),以及查詢的成功率(Query success rate),封包遞送成功率(Packet Delivery Rate)。在我們的模擬中,將 SEEKER與其它四個位置服務法 – GLS,HIGH-GRADE,XYLS,及GHLS 做比較。模擬與比較的結果顯示SEEKER具有同等地好的效能。 The location-based routing protocols for mobile ad-hoc networks (MANETs) use geographic information to achieve higher scalability and lower control overhead than those of the topology-based routing protocols, e.g. AODV and DSR, etc. However, location-based routing protocols rely on location services scheme to provide them with the location information of the destination position, so they can forward packets to the destination properly. To keep the advantage of the location-based routing protocol, the location service should has as high as possible scalability and as low as possible control overhead. This paper proposes SEEKER to accomplish such goals. The basic idea of SEEKER is the aggregate update that integrates a group of position updates to perform them altogether. In this way, we reduce a lot of location maintenance (update) overhead, and meanwhile query success rate is kept comparably high. Moreover, SEEKER can adapt to mobility by changing the frequency of the aggregate update. This can make SEEKER save more location update cost. We simulate SEEKER in terms of four metrics: the location maintenance cost, the location query cost, the query success rate, and the packet delivery rate. We also compare SEEKER with four location services - GLS, HIGH-GRADE, XYLS and GHLS. The results show that SEEKER has comparably good performances.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明