簡易檢索 / 詳目顯示

回結果列表
研究生： 羅嘉文
Jia-wen Luo
論文名稱： 無線隨意網路中一個以群組為基礎的合作快取策略
A Group-Based Cooperative Caching Scheme for MANET
指導教授： 呂永和
Yung-Ho Leu
口試委員: 葉耀明
Yao-ming Yeh
楊維寧
Wei-ning Yang
學位類別： 碩士
Master
系所名稱： 管理學院 - 資訊管理系
Department of Information Management
論文出版年： 2011
畢業學年度： 99
語文別： 中文
論文頁數： 50
中文關鍵詞： 合作快取 、隨意網路 、資料一致性
外文關鍵詞： MANETs, Group-based caching
相關次數： 點閱：183  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 在行動隨意網路中，已經有許多針對改善資料可存取性的方法被提出來，合作快取是一個允許多個行動節點之間互相分享快取資料的策略，可以有效提升資料的可存取性，在這篇論文中，我們提出一個在無線隨意網路中，以群組為基礎的合作快取策略，此方法稱為GMC，內容包含一個合作快取策略與一個快取資料一致性的維護策略。此方法使用RKCP2[1]演算法將網路中的節點分成數個互不重疊的1-hop 群組，每一個群組選出一個領導者，群組內的快取資料狀態會由領導者節點負責定期的更新、維護。在我們的方法裡，同一群組內的行動節點的快取空間可以互相支援，重複的快取資料會減少，而平均查詢反應時間也會降低。

    我們使用NS2來做模擬實驗，比較MTS、ACOD以及我們的方法，以不同的查詢間隔時間和資料更新間隔時間進行實驗。實驗的結果顯示，與現有的ACOD及MTS快取策略相比，我們的方法能獲得更低的平均查詢反應時間及能源消耗。

    By allowing data sharing among neighbor nodes, cooperative caching can effectively enhance the data accessibility in a MANET. In this thesis, we propose a group-based cache scheme, termed Group Membership Caching Scheme (GMC), which consists of a cooperative caching strategy and a consistency maintaining strategy. By using the RKCP2[1] algorithm, we partition the nodes in the network into several non-overlapping groups. Within each group a leader is chosen to maintain the information for cooperative caching and to ensure the consistency of the cached data items for the members in its group. In the GMC scheme, the cache space of all the members in a group can be effectively used so that the redundancy in cached data items is minimized and the query response time is reduced. We compare the performance of GMC with those of ACOD and MTS by simulations using NS2. The experimental results show that the GMC scheme attains lower query response time with lower energy consumption.

    摘要 -----------------------------------------------------------------------------------------------I Abstract -------------------------------------------------------------------------------------------II 圖目錄 -------------------------------------------------------------------------------------------V 表目錄 ------------------------------------------------------------------------------------------VI 第一章緒論 ----------------------------------------------------------------------------------1 1.1研究背景 ----------------------------------------------------------------------------1 1.2研究動機 ----------------------------------------------------------------------------3 1.3研究架構 ----------------------------------------------------------------------------5 第二章相關研究 ----------------------------------------------------------------------------6 2.1GroupCaching合作快取方法 ----------------------------------------------------7 2.2MTS(Modified Timestamp) ------------------------------------------------------10 2.2.1IR-Based cache invalidation scheme --------------------------------------10 2.2.2A GPS-based connectivity estimation scheme ---------------------------11 2.2.3MTS ---------------------------------------------------------------------------12 2.3ACOD(Aggregate Cache-based On Demand) ---------------------------------14 第三章研究方法 ---------------------------------------------------------------------------15 3.1動機 ---------------------------------------------------------------------------------15 3.2Group Membership Caching (GMC) -------------------------------------------16 3.2.1研究環境系統模型 ---------------------------------------------------------16 3.2.2群組定義 ---------------------------------------------------------------------17 3.3合作快取策略 ---------------------------------------------------------------------18 3.4資料查詢過程與一致性驗證 ---------------------------------------------------21 3.5資料更新過程 ---------------------------------------------------------------------22 第四章模擬結果與分析 ------------------------------------------------------------------22 4.1模擬環境參數 ---------------------------------------------------------------------22 4.2衡量指標 ---------------------------------------------------------------------------24 4.3結果分析 ---------------------------------------------------------------------------25 4.3.1資料偏斜度(θ值)的影響 --------------------------------------------------25 4.3.2資料查詢週期(request inter-arrival time)的影響 ----------------------29 4.3.3資料更新週期(update inter-arrival time)的影響 -----------------------35 4.3.4資料取代策略條件變動的影響 ------------------------------------------41 第五章結論與未來展望 ------------------------------------------------------------------47 參考文獻 ---------------------------------------------------------------------------------------48

    [1]Bin Xiao, Qingfeng Zhuge, Yi He, Zili Shao, and Edwin H.-M. Sha, “Algorithms for Disk Covering Problems with the Most Points,” In Proceedings of the IASTED international conference on parallel and distributed computing and systems (IASTED PDCS), pp. 541–546, August 2003.
    [2]M. F. Caetano, J. L. Bordim, and M.A.R. Dantas, “A Collaborative Cache Approach for Mobile Ad hoc Networks,” IEEE Symposium on Computers and Communications, pp. 404-410, August 2009.
    [3]N. Chand, R.C. Joshi, and M. Misra, “Efficient Cooperative Caching in Ad Hoc Networks,” First Intl. Conf. on Communication System Software and Middleware, pp. 1-8, August 2006.
    [4]M.K. Denko, Jun Tian, T. Nkwe, and M.S. Obaidat, ”Cluster-Based Cross-Layer Design for Cooperative Caching in Mobile Ad Hoc Networks,” IEEE Systems Journal, vol. 3, no. 4, pp. 499-508, Nov. 2009.
    [5]Y. Du, and S.K.S Gupta, “Coop – a cooperative caching service in manets,” In ICAS-ICNS 2005. Joint Intl. Conf. on Autonomic and Autonomous Systems and IEEE Intl. Conf. on Networking and Services, pp. 58-63, Dec. 2005.
    [6]Han Ke, ”Cooperative Caching Algorithm based on Grouping Nodes in Mobile Ad Hoc Networks,” IEEE International Conference on Information and Automation (ICIA), pp. 1294-1298, July 2010.
    [7]L. Feeney, and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” in Proceedings of IEEE INFOCOM, Anchorage, AK, pp. 1548-1557, 2001.
    [8]Liangzhong Yin, and Guohong Cao, “Supporting Cooperative Caching in Ad Hoc Networks,” IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 77-89, Jan. 2006.
    [9]Michael Rabinovich, Jeff Chase, and Syam Gadde, “Not all hits are created equal : cooperative proxy caching over a wide-area network”, Computer Networks and ISDN Systems, pp. 2253-2259, 1998.
    [10]Sunho Lim, Wang-Chien Lee, Guohong Cao, and Chita R. Das, “Cache invalidation strategies for internet-based mobile ad hoc networks,” Computer Communications, vol. 30, no. 8, pp. 1854-1869, Mar. 2007.
    [11]Takahiro Hara and Sanjay Kumar Madria, “Consistency Management Strategies for Data Replication in Mobile Ad Hoc Networks,” IEEE Transactions on Mobile Computing, vol. 8, no. 7, pp. 950-967, May 2009.
    [12]A. Venkateswaran, V. Sarangan, T.F. La Porta, and R. Acharya, “A Mobility-Prediction-Based Relay Deployment Framework for Conserving Power in MANETs,” IEEE Transactions on Mobile Computing, vol. 8, no. 6, pp. 750-765, April 2009.
    [13]Wenzhong Li, E. Chan, Daoxu Chen, and Sanglu Lu, “Maintaining Probabilistic Consistency for Frequently Offline Devices in Mobile Ad Hoc Networks,” IEEE Intl. Conf. on Distributed Computing Systems, pp.215-222, July 2009.
    [14]Yi-Wei Ting and Yeim-Kuan Chang, “A Novel Cooperative Caching Scheme for Wireless Ad Hoc Networks: GroupCaching,” IEEE Intl. Conf. on Networking, Architecture, and Storage, pp. 62-68, August 2007.
     
    [15]Yu Huang, Jiannong Cao, Beihong Jin, Xianping Tao, Jian Lu, and Yulin Feng, “Flexible Cache Consistency Maintenance over Wireless Ad Hoc Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no.8, pp. 1150-1161, August 2010.

    QR CODE