曾菊玲^1,,,
张春雷¹,
蒋砺思²,
夏凌¹
1.三峡大学 宜昌 443002
2.University of California，Irvine，CA，USA
基金项目:湖北省软科学计划研究专项(2018ADC038)

详细信息

作者简介:曾菊玲：女，1965年生，博士，副教授，硕士生导师，研究方向为新型组网技术及资源分配、能源互联网
张春雷：男，1992年生，硕士生，方向为新型组网技术及资源分配
蒋砺思：女，1991年生，博士生，方向为MIMO及新型组网技术
夏凌：男，1995年生，硕士生，方向为新型组网及资源分配

通讯作者:曾菊玲　julingzeng23@163.com

中图分类号:TN929.5

计量

文章访问数:909
HTML全文浏览量:360
PDF下载量:63
被引次数:0

出版历程

收稿日期:2019-12-24
修回日期:2020-06-29
网络出版日期:2020-07-17
刊出日期:2021-01-15

Channel’s Price-based Resource Allocation for Wireless Virtual Network: A Hierarchical Matching/ Stackelberg Game Approach

Juling ZENG^1,,,
Chunlei ZHANG¹,
Lisi JIANG²,
Ling XIA¹
1. China Three Gorges University, Yichang 443002, China
2. University of California, Irvine, CA, USA
Funds:The soft science program research project of Hubei province (2018ADC038)


摘要
摘要:针对分层匹配博弈不能跟踪信道变化以及循环迭代收敛慢等问题，该文提出一种基于信道定价的无线虚拟网络资源分配策略：匹配/Stackelberg分层博弈。分别以基于流带宽的用户满意度、系统带宽及切片功率作为报酬函数建立3级联合优化模型，并采用匹配/Stackelberg分层博弈求解。在博弈下层，定义移动虚拟网络操作者(MVNOs)m—切片n对m_n及其与用户(UEs)的1对1匹配博弈以代替UEs与MVNOs的多对1匹配，对
\begin{document}${m_n}$\end{document}定义基于信道平均信息的切片功率价格，加速上、下一致收敛并使UEs适应信道选择最优
，证明均衡点存在并给出了低复杂度的分布式拒绝-接收算法；在博弈上层，基于UEs与
已匹配关系，形成基础资源提供者(InPs)与
的Stackelberg博弈，给出了基于局部信道信息的功率定价和分配策略，使系统效用及频谱效率基于信道最优。最后定义了双层循环稳定条件及过程。仿真表明，该策略在信道跟踪、频谱效率、效用方面均优于随机定价的匹配/Stackelberg分层博弈以及传统分层匹配博弈。
关键词:无线虚拟网络/
分层博弈/
匹配博弈/
Stackelberg博弈/
信道定价
Abstract:For the low iteration convergence rate and the disability to track the change of channels in hierarchical matching game, a new resource allocation strategy for wireless virtual networks, i.e., the channel’s price-based hierarchical matching/Stackelberg game is proposed in this paper. A three-level joint optimization model is established on each layer reward function based on stream’s bandwidth-based user’s satisfaction, the system’s bandwidth and the slice’s power. The hierarchical matching/Stackelberg game is adopted to solve the optimizing problem. In the lower layer of the hierarchical game, the
\begin{document}${m_n}$\end{document}is defined to present Mobile Virtual Network Operator(MVNO) m-InPn and one-to-one matching game between it and UEs is constructed to displace the many-to-one matching game between UEs and MVNOs, where a price based on the global information of channels is given to speed up the identical convergence between the upper and the lower layer and make UEs select the optimal
adapting the channel. After proving the existing of equilibrium, the rejecting-receiving algorithm for one-to-one matching game is proposed. In the upper layer of the hierarchical game, a Stackelberg game between the InPs and many
is formed based on the connection between those users and
, and an optimized power pricing and allocation strategy based on local information of channel are given, which makes the optimal system utility and resource utilization based on channels. Finally, the process for the two-tier cycling is given and the stability of the hierarchical game is characterized. Simulation results show that the channel’s price-based hierarchical matching/Stackelberg game strategy outperforms the random pricing hierarchical matching/Stackelberg game and the conventional hierarchical matching game in the aspect of tracking channel’s changing and spectrum efficiency and system’s utility.
Key words:Wireless virtual network/
Hierarchical game/
Matching game/
Stackelberg game/
Channel pricing



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=5bd8acba-2578-4646-85a0-92f1f0a128ce