Distributed User Association in B5G Networks Using Early Acceptance Matching Game
Distributed User Association in B5G Networks Using Early Acceptance Matching Game
复制标题
DOI：
10.1109/twc.2020.3042393
复制
发表时间：
2021-04-01
影响因子：
10.4
通讯作者：
Vu, Mai
中科院分区：
文献类型：
--
作者：
Alizadeh, Alireza;Vu, Mai
我们运用匹配理论，对5G及未来毫米波异构网络中的分布式用户关联进行研究。我们提出了一种新颖且高效的分布式匹配博弈，称为提前接受（EA）。该方法允许用户以分布式方式向其按偏好排序的基站申请关联，一旦他们处于基站带有可用配额的偏好列表中，即可被接受。将几种带有偏好列表更新和重新申请机制的EA匹配博弈变体，与原始的以及稳定性最优的延迟接受（DA）匹配博弈进行比较。DA匹配博弈在每个基站设置一个等待列表，直到博弈结束才确定用户关联。我们证明了匹配稳定性并不一定能在诸如吞吐量等其他指标上带来最优性能。分析和仿真表明，与DA相比，所提出的EA匹配博弈在实现更高网络吞吐量的同时，关联过程显著加快。此外，无论是单次进行还是多次进行的EA博弈，都能在复杂度低得多的情况下，接近集中式用户关联的网络效用。
We study distributed user association in 5G and beyond millimeter-wave enabled heterogeneous networks using matching theory. We propose a novel and efficient distributed matching game, called early acceptance (EA), which allows users to apply for association with their ranked-preference base station in a distributed fashion and get accepted as soon as they are in the base station's preference list with available quota. Several variants of the EA matching game with preference list updating and reapplying are compared with the original and stability-optimal deferred acceptance (DA) matching game, which implements a waiting list at each base station and delays user association until the game finishes. We show that matching stability needs not lead to optimal performance in other metrics such as throughput. Analysis and simulations show that compared to DA, the proposed EA matching games achieve higher network throughput while exhibiting a significantly faster association process. Furthermore, the EA games either playing once or multiple times can reach closely the network utility of a centralized user association while having much lower complexity.