The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A tutorial on cross-layer optimization in wireless networks
Abstract
This tutorial paper overviews recent developments in optimization-based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channel-aware) scheduling for cellular (single-hop) networks, where easily implementable myopic policies are shown to optimize system performance. We then describe key lessons learned and the main obstacles in extending the work to general resource allocation problems for multihop wireless networks. Towards this end, we show that a clean-slate optimization-based approach to the multihop resource allocation problem naturally results in a "loosely coupled" cross-layer solution. That is, the algorithms obtained map to different layers [transport, network, and medium access control/physical (MAC/PHY)] of the protocol stack, and are coupled through a limited amount of information being passed back and forth. It turns out that the optimal scheduling component at the MAC layer is very complex, and thus needs simpler (potentially imperfect) distributed solutions. We demonstrate how to use imperfect scheduling in the cross-layer framework and describe recently developed distributed algorithms along these lines. We conclude by describing a set of open research problems.
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Information capacity and power control in single-cell multiuser communications
Knopp, R., & Humblet, P. A. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.525188 · Cited by 2,059
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system
Jalali, A., Padovani, R., & Pankaj, R. K. (2002) · IEEE Vehicular Technology Conference (VTC) · doi:10.1109/vetecs.2000.851593 · Cited by 1,421
Providing quality of service over a shared wireless link
Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P., & Vijayakumar, R. (2001) · IEEE Communications Magazine · doi:10.1109/35.900644 · Cited by 1,197
Cited by
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
Layering 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
Optimal energy management policies for energy harvesting sensor nodes
Sharma, V., Mukherji, U., Joseph, V., & Gupta, S. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.04.080749 · Cited by 644
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Jiang, L., & Walrand, J. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2035046 · Cited by 635
Stability of primal–dual gradient dynamics and applications to network optimization
Feijer, D., & Paganini, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.08.011 · Cited by 349
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Self-citationA˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
Du, H., Zhang, R., Liu, Y., Wang, J., Lin, Y., Li, Z., Niyato, D., Kang, J., Xiong, Z., Cui, S., et al. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3400011 · Cited by 254
Metadata
- Authors
- Lin, X., Shroff, N. B., & Srikant, R.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-08
- Volume
- 24
- Issue
- 8
- Pages
- 1452-1463
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2123893388
- Cited by
- 833
- References
- 33
- FWCI
- 69.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.