Power Allocation Policy Research Articles

Outage Capacities and Optimal Power Allocation for Fading Multiple-Access Channels

We derive the outage capacity region of an M-user fading multiple-access channel (MAC) under the assumption that both the transmitters and the receiver have perfect channel side information (CSI). The outage capacity region is implicitly obtained by deriving the outage probability region for a given rate vector. Given a required rate and average power constraint for each user, we find a successive decoding strategy and a power allocation policy that achieves points on the boundary of the outage probability region. We discuss the scenario where an outage must be declared simultaneously for all users (common outage) and when outages can be declared individually (individual outage) for each user.

Dynamic power allocation and routing for time-varying wireless networks

We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support-where /spl lambda//sub ij/ represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed that stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad hoc wireless network, where channel variations are due to user mobility. Centralized and decentralized implementations are compared, and the stability region of the decentralized algorithm is shown to contain that of the mobile relay strategy developed by Grossglauser and Tse (2002).

PRICE-BASED RESOURCE ALLOCATION IN CDMA NETWORKS AND STABILITY ANALYSIS

We present an optimal model based on utility functions and pricing for downlink radio resource allocation in code division multiple access (CDMA) systems. The aim of this model is to achieve the throughput maximization via dynamic price adjustment. Due to the existence of action delays, we give globally asymptotical stability results using Lyapunov-Razumikhin arguments for rate and price evolvement closed-loop systems. Considering total power constraint for base station, we introduce a power allocation policy, which need only users’ local information. Simulation results validate the effectiveness of the joint rate and power control scheme.

Variable-Rate Coding for Slowly Fading Gaussian Multiple-Access Channels

We consider a nonergodic multiple-access Gaussian block-fading channel where a fixed number of independent and identically distributed (i.i.d.) fading coefficients affect each codeword. Variable-rate coding with input power constraint enforced on a per-codeword basis is examined. A centralized power and rate allocation policy is determined as a function of the previous and present fading coefficients. The power control policy that optimizes the expected rates is obtained through dynamic programming and the average capacity region and the average capacity region per unit energy are characterized. Moreover, we study the slope of spectral efficiency curve versus E/sub b//N/sub 0/ (dB), and we quantify the penalty incurred by time-division multiple access (TDMA) over superposition coding in the low-power regime.

Optimum Power Control for CDMA With Deterministic Sequences in Fading Channels

We specify the capacity region for a power-controlled, fading code-division multiple-access (CDMA) channel. We investigate the properties of the optimum power allocation policy that maximizes the information-theoretic ergodic sum capacity of a CDMA system where the users are assigned arbitrary signature sequences in a frequency flat-fading environment. We provide an iterative waterfilling algorithm to obtain the powers of all users at all channel fade levels, and prove its convergence. Under certain mild conditions on the signature sequences, the optimum power allocation dictates that more than one user transmit simultaneously in some nonzero probability region of the space of all channel states. We identify these conditions, and provide an upper bound on the maximum number of users that can transmit simultaneously at any given time. Using these properties of the sum capacity maximizing power control policy, we also show that the capacity region of the fading CDMA channel is not in general strictly convex.

Power-Allocation Policy and Optimized Design of Multiple-Antenna Systems With Imperfect Channel Estimation

We here focus on the optimized design and performance of Rayleigh-faded multiple-antenna multiple-input-multiple-output systems when both transmitter and receiver share imperfect (i.e., error impaired) channel estimates computed via training sequences. In particular, according to the emerging principle of the so-called synchronized detection, for this operating scenario we propose a simple water-filling (WF)-like strategy for allocating power over transmit antennas and test its actual performance. Afterward, we introduce and evaluate some related figures of merit summarizing the overall system's performance and use these last for noting effective system's design guidelines. In particular, some optimized solutions for power-versus-bandwidth efficiency tradeoff are presented and their validity limits are debated. All the developed results explicitly take into account the actual reliability of the achievable channel estimates.

Power allocation and routing in multibeam satellites with time-varying channels

We consider power and server allocation in a multibeam satellite downlink which transmits data to N different ground locations over N time-varying channels. Packets destined for each ground location are stored in separate queues and the server rate for each queue, i, depends on the power, p/sub i/(t), allocated to that server and the channel state, c/sub i/(t), according to a concave rate-power curve /spl mu//sub i/(p/sub i/,c/sub i/). We establish the capacity region of all arrival rate vectors (/spl lambda//sub 1/,...,/spl lambda//sub N/) which admit a stabilizable system. We then develop a power-allocation policy which stabilizes the system whenever the rate vector lies within the capacity region. Such stability is guaranteed even if the channel model and the specific arrival rates are unknown. Furthermore, the algorithm is shown to be robust to arbitrary variations in the input rates and a bound on average delay is established. As a special case, this analysis verifies stability and provides a performance bound for the choose-the-K-largest-connected-queues policy when channels can be in one of two states (ON or OFF ) and K servers are allocated at every timestep (K<N). These results are extended to treat a joint problem of routing and power allocation in a system with multiple users and satellites; a throughput maximizing algorithm for this joint problem is constructed. Finally, we address the issue of interchannel interference and develop a modified policy when power vectors are constrained to feasible activation sets. Our analysis and problem formulation are also applicable to power control for wireless systems.

Multicell uplink spectral efficiency of coded DS-CDMA with random signatures

A simple multicell uplink communication model is suggested and analyzed for optimally coded randomly spread direct sequence code-division multiple access (DS-CDMA). The model adheres to Wyner's (1994) infinite linear cell-array model, according to which only adjacent-cell interference is present, and characterized by a single parameter 0/spl les//spl alpha//spl les/1. The discussion is confined to asymptotic analysis where both the number of users and the processing gain go to infinity, while their ratio goes to some finite constant. Single cell-site processing is assumed and four multiuser detection strategies are considered: the matched-filter detector, optimum detection with adjacent-cell interference treated as Gaussian noise, the linear minimum mean square error (MMSE) detector and a detector that performs MMSE-based successive interference cancellation for intracell users with linear MMSE processing of adjacent-cell interference. Spectral efficiency is evaluated under three power allocation policies: equal received powers (for all users), equal rates, and a maximal spectral efficiency policy. Comparative results demonstrate how performance is affected by the introduction of intercell interference, and what is the penalty associated with the randomly spread coded DS-CDMA strategy. Finally, the effect of intercell time-sharing protocols as suggested by Shamai and Wyner (1997) is also examined, and a significant system performance enhancement is observed.