D2D Communications Underlaying UAV-Assisted Access Networks
Unmanned aerial vehicles (UAVs)-enabled base stations (BSs) can boost the system performance of the terrestrial networks with device-to-device (D2D) communication in the scenarios that fixed BSs in the ground are not available. However, the serious interference among UAVs and multiple D2D pairs is m...
Uloženo v:
| Vydáno v: | IEEE access Ročník 6; s. 46244 - 46255 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Piscataway
IEEE
01.01.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 2169-3536, 2169-3536 |
| 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!
|
| Shrnutí: | Unmanned aerial vehicles (UAVs)-enabled base stations (BSs) can boost the system performance of the terrestrial networks with device-to-device (D2D) communication in the scenarios that fixed BSs in the ground are not available. However, the serious interference among UAVs and multiple D2D pairs is more challenging than the terrestrial case because UAVs are changing the networks topology frequently over time. In this paper, the power control optimization is investigated for D2D communications underlaying UAV-assisted access systems, where a UAV-enabled BS serves multiple users, and the remaining users communicate with each other with the assistance of the UAV, also referred to as D2D pairs. With the aim of throughput maximization, we need to address a non-convex optimization. To this end, difference of two convex functions (D.C.) programming is invoked to solve the formulated optimization, which can obtain suboptimal solutions. Considering the UAV's limited energy and low computational capability, we further design a low-complexity power control algorithm by exploiting the Hessian matrix's structure. Simulation results show that the proposed algorithms perform quite well for all considered scenarios. Both of them can improve the system throughput dramatically. Moreover, the low-complexity algorithm produces almost the same throughput as the D.C. programming method with much lower computation burden. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2169-3536 2169-3536 |
| DOI: | 10.1109/ACCESS.2018.2865629 |