Win-Coupon: An incentive framework for 3G traffic offloading

3G networks are currently facing severe traffic overload problems caused by excessive demands of mobile users. Offloading part of the 3G traffic through other forms of networks, such as Delay Tolerant Networks (DTNs), WiFi hotspots, and Femtocells, is a promising solution. However, since these networks can only provide intermittent and opportunistic connectivity to mobile users, utilizing them for 3G traffic offloading may result in a non-negligible 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 3G 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 take DTN as a case study to illustrate how to predict the offloading potential of the users by using stochastic analysis. Extensive trace-driven simulations verify the efficiency of our incentive framework for 3G traffic offloading.

[1]  Yuguang Fang,et al.  Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding , 2009, IEEE INFOCOM 2009.

[2]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[3]  Xiang-Yang Li,et al.  SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks , 2010, IEEE Transactions on Computers.

[4]  Kyunghan Lee,et al.  Mobile Data Offloading: How Much Can WiFi Deliver? , 2013, IEEE/ACM Transactions on Networking.

[5]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[6]  Xia Zhou,et al.  eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.

[7]  Aravind Srinivasan,et al.  Cellular traffic offloading through opportunistic communications: a case study , 2010, CHANTS '10.

[8]  Spectrum Auctions Spectrum Auctions , 2010 .

[9]  Qinghua Li,et al.  Contact duration aware data replication in Delay Tolerant Networks , 2011, 2011 19th IEEE International Conference on Network Protocols.

[10]  Marco Conti,et al.  Modelling data dissemination in opportunistic networks , 2008, CHANTS '08.

[11]  Dimitri P. Bertsekas,et al.  Reverse Auction and the Solution of Inequality Constrained Assignment Problems , 1993, SIAM J. Optim..

[12]  Geoffrey M. Voelker,et al.  Access and mobility of wireless PDA users , 2003, MOCO.

[13]  E. H. Clarke Multipart pricing of public goods , 1971 .

[14]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[15]  Marcelo Dias de Amorim,et al.  Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[16]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[17]  Qinghua Li,et al.  Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[18]  Ramesh Govindan,et al.  Energy-delay tradeoffs in smartphone applications , 2010, MobiSys '10.

[19]  Haitao Zheng,et al.  A General Framework for Wireless Spectrum Auctions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[20]  Arun Venkataramani,et al.  Augmenting mobile 3G using WiFi , 2010, MobiSys '10.

[21]  Brian D. Noble,et al.  BreadCrumbs: forecasting mobile connectivity , 2008, MobiCom '08.

[22]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[23]  Baochun Li,et al.  Stochastic analysis of network coding in epidemic routing , 2008, IEEE Journal on Selected Areas in Communications.

[24]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[25]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[26]  K. Jain,et al.  Practical Network Coding , 2003 .

[27]  Yu Wang,et al.  Truthful Multicast in Selfish Wireless Networks , 2004 .

[28]  Peter Cramton,et al.  The Efficiency of the Fcc Spectrum Auctions* , 1998, The Journal of Law and Economics.