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

B5G网络中基于早期接受匹配博弈的分布式用户关联

Distributed User Association in B5G Networks Using Early Acceptance Matching Games

Alireza Alizadeh, Mai Vu

摘要:

我们研究了分布式用户关联在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.

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

↑