Resource Allocation for Full-Duplex Relay-Assisted Device-to-Device Multicarrier Systems

This letter analyzes the resource allocation problem for full-duplex relay-assisted device-to-device (D2D) multicarrier systems, where multiple D2D user groups (UGs) coexist in an underlaying manner. We formulate the optimization problem, which takes the maximization of the system throughput as an o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE wireless communications letters Jg. 6; H. 2; S. 166 - 169
Hauptverfasser: Shuping Dang, Coon, Justin P., Gaojie Chen
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.04.2017
Schlagworte:
Device-to-device communication
full-duplex communications
multicarrier systems
Optimization
Receivers
Relay-assisted D2D systems
Relays
resource allocation
Resource management
Silicon
Transmitters
ISSN:2162-2337, 2162-2345
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This letter analyzes the resource allocation problem for full-duplex relay-assisted device-to-device (D2D) multicarrier systems, where multiple D2D user groups (UGs) coexist in an underlaying manner. We formulate the optimization problem, which takes the maximization of the system throughput as an objective. Two resources, i.e., subcarrier and transmit power are considered to be appropriately allocated to UGs in order to meet the objective. The formulated problem can be independently divided into a quasi-concave problem and a mixed binary integer programming (MBIP) problem. The MBIP problem is NP-hard. Therefore, to solve this problem efficiently by standard optimization techniques, we propose an alternative algorithm, which is the linear relaxation of the MBIP problem. Then, we mathematically prove and numerically verify the equivalence of the MBIP problem and its linear relaxation. By this way, the resource allocation for UGs can be carried out by a small amount of computational overhead.
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2017.2647806