Cross-Layer Optimization of Access Point Selection and Beamforming in Non-Coherent Cell Free Network

In this paper, a cross-layer optimization problem of access point selection (APS) and beamforming (BF) in cell free network (CFN) has been studied, where constraints of per access point (AP) power and per user receiving data streams are considered. Such a cross-layer design of APS&BF problem is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC S. 1 - 6
Hauptverfasser: Yan, Xuanhong, Wang, Zheng, Jia, Yi, Huang, Yongming, Yang, Luxi
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.03.2023
Schlagworte:
AP selection
Array signal processing
beamforming
Cross layer design
cross-layer optimization
non-coherent transmission
Performance gain
Programming
Simulation
Spectral efficiency
Transforms
User-centric cell free
ISSN:1558-2612
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a cross-layer optimization problem of access point selection (APS) and beamforming (BF) in cell free network (CFN) has been studied, where constraints of per access point (AP) power and per user receiving data streams are considered. Such a cross-layer design of APS&BF problem is modeled as a mixed-integer nonlinear programming (MINP) program. Then, by adopting the weighted l 1 -norm approximation, the MINP problem is transformed into the sum logarithmic multiple-ratio form. To be specific, a novel and low-complexity mix-integer fractional programming (MIFP) algorithm is proposed to solve the transformed problem effectively. Convergence analysis validates that the proposed MIFP converges to a local optimal solution. Finally, numerical results show that cross-layer design of APS&BF scheme is superior to separate design of APS&BF schemes. In addition, the proposed MIFP has the approximate performance as partial exhaustive search algorithm.
ISSN:1558-2612
DOI:10.1109/WCNC55385.2023.10118637