Optimal downlink rate allocation in multicell CDMA networks

We study downlink rate allocation for a three cells CDMA system. Based on the discretized cell model, the rate optimization problem that maximizes the total downlink rate allocation is formulated. We propose an approximation procedure for obtaining a rate allocation in three cells case. Via numerical examples, we show that this procedure gives a good approximation of the optimal downlink rate allocation

A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions

This paper presents an analytical model for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for a given downlink rate allocation. Based on the Perron-Frobenius eigenvalue, we reduce the downlink rate allocation problem to a set of multiple-choice knapsack problems. The solution of these problems provides an approximation of the optimal downlink rate allocation and cell borders for which the system throughput, expressed in terms of downlink rates, is maximized. \u

Genetically Enhanced Performance of a UTRA-like Time-Division Duplex CDMA Network

In this contribution a Dynamic Channel Allocation (DCA) algorithm is developed, which minimizes the amount of Multi-User Interference (MUI) experienced at the Base Stations (BSs) by employing Genetic Algorithms (GAs). A GA is utilized for finding a suboptimum, but highly beneficial Uplink (UL) or Downlink (DL) Timeslot (TS) allocation for improving the achievable performance of the third generation UTRA system’s Time Division Duplex (TDD) mode. It is demonstrated that a GA-assisted UL/DL timeslot scheduling scheme may avoid the severe BS to BS inter-cell interference potentially inflicted by the UTRA TDD CDMA air interface owing to allowing all TSs to be used both in the UL and D

A combinatorial approximation algorithm for CDMA downlink rate allocation

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for a given downlink rate allocation. Based on the Perron-Frobenius eigenvalue, we reduce the downlink rate allocation problem to a set of multiple-choice knapsack problems. The solution of these problems provides an approximation of the optimal downlink rate allocation and cell borders for which the system throughput, expressed in terms of utility functions of the users, is maximized

Genetic Algorithm Aided Timeslot Scheduling for UTRA TDD CDMA Networks

It is demonstrated that genetic algorithms may be utilised for finding a suboptimum but highly beneficial uplink (UL) or downlink (DL) timeslot (TS) allocation for improving the achievable performance of the third generation UTRA system’s time division duplex (TDD) mode. It is demonstrated that this novel GA-assisted UL=DL timeslot scheduling scheme is capable of avoiding the severe BS to BS intercell interference potentially inflicted by the UTRA TDD CDMA air interface owing to allowing all TSs to be used both in the UL and DL, hence potentially quadrupling the carried teletraffic and halving the uplink power

EVEREST IST - 2002 - 00185 : D23 : final report

Deliverable públic del projecte europeu EVERESTThis deliverable constitutes the final report of the project IST-2002-001858 EVEREST. After its successful completion, the project presents this document that firstly summarizes the context, goal and the approach objective of the project. Then it presents a concise summary of the major goals and results, as well as highlights the most valuable lessons derived form the project work. A list of deliverables and publications is included in the annex.Postprint (published version

Analysis of Multi-Cell Downlink Cooperation with a Constrained Spatial Model

Multi-cell cooperation (MCC) mitigates intercell interference and improves throughput at the cell edge. This paper considers a cooperative downlink, whereby cell-edge mobiles are served by multiple cooperative base stations. The cooperating base stations transmit identical signals over paths with non-identical path losses, and the receiving mobile performs diversity combining. The analysis in this paper is driven by a new expression for the conditional outage probability when signals arriving over different paths are combined in the presence of noise and interference, where the conditioning is with respect to the network topology and shadowing. The channel model accounts for path loss, shadowing, and Nakagami fading, and the Nakagami fading parameters do not need to be identical for all paths. To study performance over a wide class of network topologies, a random spatial model is adopted, and performance is found by statistically characterizing the rates provided on the downlinks. To model realistic networks, the model requires a minimum separation among base stations. Having adopted a realistic model and an accurate analysis, the paper proceeds to determine performance under several resource-allocation policies and provides insight regarding how the cell edge should be defined.Comment: 6 pages, 3 figures, IEEE Global Telecommun. Conf. (GLOBECOM), 2013, to appear. arXiv admin note: text overlap with arXiv:1210.366