Allocation dynamique de ressources pour les réseaux cellulaires sans fil full-duplex OFDMA.

TranThanh, Tam (2016). Allocation dynamique de ressources pour les réseaux cellulaires sans fil full-duplex OFDMA. Mémoire. Québec, Université du Québec, Institut national de la recherche scientifique, Maîtrise en télécommunications, 79 p.

Prévisualisation

PDF Télécharger (663kB) | Prévisualisation

Résumé

Full-duplex (FD) has recently been considered as a technological evolution for next-generation wireless networks with the expectation of signi_cant capacity increase. In FD systems, a wireless terminal can transmit and receive a signal on the same frequency band at a particular time slot. Therefore, FD systems can potentially double the spectral efficiency relatively to the Half-duplex (HD) ones. The advantages of FD have come from the combination of various techniques, including antenna design, analog and digital cancellation, to e_ectively reduces self-interference caused by the transmitted signal of a terminal to itself. Nevertheless, the performance of the FD sytem cannot be as good since it still depends on the resource allocation design. This thesis focuses on the resource allocation problem in a full-duplex (FD) multiuser single cell system consisting of one FD base-station (BS) and multiple FD mobile nodes. In particular, we are interested in jointly optimizing power allocation (PA) and subcarrier assignment (SA) for uplink (UL) and downlink (DL) transmission of all users to maximize the system's sum-rate. First, the joint optimization problem is formulated as a nonconvex mixed integer program, a notoriously di_cult nonconvex problem. Then two approaches are proposed to solve this problem. In the _rst method, the SA problem is solved by the bipartite matching method and then the PA is solved by employing the successive convex approximation for low complexity(SCALE) algorithm. In the second method, an iterative algorithm is developed to solve this problem e_ciently. In each iteration, the SA is relaxed into real numbers and updated by a gradient method, whereas the PA is again solved by the SCALE algorithm. Two greedy algorithms are further introduced in order to measure the e_ectiveness our design. Finally, numerical results are presented to demonstrate the signi_cant gains of the proposed algorithms in comparison with the conventional approaches.

Type de document:	Thèse Mémoire
Directeur de mémoire/thèse:	Le, Long Bao
Mots-clés libres:	réseaux cellulaires Sans Fil; transmission Full-duplex OFDMA; communication sans fil; 5G; auto-interférence (SI); allocation de ressources
Centre:	Centre Énergie Matériaux Télécommunications
Date de dépôt:	26 avr. 2017 13:53
Dernière modification:	26 avr. 2017 13:53
URI:	http://espace.inrs.ca/id/eprint/5126

Actions (Identification requise)

Modifier la notice