Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.02363

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.02363 (cs)
[Submitted on 5 Dec 2022 ]

Title: Improving Fairness for Cell-Free Massive MIMO Through Interference-Aware Massive Access

Title: 通过干扰感知的大规模接入提高无蜂窝大规模MIMO的公平性

Authors:Shuaifei Chen, Jiayi Zhang, Emil Björnson, Bo Ai
Abstract: Cell-free massive multiple-input multiple-output (CF mMIMO) provides good interference management by coordinating many more access points (APs) than user equipments (UEs). It becomes challenging to determine which APs should serve which UEs with which pilots when the number of UEs approximates the number of APs and far exceeds the number of pilots. Compared to the previous work, a better compromise between spectral efficiency (SE) and implementation simplicity is needed in such massive access scenarios. This paper proposes an interference-aware massive access (IAMA) scheme realizing joint AP-UE association and pilot assignment for CF mMIMO by exploiting the large-scale interference features. We propose an interference-aware reward as a novel performance metric and use it to develop two iterative algorithms to optimize the association and pilot assignment. The numerical results show a prominent advantage of our IAMA scheme over the benchmark schemes in terms of the user fairness and the average SE.
Abstract: 无蜂窝大规模多输入多输出(CF mMIMO)通过协调比用户设备(UEs)更多的接入点(APs)来提供良好的干扰管理。 当UE的数量接近AP的数量并远超过导频的数量时,确定哪些AP应为哪些UE使用哪些导频变得具有挑战性。 在这样的大规模接入场景中,需要在频谱效率(SE)和实现复杂性之间取得更好的折中。 本文提出了一种干扰感知的大规模接入(IAMA)方案,通过利用大尺度干扰特征,在CF mMIMO中实现了AP-UE关联和导频分配的联合优化。 我们提出了一种干扰感知奖励作为新的性能指标,并利用它开发了两种迭代算法来优化关联和导频分配。 数值结果表明,在用户公平性和平均SE方面,我们的IAMA方案明显优于基准方案。
Comments: 14 pages, 5 figures, accepted for publication in the IEEE Transactions on Vehicular Technology
Subjects: Information Theory (cs.IT) ; Signal Processing (eess.SP)
Cite as: arXiv:2212.02363 [cs.IT]
  (or arXiv:2212.02363v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.02363
arXiv-issued DOI via DataCite

Submission history

From: Shuaifei Chen [view email]
[v1] Mon, 5 Dec 2022 15:45:34 UTC (1,799 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
eess
eess.SP
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号