• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Ȩ Ȩ > ¿¬±¸¹®Çå >

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Multi-dimensional knapsack problem for Resource Allocation to UEs through UAV
¿µ¹®Á¦¸ñ(English Title) Multi-dimensional knapsack problem for Resource Allocation to UEs through UAV
ÀúÀÚ(Author) Umer Majeed   Sheikh Salman Hassan   Choong Seon Hon  
¿ø¹®¼ö·Ïó(Citation) VOL 48 NO. 02 PP. 0257 ~ 0259 (2021. 12)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Unmanned aerial vehicles (UAVs) are an indispensable component of future wireless networks. UAV can not only provide edge-computing services but also act as a router to the backhaul for the user devices. In this paper, we considered the problem of allocating communication and computing resources to UEs via UAV as a multi-dimensional knapsack problem. We used ORTools to solve the multi-dimensional knapsack problem in order to maximize the utility of the UAV. OR-Tools solves the NP-hard multi-dimensional knapsack problem with brand-and-bound algorithms.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå