Joint Scheduling and Resource Allocation in CDMA Systems
Joint Scheduling and Resource Allocation in CDMA Systems
复制标题
DOI：
10.1109/tit.2010.2040860
复制
发表时间：
2010-05
影响因子：
2.5
通讯作者：
V. Subramanian;R. Berry;R. Agrawal
中科院分区：
文献类型：
--
作者：
V. Subramanian;R. Berry;R. Agrawal
研究了基于码分多址（CDMA）的无线网络下行链路的调度和资源分配问题。问题是选择用户的一个子集进行传输，并为所选的每个用户选择调制和编码方案、传输功率和所使用的码数。我们将这种组合称为物理层操作点（PLOP）。每个PLOP消耗不同数量的代码和电源资源。资源分配任务是选择“最优”PLOP，同时考虑到实际系统中可能出现的系统范围和个人用户资源约束。这个问题是作为效用最大化问题的一部分来解决的，这个问题在之前的论文中提出过，包括调度和资源分配。在这种情况下，问题简化为在考虑系统范围和单个用户约束的同时，最大化依赖状态的下行链路容量区域的加权吞吐量。研究了正交CDMA高斯广播信道下行链路的这一问题。这导致了一个易于处理的凸优化问题。采用双重配方来获得几个关键的结构性能。利用这一结构，提出了求解具有几何收敛性的最优解的算法。
In this paper, the scheduling and resource allocation problem for the downlink in a code-division multiple access (CDMA)-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the ¿optimal¿ PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence.