Indoor Mobile Coverage Problem Using UAVs

Hazim Shakhatreh, Abdallah Khreishah, Issa Khalil

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks are not operational due to natural disasters. They can also be used to supplement the ground base station in order to provide better coverage and higher data rates for the users. Prior studies on UAV-based wireless coverage typically consider an air-to-ground path loss model, which assumes that the users are outdoor and located on a 2-D plane. In this paper, we propose using UAVs to provide wireless coverage for indoor users inside a high-rise building. First, we present realistic outdoor&#x2013;indoor path loss models and describe the tradeoff introduced by these models. Then, we study the problem of efficient placement of a single UAV, where the objective is to minimize the total transmit power required to cover the entire high-rise building. The formulated problem is generally difficult to solve. To that end, we consider three cases of practical interest and provide efficient solutions to the formulated problem under these cases. Then, we study the problem of minimizing the number of UAVs required to provide wireless coverage to the high-rise building and prove that this problem is NP-complete. Due to the intractability of the problem, we use clustering to minimize the number of UAVs required to cover the indoor users. In our proposed algorithm, we check if the maximum transmit power of a UAV is sufficient to cover each cluster. If not, the number of clusters is incremented by one, and the problem is solved again. In the uniform split method, we split the building into <formula><tex>$k$</tex></formula> regular structures and utilize <formula><tex>$k$</tex></formula> UAVs to provide wireless coverage for indoor users regardless of user distribution. We demonstrate through simulations that the method that splits the building into regular structures requires 80&#x0025; more number of UAVs relative to our proposed algorithm.

Original languageEnglish
JournalIEEE Systems Journal
DOIs
Publication statusAccepted/In press - 28 Apr 2018

Fingerprint

Unmanned aerial vehicles (UAV)
Base stations
Disasters
Computational complexity
Antennas
Air

Keywords

  • Atmospheric modeling
  • Base stations
  • Buildings
  • Clustering algorithms
  • Communication system security
  • Gradient descent (GD) algorithm
  • k-means clustering
  • outdoor-to-indoor path loss model
  • particle swarm optimization (PSO)
  • Unmanned aerial vehicles
  • unmanned aerial vehicles (UAVs)
  • Wireless communication

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Indoor Mobile Coverage Problem Using UAVs. / Shakhatreh, Hazim; Khreishah, Abdallah; Khalil, Issa.

In: IEEE Systems Journal, 28.04.2018.

Research output: Contribution to journalArticle

Shakhatreh, Hazim ; Khreishah, Abdallah ; Khalil, Issa. / Indoor Mobile Coverage Problem Using UAVs. In: IEEE Systems Journal. 2018.
@article{0e54472b4edd4fed86c2617470ccc206,
title = "Indoor Mobile Coverage Problem Using UAVs",
abstract = "Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks are not operational due to natural disasters. They can also be used to supplement the ground base station in order to provide better coverage and higher data rates for the users. Prior studies on UAV-based wireless coverage typically consider an air-to-ground path loss model, which assumes that the users are outdoor and located on a 2-D plane. In this paper, we propose using UAVs to provide wireless coverage for indoor users inside a high-rise building. First, we present realistic outdoor–indoor path loss models and describe the tradeoff introduced by these models. Then, we study the problem of efficient placement of a single UAV, where the objective is to minimize the total transmit power required to cover the entire high-rise building. The formulated problem is generally difficult to solve. To that end, we consider three cases of practical interest and provide efficient solutions to the formulated problem under these cases. Then, we study the problem of minimizing the number of UAVs required to provide wireless coverage to the high-rise building and prove that this problem is NP-complete. Due to the intractability of the problem, we use clustering to minimize the number of UAVs required to cover the indoor users. In our proposed algorithm, we check if the maximum transmit power of a UAV is sufficient to cover each cluster. If not, the number of clusters is incremented by one, and the problem is solved again. In the uniform split method, we split the building into $k$ regular structures and utilize $k$ UAVs to provide wireless coverage for indoor users regardless of user distribution. We demonstrate through simulations that the method that splits the building into regular structures requires 80{\%} more number of UAVs relative to our proposed algorithm.",
keywords = "Atmospheric modeling, Base stations, Buildings, Clustering algorithms, Communication system security, Gradient descent (GD) algorithm, k-means clustering, outdoor-to-indoor path loss model, particle swarm optimization (PSO), Unmanned aerial vehicles, unmanned aerial vehicles (UAVs), Wireless communication",
author = "Hazim Shakhatreh and Abdallah Khreishah and Issa Khalil",
year = "2018",
month = "4",
day = "28",
doi = "10.1109/JSYST.2018.2824802",
language = "English",
journal = "IEEE Systems Journal",
issn = "1932-8184",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Indoor Mobile Coverage Problem Using UAVs

AU - Shakhatreh, Hazim

AU - Khreishah, Abdallah

AU - Khalil, Issa

PY - 2018/4/28

Y1 - 2018/4/28

N2 - Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks are not operational due to natural disasters. They can also be used to supplement the ground base station in order to provide better coverage and higher data rates for the users. Prior studies on UAV-based wireless coverage typically consider an air-to-ground path loss model, which assumes that the users are outdoor and located on a 2-D plane. In this paper, we propose using UAVs to provide wireless coverage for indoor users inside a high-rise building. First, we present realistic outdoor–indoor path loss models and describe the tradeoff introduced by these models. Then, we study the problem of efficient placement of a single UAV, where the objective is to minimize the total transmit power required to cover the entire high-rise building. The formulated problem is generally difficult to solve. To that end, we consider three cases of practical interest and provide efficient solutions to the formulated problem under these cases. Then, we study the problem of minimizing the number of UAVs required to provide wireless coverage to the high-rise building and prove that this problem is NP-complete. Due to the intractability of the problem, we use clustering to minimize the number of UAVs required to cover the indoor users. In our proposed algorithm, we check if the maximum transmit power of a UAV is sufficient to cover each cluster. If not, the number of clusters is incremented by one, and the problem is solved again. In the uniform split method, we split the building into $k$ regular structures and utilize $k$ UAVs to provide wireless coverage for indoor users regardless of user distribution. We demonstrate through simulations that the method that splits the building into regular structures requires 80% more number of UAVs relative to our proposed algorithm.

AB - Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations when cellular networks are not operational due to natural disasters. They can also be used to supplement the ground base station in order to provide better coverage and higher data rates for the users. Prior studies on UAV-based wireless coverage typically consider an air-to-ground path loss model, which assumes that the users are outdoor and located on a 2-D plane. In this paper, we propose using UAVs to provide wireless coverage for indoor users inside a high-rise building. First, we present realistic outdoor–indoor path loss models and describe the tradeoff introduced by these models. Then, we study the problem of efficient placement of a single UAV, where the objective is to minimize the total transmit power required to cover the entire high-rise building. The formulated problem is generally difficult to solve. To that end, we consider three cases of practical interest and provide efficient solutions to the formulated problem under these cases. Then, we study the problem of minimizing the number of UAVs required to provide wireless coverage to the high-rise building and prove that this problem is NP-complete. Due to the intractability of the problem, we use clustering to minimize the number of UAVs required to cover the indoor users. In our proposed algorithm, we check if the maximum transmit power of a UAV is sufficient to cover each cluster. If not, the number of clusters is incremented by one, and the problem is solved again. In the uniform split method, we split the building into $k$ regular structures and utilize $k$ UAVs to provide wireless coverage for indoor users regardless of user distribution. We demonstrate through simulations that the method that splits the building into regular structures requires 80% more number of UAVs relative to our proposed algorithm.

KW - Atmospheric modeling

KW - Base stations

KW - Buildings

KW - Clustering algorithms

KW - Communication system security

KW - Gradient descent (GD) algorithm

KW - k-means clustering

KW - outdoor-to-indoor path loss model

KW - particle swarm optimization (PSO)

KW - Unmanned aerial vehicles

KW - unmanned aerial vehicles (UAVs)

KW - Wireless communication

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

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

U2 - 10.1109/JSYST.2018.2824802

DO - 10.1109/JSYST.2018.2824802

M3 - Article

AN - SCOPUS:85046378226

JO - IEEE Systems Journal

JF - IEEE Systems Journal

SN - 1932-8184

ER -