請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24753完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 周承復(Cheng-Fu Chou) | |
| dc.contributor.author | Chun-Wei Chen | en |
| dc.contributor.author | 陳俊瑋 | zh_TW |
| dc.date.accessioned | 2021-06-08T05:56:04Z | - |
| dc.date.copyright | 2011-08-16 | |
| dc.date.issued | 2011 | |
| dc.date.submitted | 2011-08-08 | |
| dc.identifier.citation | [1] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” in ACM SIGCOMM, 2003.
[2] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Pocket Switched Networks: Real-World Mobility and its Consequences for Opportunistic Forwarding,” University of Cambridge, Computer Lab, Tech. Rep. UCAM-CL-TR-617, Feb, 2005. [3] M. Motani, V. Srinivasan, and P. S. Nuggehalli, “Peoplenet: engineering a wireless virtual social network,” in ACM MobiCom, 2005. [4] “WiFi Direct,” http://www.wi-fi.org/Wi-Fi Direct.php. [5] V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, “Rfc 4838, delay-tolerant networking architecture,” IRTF DTN Research Group, 2007. [6] B. Han, P. Hui, V. A. Kumar, M. V. Marathe, G. Pei, and A. Srinivasan, “Cellular traffic offloading through opportunistic communications: a case study,” in Proceedings of the 5th ACM workshop on Challenged networks (CHANTS), 2010. [7] A. Lindgren, A. Doria, and O. Schel’en, “Probabilistic Routing in Intermittently Connected Networks,” ACM SIGMOBILE Mobile Computing and Communications Review,vol. 7, no. 3, 2003. [8] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Performance Analysis of Mobility-Assisted Routing,” in ACM MobiHoc, 2006. [9] E. M. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,” in ACM MobiHoc, 2007. [10] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble Rap: Social-based Forwarding in Delay Tolerant Networks,” in ACM MobiHoc, 2008. [11] Q. Yuan, I. Cardei, and J. Wu, “Predict and Relay: an Efficient Routing in Disruption-Tolerant Networks,” in ACM MobiHoc, 2009. [12] W. Zhao, M. Ammar, and E. Zegura, “Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms,” in ACM SIGCOMM workshop on Delay tolerant networking (WDTN), 2005. [13] U. Lee, S. Y. Oh, K.-W. Lee, and M. Gerla, “RelayCast: Scalable Multicast Routing in Delay Tolerant Networks,” in IEEE International Conference on Network Protocols (ICNP), 2008. [14] W. Gao, Q. Li, B. Zhao, and G. Cao, “Multicasting in Delay Tolerant Networks: A Social Network Perspective,” in ACM MobiHoc, 2009. [15] S. Ioannidis, A. Chaintreau, and L. Massoulie, “Optimal and Scalable Distribution of Content Updates over a Mobile Social Network,” in IEEE INFOCOM, 2009. [16] H. Kuhn, “The hungarian method for the assignment problem,” Naval research logistics quarterly, vol. 2, no. 1-2, pp. 83–97, 1955. [17] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Tech. Rep. CS-200006, Duke University, 2000. [18] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: An efficient routing scheme for intermittently connected mobile networks,” in ACM SIGCOMM workshop on Delay-tolerant networking (WDTN), 2005. [19] W. Gao and G. Cao, “User-Centric Data Dissemination in Disruption Tolerant Networks,” in IEEE INFOCOM, 2011. [20] D. B. West, Introduction to Graph Theory (2nd Edition). Prentice Hall, 1999. [21] V. Srinivasan, M. Motani, and W. T. Ooi, “Analysis and Implications of Student Contact Patterns Derived from Campus Schedules,” in ACM MobiCom, 2006. [22] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, “Pocket Switched Networks and Human Mobility in Conference Environments,” in ACM SIGCOMM workshop on Delay-tolerant networking (WDTN), 2005. [23] N. Eagle and A. Pentland, “Reality Mining: Sensing Complex Social Systems,” Personal and Ubiquitous Computing, vol. 10, no. 4, p. 268, 2006. [24] K. Lee, S. Hong, S. Kim, I. Rhee, and S. Chong, “Slaw: A New Mobility Model for Human Walks,” in IEEE INFOCOM, 2009. [25] “Last.fm,” http://www.last.fm. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24753 | - |
| dc.description.abstract | 由於行動裝置的興起與普遍化，使用者期望可以透過裝置之上的短距離傳輸媒介，如Wifi或是藍芽(Bluetooth)，在與其他使用者接近的時候能夠互相的交換多媒體檔案或是資訊；然而過去在這種延遲容忍網路下的資料散布研究大多注重在單一資料的散布並且沒有考慮到使用者對於不同檔案的喜好程度，因此在本篇論文中，我們提出一個注重使用者偏好，在延遲容忍網路中最大化使用者效用的檔案傳播機制。
而因為在這樣的行動社群網路中的網路連線狀態並不穩定，當使用者在相遇時間有限的情況之下，必須考慮到未來所產生的效益，選擇對整個網路最有效益的資料進行傳送來滿足所有的使用者。 我們把這樣的問題表示成一個最大權二分圖完美匹配的問題，並且提出使用者未來效用貢獻的估算方法。 透過模擬驗證的方式，我們所提出的方式比起以往單純考慮機率或是沒有考慮未來貢獻的方式，的確可以提高整體使用者的平均效用。 | zh_TW |
| dc.description.abstract | As mobile devices have become more ubiquitous, mobile users increasingly
expect to utilize proximity-based connectivity, e.g., WiFi and Bluetooth, to opportunistically share multimedia content based on their personal preferences. However, many previous studies investigate content dissemination protocols that distribute a single object to as many users in an opportunistic mobile social network as possible without considering user preference. In this paper, we propose PrefCast, a preference-aware content dissemination protocol that targets on maximally satisfying user preference for content objects. Due to non-persistent connectivity of users in a mobile social network, when a user meets users for a limited contact duration, it needs to efficiently disseminate a suitable set of objects that can bring possible future contacts a high utility (the quantitative metric of preference satisfaction). We formulate such a problem as a maximum-utility forwarding model, and propose an algorithm that enables each user to predict how much utility it can contribute to possible future contacts and solve its optimal forwarding schedule in a distributed manner. Our trace-based evaluation shows that PrefCast can produce a 18:5% and 25:2% higher average utility than the protocols that only consider contact frequency and preference of local contacts, respectively. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-08T05:56:04Z (GMT). No. of bitstreams: 1 ntu-100-R98944008-1.pdf: 688964 bytes, checksum: 6e4bf8b4e0feff763b052a37c433a0b2 (MD5) Previous issue date: 2011 | en |
| dc.description.tableofcontents | 致謝ii
中文摘要iv Abstract v List of Figures ix List of Tables x 1 Introduction 1 2 Related Work 5 3 PrefCast Framework 7 3.1 Problem Definition and Assumptions . . . . . . . . . . . . . . . . . . . . 7 3.2 Maximum-Utility Forwarding Model . . . . . . . . . . . . . . . . . . . . 9 3.3 Optimal Forwarding Scheduling Algorithm . . . . . . . . . . . . . . . . 13 3.4 How Well does Greedy Approximate the Optimal Solution? . . . . . . . . 14 4 Metric Estimation 17 5 Performance Evaluation 22 5.1 Performance of PrefCast . . . . . . . . . . . . . . . . . . . . . . . . . . 23 5.2 Sensitivity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 6 Conclusion 31 Bibliography 32 Appendices 35 .1 Performance Gap between the Optimal and Greedy Solutions . . . . . . . 36 | |
| dc.language.iso | en | |
| dc.subject | 最大權二分圖完美匹配 | zh_TW |
| dc.subject | 延遲容忍網路 | zh_TW |
| dc.subject | 資料散布 | zh_TW |
| dc.subject | 注重偏好 | zh_TW |
| dc.subject | 效益貢獻 | zh_TW |
| dc.subject | Utility contribution | en |
| dc.subject | Maximum weighted bipartite matching | en |
| dc.subject | Delay tolerant networks(DTNs) | en |
| dc.subject | Content dissemination | en |
| dc.subject | Preference-aware | en |
| dc.title | 延遲容忍網路中注重使用者偏好的資料散布機制 | zh_TW |
| dc.title | Preference-Aware Data Dissemination in Delay Tolerant Networks | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 99-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 林靖茹(Ching-Ju Lin),吳曉光(Hsiao-Kunag Wu),蔡子傑(Tzu-Chieh Tsai),王協源(Shie-Yuan Wang) | |
| dc.subject.keyword | 延遲容忍網路,資料散布,注重偏好,效益貢獻,最大權二分圖完美匹配, | zh_TW |
| dc.subject.keyword | Delay tolerant networks(DTNs),Content dissemination,Preference-aware,Utility contribution,Maximum weighted bipartite matching, | en |
| dc.relation.page | 37 | |
| dc.rights.note | 未授權 | |
| dc.date.accepted | 2011-08-08 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊網路與多媒體研究所 | zh_TW |
| 顯示於系所單位： | 資訊網路與多媒體研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-100-1.pdf 未授權公開取用 | 672.82 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。