簡易檢索 / 詳目顯示

研究生: 劉威呈
WEI-CHENG LIU
論文名稱: 無線隨意網路中考量連結穩定度的協同資料快取方法
A Link-Stability-Based Cooperative Cache Policy for Mobile Ad Hoc Networks
指導教授: 呂永和
Yung-Ho Lu
口試委員: 楊維寧
Wei-Ning Yang
葉耀明
Yao-Ming Yeh
學位類別: 碩士
Master
系所名稱: 管理學院 - 資訊管理系
Department of Information Management
論文出版年: 2006
畢業學年度: 94
語文別: 中文
論文頁數: 58
中文關鍵詞: 無線隨意網路資料快取資料備份穩定度
外文關鍵詞: Mobile Ad Hoc Network, Data Cache, Data Replication, Stability
相關次數: 點閱:270下載:5
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在無線隨意網路的環境下,因為網路拓樸經常變動 ,節點間的連線時常會中斷,導致網路斷裂的情形發生。為了要解決網路斷裂的問題,可以使用資料備分。資料備份的策略主要是每個節點要考量快取哪些資料項在自己的快取空間中,以提升整體的網路效益。現有關於資料備份策略的研究主要是著重於節點要備份哪些資料對自己最有益處,或是對周圍的其他節點會有幫助,而對於節點間連線的穩定性的討論不多。
    在本論文中,我們提出一個考慮節點連線穩定度的資料備份策略,我們利用節點間過去的一段時間的連接情況來當作衡量節點間的穩定度的依據。當兩節點過去的連接情況越頻繁,則兩節點對於彼此的資料快取的內容影響會越大。經過模擬的實驗結果顯示,我們的資料備份方法對於資料的可存取性和請求延遲而言,皆有不錯的表現。


    In Mobile Ad Hoc Networks (MANETs), a mobile client can move freely around the network. The mobility of a mobile client causes the rapidly change on the network topology, unstable connection between mobile nodes and frequent network division. To solve this problem, data replication is proposed. In a data replication method, each node considers which data items should be cached in its local storage to improve the system performance. In the recent researches, each mobile client usually stores the data items that bring the most advantage to itself and its neighbors. However, only a few researches take into account of the link stability between mobile clients. In this thesis, we propose a data replication scheme of this sort.
    We measure the stability between two mobile clients by their link conditions in a recent period of time. If two nodes connect frequently in a recent period of time, the link between them is more stable and they tend to be more cooperative in replica allocation. Through an experiment using NS2, we show that our scheme offers better performance in terms of data accessibility and query delay.

    中文摘要 I 英文摘要 II 目錄 III 圖表目錄 V 第一章 序論 1 1.1關於無線隨意網路 1 1.2無線隨意網路的應用環境 2 1.3無線隨意網路的特性 3 1.4無線隨意網路下的資料備份策略 6 1.5研究動機 9 1.6論文架構 10 第二章 相關研究 11 第三章 研究方法 19 3.1問題定義 19 3.2系統模型及環境假設 21 3.3快取空間與穩定度的探討 22 3.3.1快取空間與穩定度的關係 22 3.3.2何謂穩定度 23 3.3.3穩定度的衡量 24 3.4快取空間分配策略 33 3.4.1快取空間的大小配置 34 3.4.2快取空間的內容配置 36 第四章 實驗結果與分析 43 4.1軟硬體環境 44 4.2環境參數設定 44 4.3實驗分析結果 46 第五章 結論與未來展望 55 參考文獻 57

    1.T. Hara, "Effective replica allocation in ad hoc networks for improving data accessibility, " IEEE INFOCOM 2001, vol.3, pp.1568 - 1576, April 2001

    2.T. Hara, "Replica allocation in ad hoc networks with periodic data update, "Proc. of Mobile Data Management 2002. pp. 79 – 86, Jan. 2002

    3.L. Yin and G. Cao, " Balancing the Tradeoffs between Data Accessibility and Query Delay in Ad Hoc Networks,'' IEEE Symposium on Reliable Distributed Systems (SRDS), 2004.

    4.T. Hara, N. Murakami, S. Nishio: "Replica allocation for correlated data items in ad hoc sensor networks, ". SIGMOD Record 33(1): 38-43 (2004)

    5.S. Ishihara, M. Tamor,T. Mizuno,T. Watanabe, "Replication of data associated with locations in ad hoc networks, "in proc of IEEE international conference on Mobile Data Management (MDM2004),p.172.2004

    6.J. Cho; S. Oh; J. Kim; H. Ho Lee; J. Lee "Neighbor caching in multi-hop wireless ad hoc networks, " IEEE Communications Letters, Vol. 7 , Issue. 11, Pp. 525 – 527,Nov. 2003

    7.Vittoria Gianuzzi: Data replication effectiveness in mobile ad-hoc networks. PE-WASUN 2004: 17-22

    8.J.-L. Huang and M.-S. Chen, "Exploring Group Mobility for Replica Allocation in a Mobile Ad-Hoc Network, " Proc. of the ACM 12th Intern'l Conf. on Information and Knowledge Management (CIKM-03), Nov. 2003

    9.The Network Simulator - ns-2: http://www.isi.edu/nsnam/ns/

    10.C.Perkins and P. Bhagwat. "Highly dynamic DestinationSequenced Distance-Vector routing (DSDV) for mobile computers, "In Proceedings of the SIGCOMM ’94 ConferenceCommunicationsArchitectures, Protocols and Applications, pages 234–244

    11.G. Karumanchi, S. Muralidharan, and R. Prakash, "InformationDissemination in Partitionable Mobile Ad Hoc Networks, "18th IEEE Symposium on Reliable Distributed Systems,Oct. 1999

    12.F. Sailhan, V. Issarny. "Cooperative Caching in Ad Hoc Networks, " The 4th International Conference on Mobile Data Management, MDM'03. Pages: 13 – 28.2003

    13.L. Yin; G. Cao, "Supporting cooperative caching in ad hoc networks, " INFOCOM 2004, Volume: 4 pp. 2537 - 2547 , 7 March 2004

    14.G. Zipf, "Human Behavior and the Principle of Least Effort, " Addison-Wesley, 1949

    QR CODE