Epidemic-Like Proximity-Based Traffic Offloading

作     者：DONG Wenxiang CHEN Jie YANG Ying ZHANG Wenyi 

作者机构：Department of Electronic Engineering and Information ScienceUniversity of Science and Technology of China Key Laboratory of Wireless-Optical CommunicationsChinese Academy of Sciences 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2015年第12卷第10期

页      面：91-107页

核心收录：

学科分类：0810[工学-信息与通信工程] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Basic Research Program of China(973 Program) through grant 2012CB316004 the Doctoral Program of Higher Education(SRFDP) Research Grants Council Earmarked Research Grants(RGC ERG) Joint Research Scheme through Specialized Research Fund 20133402140001 National Natural Science Foundation of China through grant 61379003 

主　　题：cellular traffic offloading graph theory information diffusion mobile social networks proximity based communication 

摘      要：Cellular networks are overloaded due to the mobile traffic surge,and mobile social networks(MSNets) can be leveraged for traffic *** this paper,we study the issue of choosing seed users for maximizing the mobile traffic offloaded from cellular *** introduce a gossip-style social cascade(GSC) model to model the epidemic-like information diffusion process in *** static-case and mobile-case networks,we establish an equivalent view and a temporal mapping of the information diffusion process,*** further prove the submodularity in the information diffusion and propose a greedy algorithm to choose the seed users for traffic offloading,yielding a sub-optimal solution to the NP-hard traffic offloading maximization(TOM) *** are carried out to study the offloading performance,illustrating that the greedy algorithm significantly outperforms the heuristic and random algorithms,and user mobility can help further reduce cellular load.