• English
    • Tiếng Việt
  • Tiếng Việt 
    • English
    • Tiếng Việt
  • Đăng nhập
View Item 
  •   Trang chủ
  • The College of Engineering and Computer Science
  • Nguyen Van Dinh, PhD.
  • View Item
  •   Trang chủ
  • The College of Engineering and Computer Science
  • Nguyen Van Dinh, PhD.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Joint communications and sensing design for multi-carrier MIMO systems

Thumbnail
Xem/Mở
Joint Resource Allocation and Link Adaptation for Ultra-Reliable and Low-Latency Services.pdf (632.1Kb)
Năm xuất bản
2023
Tác giả
Hossen, Md Arman
Chatzinotas, Symeon
Ottersten, Bjorn
Nguyen, Van Dinh
Vu, X. Thang
Metadata
Hiển thị đầy đủ biểu ghi
Tóm tắt
With the emergence of ultra-reliable and low latency communication (URLLC) services, link adaptation (LA) plays a pivotal role in improving the robustness and reliability of communication networks via appropriate modulation and coding schemes (MCS). LA-based resource management schemes in both physical and medium access control layers can significantly enhance the system performance in terms of throughput, latency, reliability, and quality of service. Increasing the number of retransmissions will achieve higher reliability and increase transmission latency. In order to balance this trade-off with improved link performance for URLLC services, we study a joint subcarrier and power allocation problem to maximize the achievable sum-rate under an appropriate MCS. The formulated problem is mixed-integer nonconvex programming which is challenging to solve optimally. In addition, a direct application of standard optimization techniques is no longer applicable due to the complication of the effective signal-to-noise ratio (SNR) function. To overcome this challenge, we first relax the binary variables to continuous ones and introduce additional variables to convert the relaxed problem into a more tractable form. By leveraging the successive convex approximation method, we develop a low-complexity iterative algorithm that guarantees to achieve at least a locally optimal solution. Simulation results are provided to show the fast convergence of the proposed iterative algorithm and demonstrate the significant performance improvement in terms of the achievable sum-rate, compared with the conventional LA approach and existing retransmission policy.
Định danh
https://vinspace.edu.vn/handle/VIN/382
Collections
  • Nguyen Van Dinh, PhD. [15]

Liên hệ | Gửi phản hồi
 

 

Duyệt theo

Toàn bộ thư việnĐơn vị và Bộ sưu tậpNăm xuất bảnTác giảNhan đềChủ đềTrong Bộ sưu tậpNăm xuất bảnTác giảNhan đềChủ đề

Tài khoản

Đăng nhậpĐăng ký

Liên hệ | Gửi phản hồi