The DOI matches its Crossref record.
QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks
Abstract
For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput and minimize delay. The distinguishing characteristics of these resource allocation formulations is that, by using convex optimization, they accommodate a variety of realistic QoS and fairness constraints. Their globally optimal solutions can be computed efficiently through polynomial time interior point methods, even though they use nonlinear objectives and constraints. Through power control in wireless cellular networks, we optimize SIR and delay for a particular QoS class, subject to QoS constraints for all other QoS classes. For wireless ad hoc networks with multihop transmissions and Rayleigh fading, we optimize various objectives, such as the overall system throughput, subject to constraints on power, probability of outage, and data rates. These formulations can also be used for admission control and relative pricing. Both proportional and minmax fairness can be implemented under the convex optimization framework, where fairness parameters can be jointly optimized with QoS criteria. Simple heuristics are also shown and tested using the convex optimization tools.
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
Cited by
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
Self-citationPower Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
Self-citationChiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Self-citationDynamic power allocation and routing for time-varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837349 · Cited by 596
Dynamic Spectrum Access with QoS and Interference Temperature Constraints
Xing, Y., Mathur, C. N., Haleem, M. A., Chandramouli, R., & Subbalakshmi, K. P. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.50 · Cited by 461
Fairness and Optimal Stochastic Control for Heterogeneous Networks
Neely, M. J., Modiano, E., & Li, C.-P. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.900405 · Cited by 433
Geometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
Self-citationCoordinated Scheduling and Power Allocation in Downlink Multicell OFDMA Networks
Venturino, L., Prasad, N., & Wang, X. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2013233 · Cited by 305
Edge Computing Aware NOMA for 5G Networks
Kiani, A., & Ansari, N. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2796542 · Cited by 299
(2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347 · Cited by 259
Distributed Non-Autonomous Power Control through Distributed Convex Optimization
Ram, S. S., Veeravalli, V. V., & Nedic, A. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062275 · Cited by 99
Understanding Human-Machine Networks: A Cross-Disciplinary Survey
Tsvetkova, M., Yasseri, T., Meyer, E. T., Pickering, J. B., Engen, V., Walland, P., Lüders, M., Følstad, A., & Bravos, G. (2018) · ACM Computing Surveys · doi:10.1145/3039868 · Cited by 67
Metadata
- Authors
- Julian, D., Chiang, M., O'Neill, D., & Boyd, S.
- Venue
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 477-486
- OpenAlex
- W2158579229
- Cited by
- 220
- References
- 0
- FWCI
- 25.12
- Type
- conference paper
- 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.