{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:23:12Z","timestamp":1764937392771,"version":"3.37.3"},"reference-count":27,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ukrainian government project","award":["0120U100674"],"award-info":[{"award-number":["0120U100674"]}]},{"name":"Scientific Grant Agency of the Ministry of Education, Science, Research and Sport of the Slovak Republic","award":["1\/0268\/19"],"award-info":[{"award-number":["1\/0268\/19"]}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"crossref","award":["APVV-15-0055"],"award-info":[{"award-number":["APVV-15-0055"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"crossref","award":["APVV-18-0214"],"award-info":[{"award-number":["APVV-18-0214"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61962036"],"award-info":[{"award-number":["61962036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p> The challenge of dynamic traffic demand in mobile networks is tackled by moving cells based on unmanned aerial vehicles. Considering the tremendous potential of unmanned aerial vehicles in the future, we propose a new heuristic algorithm for coverage optimization. The proposed algorithm is implemented based on a conditional generative adversarial neural network, with a unique multilayer sum-pooling loss function. To assess the performance of the proposed approach, we compare it with the optimal core-set algorithm and quasi-optimal spiral algorithm. Simulation results show that the proposed approach converges to the quasi-optimal solution with a negligible difference from the global optimum while maintaining a quadratic complexity regardless of the number of users. <\/jats:p>","DOI":"10.1177\/15501477221075544","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T10:41:17Z","timestamp":1648204877000},"page":"155014772210755","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast and computationally efficient generative adversarial network algorithm for unmanned aerial vehicle\u2013based network coverage optimization"],"prefix":"10.1177","volume":"18","author":[{"given":"Marek","family":"Ru\u017ei\u010dka","sequence":"first","affiliation":[{"name":"Department of Computers and Informatics, Technical University of Ko\u0161ice, Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Volo\u0161in","sequence":"additional","affiliation":[{"name":"Department of Computers and Informatics, Technical University of Ko\u0161ice, Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7334-9540","authenticated-orcid":false,"given":"Juraj","family":"Gazda","sequence":"additional","affiliation":[{"name":"Department of Computers and Informatics, Technical University of Ko\u0161ice, Ko\u0161ice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taras","family":"Maksymyuk","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, Lviv Polytechnic National University, Lviv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longzhe","family":"Han","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Institute of Technology, Nanchang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mischa","family":"Dohler","sequence":"additional","affiliation":[{"name":"Centre of Telecommunications Research, King\u2019s College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"bibr1-15501477221075544","unstructured":"Ritchie H. Google mobility trends: how has the pandemic changed the movement of people around the world?https:\/\/ourworldindata.org\/covid-mobility-trends (accessed 8 December 2021)."},{"key":"bibr2-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2906228"},{"key":"bibr3-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2902862"},{"key":"bibr4-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2495297"},{"key":"bibr5-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2019.2899599"},{"key":"bibr6-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2927521"},{"first-page":"250","volume-title":"Proceedings of the thirty-fourth annual ACM symposium on theory of computing","author":"B\u0101doiu M","key":"bibr7-15501477221075544"},{"key":"bibr8-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9503-x"},{"key":"bibr9-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2633248"},{"key":"bibr10-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-019-2834-x"},{"first-page":"282","volume-title":"2019 international conference on computing, networking and communications (ICNC)","author":"Hughes B","key":"bibr11-15501477221075544"},{"key":"bibr12-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2975630"},{"key":"bibr13-15501477221075544","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2020.9010022"},{"key":"bibr14-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2892564"},{"first-page":"1","volume-title":"2020 IEEE globecom workshops (GC Wkshps)","author":"Plachy J","key":"bibr15-15501477221075544"},{"key":"bibr16-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/MAES.2020.2966317"},{"key":"bibr17-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3121905"},{"key":"bibr18-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2020.3027695"},{"key":"bibr19-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3001752"},{"first-page":"23","volume-title":"2020 10th IEEE international conference on control system, computing and engineering (ICCSCE)","author":"Khan MF","key":"bibr20-15501477221075544"},{"key":"bibr21-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2021.101496"},{"key":"bibr22-15501477221075544","volume-title":"Conditional generative adversarial nets","volume":"1784","author":"Mirza M","year":"2014"},{"key":"bibr23-15501477221075544","volume-title":"Generative adversarial networks","volume":"2661","author":"Goodfellow IJ","year":"2014"},{"first-page":"1125","volume-title":"Proceedings of the IEEE conference on computer vision and pattern recognition","author":"Isola P","key":"bibr24-15501477221075544"},{"key":"bibr25-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1269"},{"key":"bibr26-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2012474"},{"key":"bibr27-15501477221075544","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00047-5"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/15501477221075544","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/15501477221075544","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/15501477221075544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:07:56Z","timestamp":1648638476000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1177\/15501477221075544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1177\/15501477221075544"],"URL":"https:\/\/doi.org\/10.1177\/15501477221075544","relation":{},"ISSN":["1550-1329","1550-1477"],"issn-type":[{"type":"print","value":"1550-1329"},{"type":"electronic","value":"1550-1477"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}