Jointly Optimizing Power Allocation and Device Association for Robust IoT Networks under Infeasible Circumstances
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q1Scopus Q1
- 저널
- IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT22(2) · pp.1372 · 2025
- 피인용
- Web of Science 5Scopus 4
- FWCI (Scopus)
- 0.6
- JCR IF
- JCR 2024 5.4
- ISSN
- 1932-4537
저자
- 응우옌 쑤언 둥제1저자Pusan Natl Univ, Dept Informat Convergence Engn, Busan 46241, South Korea
- Van Chien, TrinhHanoi Univ Sci & Technol, Sch Informat & Commun Technol, Hanoi 100000, Vietnam
- Hoang, Dinh ThaiUniv Technol Sydney, Sch Elect & Data Engn, Sydney, NSW 2007, Australia
- 황원주교신저자Pusan Natl Univ, Ctr Artificial Intelligence Res, Sch Comp Sci & Engn, Busan 46241, South Korea
초록
Jointly optimizing power allocation and device association is crucial in Internet-of-Things (IoT) networks to ensure devices achieve their data throughput requirements. Device association, which assigns IoT devices to specific access points (APs), critically impacts resource allocation. Many existing works often assume all data throughput requirements are satisfied, which is impractical given resource limitations and diverse demands. When requirements cannot be met, the system becomes infeasible, causing congestion and degraded performance. To address this problem, we propose a novel framework to enhance IoT system robustness by solving two problems, comprising maximizing the number of satisfied IoT devices and jointly maximizing both the number of satisfied devices and total network throughput. These objectives often conflict under infeasible circumstances, necessitating a careful balance. We thus propose a modified branch-and-bound (BB)-based method to solve the first problem. An iterative algorithm is proposed for the second problem that gradually increases the number of satisfied IoT devices and improves the total network throughput. We employ a logarithmic approximation for a lower bound on data throughput and design a fixed-point algorithm for power allocation, followed by a coalition game-based method for device association. Numerical results demonstrate the efficiency of the proposed algorithm, serving fewer devices than the BB-based method but with faster running time and higher total throughput.
키워드
device associationDual-objective optimizationIoTpower allocationservice managementBASE STATION ASSOCIATIONRATE CONSTRAINTSMASSIVE MIMOSUM-RATEPERFORMANCEFRAMEWORK
식별자
- Scopus EID
- 2-s2.0-85209915108
- WoS UID
- 001473161100018



로그인
연구물 목록으로