Small cell association with networked flying platforms: novel algorithms and performance bounds

Syed Awais Wahab Shah, Tamer Khattab, Muhammad Zeeshan Shakir, Mohammad Galal Khafagy, Mazen Omar Hasna

Research output: Contribution to journalArticle

Abstract

Fifth generation and beyond (5G+) systems expect coverage and capacity enhancements along with the consideration of limited power, cost and spectrum. Densification of small cells (SCs) is a promising approach to cater these demands of 5G+ systems. However, such an ultra dense network of SCs requires provision of smart backhaul and fronthaul networks. In this paper, we employ a scalable idea of using networked flying platforms (NFPs) as aerial hubs to provide fronthaul connectivity to the SCs. We consider the association problem of SCs and NFPs in a SC network and study the effect of practical constraints related to the system and NFPs. Mainly, we show that the association problem is related to the generalized assignment problem (GAP). Using the relevance with GAP, we show the NP-hard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate. Linear Programming relaxation of the problem is also studied to compare the results with the derived bounds. Finally, two novel greedy solutions of the association problem are presented, where one of them is a distributed solution and the other one is its centralized version. Numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds. The computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented.
Original languageEnglish
JournalIEEE Journal on Selected Areas in Communications
Publication statusSubmitted - 1 Jan 2018

Fingerprint

Densification
Linear programming
Computational complexity
Antennas
Costs

Cite this

Shah, S. A. W., Khattab, T., Shakir, M. Z., Khafagy, M. G., & Hasna, M. O. (2018). Small cell association with networked flying platforms: novel algorithms and performance bounds. Manuscript submitted for publication.
@article{0eb03e37ae774cdcbeb1b0f50af36dda,
title = "Small cell association with networked flying platforms: novel algorithms and performance bounds",
abstract = "Fifth generation and beyond (5G+) systems expect coverage and capacity enhancements along with the consideration of limited power, cost and spectrum. Densification of small cells (SCs) is a promising approach to cater these demands of 5G+ systems. However, such an ultra dense network of SCs requires provision of smart backhaul and fronthaul networks. In this paper, we employ a scalable idea of using networked flying platforms (NFPs) as aerial hubs to provide fronthaul connectivity to the SCs. We consider the association problem of SCs and NFPs in a SC network and study the effect of practical constraints related to the system and NFPs. Mainly, we show that the association problem is related to the generalized assignment problem (GAP). Using the relevance with GAP, we show the NP-hard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate. Linear Programming relaxation of the problem is also studied to compare the results with the derived bounds. Finally, two novel greedy solutions of the association problem are presented, where one of them is a distributed solution and the other one is its centralized version. Numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds. The computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented.",
author = "Shah, {Syed Awais Wahab} and Tamer Khattab and Shakir, {Muhammad Zeeshan} and Khafagy, {Mohammad Galal} and Hasna, {Mazen Omar}",
year = "2018",
month = "1",
day = "1",
language = "English",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "IEEE",

}

Small cell association with networked flying platforms : novel algorithms and performance bounds. / Shah, Syed Awais Wahab; Khattab, Tamer; Shakir, Muhammad Zeeshan; Khafagy, Mohammad Galal ; Hasna, Mazen Omar.

In: IEEE Journal on Selected Areas in Communications, 01.01.2018.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Small cell association with networked flying platforms

T2 - novel algorithms and performance bounds

AU - Shah, Syed Awais Wahab

AU - Khattab, Tamer

AU - Shakir, Muhammad Zeeshan

AU - Khafagy, Mohammad Galal

AU - Hasna, Mazen Omar

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Fifth generation and beyond (5G+) systems expect coverage and capacity enhancements along with the consideration of limited power, cost and spectrum. Densification of small cells (SCs) is a promising approach to cater these demands of 5G+ systems. However, such an ultra dense network of SCs requires provision of smart backhaul and fronthaul networks. In this paper, we employ a scalable idea of using networked flying platforms (NFPs) as aerial hubs to provide fronthaul connectivity to the SCs. We consider the association problem of SCs and NFPs in a SC network and study the effect of practical constraints related to the system and NFPs. Mainly, we show that the association problem is related to the generalized assignment problem (GAP). Using the relevance with GAP, we show the NP-hard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate. Linear Programming relaxation of the problem is also studied to compare the results with the derived bounds. Finally, two novel greedy solutions of the association problem are presented, where one of them is a distributed solution and the other one is its centralized version. Numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds. The computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented.

AB - Fifth generation and beyond (5G+) systems expect coverage and capacity enhancements along with the consideration of limited power, cost and spectrum. Densification of small cells (SCs) is a promising approach to cater these demands of 5G+ systems. However, such an ultra dense network of SCs requires provision of smart backhaul and fronthaul networks. In this paper, we employ a scalable idea of using networked flying platforms (NFPs) as aerial hubs to provide fronthaul connectivity to the SCs. We consider the association problem of SCs and NFPs in a SC network and study the effect of practical constraints related to the system and NFPs. Mainly, we show that the association problem is related to the generalized assignment problem (GAP). Using the relevance with GAP, we show the NP-hard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate. Linear Programming relaxation of the problem is also studied to compare the results with the derived bounds. Finally, two novel greedy solutions of the association problem are presented, where one of them is a distributed solution and the other one is its centralized version. Numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds. The computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented.

M3 - Article

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

ER -