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.
Funding
This work has been supported by the Engineering and Physical Science Research Council of the UK, EPSRC, under the grant EP/M015475.
History
School
Mechanical, Electrical and Manufacturing Engineering
Published in
IEEE Global Communications Conference (IEEE GLOBECOM)
Citation
LIU, Y., DERAKHSHANI, M. and LAMBOTHARAN, S., 2017. Dual connectivity in backhaul-limited massive-MIMO HetNets: User association and power allocation. Presented at the IEEE Global Communications Conference (IEEE GLOBECOM), Singapore, 4-8th December.
Publisher
IEEE
Version
AM (Accepted Manuscript)
Acceptance date
2017-07-25
Publication date
2017
Notes
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.