Cellular Traffic Offloading through Opportunistic Communications: A Case Study

被引:117
作者
Han, Bo [1 ]
Hui, Pan [2 ]
Kumar, V. S. Anil [3 ]
Marathe, Madhav V. [3 ]
Pei, Guanhong [3 ]
Srinivasan, Aravind [1 ,4 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[2] Deutsch Telekom Labs, D-10587 Berlin, Germany
[3] Bioinformat Inst Virginia Tech, Dept Comp Sci & Virginia, Blacksburg, VA 24061 USA
[4] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA
来源
PROCEEDINGS OF THE 5TH ACM WORKSHOP ON CHALLENGED NETWORKS (CHANTS '10) | 2010年
关键词
Cellular traffic offloading; target-set selection; opportunistic communications; mobile social networks; HUMAN MOBILITY; NETWORK; SCHEME;
D O I
10.1145/1859934.1859943
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the 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. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66% for a real-world mobility trace.
引用
收藏
页码:31 / 38
页数:8
相关论文
共 29 条
  • [1] Balasubramanian A., 2010, P MOBISYS 2010 JUN
  • [2] Balasubramanian N, 2009, IMC'09: PROCEEDINGS OF THE 2009 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P280
  • [3] Beckman R, 2010, 2010 IEEE S NEW FRON, P1
  • [4] Boldrini C., 2008, P INT S WORLD WIR MO, P1, DOI DOI 10.1109/WOWMOM.2008.4594890
  • [5] Impact of human mobility on opportunistic forwarding algorithms
    Chaintreau, Augustin
    Hui, Pan
    Crowcroft, Jon
    Diot, Christophe
    Gass, Richard
    Scott, James
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (06) : 606 - 620
  • [6] Femtocell Networks: A Survey
    Chandrasekhar, Vikram
    Andrews, Jeffrey G.
    Gatherer, Alan
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2008, 46 (09) : 59 - 67
  • [7] Chierichetti F., 2010, P SODA 2010 JAN
  • [8] Domingos P., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P57, DOI 10.1145/502512.502525
  • [9] Social serendipity: Mobilizing social software
    Eagle, N
    Pentland, A
    [J]. IEEE PERVASIVE COMPUTING, 2005, 4 (02) : 28 - 34
  • [10] Inferring friendship network structure by using mobile phone data
    Eagle, Nathan
    Pentland, Alex
    Lazer, David
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (36) : 15274 - 15278