The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Power Control By Geometric Programming
Abstract
In wireless cellular or ad hoc networks where Quality of Service (QoS) is interference-limited, a variety of power control problems can be formulated as nonlinear optimization with a system-wide objective, e.g., maximizing the total system throughput or the worst user throughput, subject to QoS constraints from individual users, e.g., on data rate, delay, and outage probability. We show that in the high Signal-to- interference Ratios (SIR) regime, these nonlinear and apparently difficult, nonconvex optimization problems can be transformed into convex optimization problems in the form of geometric programming; hence they can be very efficiently solved for global optimality even with a large number of users. In the medium to low SIR regime, some of these constrained nonlinear optimization of power control cannot be turned into tractable convex formulations, but a heuristic can be used to compute in most cases the optimal solution by solving a series of geometric programs through the approach of successive convex approximation. While efficient and robust algorithms have been extensively studied for centralized solutions of geometric programs, distributed algorithms have not been explored before. We present a systematic method of distributed algorithms for power control that is geometric-programming-based. These techniques for power control, together with their implications to admission control and pricing in wireless networks, are illustrated through several numerical examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Goldsmith, A. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511841224 · Cited by 10,658
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
A framework for uplink power control in cellular radio systems
Yates, R. D. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.414651 · Cited by 2,436
A simple distributed autonomous power control algorithm and its convergence
Foschini, G. J., & Miljanic, Z. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.260747 · Cited by 1,723
A tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
Marks, B. R., & Wright, G. P. (1978) · Operations Research · doi:10.1287/opre.26.4.681 · Cited by 985
Kandukuri, S., & Boyd, S. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/7693.975444 · Cited by 642
Chiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Self-citationGeometric Programming : Theory and Application
Duffin, R. J., Peterson, E. L., & Zener, C. M. (1967) · Cited by 604
Geometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
Self-citationPricing and power control in a multicell wireless data network
Saraydar, C. U., Mandayam, N. B., & Goodman, D. J. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.957304 · Cited by 373
Low-Complexity Distributed Algorithms for Spectrum Balancing in Multi-User DSL Networks
Papandriopoulos, J., & Evans, J. (2006) · 2006 IEEE International Conference on Communications · doi:10.1109/icc.2006.255311 · Cited by 283
Geometric Programming for Communication Systems
Chiang, M. (2005) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000005 · Cited by 247
Self-citationJulian, D., Chiang, M., O'Neill, D., & Boyd, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019292 · Cited by 220
Self-citationAn infeasible interior-point algorithm for solving primal and dual geometric programs
Kortanek, K. O., Xu, X., & Ye, Y. (1997) · Mathematical Programming · doi:10.1007/bf02614382 · Cited by 145
Distributed Optimization of Coupled Systems With Applications to Network Utility Maximization
Tan, C. W., Palomar, D. P., & Chiang, M. (2006) · doi:10.1109/icassp.2006.1661442 · Cited by 55
Self-citationPalomar, D. P., & Chiang, M. (2006) · doi:10.1109/infocom.2006.257 · Cited by 42
Self-citation
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Self-citationLayering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationA Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Spectrum sharing for unlicensed bands
Etkin, R., Parekh, A., & Tse, D. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070402 · Cited by 859
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks
Yetgin, H., Cheung, K. T. K., El-Hajjar, M., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2650979 · Cited by 627
Metadata
- Authors
- Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2007-07
- Volume
- 6
- Issue
- 7
- Pages
- 2640-2651
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2112820013
- Cited by
- 886
- References
- 20
- FWCI
- 43.16
- Type
- journal article
- Language
- en
- Open access
- closed
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.