An Incentive Framework for Cellular Traffic Offloading

被引:117
作者
Zhuo, Xuejun [1 ]
Gao, Wei [2 ]
Cao, Guohong [3 ]
Hua, Sha [4 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100193, Peoples R China
[2] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37919 USA
[3] Penn State Univ, Dept Comp Sci & Engn, State Coll, PA 16802 USA
[4] NYU, Polytech Inst, Dept Elect & Comp Engn, MetroTech Ctr 6, Brooklyn, NY 11201 USA
关键词
Cellular traffic offloading; auction; delay tolerant networks; WiFi hotspots;
D O I
10.1109/TMC.2013.15
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cellular networks (e.g., 3G) are currently facing severe traffic overload problems caused by excessive traffic demands. Offloading part of the cellular traffic through other forms of networks, such as Delay Tolerant Networks (DTNs) and WiFi hotspots, is a promising solution. However, since these networks can only provide intermittent connectivity to mobile users, utilizing them for cellular traffic offloading may result in a nonnegligible delay. As the delay increases, the users' satisfaction decreases. In this paper, we investigate the tradeoff between the amount of traffic being offloaded and the users' satisfaction. We provide a novel incentive framework to motivate users to leverage their delay tolerance for cellular traffic offloading. To minimize the incentive cost given an offloading target, users with high delay tolerance and large offloading potential should be prioritized for traffic offloading. To effectively capture the dynamic characteristics of users' delay tolerance, our incentive framework is based on reverse auction to let users proactively express their delay tolerance by submitting bids. We further illustrate how to predict the offloading potential of the users by using stochastic analysis for both DTN and WiFi cases. Extensive trace-driven simulations verify the efficiency of our incentive framework for cellular traffic offloading.
引用
收藏
页码:541 / 555
页数:15
相关论文
共 32 条
[1]  
ANDEREGG L, 2003, P ACM MOBICOM
[2]  
[Anonymous], 2013, CRAWDAD METADATA UMA
[3]  
[Anonymous], 2003, P ANN ALL C COMM CON
[4]  
Archer Aaron, 2004, Internet Mathematics, V1, P129
[5]  
Balasubramanian A., 2010, P ACM MOBISYS
[6]   REVERSE AUCTION AND THE SOLUTION OF INEQUALITY CONSTRAINED ASSIGNMENT PROBLEMS [J].
Bertsekas, Dimitri P. ;
Castanon, David A. ;
Tsaknakis, Haralampos .
SIAM JOURNAL ON OPTIMIZATION, 1993, 3 (02) :268-297
[7]  
Boldrini C., 2008, P ACM 3 WORKSH CHALL
[8]  
Clarke E. H., 1971, Pub- lic choice, P17, DOI DOI 10.1007/BF01726210
[9]   Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks [J].
Costa, Paolo ;
Mascolo, Cecilia ;
Musolesi, Mirco ;
Picco, Gian Pietro .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (05) :748-760
[10]  
Cramton P, 2002, HANDBOOK OF TELECOMMUNICATIONS ECONOMICS, VOL 1: STRUCTURE, REGULATION AND COMPETITION, P605