Loading...
Please wait, while we are loading the content...
Similar Documents
Decoupled Uplink-Downlink User Association in Full-Duplex Small Cell Networks
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sekander, Silvia |
| Copyright Year | 2016 |
| Abstract | In multi-tier cellular networks, user performance is largely affected by the varying transmit powers, distances, and non-uniform traffic loads of different base stations (BSs) in both the downlink (DL) and uplink (UL) directions of transmission. In presence of such heterogeneity, decoupled UL-DL user association (DUDe), which allows users to associate with different BSs for UL and DL transmissions, can be used to optimize network performance. Again, in-band full-duplex (FD) communication is considered as a promising technique to improve the spectral efficiency of future multi-tier fifth generation (5G) cellular networks. Nonetheless, due to severe UL-to-DL and DL-to-UL interference issues arising due to FD communications, the performance gains of DUDe in FD multi-tier networks are inconspicuous. To this end, this thesis develops a comprehensive framework to analyze the usefulness of DUDe in a full-duplex multi-tier cellular network. We first formulate a joint UL and DL user association problem (with the provision of decoupled association) that maximizes the sum-rate for UL and DL transmission of all users. Since the formulated problem is a mixed-integer non-linear programming (MINLP) problem, we invoke approximations and binary constraint relaxations to convert the problem into a Geometric Programming (GP) problem that is solved using Karush-Kuhn-Tucker (KKT) optimality conditions. Given the centralized nature and complexity of the GP problem, the solution of which serves as the upper bound for any sub-optimal solution, we formulate a distributed two-sided iterative matching game and develop a solution to obtain the solution of the game. In this game, the users and BSs rank one another using preference metrics that are subject to the externalities (i.e., dynamic interference conditions). The solution of the game is guaranteed to converge and provides Pareto-efficient stable associations. Finally, we derive efficient light-weight versions of the iterative matching solution, i.e., non-iterative matching and sequential UL-DL matching algorithms. The performances of all the solutions are critically evaluated in terms of aggregate UL and DL rates of all users, the number of unassociated users, and the number of coupled/decoupled associations. Simulation results demonstrate the efficacy of the proposed algorithms over the centralized GP solution as well as traditional coupled and decoupled user association schemes. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://mspace.lib.umanitoba.ca/bitstream/handle/1993/31621/Sekander_Silvia.pdf?isAllowed=y&sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
