z-logo
open-access-imgOpen Access
Fairness aware multiple drone base station deployment
Author(s) -
Akarsu Alper,
Girici Tolga
Publication year - 2018
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0978
Subject(s) - software deployment , computer science , base station , drone , particle swarm optimization , task (project management) , wireless , real time computing , computer network , algorithm , telecommunications , systems engineering , engineering , genetics , biology , operating system
The recent advances in drone technology significantly improved the effectiveness of applications such as border surveillance, disaster management, seismic surveying, and precision agriculture. The use of drones as base stations to improve communication in the next generation wireless networks is another attractive application. However, the deployment of drone base stations (DBSs) is not an easy task and requires a carefully designed strategy. Fairness is one of the most important metrics of tactical communications or a disaster‐affected network and must be considered for the efficient deployment of DBSs. In this study, a fairness‐aware multiple DBS deployment algorithm is proposed. As the proposed algorithm uses particle swarm optimisation (PSO) that requires significant processing power, simpler algorithms with faster execution times are also proposed and the results are compared. The simulations are performed to evaluate the performance of the algorithms in two different network scenarios. The simulation results show that the proposed PSO‐based method finds the three‐dimensional locations of DBSs, achieving the best fairness performance with a minimum number of DBSs for deployment. However, it is shown that the proposed suboptimal algorithm performs very close to the PSO‐based solution and requires significantly less processing time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here