论文标题
使用早期接受匹配游戏中的B5G网络中的分布式用户协会
Distributed User Association in B5G Networks Using Early Acceptance Matching Games
论文作者
论文摘要
我们使用匹配理论研究了5G和超越毫米波启用异质网络的分布式用户协会。我们提出了一个新颖而有效的分布式匹配游戏，称为“早期接受（EA）”，该游戏允许用户以分布式方式申请与他们的排名偏好基础站的关联，并在基本站的首选项列表中以可用配额而被接受。将EA匹配游戏的几种变体更新和重新申请与原始和稳定性最佳的延期递延接受度（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.
