簡易檢索 / 詳目顯示

研究生: 范恆嘉
Heng-Chia Fan
論文名稱: 無線隨意網路中一個帶狀區域的合作快取協定
A Belt-Shaped Region Cooperative Cache Scheme for MANET
指導教授: 呂永和
Yung-ho Leu
口試委員: 楊維寧
Wei-Ning Yang
陳雲岫
Yun-Shiow Chen
學位類別: 碩士
Master
系所名稱: 管理學院 - 資訊管理系
Department of Information Management
論文出版年: 2010
畢業學年度: 98
語文別: 中文
論文頁數: 50
中文關鍵詞: 無線隨意網路資料一致性快取管理合作快取資料驗證與搜尋
外文關鍵詞: Ad Hoc Networks, cache management, data invalidation
相關次數: 點閱:228下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 無線隨意網路(MANET)提供了一個不需要基礎建設的網路環境,適合用於臨時需要網路通訊但卻無基礎建設的情況,像災區救難、戰地通訊等。為了提昇網路整體的效能,常採用資料快取(data caching)技術。但只要環境下的資料會隨著時間的改變而異動,就必須要把資料一致性(data consistency)的議題納入考慮。傳統行動計算網路環境中對備份資料一致性維護方法並不適用於無線隨意網路環境,這是因為傳統行動計算網路中資料的傳遞屬單點跳躍(single-hop),亦即網路中各節點(mobile nodes)可以直接傳到伺服器,不需要靠其他節點的傳遞,若有節點所要求的資料被異動,可以很迅速的和伺服器來索取最新的資料內容。
    而無線隨意網路中,使用的是多點跳躍(multi-hop)的傳送方式,節點與伺服器之間,經常需要靠多個節點傳遞方能傳送資料,無線隨意網路的連線也不是非常穩定,各節點之間連線時常斷線,向伺服器取得最新資料並非有效率的方式,轉向鄰近節點取得最新的備份資料內容是比較可行的方式。故本研究除了快取備份策略之外,還把資料驗證的方法融入,達成一個有效率的快取搜尋策略,讓網路中的節點可以快速的尋獲最新的資料。在無線隨意網路中的快取一致性和快取管理議題上,我們提供了一個資料搜尋策略,減少能源浪費同時能夠快速的獲得最新資料。模擬的結果顯示,我們所提的方法不但減少了能量消耗也縮短了查詢回應時間。


    A Mobile Ad Hoc Network (MANET) is a wireless network which does not need any pre-existing infrastructure. A well-known approach to improve the communication performance of a MANET is to cache the required data items. With cooperative caching, a mobile node caches data items not only for itself but for other nodes which are also interested in the same data items. If the data items in the networks are allowed to be updated, we need to maintain the consistency of the cached data items.
    In this paper, we propose a cache scheme, called belt-shaped region cooperative cache scheme, which includes a cache search strategy, a caching strategy and a consistency-maintaining strategy. In this scheme, we design a new approach to cache data items so that the server can spend minimal cost to maintain the cache consistency and the mobile nodes can find their required data efficiently. This approach reduces the mean distance from a requesting node to the replying node for accessing a required data item. The simulation results show that our approach outperforms the existing methods, such as ACOD and MTS, in terms of query response time and energy consumption.

    摘 要 II Abstract III 圖目錄 V 表目錄 VI 第1章 緒論 1 1.1 行動計算環境 2 1.2 無線隨意網路 3 1.2.1 無線隨意網路的特性與限制 4 1.2.2 無線隨意網路的應用 5 1.3 無線隨意網路快取 7 1.4 無線隨意網路資料驗證與搜尋 7 1.5 研究動機 8 1.6 論文架構 9 第2章 相關研究 10 第3章 研究方法 15 3.1 研究環境系統模型 15 3.2 資料快取策略 19 3.2.1 資料快取流程 19 3.3 資料搜尋策略 21 3.3.1 資料搜尋流程 22 3.4 資料一致性策略 26 3.4.1 資料驗證流程 26 3.5 執行實例 27 第4章 實驗數據分析 33 4.1 軟硬體環境 33 4.2 模擬參數設定 34 4.3 衡量指標 36 4.4 結果分析 37 第5章 結論與未來展望 47 5.1 結論 47 5.2 未來展望 48

    [1] Liangzhong Yin; Guohing Cao, ”Supporting Cooperative Caching in Ad Hoc Networks”, Mobile Computing, IEEE Transaction on, Volume 5, Issue 1, Jan. 2006
    [2] Edward Chan; Wenzhong Li; Daoxu Chen, “Energy saving strategies for cooperative cache replacement in mobile ad hoc networks”, Pervasive and Mobile Computing, ELSEVIER, Volume 5, Issue 1, Feb. 2009
    [3] Ge-Ming Chiu; Cheng-Ru Young, “Exploiting In-Zone Broadcasts for Cache Sharing in Mobile Ad Hoc Networks”, Mobile Computing, IEEE Transaction on, Volume 8, Issue 3, Mar. 2009
    [4] Bin Tang; Himanshu Gupta; Samir R. Das, “Benefit-based Data Caching in Ad Hoc Networks”, Mobile Computing, IEEE Transaction on, Volume 7, Issue 3, Mar. 2008
    [5] Hassan Artail; Haidar Safa; Khaleel Mershad; Zahy Abou-Atme; Nabeel Sulieman, “COACS: A Cooperative and Adaptive Caching System for MANETs”, Mobile Computing, IEEE Transaction on, Volume 7, Issue 8, Aug. 2008
    [6] Daniel Barbara; Tomasz Imielinski, “Sleepers and workaholics: Caching strategies in mobile environments”, in: Preceedings of ACM SIGMOD, 1994, pp. 1-12.
    [7] Yu Du; Sandeep K.S. Gupta; Georgios Varsamopoulos, “Improving on-demand data access efficiency in MANETs with cooperative caching”, Ad Hoc Networks, ELSEVIER, Volume 7, Issue 3, May. 2009
    [8] Sunho Lim; Wang-Chien Lee; Guohong Cao; Chita R. Das, “Performance Comparison of Cache Invalidation strategies for internet-based mobile ad hoc networks”, IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004
    [9] Kun-Lung Wu; Philip S. Yu; Ming-Syan Chen, “Energy-Efficient Caching for Wireless Mobile Computing”, Proc. 20th Int’l Conf. on Data Eng., p.p. 336-345, 1997
    [10] Kian-Lee Tan; Jun Cai, “Broadcast-based group invalidation: An energy efficient cache invalidation scheme”, Information Science 100 p.p. 229-254, 1997
    [11] Jun Cai; Kian-Lee Tan, “Energy-Efficient selective cache invalidation”, Wireless Networks 5, p.p. 489-502, 1999
    [12] Guohong Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Envirements”, IEEE Trans. on Knowledge and Data Engineering, volum15, Issue 5, p.p. 1251-1265, 2003
    [13] The Network Simulator – ns-2:http://www.isi.edu/nsnam/ns/
    [14] Charles Perkins, “Ad-Hoc On Demand Distance Vector Routing (AODV)”, Internet-Draft, November 1997. draft~ietf-manet-aodv-00.txt.
    [15] Lee Breslau; Pei Cao; Li Fan; Graham Philips; Scott Shenker, “Web caching and Zipf-like distributions: Evidence and implications”, in Proceedings of IEEE INFOCOM'99, Pages 126–134, Mar. 1999.
    [16] Laura Feeney; Martin Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in Ad Hoc Networking Environment”, in Proceedings of IEEE INFOCOM, Anchorage, AK, 2001
    [17] Daniela Tulone, “Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems”, Ad Hoc Networks ELSEVIER, Volume 5, Issue 8, Mar. 2007

    QR CODE