期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2013
卷号：10
期号：3
出版社：IJCSI Press
摘要：Due to the increasing popularity of various applications for smart phones, 3G cellular networks are currently overloaded by mobile data traffic. Offloading mobile cellular network traffic through opportunistic communications is a promising solution to partially solve mobile data traffic, because there is no monetary cost for it. To solve this problem we propose target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. Here, with only k mobile users we study how to select the target set, such that we can minimize the cellular mobile data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then with the help of opportunistic communications, target-users will further disseminate the information among all the registered users. At last, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). Here we intend three algorithms, called Greedy, Heuristic, and Random, to solve data traffic over cellular mobile data traffic and then evaluate their performance through an extensive trace-driven simulation study. The simulation results check the efficiency of these three algorithms for both synthetic and real-world mobility traces. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we execute a proof-of-concept prototype, called Opp-Off, which utilizes their Bluetooth interface for device/service discovery and content transfer. Through this work we can improve performance, security, and cost of existing data traffic over network.
