政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/100500

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/100500

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113392/144379 (79%)
造訪人次 : 51219687 線上人數 : 901

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/100500

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/100500

題名:	基於社交行為對興趣導向訊息之耐延遲網路傳輸策略 An Interest-based Message Dissemination Approach with Social Behavior Consideration in Delay Tolerant Networks
作者:	陳柏錡 Chen, Po Chi
貢獻者:	蔡子傑 Tsai, Tzu Chieh 陳柏錡 Chen, Po Chi
關鍵詞:	耐延遲網路校園環境個人資訊個人興趣社群關係 Delay-Tolerant Network campus environment personal information personal interest social relationship
日期:	2016
上傳時間:	2016-08-22 11:07:08 (UTC+8)
摘要:	耐延遲網路相較於一般的3G、4G或是Wi-Fi網路是相對受限的，只能利用節點之間短暫的相遇時利用Bluetooth以及Wi-Fi direct交流訊息，他不僅沒有穩定的連線能力，頻寬也相對較小。但耐延遲網路卻因是斷斷續續且可以傳送給現實中相遇的人，使他人幫忙攜帶訊息進而傳送至目的而成優點。因現今社會的人們大多有固定的行經路線像平日的上下班，亦或是學生一定有著固定的課表和交通路線。另外，有共同興趣的人也會朝著特定的地標前進，像喜歡運動的人會往運動中心集中、喜歡閱讀的人會往圖書館借閱書籍、喜歡文藝的人會賞閱展覽。這無形中讓我們可以利用耐延遲網路的方式傳送有特定屬性的廣告訊息給對這特定屬性有興趣的人們。我們在此論文中提出兩種在耐延遲網路上新的資料傳遞方式，我們集合人們有各自的喜好並以人們有相同路徑及有著相同興趣的人們會聚集的特性在人群中傳送訊息，我們預先用手機蒐集歷史資料並統計人群的移動模型再用以驗證未來節點相遇的情況。最後，我們將本論文方法與其它資料傳送方法比較評估效能，模擬結果顯示我們提出的傳送方法有較優的傳送成功率與相對較低的資源耗費。 Compared with 3G, 4G and Wi-Fi, Delay-Tolerant Networking (DTN) can only have intermittent chance to transmit messages with Bluetooth or Wi-Fi direct. Without a clear end-to-end path and relatively lower bandwidth, routing a message in DTN to the destination is difficult. But in some particular case, it could be an advantage. People around the world have their personal habit and it will be projected on their social life. Also, most people have their own routine to work or to school. Therefore we use the social behavior as a foundation feature of our routing algorithm. We propose two new kinds of routing algorithms with our own trace file. On one hand, birds of a feather flock together, so people who have similar interests tend to go to the same places. In case of this, we combining the personal interests and the trace file to different buildings where each node locates, we propose the building-based routing algorithm. On the other hand, we think people who have similar interests hang out together more often, so we use the social relationship as a feature and propose social-based routing algorithm. In the end, we compare our algorithms with Epidemic, MaxProp and PRoPHET routing algorithms. The result shows that our algorithms exceed the others in performance.
參考文獻:	[1] K. Fall, “A delay-tolerant network architecture for challenged internets.” in Proc. SIGCOMM, 2003. [2] E. P. C. Jones, L. Li, and P. A. S. Ward, “Practical routing in delay-tolerant networks,” in Proc. WDTN, 2005. [3] A.Lindgren, A.Doria, and O.Schelen, “Probabilistic routing in intermittently connected networks,” in Proc. SAPIR, 2004 [4] Tzu-Chieh Tsai and Ho-Hsiang Chan, “NCCU Trace: social-network-aware mobility trace,” Communications Magazine, IEEE, vol. 53, pp. 144–149, 2015. [5] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Tech. Rep. CS-2000- 06, Duke Univ., July 2000. [6] BURGESS, J., GALLAGHER, B., JENSEN, D., AND LEVINE, B. N. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proceedings of IEEE Infocom (April 2006). [7] LINDGREN, A., DORIA, A., AND SCHELEN, O. Probabilistic routing in intermittently connected networks. In The First International Workshop on Service Assurance with Partial and Intermittent Resources (SAPIR) (2004). [8] Zhang, Xiaomei, and Guohong Cao. "Transient community detection and its application to data forwarding in delay tolerant networks." 2013 21st IEEE International Conference on Network Protocols (ICNP). IEEE, 2013. [9] Bigwood, Greg, et al. "Exploiting self-reported social networks for routing in ubiquitous computing environments." 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. IEEE, 2008. [10] Sanguankotchakorn, Teerapat, Shradha Shrestha, and Nobuhiko Sugino. "Effective ad hoc social networking on OLSR MANET using similarity of interest approach." International Conference on Internet and Distributed Computing Systems. Springer Berlin Heidelberg, 2012. [11] A. Mei, G. Morabito, P. Santi and J. Stefa, “Social-aware stateless forwarding in pocket switched networks,” in Proc. 30th IEEE Conference on Computer Communications(INFOCOM) mini-conference, 2011. [12] K. Zhu, W. Li, and X. Fu. Rethinking routing information in mobile social networks: Location-based or social-based? Elsevier Computer Communications (to appear), 2014. [13] W. Gao, Q. Li, B. Zhao, G. Cao Multicasting in delay tolerant networks: a social network perspective MobiHoc ’09: Proceedings of the 10th ACM International Symposium on Mobile ad hoc Networking and Computing, ACM, New York, NY, USA (2009), pp. 299–308 [14] N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, Vol 10(4):255–268, May 2006. [15] P. Hui, People are the network: experimental design and evaluation of social-based forwarding algorithms, Ph.D. dissertation, UCAM-CL-TR-713. University of Cambridge, Comp.Lab., 2008 [16] V. Srinivasan, M. Motani, and W. T. Ooi, “Analysis and implications of student contact patterns derived from campus schedules,” in Proc.ACM MobiCom, Los Angeles,CA, Sep.2006,pp.86–97. [17] P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. Proc. MobiHoc, pages 241–250, 2008. [18] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of human mobility on the design of opportunistic forwarding algorithms,” in Proc. INFOCOM, April 2006. [19] T. Karagiannis, J.-Y. Le Boudec, and M. Vojnovic, “Power law and exponential decay of inter contact times between mobile ´ devices,” in ACM MobiCom ’07, 2007. [20] J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft, “Opportunistic content distribution in an urban setting,” in ACM CHANTS, 2006, pp. 205–212. [21] Y. Zhang, W. Gao, G. Cao, T. L. Porta, B. Krishnamachari, and A. Iyengar, “Social-Aware Data Diffusion in Delay Tolerant MANET,” Handbook of Optimization in Complex Networks: Communication and Social Networks, 2010 [22] E. Daly and M. Haahr, “Social network analysis for routing in disconnected delay-tolerant manets,” in Proceedings of ACM MobiHoc, 2007. [23] Socievole, Annalisa, Floriano De Rango, and Antonio Caputo. "Wireless contacts, Facebook friendships and interests: Analysis of a multi-layer social network in an academic environment." 2014 IFIP Wireless Days (WD). IEEE, 2014. [24] Cabrero, Sergio, et al. "Understanding Opportunistic Networking for Emergency Services: Analysis of One Year of GPS Traces." Proceedings of the 10th ACM MobiCom Workshop on Challenged Networks. ACM, 2015. [25] https://github.com/NCCU-MCLAB/NCCU-Trace-Data [26] A. Ker¨anen, J. Ott, and T. K¨arkk¨ainen. The ONE Simulator for DTN Protocol Evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, March 2009.
描述:	碩士國立政治大學資訊科學學系 103753009
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0103753009
資料類型:	thesis
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
300901.pdf	2873Kb	Adobe PDF2	226	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋