The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Abstract
In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Performance analysis of the IEEE 802.11 distributed coordination function
Bianchi, G. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.840210 · Cited by 8,651
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Reversibility and Stochastic Networks
Cohen, J. E., & Kelly, F. P. (1981) · Technometrics · doi:10.1080/00401706.1981.10486278 · Cited by 2,212
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Achieving 100% throughput in an input-queued switch
McKeown, N., Mekkittikul, A., Anantharam, V., & Walrand, J. (1999) · IEEE Transactions on Communications · doi:10.1109/26.780463 · Cited by 838
Self-citationA tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Reversibility and stochastic networks
Kingmán, J. F. C. (1980) · European Journal of Operational Research · doi:10.1016/0377-2217(80)90150-2 · Cited by 547
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
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913537 · Cited by 253
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
Jiang, L., & Walrand, J. (2008) · 2008 46th Annual Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797741 · Cited by 162
Self-citationThe Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
Zhang, J., Dong, Z., & Chiang, M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913572 · Cited by 73
DiffQ: Differential Backlog Congestion Control for Wireless Multi-hop Networks
Warrier, A. C., Ha, S., Wason, P., Injong Rhee, Y., & Kim, J. H. (2008) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2008.78 · Cited by 16
Cited by
Stochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Blockchain Meets Edge Computing: A Distributed and Trusted Authentication System
Guo, S., Hu, X., Guo, S., Qiu, X., & Qi, F. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938001 · Cited by 319
Metadata
- Authors
- Jiang, L., & Walrand, J.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2010-06
- Volume
- 18
- Issue
- 3
- Pages
- 960-972
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2097058227
- Cited by
- 635
- References
- 17
- FWCI
- 95.82
- 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.