The DOI matches its OpenAlex record; 5 of the 5 references it cites were found in a registry or an index.
On max-min fairness and scheduling in wireless ad-hoc networks
Abstract
This paper addresses the problem of fairness in wireless ad-hoc networks. Usually, the problem of fairness in wireless ad-hoc networks is addressed in a classic approach inherited from wired networks. The common assumption is that nodes/flows have pre-assigned fair shares. The task becomes then to modify wired networks' fair queueing algorithms to address wireless network nature. Wired networks have efficient means of allocating fiar shares through admission control and additionally, the fair shares remain constant throughout the session duration due to the static nature of the nodes. In ad-hoc networks, it is meaningless to assume statically pre-assigned fair shares, since on one hand, not only the nodes move, but also the routers are mobile, and on the other hand, contention is location dependent, such that in terms of absolute guarantees, fairness would at most mean "avoiding starvation": thus applying rate proportional fiar queueing algorithms is beyond the original goal of such algorithm, viz. flow isolation/protection and bandwidth guarantee. In this work we argue in favor of multi-level scheduling for wireless ad-hoc networks with max-min fair allocation of the fair shares at the lower-most layer (MAC layer). This paper, mainly lays down the theoretical framework by which one can calculate the fair shares that would achieve max-min fairness in an ad-hoc network. We design distributed algorithms that allow each node to determine its max-min per-link fair share in a global ad-hoc network without knowledge of the global topology of the network. The results are then used in conjunction with a novel practical scheduling algorithm for IEEE 802.11 to show how fairness is achieved
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
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Bharghavan, V., Demers, A. J., Shenker, S. J., & Zhang, L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190334 · Cited by 1,771
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399
Achieving fairness in IEEE 802.11 DFWMAC with variable packet lengths
Wang, Y., & Bensaou, B. (2002) · Globecom · doi:10.1109/glocom.2001.966350 · Cited by 72
Self-citation
Cited by
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
End-to-end performance and fairness in multihop wireless backhaul networks
Gambiroza, V., Sadeghi, B., & Knightly, E. W. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023749 · Cited by 386
A Unified Framework for Max-Min and Min-Max Fairness With Applications
Radunovic, B., & Le Boudec, J.-Y. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.896231 · Cited by 345
Metadata
- Authors
- Huang, X. L., & Bensaou, B.
- Venue
- ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
- Published
- 2001-01-01
- OpenAlex
- W2032824989
- Cited by
- 276
- References
- 5
- FWCI
- 5.91
- 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.