Dépôt numérique
RECHERCHER

Algorithmes de gestion des ressources radio pour la communication périphérique à périphérique (D2D) dans les réseaux cellulaires sans fil.

Hoang, Tuong Duc (2017). Algorithmes de gestion des ressources radio pour la communication périphérique à périphérique (D2D) dans les réseaux cellulaires sans fil. Thèse. Québec, Université du Québec, Institut national de la recherche scientifique, Doctorat en télécommunications.

[img]
Prévisualisation
PDF
Télécharger (2MB) | Prévisualisation

Résumé

Device-to-device (D2D) communication has been recently proposed as an important technology for the next-generation wireless cellular system, which promises to significantly improve the system spectrum-efficiency, and energy-efficiency by exploiting the advantages of proximity communication. However, many challenges must be resolved to enable efficient integration of D2D communication into the cellular networks. The overall objective of this doctoral research is to develop novel and efficient resource allocation algorithms for D2D communications. Toward this end, we investigate three key design issues to support the harmonious coexistence of D2D and existing cellular communications, namely spectrum and energy-efficient resource allocation for single hop D2D communication, mode selection and resource allocation for relay-based D2D communication, and joint scheduling and resource allocation for D2D communication. These designs have resulted in several novel contributions, which can be summarized as follows. First, we propose the spectrum-efficient resource allocation design for single hop D2D communication in the cellular networks, which is presented in Chapter 5. In particular, we present a resource allocation model which allows dynamic power allocation and subchannel assignment for both cellular and D2D links. It is then demonstrated that the proposed algorithm can improve the system spectrum-efficiency significantly in comparison with existing D2D resource allocation algorithms. Second, we develop a general energy-efficient resource allocation framework for single hop D2D communication in cellular networks which targets to maximize the minimum weighted energy-efficiency (EE) of D2D links while maintaining the minimum required data rates of the cellular links. The research outcomes of this study are presented in Chapter 6. Particularly, we propose a low-complexity power control and subchannel allocation algorithm, which can approach the optimal solution of the underlying resource allocation problem. We also present the distributed implementation for the proposed algorithm, which helps reduce the computation burden for the BS. Third, we study the resource allocation problem for relay-based D2D communications, which is covered in Chapter 7. The proposed design allows D2D links to dynamically choose either the direct or relay mode. We then propose an efficient mode selection and resource allocation algorithm which optimizes the system spectrum-efficiency. We show that the proposed algorithm can dramatically outperform the conventional resource allocation schemes. Finally, we consider the joint scheduling and resource allocation design for D2D communication in the cellular networks, which is described in Chapter 8. The proposed design framework allows to dynamically select the set of scheduled D2D links and optimize the system spectrum-efficiency. Toward this end, we develop a monotonic-based algorithm which asymptotically achieves the optimal solution. We then propose a low-complexity algorithm, which can perform much better than the conventional ones and approach the optimal solution.

Type de document: Thèse Thèse
Directeur de mémoire/thèse: Le, Long Bao
Mots-clés libres: Device-to-device (D2D) communication; wireless cellular system; Energy-Efficient Resource Allocation; Joint Mode Selection and Resource Allocation
Centre: Centre Énergie Matériaux Télécommunications
Date de dépôt: 29 janv. 2018 22:14
Dernière modification: 29 janv. 2018 22:14
URI: http://espace.inrs.ca/id/eprint/6651

Actions (Identification requise)

Modifier la notice Modifier la notice