We propose a new method of power control for interference-limited wireless networks with Rayleigh fading of both the desired and interference signals Our method explicitly takes into account the statistical variation of both the received signal and interference power and optimally allocates power subject to constraints on the probability of fading induced outage for each transmitter/receiver pair We establish several results for this type of problem We establish tight bounds that relate the outage probability caused by channel fading to the signal-to-interference margin calculated when the statistical variation of the signal and interference powers is ignored This allows us to show that well-known methods for allocating power, based on Perron-Frobenius eigenvalue theory, can be used to determine power allocations that are provably close to achieving optimal (ie, minimal) outage probability We show that the problems of minimizing the transmitter power subject to constraints on outage probability and minimizing outage probability subject to power constraints can be posed as a geometric program (GP) A GP is a special type of optimization problem that can be transformed to a nonlinear convex optimization problem by a change of variables and therefore solved globally and efficiently by interior-point methods We also give a fast iterative method for finding the optimal power allocation to minimize the outage probability

/pdf/optimal-power-control-in-interference-limited-fading-4dn1xx7gmt.pdf

Optimal power control in interference-limited fading wireless channels with outage-probability specifications

Transmit power in wireless cellular networks is a key degree of freedom in the management of interference, energy, and connectivity. Power control in both the uplink and downlink of a cellular network has been extensively studied, especially over the last 15 years, and some of the results have enabled the continuous evolution and significant impact of the digital cellular technology.

This survey provides a comprehensive discussion of the models, algorithms, analysis, and methodologies in this vast and growing literature. It starts with a taxonomy of the wide range of power control problem formulations, and progresses from the basic formulation to more sophisticated ones. When transmit power is the only set of optimization variables, algorithms for fixed SIR are presented first, before turning to their robust versions and joint SIR and power optimization. This is followed by opportunistic and non-cooperative power control. Then joint control of power together with beamforming pattern, base station assignment, spectrum allocation, and transmit schedule is surveyed\break one-by-one.

Throughout the survey, we highlight the use of mathematical language and tools in the study of power control, including optimization theory, control theory, game theory, and linear algebra. Practical implementations of some of the algorithms in operational networks are discussed in the concluding section. As illustrated by the open problems presented at the end of most chapters, in the area of power control in cellular networks, there are still many under-explored directions and unresolved issues that remain theoretically challenging and practically important..

/pdf/power-control-in-wireless-cellular-networks-3afjsxci1x.pdf

Power Control in Wireless Cellular Networks

A resource allocation framework is presented for spectrum underlay in cognitive wireless networks. We consider both interference constraints for primary users and quality of service (QoS) constraints for secondary users. Specifically, interference from secondary users to primary users is constrained to be below a tolerable limit. Also, signal to interference plus noise ratio (SINR) of each secondary user is maintained higher than a desired level for QoS insurance. We propose admission control algorithms to be used during high network load conditions which are performed jointly with power control so that QoS requirements of all admitted secondary users are satisfied while keeping the interference to primary users below the tolerable limit. If all secondary users can be supported at minimum rates, we allow them to increase their transmission rates and share the spectrum in a fair manner. We formulate the joint power/rate allocation with proportional and max-min fairness criteria as optimization problems. We show how to transform these optimization problems into a convex form so that their globally optimal solutions can be obtained. Numerical results show that the proposed admission control algorithms achieve performance very close to that of the optimal solution. Also, impacts of different system and QoS parameters on the network performance are investigated for the admission control, and rate/power allocation algorithms under different fairness criteria.

Resource allocation for spectrum underlay in cognitive radio networks

Spectrum is one of the most precious radio resources. With the increasing demand for wireless communication, efficiently using the spectrum resource has become an essential issue. With the Federal Communications Commission's (FCC) spectrum policy reform, secondary spectrum sharing has gained increasing interest. One of the policy reforms introduces the concept of an interference temperature - the total allowable interference in a spectral band. This means that secondary users can use different transmit powers as long as the sum of these power is less than the interference threshold. In this paper, we study two problems in secondary spectrum access with minimum signal to interference noise ratio (quality of service (QoS)) guarantee under an interference temperature constraint. First, when all the secondary links can be supported, a nonlinear optimization problem with the objective to maximize the total transmitting rate of the secondary users is formulated. The nonlinear optimization is solved efficiently using geometric programming techniques. The second problem we address is, when not all the secondary links can be supported with their QoS requirement, it is desirable to have the spectrum access opportunity proportional to the user priority if they belong to different priority classes. In this context, we formulate an operator problem which takes the priority issues into consideration. To solve this problem, first, we propose a centralized reduced complexity search algorithm to find the optimal solution. Then, in order to solve this problem distributively, we define a secondary spectrum sharing potential game. The Nash equilibria of this potential game are investigated. The efficiency of the Nash equilibria solutions are characterized. It is shown that distributed sequential play and an algorithm based on stochastic learning attain the equilibrium solutions. Finally, the performances are examined through simulations

Dynamic Spectrum Access with QoS and Interference Temperature Constraints

Transmitter power control can be used to concurrently achieve several key objectives in wireless networking, including minimizing power consumption and prolonging the battery life of mobile nodes, mitigating interference and increasing the network capacity, and maintaining the required link QoS by adapting to node movements, fluctuating interference, channel impairments, and so on. Moreover, power control can be used as a vehicle for implementing on-line several basic network operations, including admission control, channel selection and switching, and handoff control. We consider issues associated with the design of power-sensitive wireless network architectures, which utilize power efficiently in establishing user communication at required QoS levels. Our focus is mainly on the network layer and less on the physical one. Besides reviewing some of the developments in power control, we also formulate some general associated concepts which have wide applicability to wireless network design. A synthesis of these concepts into a framework for power-sensitive network architectures is done, based on some key justifiable points. Various important relevant issues are highlighted and discussed, as well as several directions for further research in this area. Overall, a first step is taken toward the design of power-sensitive network architectures for next-generation wireless networks.

Toward power-sensitive network architectures in wireless communications: concepts, issues, and design aspects

In this paper we study the mobile removal problem in a cellular PCS network where transmitter powers are constrained and controlled by a Distributed Constrained Power Control (DCPC) algorithm. Receivers are subject to non-negligible noise, and the DCPC attempts to bring each receiver's CIR above a given target. To evaluate feasibility and computational complexity, we assume a paradigm where radio bandwidth is scarce and inter-base station connection is fast. We show that finding the optimal removal set is an NP-Complete problem, giving rise for heuristic algorithms. We study and compare among three classes of transmitter removal algorithms. Two classes consist of algorithms which are invoked only when reaching a stable power vector under DCPC. The third class consist of algorithms which combine transmitter removals with power control. These are One-by-one Removals, Multiple Removals, and Power Control with Removals Combined. In the class of power control with removals combined, we also consider a distributed algorithm which uses the same local information as DCPC does. All removal algorithms are compared with respect to their outage probabilities and their time to converge to a stable state. Comparisons are made in a hexagonal macro-cellular system, and in two metropolitan micro-cellular systems. The Power Control with Removals Combined algorithm emerges as practically the best approach with respect to both criteria.

Gradual removals in cellular PCS with constrained power control and noise

We study the mobile admission control problem in a cellular PCS network where transmitter powers are constrained and controlled by a distributed constrained power control (DCPC) algorithm. Receivers are subject to nonnegligible noise, and the DCPC attempts to bring each receiver's CIR (carrier-to-interference ratio) above a given quality target. Two classes of distributed admission control are considered. One is a noninteractive admission control (N-IAC), where an admission decision is instantaneously made based on the system state. The other is an interactive admission control (IAC), under which the new mobile is permitted to interact with one or more potential channels before a decision is made. The algorithms are evaluated with respect to their execution time and their decision errors. Two types of errors are examined: type I error, where a new mobile is erroneously accepted and results in outage; and type II error, where a new mobile is erroneously rejected and results in blocking. The algorithms in the N-IAC class accept a new mobile if and only if the uplink and the downlink interferences are below certain corresponding thresholds. These algorithms are subject to errors of type I and type II. In the IAC class, we derive a soft and safe (SAS) admission algorithm, which is type I and type II error free, and protects the CIR's of all active links at any moment of time. A fast-SAS version, which is only type I error-free, is proposed for practical implementation, and is evaluated in several case studies.

Soft and safe admission control in cellular networks

In this paper we study the mobile removal problem in a cellular PCS network where transmitter powers are constrained and controlled by a distributed constrained power control (DCPC) algorithm. Due to transmitter mobility and random signal propagation, there are system states where not all transmitters can be supported, even under the optimal power control. Thus, some of them should be removed. It can be shown that finding the optimal removal set is an NP-complete problem, and therefore gives rise to heuristic algorithms. In this paper we study and compare among three classes of transmitter removal algorithms, one-by-one removals, multiple removals and power control with removals combined. All removal algorithms are compared with respect to their outage probabilities and their time to convergence to a steady state. The power control with removals combined algorithm emerges as the best approach with respect to both criteria.

/pdf/gradual-removals-in-cellular-pcs-with-constrained-power-3cdnto42e7.pdf

Distributed discrete power control in cellular PCS

Transmitter power control has proven to be an efficient method to control cochannel interference in cellular PCS, and to increase bandwidth utilization. Power control can also improve channel quality, lower the power consumption, and facilitate network management functions such as mobile removals, hand-off and admission control. Most of the previous studies have assumed that the transmitter power level is controlled in a continuous domain, whereas in digitally power controlled systems, power levels are discrete. In this paper we study the transmitter power control problem using only a finite set of discrete power levels.

The optimal discrete power vector is characterized, and a Distributed Discrete Power Control (DDPC) algorithm which converges to it, is presented. The impact of the power level grid on the outage probability is also investigated. A microcellular case study is used to evaluate the outage probabilities of the algorithms.

/pdf/distributed-discrete-power-control-in-cellular-pcs-hok91mok55.pdf

Michael Andersin

Papers

Gradual removals in cellular PCS with constrained power control and noise

Soft and safe admission control in cellular networks

Gradual removals in cellular PCS with constrained power control and noise

Distributed discrete power control in cellular PCS

Distributed Discrete Power Control in Cellular PCS