Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Wireless Personal Co...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Wireless Personal Communications
Article . 1994 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
DBLP
Article . 1994
Data sources: DBLP
versions View all 2 versions
addClaim

Constrained power control

Authors: Sudheer A. Grandhi; Jens Zander; Roy D. Yates;

Constrained power control

Abstract

High system capacities can be achieved by controlling the transmitter power in multiuser radio systems. Power control with no constraint on the maximum power level has been studied extensively in earlier work [1–18]. Transmitter power is at a premium in radio systems such as cellular systems and PCS. There is a limit on the maximum transmitter power especially at the terminals (e.g. mobile units and handsets) since the power comes from a battery. In this paper we study power control that maximizes the minimum carrier to interference ratio (CIR), with a constraint on the maximum power. The optimal power vector solution lies on the boundary of the constrained power vector set and achieves a balance in the CIR's. Results indicate that the constraints do not induce any stability problems. A distributed scheme with favourable convergence properties and close to optimum performance is presented. Simulation results show that the algorithm tries to maximize the number of terminals served with CIR greater than or equal to the target CIR, while conserving power.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    223
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 0.1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
223
Top 10%
Top 0.1%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!