A Tunable Caching Distribution Model for Unmanned Aerial Vehicle Networks

被引:8
作者
Tang, Wenfei [1 ]
Zhang, Hongtao [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Minist Educ China, Key Lab Universal Wireless Commun, Beijing 100876, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Cache-enabled unmanned aerial vehicle (UAV); stochastic geometry; transmission cooperation; tunable caching; CELLULAR NETWORKS; TRANSMISSION; COOPERATION; PLACEMENT; DESIGN; 5G;
D O I
10.1109/JIOT.2021.3116198
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the existing works on performance analysis of cache-enabled unmanned aerial vehicle (UAV) networks, caching distribution is fixed, and the joint cache-level and transmission-level cooperation has not been analyzed in literature. Considering UAVs agility and line-of-sight (LOS)/non-line-of-sight (NLOS) channel characteristics, this article proposes a tunable caching distribution model, where content placement and transmission can be flexibly adjusted to match interference topology dynamics and derives semi-closed expression of caching coverage probability via stochastic geometry. Specifically, UAVs will take the partition coefficient rho to determine caching distribution, where the most popular content files are reserved in every UAV within the cooperation group and jointly transmit to the user, while other files are probabilistic stored in the remaining cache space to achieve content diversity. In addition, when requiring the less popular files, the user will always connect to the UAV with the best signal-to-interference (SIR) ratio among cache hit UAVs within the cooperation group. The theoretical analysis investigates the effects of various system parameters such as UAVs height, cooperative radius, and content popularity on the caching coverage probability and optimal rho for can be found. It can be seen that optimal rho will be decreased first and then increased along with the increase of UAVs height, which reveals the tradeoff between cache hit probability and transmission reliability. Analytical results show that our proposed cache and transmission policy can achieve 34% gain of coverage probability compared to the policy of probabilistic cached.
引用
收藏
页码:8646 / 8656
页数:11
相关论文
共 23 条
[1]   Optimal LAP Altitude for Maximum Coverage [J].
Al-Hourani, Akram ;
Kandeepan, Sithamparanathan ;
Lardner, Simon .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (06) :569-572
[2]  
Baccelll F., 2009, STOCHASTIC GEOMETRY
[3]   The New Frontier in RAN Heterogeneity: Multi-Tier Drone-Cells [J].
Bor-Yaliniz, Irem ;
Yanikomeroglu, Halim .
IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (11) :48-55
[4]   Liquid State Machine Learning for Resource and Cache Management in LTE-U Unmanned Aerial Vehicle (UAV) Networks [J].
Chen, Mingzhe ;
Saad, Walid ;
Yin, Changchuan .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (03) :1504-1517
[5]   Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Networks [J].
Chen, Zheng ;
Lee, Jemin ;
Quek, Tony Q. S. ;
Kountouris, Marios .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (05) :3401-3415
[6]   UAV-Assisted Networks Through a Tunable Dependent Model [J].
Chen, Ziyi ;
Zhang, Hongtao .
IEEE COMMUNICATIONS LETTERS, 2020, 24 (05) :1110-1114
[7]   Downlink Coverage Analysis for a Finite 3-D Wireless Network of Unmanned Aerial Vehicles [J].
Chetlur, Vishnu Vardhan ;
Dhillon, Harpreet S. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (10) :4543-4558
[8]   Coverage and Rate Analysis of Cache-Enabled Vertical Heterogeneous Networks [J].
Fan, Congshan ;
Zhang, Tiankui ;
Zeng, Zhimin .
IEEE ACCESS, 2019, 7 :153519-153532
[9]   Joint Cache Placement, Flight Trajectory, and Transmission Power Optimization for Multi-UAV Assisted Wireless Networks [J].
Ji, Jiequ ;
Zhu, Kun ;
Niyato, Dusit ;
Wang, Ran .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (08) :5389-5403
[10]   Probabilistic Caching Based on Maximum Distance Separable Code in a User-Centric Clustered Cache-Aided Wireless Network [J].
Ko, Dongyeon ;
Hong, Bi ;
Choi, Wan .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (03) :1792-1804