Greedy scheme for optimal resource allocation in HetNets with wireless backhaul

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

Abstract

We formulate a linear programming problem to find the minimum clearing time in HetNets. Although this program is NP hard in general, we consider particular topologies that arise in HetNets, including a two cell HetNet and a linear chain of HetNets, both with wireless backhaul, and we provide an efficient, greedy algorithm that provably solves the minimum clearing time problem for these networks. We show how this algorithm can be applied to jointly optimize the ABS time across multiple macros in a HetNet, and we demonstrate capacity gains of the algorithm, compared to standard approaches to Inter Cell Interference Coordination. This paper provides insight into how to manage interference in presence of more than one macro, and how to efficiently operate wireless backhaul in HetNets.

LanguageEnglish
Title of host publication2017 IEEE 85th Vehicular Technology Conference (VTC Spring)
Subtitle of host publicationproceedings
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-5
Number of pages5
ISBN (Electronic)9781509059324
ISBN (Print)9781509059331
DOIs
Publication statusPublished - 2017
Event85th IEEE Vehicular Technology Conference, VTC Spring 2017 - Sydney, Australia
Duration: 4 Jun 20177 Jun 2017

Conference

Conference85th IEEE Vehicular Technology Conference, VTC Spring 2017
CountryAustralia
CitySydney
Period4/06/177/06/17

Fingerprint

Optimal Allocation
Resource Allocation
Resource allocation
Macros
Interference
Cell
Greedy Algorithm
Linear programming
NP-complete problem
Optimise
Topology
Demonstrate

Cite this

Gopalam, S., Hanly, S. V., & Whiting, P. (2017). Greedy scheme for optimal resource allocation in HetNets with wireless backhaul. In 2017 IEEE 85th Vehicular Technology Conference (VTC Spring): proceedings (pp. 1-5). Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/VTCSpring.2017.8108532
Gopalam, Swaroop ; Hanly, Stephen V. ; Whiting, Philip. / Greedy scheme for optimal resource allocation in HetNets with wireless backhaul. 2017 IEEE 85th Vehicular Technology Conference (VTC Spring): proceedings. Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2017. pp. 1-5
@inproceedings{1a6948acd1214339bd251949f420b5fe,
title = "Greedy scheme for optimal resource allocation in HetNets with wireless backhaul",
abstract = "We formulate a linear programming problem to find the minimum clearing time in HetNets. Although this program is NP hard in general, we consider particular topologies that arise in HetNets, including a two cell HetNet and a linear chain of HetNets, both with wireless backhaul, and we provide an efficient, greedy algorithm that provably solves the minimum clearing time problem for these networks. We show how this algorithm can be applied to jointly optimize the ABS time across multiple macros in a HetNet, and we demonstrate capacity gains of the algorithm, compared to standard approaches to Inter Cell Interference Coordination. This paper provides insight into how to manage interference in presence of more than one macro, and how to efficiently operate wireless backhaul in HetNets.",
author = "Swaroop Gopalam and Hanly, {Stephen V.} and Philip Whiting",
year = "2017",
doi = "10.1109/VTCSpring.2017.8108532",
language = "English",
isbn = "9781509059331",
pages = "1--5",
booktitle = "2017 IEEE 85th Vehicular Technology Conference (VTC Spring)",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
address = "United States",

}

Gopalam, S, Hanly, SV & Whiting, P 2017, Greedy scheme for optimal resource allocation in HetNets with wireless backhaul. in 2017 IEEE 85th Vehicular Technology Conference (VTC Spring): proceedings. Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1-5, 85th IEEE Vehicular Technology Conference, VTC Spring 2017, Sydney, Australia, 4/06/17. https://doi.org/10.1109/VTCSpring.2017.8108532

Greedy scheme for optimal resource allocation in HetNets with wireless backhaul. / Gopalam, Swaroop; Hanly, Stephen V.; Whiting, Philip.

2017 IEEE 85th Vehicular Technology Conference (VTC Spring): proceedings. Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2017. p. 1-5.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

TY - GEN

T1 - Greedy scheme for optimal resource allocation in HetNets with wireless backhaul

AU - Gopalam, Swaroop

AU - Hanly, Stephen V.

AU - Whiting, Philip

PY - 2017

Y1 - 2017

N2 - We formulate a linear programming problem to find the minimum clearing time in HetNets. Although this program is NP hard in general, we consider particular topologies that arise in HetNets, including a two cell HetNet and a linear chain of HetNets, both with wireless backhaul, and we provide an efficient, greedy algorithm that provably solves the minimum clearing time problem for these networks. We show how this algorithm can be applied to jointly optimize the ABS time across multiple macros in a HetNet, and we demonstrate capacity gains of the algorithm, compared to standard approaches to Inter Cell Interference Coordination. This paper provides insight into how to manage interference in presence of more than one macro, and how to efficiently operate wireless backhaul in HetNets.

AB - We formulate a linear programming problem to find the minimum clearing time in HetNets. Although this program is NP hard in general, we consider particular topologies that arise in HetNets, including a two cell HetNet and a linear chain of HetNets, both with wireless backhaul, and we provide an efficient, greedy algorithm that provably solves the minimum clearing time problem for these networks. We show how this algorithm can be applied to jointly optimize the ABS time across multiple macros in a HetNet, and we demonstrate capacity gains of the algorithm, compared to standard approaches to Inter Cell Interference Coordination. This paper provides insight into how to manage interference in presence of more than one macro, and how to efficiently operate wireless backhaul in HetNets.

UR - http://www.scopus.com/inward/record.url?scp=85040612175&partnerID=8YFLogxK

U2 - 10.1109/VTCSpring.2017.8108532

DO - 10.1109/VTCSpring.2017.8108532

M3 - Conference proceeding contribution

SN - 9781509059331

SP - 1

EP - 5

BT - 2017 IEEE 85th Vehicular Technology Conference (VTC Spring)

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

ER -

Gopalam S, Hanly SV, Whiting P. Greedy scheme for optimal resource allocation in HetNets with wireless backhaul. In 2017 IEEE 85th Vehicular Technology Conference (VTC Spring): proceedings. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). 2017. p. 1-5 https://doi.org/10.1109/VTCSpring.2017.8108532