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

空天地一体化系统关联的多边匹配方法

Multi-sided Matching for the Association of Space-Air-Ground Integrated Systems

Abdoul Karim A. H. Saliah, Doha Hamza, Hajar El Hammouti, Jeff S Shamma, Mohamed-Slim Alouini

AI总结:

针对空天地一体化网络(SAGINs)多层异构的关联难题,提出基于多边多对一匹配博弈的分布式随机匹配算法,实现跨层节点高效稳定关联,性能优于贪婪和基于距离的算法。

摘要:

空天地一体化网络(SAGINs)将在6G通信系统中发挥关键作用,被视为提升人口密集城区网络容量、拓展农村地区连接覆盖的一项极具前景的技术。然而,SAGINs的复杂、多层级与异构特性,要求采用创新方法设计其多层级关联机制。在此背景下,我们提出利用多边匹配理论对SAGINs关联问题进行建模,目标是设计一种可靠、异步且完全分布式的方法,实现跨层节点关联,最大化所分配智能体的总端到端速率。为此,我们将该问题构建为一个多边多对一匹配博弈,提出了一种信息交互量极小的随机匹配算法,经证明该算法可在相邻层节点间实现高效且稳定的关联。仿真结果表明,与贪婪算法和基于距离的算法相比,我们提出的方法可带来显著性能增益。

英文摘要:

Space-air-ground integrated networks (SAGINs) will play a pivotal role in 6G communication systems. They are considered a promising technology for enhancing network capacity in densely populated urban areas and extending connectivity to rural regions. However, the complex, multi-layered, and heterogeneous nature of SAGINs demands an innovative approach to designing their multi-tier associations. In this context, we propose a modeling of the SAGINs association problem using multi-sided matching theory. Our objective is to devise a reliable, asynchronous, and fully distributed approach that associates nodes across the layers to maximize the total end-to-end rate of the assigned agents. To achieve this, our problem is formulated as a multi-sided many-to-one matching game. We introduce a randomized matching algorithm with minimal information exchange. The algorithm is shown to reach an efficient and stable association between nodes in adjacent layers. Simulation results show that our proposed approach yields significant gains compared to both greedy and distance-based algorithms.

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

↑