A two-phase network coding design for mobile time-valued group-message dissemination

碩士 === 國立政治大學 === 資訊科學學系 === 105 === 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...

Full description

Bibliographic Details
Main Authors: Liu, Ting Shen, 劉亭侁
Other Authors: Tsai, Tzu Chieh
Format: Others
Language:en_US
Online Access:http://ndltd.ncl.edu.tw/handle/m69qg6
Description
Summary:碩士 === 國立政治大學 === 資訊科學學系 === 105 === 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.