ICIC-Enabled Association and Channel Selection for UAV-BSs Based on User Locations and Demands

S. A. W. Shah, Mohammad Galal Khafagy, T. Khattab, M. Hasna, K. Abualsaud
{"title":"ICIC-Enabled Association and Channel Selection for UAV-BSs Based on User Locations and Demands","authors":"S. A. W. Shah, Mohammad Galal Khafagy, T. Khattab, M. Hasna, K. Abualsaud","doi":"10.1109/WCNCW.2019.8902917","DOIUrl":null,"url":null,"abstract":"In this work, the downlink association problem is studied when inter-cell interference coordination (ICIC) is enabled at the network side. The serving base stations (BSs) are mounted over unmanned aerial vehicles (UAVs), allowing for their initial placement as per the user geographic distribution. With recent air-to-ground channel modeling adopted herein, we focus on addressing the problem of coordinated channel assignment from within a reusable channel pool at each of the operator-deployed UAV-BSs along with the consideration of backhaul constraint. The joint association/channel assignment problem, which enables a flexible design of the inter-cell interference terms experienced by the users, is cast into a mixed integer linear program (MILP) that is numerically solved. Due to being a non-deterministic polynomial time (NP)-hard problem, the computation time may unboundedly grow, especially as the number of network nodes increases. To solve this problem, a low-complexity heuristic algorithm is proposed. The proposed heuristic solution is compared to that obtained via the MOSEK solver, revealing a close achievable performance with much less computational complexity.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"300 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2019.8902917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this work, the downlink association problem is studied when inter-cell interference coordination (ICIC) is enabled at the network side. The serving base stations (BSs) are mounted over unmanned aerial vehicles (UAVs), allowing for their initial placement as per the user geographic distribution. With recent air-to-ground channel modeling adopted herein, we focus on addressing the problem of coordinated channel assignment from within a reusable channel pool at each of the operator-deployed UAV-BSs along with the consideration of backhaul constraint. The joint association/channel assignment problem, which enables a flexible design of the inter-cell interference terms experienced by the users, is cast into a mixed integer linear program (MILP) that is numerically solved. Due to being a non-deterministic polynomial time (NP)-hard problem, the computation time may unboundedly grow, especially as the number of network nodes increases. To solve this problem, a low-complexity heuristic algorithm is proposed. The proposed heuristic solution is compared to that obtained via the MOSEK solver, revealing a close achievable performance with much less computational complexity.
基于用户位置和需求的icic支持的无人机- bss关联和信道选择
本文研究了在网络侧启用小区间干扰协调(ICIC)时的下行链路关联问题。服务基站(BSs)安装在无人驾驶飞行器(uav)上,允许它们根据用户地理分布进行初始放置。本文采用了最新的空对地信道模型,重点解决了在每个运营商部署的无人机- bss的可重用信道池内协调信道分配的问题,并考虑了回程约束。将联合关联/信道分配问题转化为混合整数线性规划(MILP),并对其进行数值求解,从而实现对用户所经历的小区间干扰项的灵活设计。由于是一个非确定性多项式时间(NP)难题,计算时间可能会无限增长,特别是随着网络节点数量的增加。为了解决这一问题,提出了一种低复杂度的启发式算法。将提出的启发式解决方案与MOSEK求解器获得的解决方案进行了比较,揭示了在计算复杂度大大降低的情况下接近可实现的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信