본문 바로가기

Quantum Annealing-Based Sum Rate Maximization for Multi-UAV-Aided Wireless Networks

문서 유형
연구출판물 · 학술지 논문
등재
SCIEScopus
저널 순위
JCR Q1Scopus Q1
저널
IEEE INTERNET OF THINGS JOURNAL12(12) · pp.21225 · 2025
피인용
Web of Science 12Scopus 17
FWCI (Scopus)
3.11
JCR IF
JCR 2024 8.9
ISSN
2327-4662

저자

  1. 정선근제1저자Pusan Natl Univ, Dept Informat Convergence Engn, Busan 46241, South Korea
  2. Duc, Pham Dang AnhHanoi Univ Sci & Technol, Sch Informat & Commun Technol, Hanoi 100000, Vietnam
  3. Do, Quang VinhTon Duc Thang Univ, Fac Elect & Elect Engn, Wireless Commun Res Grp, Ho Chi Minh City 700000, Vietnam
  4. 노대일Pusan Natl Univ, Dept Informat Convergence Engn, Busan 46241, South Korea
  5. 응우옌 쑤언 둥Pusan Natl Univ, Dept Informat Convergence Engn, Busan 46241, South Korea
  6. Chien, Trinh VanHanoi Univ Sci & Technol, Sch Informat & Commun Technol, Hanoi 100000, Vietnam
  7. 팜쿽비엣Trinity Coll Dublin, Sch Comp Sci & Stat, Dublin D02 PN40, Ireland
  8. Hasegawa, MikioTokyo Univ Sci, Dept Elect Engn, Tokyo 1628601, Japan
  9. Sekiya, HirooChiba Univ, Grad Sch Engn, Chiba 2638522, Japan
  10. 황원주교신저자Pusan Natl Univ, Ctr Artificial Intelligence Res, Sch Comp Sci & Engn, Busan 46241, South Korea

초록

In wireless communication networks, it is difficult to solve many NP-hard problems owing to computational complexity and high cost. Recently, quantum annealing (QA) based on quantum physics was introduced as a key enabler for solving optimization problems quickly. However, only some studies consider quantum-based approaches in wireless communications. Therefore, we investigate the performance of a QA solution to an optimization problem in wireless networks. Specifically, we aim to maximize the sum rate by jointly optimizing clustering, sub-channel assignment, and power allocation in a multi-unmanned aerial vehicle-aided wireless network. We formulate the sum rate maximization problem as a combinatorial optimization problem. Then, we divide it into two sub-problems: 1) a QA-based clustering and 2) sub-channel assignment and power allocation for a given clustering configuration. Subsequently, we obtain an optimized solution for the joint optimization problem by solving these two sub-problems. For the first sub-problem, we convert the problem into a simplified quadratic unconstrained binary optimization (QUBO) model. As for the second sub-problem, we introduce a novel QA algorithm with optimal scaling parameters to address it. Simulation results demonstrate the effectiveness of the proposed algorithm in terms of the sum rate and running time.

키워드

Combinatorial optimizationquadratic unconstrained binary optimizationquantum annealingresource allocationUAVRESOURCE-ALLOCATIONOPTIMIZATIONASSOCIATIONALGORITHMSPLACEMENT

식별자

Scopus EID
2-s2.0-85219529877
WoS UID
001506780700027