Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation

Ye Liu, Mahsa Derakhshani, Sangarapillai Lambotharan

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

4 Citations (Scopus)
2 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication2017 IEEE Global Communications Conference
PublisherIEEE
Number of pages6
ISBN (Electronic)978-1-5090-5019-2
ISBN (Print)978-1-5090-5020-8
DOIs
Publication statusPublished - Jan 2018
Externally publishedYes
EventIEEE GLOBECOM 2017 - , Singapore
Duration: 4 Dec 20178 Dec 2017
https://globecom2017.ieee-globecom.org/

Conference

ConferenceIEEE GLOBECOM 2017
CountrySingapore
Period4/12/178/12/17
Internet address

Fingerprint

Heterogeneous networks
MIMO systems
Base stations
Macros
Costs

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.

Keywords

  • Iterative methods
  • Optimization
  • Uplink
  • Antennas
  • Base stations
  • Complexity theory
  • Resource management

Cite this

Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation. / Liu, Ye; Derakhshani, Mahsa; Lambotharan, Sangarapillai.

2017 IEEE Global Communications Conference. IEEE, 2018.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Liu, Y, Derakhshani, M & Lambotharan, S 2018, Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation. in 2017 IEEE Global Communications Conference. IEEE, IEEE GLOBECOM 2017, Singapore, 4/12/17. https://doi.org/10.1109/GLOCOM.2017.8254644
Liu, Ye ; Derakhshani, Mahsa ; Lambotharan, Sangarapillai. / Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation. 2017 IEEE Global Communications Conference. IEEE, 2018.
@inproceedings{d2bc3bdc76a14dab8fca9a01dfbaa327,
title = "Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation",
abstract = "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.",
keywords = "Iterative methods, Optimization, Uplink, Antennas, Base stations, Complexity theory, Resource management",
author = "Ye Liu and Mahsa Derakhshani and Sangarapillai Lambotharan",
note = "{\circledC} 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.",
year = "2018",
month = "1",
doi = "10.1109/GLOCOM.2017.8254644",
language = "English",
isbn = "978-1-5090-5020-8",
booktitle = "2017 IEEE Global Communications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Dual connectivity in backhaul-limited heterogeneous networks with massive-MIMO: User association and power allocation

AU - Liu, Ye

AU - Derakhshani, Mahsa

AU - Lambotharan, Sangarapillai

N1 - © 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.

PY - 2018/1

Y1 - 2018/1

N2 - 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.

AB - 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.

KW - Iterative methods

KW - Optimization

KW - Uplink

KW - Antennas

KW - Base stations

KW - Complexity theory

KW - Resource management

U2 - 10.1109/GLOCOM.2017.8254644

DO - 10.1109/GLOCOM.2017.8254644

M3 - Conference proceeding

SN - 978-1-5090-5020-8

BT - 2017 IEEE Global Communications Conference

PB - IEEE

ER -