سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks

Publish Year: 1392
Type: Journal paper
Language: English
View: 327
این Paper فقط به صورت چکیده توسط دبیرخانه ارسال شده است و فایل کامل قابل دریافت نیست. برای یافتن Papers دارای فایل کامل، از بخش [جستجوی مقالات فارسی] اقدام فرمایید.

نسخه کامل این Paper ارائه نشده است و در دسترس نمی باشد

Export:

Link to this Paper:

Document National Code:

JR_JCESH-2-4_006

Index date: 14 October 2019

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks abstract

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and is hard to deal with for large number of sub channels and/or users. However, relying on some approximation methods, it is demonstrated that the proposed sub-optimal problem has roots in combinatorial optimization, termed as Assignment problem which can be tackled through the so called Hungarian method. Simulation results demonstrate that the proposed method outperforms existing works addressed in the literature.

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks Keywords:

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks authors