臺灣博碩士論文加值系統

行動點對點網路（Mobile Peer-to-Peer network，簡稱MP2P）是由一些移動節點(mobile node)所組合而成，它們只能與一步鄰居溝通。每個節點可能會產生資料（report），並可能存在某些節點對資料感興趣，並希望可以取得資料，但對產生資料的節點而言，並非每個對資料感興趣的節點都在自己的溝通範圍之內，故節點之間需要倚賴儲存並轉發（store-and-forward）方式來一步步達到多步資料傳遞的目的。本論文的目標在解決儲存空間、頻寬、電力資源限制的MP2P環境中，如何可以在較短的時間內，讓更多資料傳到有興趣的節點。我們提出一個評分的機制，來引導每個節點在完全分散式的系統下，可以選擇對的資料來儲存並轉發。我們透過模擬程式來進行方法驗證，並發現我們的模擬結果和另一個行動點對點資料散播演算法RANDI相比，我們的評分機制不僅達到有效率的資料傳遞，更可以有效地減少資源的花費。

A mobile Peer-to-Peer (MP2P) network is a network which composes of a set of mobile nodes in which communication is restricted to one-hop neighbors. In such a network, some nodes may produce reports (or information/data) that are of interest to some other nodes. However, nodes who are interested in those reports may not be in the communication range of a report producer, and thus cannot receive the reports immediately. Data dissemination deals with delivering a report to mobile nodes that have expressed their interest in the report through intermediate nodes by way of relaying. Typically, a relay node exchanges and stores the report when it encounters another node that has a copy of the report, and later forwards the report to the interested nodes. Since most mobile nodes have limited storage, bandwidth and energy, we need to take it into consideration the resource constraints when designing data dissemination scheme for a MP2P network. The main objective of this thesis is to present a data dissemination protocol that improves the performance of system while enjoying low communication overhead. Basically, our scheme is based on a ranking mechanism that helps guide each node to choose a set of reports for exchange in an efficient manner. We also build a simulator to evaluate our protocol. Comparing with the existing methods, our protocol can not only provide effective data dissemination but also reduce the traffic cost efficiently.

Abstract ii
誌謝 iii
目錄 iv
圖目錄 v
第一章 緒論 1
1.1背景 1
1.2論文目標 5
1.3 論文架構 6
第二章 相關研究 7
第三章 我們的資料散播協定 12
3.1網路模型與假設 12
3.2方法概述 13
3.3 歷史資訊收集 17
3.4 分數計算 20
3.5 分數排序及傳送 25
3.6 暫存更新 26
第四章 效能評估與模擬結果 28
4.1 效能評估 28
4.1.1 RANDI 29
4.2 模擬參數和環境設定 29
4.3 模擬結果 30
4.3.1 Response-time Bounded Throughput 30
4.3.2 Communication cost 34
4.3.3 Other 37
第五章 結論與未來展望 38
重要參考文獻 40

[1]O. Wolfson, X. Bo, Y. Huabei, and C. Hu, "Search-and-Discover in Mobile P2P Network Databases," in Procedings of 26th IEEE International Conference on Distributed Computing Systems, 2006, pp. 65-65.
[2]D. Gavidia and M. van Steen, "A probabilistic replication and storage scheme for large wireless networks of small devices," in Procedings of 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, pp. 469-476.
[3]S. K. Goel, M. Singh, X. Dongyan, and L. Baochun, "Efficient peer-to-peer data dissemination in mobile ad-hoc networks," in Proceedings of International Conference on Parallel Processing Workshops, 2002, pp. 152-158.
[4]T. Repantis and V. Kalogeraki, "Data dissemination in mobile peer-to-peer networks," in Procedings of Sixth International Conference on Mobile Data Management, 2005, pp. 211-219.
[5]L. Yan, O. Wolfson, and X. Bo, "A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks," in Procedings of Third International Conference on Wireless and Mobile Communications, 2007, pp. 50b-50b.
[6]X. Bo, A. Ouksel, and O. Wolfson, "Opportunistic resource exchange in inter-vehicle ad-hoc networks," in Proceedings of 2004 IEEE International Conference on Mobile Data Management, 2004, pp. 4-12.
[7]O. Wolfson, X. Bo, and A. P. Sistla, "An economic model for resource exchange in mobile peer to peer networks," in Proceedings of 16th International Conference on Scientific and Statistical Database Management, 2004, pp. 235-244.
[8]M. Papadopouli and H. Schulzrinne, "Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices," in Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2001, pp. 117-127.
[9]M. Motani, V. Srinivasan, and P. S. Nuggehalli, "PeopleNet: Engineering a wireless virtual social network," in Procedings of Eleventh Annual International Conference on Mobile Computing and Networking, 2005, pp. 243-257.
[10]K. Do Hoon, L. Myoung Rak, H. Longzhe, and H. P. In, "Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing," in Procedings of International Conference on Multimedia and Ubiquitous Engineering, 2008, pp. 384-389.
[11]P. Costa, C. Mascolo, M. Musolesi, and G. P. Picco, "Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks," IEEE Journal on Selected Areas in Communications, vol. 26, pp. 748-760, 2008.
[12]O. Wolfson, B. Xu, and R. M. Tanner, "Mobile peer-to-peer data dissemination with resource constraints," in Procedings of 8th International Conference on Mobile Data Management, 2007, pp. 16-23.