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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113318/144297 (79%)
Visitors : 50955335 Online Users : 951

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

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/106436

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/106436

Title:	考慮時間價值的兩階段群組訊息網路編碼的散播機制 A two-phase network coding design for mobile time-valued group-message dissemination
Authors:	劉亭侁 Liu, Ting Shen
Contributors:	蔡子傑 Tsai, Tzu Chieh 劉亭侁 Liu, Ting Shen
Keywords:	聊天應用程式間歇性連接網路廣播傳輸網絡編碼政大軌跡紀錄機會性社群網路 Chat App Intermittently Connected Networks Broadcast Network Coding NCCU Trace Data Opportunistic Mobile Social Network
Date:	2017
Issue Date:	2017-02-08 16:42:03 (UTC+8)
Abstract:	現今因無線通訊技術的進步，使得人們能方便地利用智慧型裝置透過3G，4G和Wi-Fi等技術彼此溝通聊天。其中，聊天應用是最受智慧型裝置使用者歡迎的應用程式。大部分的聊天應用程式需依賴網路以達到訊息交換的目的。然而網路的頻寬是非常有限的，當使用者處在擁擠的環境中時，他們可能會面臨資源耗盡問題。此外，例如在漫遊的情況下有些使用者並沒有行動網路的存取，導致使用者無法使用聊天應用。因此我們希望利用無線廣播傳輸的特性，開發一個應用於間歇性網路連接的聊天應用程式。然而，廣播傳輸的散播策略若沒有設計得宜，可能導致廣播風暴的問題，使得整體網路效能低落。我們研究的目標是要如何在間歇性網路增加訊息的傳輸效率。為了達成此目標，在我們的研究中考量了許多技術要求，如：訊息具有截止時間與優先權特性、多聊天室應用、傳輸效率。我們提出了一種兩階段基於網絡編碼設計的訊息散播方法，實現在機會性社群網路中的訊息散播。網絡編碼階段，提高網路頻寬的傳輸效率，也能增加網路傳輸的可靠性；預熱階段能提升網路編碼訊息被解開的機率。最後，利用政大的真實軌跡紀錄評估我們所設計的訊息傳播方法。結果顯示，我們的方法是有效率且優於氾濫式的路由協議和一般的網絡編碼散播技術。 Nowadays, the advancement of wireless communication technology has allowed people to use smart phones to communicate with each other more easily via 3G/4G, Wi-Fi, etc. One kind of popular mobile Apps is “chat” App. Most chat Apps rely on the Internet to exchange the messages. However, the bandwidth of network is limited in some circumstances. When users stay in the crowded environment, they will face the resource depletion problem. Besides, some people may not subscribe to any cellular network access, e.g. in roaming scenarios. Therefore, we want to develop a novel mobile Chat APP in intermittently connected networks. We utilize the characteristic of the wireless broadcast transmission. However, it may cause the broadcast storm problem without careful design. How to increase the efficiency of message delivery in such intermittently connected networks is our research goal. To achieve this, technical issues in our research involve message priority, multi-chatroom, deadline and transmission efficiency. We proposed a two-phase network coding design for message dissemination to enable the multi-hop instant messaging in Opportunistic Mobile Social Networks. The network coding phase can increase the bandwidth utility and transmission efficiency. Moreover, it can improve transmission robustness and adaptability. The warm up phase can increase the decoding probability of coded packets. Finally, we evaluated our approach with real trace data from NCCU. The results showed that our approach is effective and superior to the flooding based routing protocol and the pure network coding technique.
Reference:	[1] FireChat: https://opengarden.com/firechat [2] Yu-Chee Tseng , Sze-Yao Ni , Yuh-Shyan Chen , Jang-Ping Sheu, The broadcast storm problem in a mobile ad hoc network, Wireless Networks, v.8 n.2/3, p.153-167, March-May 2002 [3] R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network information flow," IEEE Trans. On Information Theory, vol. 46, pp. 1204-1216, 2000. [4] K. Fall, “A delay-tolerant network architecture for challenged internets.” in Proc. SIGCOMM, 2003. [5] Jian Shen, Sangman Moh, and Ilyong Chung, “Routing Protocols in Delay Tolerant Networks: A Comparative Survey” in International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC’ 08), July 2008 [6] T. Ho, R. Koetter, M. Medard, D. R. Karger, and M.Effros. “The benefits of coding over routing in a randomized setting”International Symposium on Information Theory (ISIT), page 442, July 2003 [7] R. H. Frenkiel, B. R. Badrinath, J. Borres, and R. D. Yates, “The infostations challenge: balancing cost and ubiquity in delivering wireless data,” IEEE Personal Communications, vol. 7, no. 2, pp. 66–71, 2000 [8] A. Demers, D. Greene, C. Houser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry,“Epidemic algorithms for replicated database maintenance,” SIGOPS Operating Systems Review, vol. 22, pp. 8–32, January 1988. [9] TSAI, Tzu-Chieh; CHAN, Ho-Hsiang. NCCU Trace: social-network-aware mobility trace. IEEE Communications Magazine, 2015, 53.10: 144-149. [10] N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, Vol 10(4):255–268, May 2006. [11] 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 [12] 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. [13] CHEN, Yuanzhu, et al. Delay-tolerant networks and network coding: Comparative studies on simulated and real device experiments. Computer Networks, 2015, 83: 349-362. [14] OSTOVARI, Pouya; KHREISHAH, Abdallah; WU, Jie. Broadcasting with hard deadlines in wireless multihop networks using network coding. Wireless Communications and Mobile Computing, 2015, 15.5: 983-999. [15] Ostovari, Pouya, Jie Wu, and Abdallah Khreishah. "Deadline-aware broadcasting in wireless networks with local network coding." Computing, Networking and Communications (ICNC), 2012 International Conference on. IEEE, 2012. [16] Spyropoulos, Thrasyvoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. "Spray and wait: an efficient routing scheme for intermittently connected mobile networks." Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM, 2005. [17] Xiao, Mingjun, Jie Wu, and Liusheng Huang. "Community-aware opportunistic routing in mobile social networks." IEEE Transactions on Computers 63.7 (2014): 1682-1695. [18] Jorg Widmer, Jean-Yves Le Boudec, Network coding for efficient communication in extreme networks, in: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, 2005, pp. 284–291. [19] 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. [20] 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. [21] 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. [22] 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. [23] https://github.com/NCCU-MCLAB/NCCU-Trace-Data [24] L. Li, R. Ramjee, M. Buddhikot, and S. Miller, “Network coding-based broadcast in mobile ad-hoc networks,” in IEEE INFOCOM, May 2007. [25] http://www.investopedia.com/terms/t/timevalue.asp [26] 郭振茂, "淺談選擇權評價Black-Scholes 公式中希臘字母的應用", 2003 [27] https://en.wikipedia.org/wiki/Greeks_(finance) [28] 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. [29] Marin, Radu-Corneliu, Ciprian Dobre, and Fatos Xhafa. "Exploring Predictability in Mobile Interaction." EIDWT. 2012.
Description:	碩士國立政治大學資訊科學學系 103753010
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0103753010
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Description	Size	Format
301001.pdf		2040Kb	Adobe PDF2	87	View/Open
301002.pdf		2040Kb	Adobe PDF2	54	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 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 © - Feedback