Ju-Hyung Lee, Kihong Park, Mohamed-Slim Alouini, Young-Chai Ko
{"title":"Free Space Optical Communication on UAV-Assisted Backhaul Networks: Optimization for Service Time","authors":"Ju-Hyung Lee, Kihong Park, Mohamed-Slim Alouini, Young-Chai Ko","doi":"10.1109/GCWkshps45667.2019.9024382","DOIUrl":null,"url":null,"abstract":"In this work, we address the trajectory optimization of a fixed-wing UAV using free space optical communication (FSO). Here, we focus on maximizing the service time of FSO-based vertical wireless backhaul networks by considering practical constraints for wireless UAV communication, including limited energy and required data rates. To solve the optimization problem, we use a bisection method and sequential programming and introduce a new feasibility algorithm. Although we design suboptimal solutions due to the non-convexity of the problems, simulation indicates that the proposed schemes exhibit a gain of approximately 123.4% in terms of service-time when compared with the conventional scheme.","PeriodicalId":210825,"journal":{"name":"2019 IEEE Globecom Workshops (GC Wkshps)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCWkshps45667.2019.9024382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
In this work, we address the trajectory optimization of a fixed-wing UAV using free space optical communication (FSO). Here, we focus on maximizing the service time of FSO-based vertical wireless backhaul networks by considering practical constraints for wireless UAV communication, including limited energy and required data rates. To solve the optimization problem, we use a bisection method and sequential programming and introduce a new feasibility algorithm. Although we design suboptimal solutions due to the non-convexity of the problems, simulation indicates that the proposed schemes exhibit a gain of approximately 123.4% in terms of service-time when compared with the conventional scheme.