Hamzih ALsmadi;Huda Alsheyab;Malek Alsmadi;Emad Mohammed;Yazan Alomari;Salama Ikki
{"title":"无人机网络中复杂度较低、频谱效率较高的资源分配算法","authors":"Hamzih ALsmadi;Huda Alsheyab;Malek Alsmadi;Emad Mohammed;Yazan Alomari;Salama Ikki","doi":"10.1109/ICJECE.2022.3178033","DOIUrl":null,"url":null,"abstract":"This work studies the unmanned aerial vehicles (UAVs) as a provider and supporter of the future wireless networks’ connections. In this work, we aim to find an optimal solution for the association problem between the wireless access points (WAPs) and UAVs, which allow us to maximize the total weighted sum rate. This optimization is subjected to quality of service (QoS), a number of links, available bandwidth, fairness, and coverage constraints. We propose a centralized algorithm to solve the association problem. Our results show that the proposed algorithm excels for the counterpart suboptimal and approaches the optimal solution with very reduced complexity.","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"45 3","pages":"279-284"},"PeriodicalIF":2.1000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Less Complex and Higher Spectral Efficiency Resource Allocation Algorithm for Unmanned Aerial Vehicles Networks\",\"authors\":\"Hamzih ALsmadi;Huda Alsheyab;Malek Alsmadi;Emad Mohammed;Yazan Alomari;Salama Ikki\",\"doi\":\"10.1109/ICJECE.2022.3178033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work studies the unmanned aerial vehicles (UAVs) as a provider and supporter of the future wireless networks’ connections. In this work, we aim to find an optimal solution for the association problem between the wireless access points (WAPs) and UAVs, which allow us to maximize the total weighted sum rate. This optimization is subjected to quality of service (QoS), a number of links, available bandwidth, fairness, and coverage constraints. We propose a centralized algorithm to solve the association problem. Our results show that the proposed algorithm excels for the counterpart suboptimal and approaches the optimal solution with very reduced complexity.\",\"PeriodicalId\":100619,\"journal\":{\"name\":\"IEEE Canadian Journal of Electrical and Computer Engineering\",\"volume\":\"45 3\",\"pages\":\"279-284\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Canadian Journal of Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/9864035/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Canadian Journal of Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/9864035/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
Less Complex and Higher Spectral Efficiency Resource Allocation Algorithm for Unmanned Aerial Vehicles Networks
This work studies the unmanned aerial vehicles (UAVs) as a provider and supporter of the future wireless networks’ connections. In this work, we aim to find an optimal solution for the association problem between the wireless access points (WAPs) and UAVs, which allow us to maximize the total weighted sum rate. This optimization is subjected to quality of service (QoS), a number of links, available bandwidth, fairness, and coverage constraints. We propose a centralized algorithm to solve the association problem. Our results show that the proposed algorithm excels for the counterpart suboptimal and approaches the optimal solution with very reduced complexity.