T. H. T. Le, N. H. Tran, P. L. Vo, Z. Han, M. Bennis and C. S. Hong, "Joint Cache Allocation With Incentive and User Association in Cloud Radio Access Networks Using Hierarchical Game," in IEEE Access, vol. 7, pp. 20773-20788, 2019. doi: 10.1109/ACCESS.2019.2896637
Joint cache allocation with incentive and user association in cloud radio access networks using hierarchical game
|Author:||Le, Tra Huong Thi1; Tran, Nguyen H.2; Vo, Phuong Luu1,3;|
1Department of Computer Science and Engineering, Kyung Hee University, Yongin 17104, South Korea
2School of Computer Science, The University of Sydney, Sydney, NSW 2006, Australia
3School of Computer Science and Engineering, International University-Vietnam National University Ho Chi Minh City, Ho Chi Minh City 7000, Vietnam
4Department of Electrical and Computer Engineering, University of Houston, Houston, TX 77004-4005, USA
5Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
|Online Access:||PDF Full Text (PDF, 4.6 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2019101532721
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2019-10-15
In this paper, we consider a cloud radio access network-based system consisting of one network operator (NO) and several content providers (CPs). The NO owns a cloud cache and provides caching as a service for CPs, who provide contents to users. While the NO wishes to motivate CPs to rent its cache and maximize its profit, CPs want to optimize the service performance for users and their renting utilities. Due to the time separation between cache allocation and user association problems, we model the interactions between the NO and CPs as a hierarchical game, i.e., a cache renting scheme between the NO and CPs in the cache allocation problem and the willingness of CPs in the user association problem. In the cache allocation problem, we propose a contract theory-based incentive mechanism in which the NO designs and offers an optimal contract to various types of CPs. We then formulate the user association problem as a many-to-many matching game with externalities. To solve this matching game, we propose a matching algorithm that converges to a two-sided exchange stable matching with low complexity. The simulation results demonstrate that this proposed approach is beneficial to the NO’s profit and incentivize the CP to rent the cache with truthful private information. In addition, the system performance of the proposed approach in terms of the total data rate-delay tradeoff outperforms than the benchmarks.
|Pages:||20773 - 20788|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported by the National Research Foundation of Korea (NRF) funded by the South Korean Government (MSIT), under Grant NRF-2017R1A2A2A05000995.
© 2019 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.