In this paper, we propose two efficient and practical resource allocation algorithms to maximize the weighted sum-rate of coordinated multipoint (CoMP) transmission with joint processing in multiuser multiple-input mu...
详细信息
ISBN:
(纸本)9781479935130
In this paper, we propose two efficient and practical resource allocation algorithms to maximize the weighted sum-rate of coordinated multipoint (CoMP) transmission with joint processing in multiuser multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems subject to per-antenna power constraints. We first propose a continuous-rate algorithm that utilizes successive convex approximation (SCA) to dynamically allocate the transmit powers of multiple CoMP base stations (BSs) transmitting to multiple co-channel user terminals (UTs). Next, we propose a discrete-rate algorithm that takes the continuous-rate result as a starting point and redistributes the transmit powers to obtain a discrete solution. Simulation results are provided to benchmark our continuous-rate algorithm with two alternative approaches: iterative waterfilling (IWF), and zero-forcing beamforming (ZFB). Results show that SCA provides significant sum-rate improvements over IWF in medium to high interference scenarios, and outperforms ZFB in low to medium interference scenarios. Moreover, our proposed discrete rate algorithm produces a higher discrete sum-rate with much lower computational complexity compared to existing algorithms.
The future broadband wireless cellular systems Evolved UTRAN (E-UTRAN) and WiMAX are receiving a lot of interest in recent years. Both systems deploy Orthogonal Frequency Division Multiplex (OFDM) physical layer consi...
详细信息
ISBN:
(纸本)9781424426430
The future broadband wireless cellular systems Evolved UTRAN (E-UTRAN) and WiMAX are receiving a lot of interest in recent years. Both systems deploy Orthogonal Frequency Division Multiplex (OFDM) physical layer consisting of large number of mutually orthogonal sub-carriers. This physical layer provides high robustness against multi-path effects, high flexibility in allocation of the physical resources, high bandwidth scalability and relatively easy combination with Multiple-Input-Multiple-Output (MIMO) transmission and reception. In this study we investigate several algorithms for allocation of the downlink resources for E-UTRAN and WiMAX cellular systems. The goal of the study is to see the differences in downlink sector and user throughput, and user throughput versus distance from the reference base station for the resource allocation algorithms: Reuse-one, Reuse-three, Soft re-use, Reuse partitioning, Proportional Fair and Maximum C/I. Additionally, we observe the difference in performance between E-UTRAN and WiMAX under the conditions selected in this study. The evaluations are done via MATLAB simulations of a cellular system with one central three-sectored site surrounded with two tiers of interfering three-sector sites.
The third generation (3G) mobile system will be based on the Global System for Mobile communications (GSM) and will begin with the General Packet Radio Service (GPRS). Finally the additional channel capacity offered b...
详细信息
We present a numerical-analytical method to evaluate multi-service networks with adaptive routing, scheduling and admission controls. We apply our method to connection-oriented networks supporting different types of r...
详细信息
We present a numerical-analytical method to evaluate multi-service networks with adaptive routing, scheduling and admission controls. We apply our method to connection-oriented networks supporting different types of real-time connections. The network dynamics is described by difference equations which can be solved for both transient and steady-state performances. Results indicate that our method is computationally much cheaper than discrete-event simulation, and yields accurate performance measures. Connection routing algorithms are usually evaluated individually in terms of steady-state performance measures. In this paper, we also use our time-dependent evaluation method to compare several connection routing schemes in terms of instantaneous measures. Our results show that a routing scheme which defines the cost of a path as the sum of measured link utilizations yields more stable behavior and lower connection blocking probability over a wide range of workload parameters and network configurations than other traditional schemes. (C) 1998 Elsevier Science B.V.
暂无评论