能量采集小基站中基于斯坦科尔伯格博弈的内容缓存算法  

A Stackelberg game based content caching algorithm in energy-harvesting small cell networks

作　　者：王学婷 朱琦[1] 胡晗[1] WANG Xueting;ZHU Qi;HU Han(Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学,江苏南京210003

出　　处：《电信科学》2019年第1期18-29,共12页Telecommunications Science

基　　金：国家自然科学基金资助项目(No.61571234;No.61631020);江苏省研究生科研与实践创新计划项目(No.KYCX17_0765);江苏省自然科学基金资助项目(No.BK20140894)~~

摘　　要：为了提升用户对下载文献的满意度,提出了能量采集小基站中基于缓存的资源分配算法。算法建立了联合用户接入和小基站缓存内容更新的斯坦科尔伯格博弈,首先提出了基于联盟博弈的用户接入选择算法,算法以用户满意度为效用函数允许用户在各联盟(小基站)之间转移,当转移后的效用能满足转移准则时,用户转移被接受,算法允许多个用户接入同一基站,用户采用NOMA技术共享小基站信道;随后建立小基站缓存更新算法,小基站调整自身的缓存内容以最大化收益。随后两层算法多次迭代,最终获得均衡解。仿真结果证明本算法在用户满意度和能效上都比基于就近接入原则的算法有着更为出色的表现。To improve the users' satisfaction of download files,a caching based resource allocation algorithm in energy-harvesting small cell networks was proposed,which was established as a Stackelberg game that jointly optimized user accessing and small cells1 content updating. Firstly,a coalitonal game for users to transfer between coalitions (small cells) with user satisfaction being utility function was proposed,and the transition was accepted once the utility of user after transferring satisfies the transition rules. Several users were allowed to be served by a same cell,and users accessing the same small cell would share the same channel using NOMA. Then,to maximize the benefit,a cache updating scheme was put forward to update the files cached by small cells. The equilibrium solution could be achieved after finite iterations of the two algorithms. The simulation results show that the proposed novel algorithm performs better in user satisfaction and energy-saving comparing with algorithm using principle of proximity.

关 键 词：联盟博弈 内容缓存 能量采集 NOMA 

分 类 号：TN929.5[电子电信—通信与信息系统]