With dual connectivity, a mobile user can be served by a macro base station (MBS) and a pico base station (PBS) simultaneously. In this paper, we address the problem of optimizing user-PBS association and power allocation in the uplink such that the network can serve the users' demand at the minimum cost, where the PBSs are subject to backhaul capacity limitations and minimum rate requirements of users. We show that this non-convex problem can be formulated as a signomial geometric programming (SGP) whose solution can be found by solving a series of geometric programming (GP) problems. Simulation results are provided to demonstrate traffic offloading trend to PBSs for different cost and backhaul capacity settings, confirming the effectiveness of the proposed iterative algorithm. They also show that the output of the proposed algorithm closely matches the global optimal solution with affordable complexity.
|Title of host publication||2017 IEEE Global Communications Conference|
|Number of pages||6|
|Publication status||Published - Jan 2018|
|Event||IEEE GLOBECOM 2017 - , Singapore|
Duration: 4 Dec 2017 → 8 Dec 2017
|Conference||IEEE GLOBECOM 2017|
|Period||4/12/17 → 8/12/17|
Bibliographical note© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
- Iterative methods
- Base stations
- Complexity theory
- Resource management