TY - JOUR
T1 - The Coverage Overlapping Problem of Serving Arbitrary Crowds in 3D Drone Cellular Networks
AU - Lai, Chuan Chi
AU - Wang, Li Chun
AU - Han, Zhu
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2022/3/1
Y1 - 2022/3/1
N2 - Providing coverage for flash crowds is an important application for drone base stations (DBSs). However, any arbitrary crowd is likely to be distributed at a high density. Under the condition for each DBS to serve the same number of ground users, multiple DBSs may be placed at the same horizontal location but different altitudes and will cause severe co-channel interference, to which we refer as the coverage overlapping problem. To solve this problem, we then proposed the data-driven 3D placement (DDP) and the enhanced DDP (eDDP) algorithms. The proposed DDP and eDDP can effectively find the appropriate number, altitude, location, and coverage of DBSs in the serving area in polynomial time to maximize the system sum rate and guarantee the minimum data rate requirement of the user equipment. The simulation results show that, compared with the balanced $k$k-means approach, the proposed eDDP can increase the system sum rate by 200 percent and reduce the computation time by 50 percent. In particular, eDDP can effectively reduce the occurrence of the coverage overlapping problem and then outperform DDP by about 100 percent in terms of system sum rate.
AB - Providing coverage for flash crowds is an important application for drone base stations (DBSs). However, any arbitrary crowd is likely to be distributed at a high density. Under the condition for each DBS to serve the same number of ground users, multiple DBSs may be placed at the same horizontal location but different altitudes and will cause severe co-channel interference, to which we refer as the coverage overlapping problem. To solve this problem, we then proposed the data-driven 3D placement (DDP) and the enhanced DDP (eDDP) algorithms. The proposed DDP and eDDP can effectively find the appropriate number, altitude, location, and coverage of DBSs in the serving area in polynomial time to maximize the system sum rate and guarantee the minimum data rate requirement of the user equipment. The simulation results show that, compared with the balanced $k$k-means approach, the proposed eDDP can increase the system sum rate by 200 percent and reduce the computation time by 50 percent. In particular, eDDP can effectively reduce the occurrence of the coverage overlapping problem and then outperform DDP by about 100 percent in terms of system sum rate.
KW - 3D placement
KW - Drone
KW - co-channel interference
KW - coverage overlapping
KW - heterogeneous networks
KW - sum rate
UR - http://www.scopus.com/inward/record.url?scp=85101252249&partnerID=8YFLogxK
U2 - 10.1109/TMC.2020.3019106
DO - 10.1109/TMC.2020.3019106
M3 - Article
AN - SCOPUS:85101252249
SN - 1536-1233
VL - 21
SP - 1124
EP - 1141
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 3
ER -