The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
Open accessAbstract
This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we formulate this power control problem as a (generalized) Nash equilibrium (NE) game. We obtain sufficient conditions that guarantee the existence and nonemptiness of the solution set to our problem. Then, to compute the solutions of the game, we propose two distributed algorithms based on the single user water-filling solution: Thesequentialand thesimultaneousiterative water-filling algorithms, wherein the users update their own strategies sequentially and simultaneously, respectively. We derive a unified set of sufficient conditions that guarantee the uniqueness of the solution and global convergence of both algorithms. Our results are applicable to all practical distributed multipoint-to-multipoint interference systems, either wired or wireless, where a quality of service in (QoS) terms of information rate must be guaranteed for each link.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Cited by
Generalized Nash equilibrium problems
Facchinei, F., & Kanzow, C. (2007) · 4OR · doi:10.1007/s10288-007-0054-4 · Cited by 591
Self-citationEnergy Efficiency in Wireless Networks via Fractional Programming Theory
Zappone, A., & Jorswieck, E. (2015) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000088 · Cited by 513
Convex Optimization, Game Theory, and Variational Inequality Theory
Scutari, G., Palomar, D., Facchinei, F., & Pang, J.-S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936021 · Cited by 376
Self-citationDistributed Nash equilibrium seeking for aggregative games with coupled constraints
Liang, S., Yi, P., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.064 · Cited by 328
Energy Efficiency in Wireless Networks via Fractional Programming Theory
Zappone, A., & Jorswieck, E. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781680830439 · Cited by 326
Metadata
- Authors
- Pang, J.-S., Scutari, G., Facchinei, F., & Wang, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-08
- Volume
- 54
- Issue
- 8
- Pages
- 3471-3489
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2166977026
- Cited by
- 215
- References
- 1
- FWCI
- 16.14
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.