CoChat
Sign Up
Cited by 333Wireless Networks and ProtocolsAdvanced Wireless Network OptimizationMobile Ad Hoc Networks

The DOI matches its Crossref record.

Fairness and load balancing in wireless LANs using association control

Bejerano, Yigal, Han, Seung-Jae, Li, Li (Erran)·2004·Proceedings of the 10th annual international conference on Mobile computing and networking
DOI 10.1145/1023720.1023751
Open this paper in CoChat — free account

Abstract

Recent studies on operational wireless LANs (WLANs) have shown that user load is often unevenly distributed among wireless access points (APs). This unbalanced load results in unfair bandwidth allocation among users. We observe that the unbalanced load and unfair bandwidth allocation can be greatly alleviated by intelligently associating users to APs, termed association control, rather than having users greedily associate APs of best received signal strength.In this study, we present an efficient algorithmic solution to determine the user-AP associations that ensure max-min fair bandwidth allocation. We provide a rigorous formulation of the association control problem that considers bandwidth constraints of both the wireless and backhaul links. Our formulation indicates the strong correlation between fairness and load balancing, which enables us to use load balancing techniques for obtaining near optimal max-min fair bandwidth allocation. Since this problem is NP-hard, we present algorithms that achieve a constant-factor approximate max-min fair bandwidth allocation. First, we calculate a fractional load balancing solution, where users can be associated with multiple APs simultaneously. This solution guarantees the fairest bandwidth allocation in terms of max-min fairness. Then, by utilizing a rounding method we obtain an efficient integral association. In particular, we provide a 2-approximation algorithm for unweighted greedy users and a 3-approximation algorithm for weight…

Overview

Integrity signals

Registry

Crossref · 10.1145/1023720.1023751

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 28

  1. 10.1145/511334.511359 · DOI
  2. 10.1145/570645.570659 · DOI
  3. 10.1145/1066116.1066127 · DOI
  4. I. Papanikos and M. Logothetis . A study on dynamic load balance for IEEE 802.11b wireless LAN . In Proc. COMCON , 2001 . I. Papanikos and M. Logothetis. A study on dynamic load balance for IEEE 802.11b wireless LAN. In Proc. COMCON, 2001.
  5. 10.1145/510726.510733 · DOI
  6. T-C. Tsai and C-F. Lien . IEEE 802. 11 hot spot load balance and QoS-maintained seamless roaming . In Proc. National Computer Symposium (NCS) , 2003 . T-C. Tsai and C-F. Lien. IEEE 802.11 hot spot load balance and QoS-maintained seamless roaming. In Proc. National Computer Symposium (NCS), 2003.
  7. Proxim Wireless Networks . ORINOCO AP-600 data sheet , 2004 . Proxim Wireless Networks. ORINOCO AP-600 data sheet, 2004.
  8. Cisco Systems Inc. Data sheet for cisco aironet 1200 series , 2004 . Cisco Systems Inc. Data sheet for cisco aironet 1200 series, 2004.
  9. 10.1109/COMST.2000.5340800 · DOI
  10. S. Das , H. Viswanathan , and G. Rittenhouse . Dynamic load balancing through coordinated scheduling in packet data systems . In Proc. IEEE INFOCOM , 2003 . S. Das, H. Viswanathan, and G. Rittenhouse. Dynamic load balancing through coordinated scheduling in packet data systems. In Proc. IEEE INFOCOM, 2003.
  11. 10.1109/TCOM.1986.1096544 · DOI
  12. 10.1109/25.554736 · DOI
  13. 10.1109/25.669085 · DOI
  14. 10.1145/381591.381608 · DOI
  15. 10.1109/TCOM.1981.1095081 · DOI
  16. 10.1145/237814.237837 · DOI
  17. Dimitri P. Bertsekas and Robert Gallager. Data Networks ( 2 nd Edition). Prentice Hall , 1991 . Dimitri P. Bertsekas and Robert Gallager. Data Networks (2nd Edition). Prentice Hall, 1991.
  18. 10.1007/BF01585506 · DOI
  19. 10.5555/795665.796474 · DOI
  20. 10.1007/BF01585745 · DOI
  21. 10.1145/167088.167248 · DOI
  22. A. Goel , A. Meyerson , and S. Plotkin . Approximate majorization and fair online load balancing . In Proc. SODA , pages 384 -- 390 . Society for Industrial and Applied Mathematics , 2001 . A. Goel, A. Meyerson, and S. Plotkin. Approximate majorization and fair online load balancing. In Proc. SODA, pages 384--390. Society for Industrial and Applied Mathematics, 2001.
  23. 10.1145/288235.288239 · DOI
  24. 10.1145/288235.288242 · DOI
  25. 10.1109/INFCOM.2003.1208701 · DOI
  26. 10.1007/BF01585178 · DOI
  27. V. Vazirani . Approximation Algorithms . Springer-Verlag New York, Inc orporated, 1999 . V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Incorporated, 1999.
  28. L. Lovazs and M. D. Plummer . Matching Theory . North Holland - Amsterdam , 1986 . L. Lovazs and M. D. Plummer. Matching Theory. North Holland - Amsterdam, 1986.

Cited by

Sorted by citations

See all 333

Metadata

Authors
Bejerano, Y., Han, S.-J., & Li, L. (.
Affiliations
Bell Laboratories, Lucent Technologies, Murray Hill, NJ
ORCID
Venue
Proceedings of the 10th annual international conference on Mobile computing and networking
Publisher
ACM
Published
2004-09-26
Pages
315-329
ISSN
1543-5679 (ISSN-L)
DOI
10.1145/1023720.1023751
OpenAlex
W1980776940
Cited by
333
References
0
Citations by year
2026: 1 · 2025: 3 · 2024: 2 · 2023: 2 · 2022: 5 · 2021: 5 · 2020: 5 · 2019: 11 · 2018: 13 · 2017: 16 · 2016: 10 · 2015: 20 · 2014: 28 · 2013: 22 · 2012: 25
FWCI
10.44
Type
conference paper
Language
en
Open access
closed
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)
Locations
ACM Annual International Conference on Mobile Computing and Networking (MobiCom) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
Keywords
wireless LAN, load balancing, max-min fairness, bandwidth allocation, approximation algorithms, rounding, NP-hardness

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fairness and load balancing in wireless LANs using association control. https://app.cochat.ai/papers/10.1145/1023720.1023751
The paper
Bejerano, Y., Han, S.-J., & Li, L. (. (2004). Fairness and load balancing in wireless LANs using association control. Proceedings of the 10th annual international conference on Mobile computing and networking. https://doi.org/10.1145/1023720.1023751