The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Open accessAbstract
The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time, is addressed in this paper. It is shown that a simple distributed scheduling strategy, maximal scheduling, attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. The guaranteed fraction depends on the ldquointerference degreerdquo of the network, which is the maximum number of transmitter-receiver pairs that interfere with any given transmitter-receiver pair in the network and do not interfere with each other. Depending on the nature of communication, the transmission powers and the propagation models, the guaranteed fraction can be lower-bounded by the maximum link degrees in the underlying topology, or even by constants that are independent of the topology. The guarantees are tight in that they cannot be improved any further with maximal scheduling. The results can be generalized to end-to-end multihop sessions. Finally, enhancements to maximal scheduling that can guarantee fairness of rate allocation among different sessions, are discussed.
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
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Distributed Computing: A Locality-Sensitive Approach
Peleg, D. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719772 · Cited by 1,487
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
Bertsekas, D. P., & Gallager, R. G. (1992) · Prentice-Hall, Inc eBooks · Cited by 852
The throughput of data switches with and without speedup
Dai, J. G., & Prabhakar, B. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832229 · Cited by 469
Matching output queueing with a combined input/output-queued switch
Chuang, S.-T., Goel, A., McKeown, N., & Prabhakar, B. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.772430 · Cited by 390
Alicherry, M., Bhatia, R., & Li, L. E. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.881641 · Cited by 384
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
A 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
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
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
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
Metadata
- Authors
- Chaporkar, P., Kar, K., Luo, X., & Sarkar, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-02
- Volume
- 54
- Issue
- 2
- Pages
- 572-594
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2116071440
- Cited by
- 253
- References
- 8
- FWCI
- 31.38
- 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.