Cellular networks are overloaded due to the mobile traffic surge,and mobile social networks(MSNets) can be leveraged for traffic offloading.In this paper,we study the issue of choosing seed users for maximizing the mo...Cellular networks are overloaded due to the mobile traffic surge,and mobile social networks(MSNets) can be leveraged for traffic offloading.In this paper,we study the issue of choosing seed users for maximizing the mobile traffic offloaded from cellular networks.We introduce a gossip-style social cascade(GSC) model to model the epidemic-like information diffusion process in MSNets.For static-case and mobile-case networks,we establish an equivalent view and a temporal mapping of the information diffusion process,respectively.We 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) problem.Experiments 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.展开更多
基金supported by the National Basic Research Program of China(973 Program) through grant 2012CB316004the Doctoral Program of Higher Education(SRFDP)+1 种基金Research Grants Council Earmarked Research Grants(RGC ERG) Joint Research Scheme through Specialized Research Fund 20133402140001National Natural Science Foundation of China through grant 61379003
文摘Cellular networks are overloaded due to the mobile traffic surge,and mobile social networks(MSNets) can be leveraged for traffic offloading.In this paper,we study the issue of choosing seed users for maximizing the mobile traffic offloaded from cellular networks.We introduce a gossip-style social cascade(GSC) model to model the epidemic-like information diffusion process in MSNets.For static-case and mobile-case networks,we establish an equivalent view and a temporal mapping of the information diffusion process,respectively.We 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) problem.Experiments 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.
