arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.09662cs.ITmath.IT
收藏

QoS保证下机器类通信的博弈优化

Game-Theoretic Optimization for Machine-Type Communications Under QoS Guarantee

Yu Gu, Qimei Cui, Qiang Ye, Weihua Zhuang

摘要:

大规模机器类型通信(mMTC)是第五代(5G)通信网络中的服务的新焦点。端到端(E2E)服务交付的相关严格延迟要求带来了技术挑战。在本文中,我们提出了一个联合的随机接入和数据传输协议mMTC,以保证不同的业务类型的E2E服务质量。首先,我们开发了一个基于优先级排序的接入类别限制(ACB)模型,并推导出一种新的有效容量。然后,我们将基于优先级的ACB策略建模为一个非合作博弈,其中效用定义为有效容量和接入惩罚价格之间的差异。我们证明了非合作博弈的纳什均衡(NE)的存在唯一性,这也是一个子模块效用最大化问题,可以用一个收敛到唯一NE的贪婪更新算法来求解.为了进一步提高效率,我们提出了一个价格更新算法,收敛到局部最优。仿真结果表明了所推导的有效容量的性能和所提出的算法的有效性。

英文摘要:

Massive machine-type communication (mMTC) is a new focus of services in fifth generation (5G) communication networks. The associated stringent delay requirement of end-to-end (E2E) service deliveries poses technical challenges. In this paper, we propose a joint random access and data transmission protocol for mMTC to guarantee E2E service quality of different traffic types. First, we develop a priority-queueing-based access class barring (ACB) model and a novel effective capacity is derived. Then, we model the priority-queueing-based ACB policy as a non-cooperative game, where utility is defined as the difference between effective capacity and access penalty price. We prove the existence and uniqueness of Nash equilibrium (NE) of the non-cooperative game, which is also a sub-modular utility maximization problem and can be solved by a greedy updating algorithm with convergence to the unique NE. To further improve the efficiency, we present a price-update algorithm, which converges to a local optimum. Simulations demonstrate the performance of the derived effective capacity and the effectiveness of the proposed algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑