Please use this identifier to cite or link to this item:
|Title:||Optimal handing-back point in mobile data offloading||Authors:||Zhang, Da
Yeo, Chai Kiat
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data||Issue Date:||2012||Source:||Zhang, D., & Yeo, C. (2012). Optimal handing-back point in mobile data offloading. 2012 IEEE Vehicular Networking Conference (VNC), pp219-225.||Abstract:||For vehicular users, mobile data offloading through WiFi has proven its feasibility in reducing the data burden on the cellular networks. By delaying the data request for a while before resorting to the cellular network, the vehicular user can utilize the opportunistically available WiFi connections during the delay to serve its request An important question here is: how long should the user wait for the offloading? Delaying a longer period brings more potential offloading opportunities (i.e. offloaded data volume), but makes the user more and more impatient Furthermore, if no satisfactory amount of data can be offloaded through WiFi during the delay period, the user would think the delay is worthless and lose his enthusiasm in such offloading service. How to find the best time to hand-back the data transfer to the cellular networks from the offloading status, to achieve the optimal trade-off between the offloaded data volume and user satisfaction, is the focus of this paper. We propose a model based on semi-Markov process to accurately predict the potential future offloaded volume. The user satisfaction is modeled as a satisfaction function of the delay period. Then a series of algorithms are proposed to find the optimal handing-back time from offloading. Through extensive simulations and numerical results, our scheme shows its high effectiveness and flexibility.||URI:||https://hdl.handle.net/10356/100635
|DOI:||http://dx.doi.org/10.1109/VNC.2012.6407435||Rights:||© 2012 IEEE||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.