Power Allocation for D2D Communications Using Max-Min Message-Passing Algorithm

The approach of factor-graphs (FGs) is applied in the context of power control and user pairing in Device-to-Device (D2D) communications as an effective underlay concept in wireless cellular networks. D2D communications can increase the spectral efficiency of wireless cellular networks by establishi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 69; číslo 8; s. 8443 - 8458
Hlavní autoři: Rashed, Salma Kazemi, Asvadi, Reza, Rajabi, Siavash, Ghorashi, Seyed Ali, Martini, Maria G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Cellular communication
Cellular networks
Complexity
Complexity theory
Convergence
Device-to-device (D2D) communications
Device-to-device communication
factor-graph (FG)
Game theory
Games
Interference
Max-Min
Message passing
Power control
Power management
Resource management
Wireless communications
Wireless networks
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The approach of factor-graphs (FGs) is applied in the context of power control and user pairing in Device-to-Device (D2D) communications as an effective underlay concept in wireless cellular networks. D2D communications can increase the spectral efficiency of wireless cellular networks by establishing a direct link between devices with limited help from the evolved node base stations (eNBs). A well-designed user pairing and power allocation scheme with low complexity can remarkably improve the system's performance. In this paper, a simple and distributed FG based approach is utilized for power control and user pairing implementation in an underlay cellular network with D2D communications. A max-min criterion is proposed to maximize the minimum rate of all active users in the network, including the cellular and multiple D2D co-channel links in the uplink direction. An associated message-passing (MP) algorithm is presented to distributedly solve the resultant NP-hard maximization problem, with a guaranteed convergence compared to game theoretic and Q-learning based methods. The complexity and convergence of the proposed method is analyzed and numerical results confirm that the proposed scheme outperforms alternative algorithms in terms of complexity, while keeping the sum-rate of users nearly the same as centralized counterpart methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2020.2995534