scispace - formally typeset
Journal ArticleDOI

On-Line AP Association Algorithms for 802.11n WLANs with Heterogeneous Clients

Dawei Gong, +1 more
- 01 Nov 2014 - 
- Vol. 63, Iss: 11, pp 2772-2786
TLDR
This paper presents a bi-dimensional Markov model to estimate the uplink and downlink throughput of clients and formulate AP association into an optimization problem, aiming at providing each client a bandwidth proportional to its usable data rate, and proposes an on-line AP association algorithm under the condition that each client can acquire timely information of all clients associated with nearby APs.
Abstract
As the latest amendment of IEEE 802.11 standard, 802.11n allows a maximum raw data rate as high as 600 Mbps, making it a desirable candidate for wireless local area network (WLAN) deployment. In typical deployment, the coverage areas of nearby access points (APs) usually overlap with each other to provide satisfactory coverage and seamless mobility support. Clients tend to associate (connect) to the AP with the strongest signal strength, which may lead to poor client throughput and overloaded APs. Although a number of AP association schemes have been proposed for IEEE 802.11 WLANs in the literature, the challenges brought by the new features in 802.11n have not been thoroughly studied nor the impact of legacy 802.11a/b/g clients in 802.11n WLANS on AP association. To fill in this gap, in this paper, we explore AP association for 802.11n with heterogeneous clients (802.11a/b/g/n). We first present a bi-dimensional Markov model to estimate the uplink and downlink throughput of clients and formulate AP association into an optimization problem, aiming at providing each client a bandwidth proportional to its usable data rate. Based on this Markov model, we propose an on-line AP association algorithm under the condition that each client can acquire timely information of all clients associated with nearby APs. Furthermore, for WLANs with densely deployed APs, we provide another on-line AP association algorithm with lower complexity, which takes full advantage of 802.11n transmissions by simply associating different types of clients with different APs. We have conducted extensive simulations and experiments to validate the proposed algorithms. The results show that our algorithms can significantly improve both 802.11n throughput and aggregated network throughput under various network scenarios, compared to previous AP association schemes. Our experiments also confirm the effectiveness of the algorithms in enhancing network throughput, maintaining proportional fairness among clients, and balancing load among APs.

read more

Citations
More filters
Journal ArticleDOI

LeaD : Large-Scale Edge Cache Deployment Based on Spatio-Temporal WiFi Traffic Statistics

TL;DR: This paper explores the cache deployment in a large-scale WiFi system, which contains 8,000 APs and serves more than 40,000 active users, to maximize the long-term caching gain, and proposes a cache deployment strategy, named LeaD, which is able to achieve the near-optimal caching performance and can outperform other benchmark strategies significantly.
Journal ArticleDOI

A Review of Software-Defined WLANs: Architectures and Central Control Mechanisms

TL;DR: In this article, the authors present an overview of SDWLAN architectures and provide a qualitative comparison in terms of features such as programmability and virtualization, and classify and investigate the two important classes of centralized network control mechanisms: 1) association control and 2) channel assignment.
Journal ArticleDOI

QoS-Driven Efficient Client Association in High-Density Software-Defined WLAN

TL;DR: This paper forms the client association in a high-density scenario as an optimization problem aiming to minimize the interpacket delay of individual flows, based on an unsaturated and heterogeneous Markovian analytical model, and interprets the optimization problem as an NP-hard supermodular set function minimization problem, which is solved by two low-complexity heuristic methods.
Proceedings ArticleDOI

Dynamic access point association using Software Defined Networking

TL;DR: This paper proposes a dynamic AP selection algorithm/framework in wireless user device that receive network resource related statistics from SDN Controller and guide the client device to associate itself with the best selected AP.
Journal ArticleDOI

Concurrent decentralized channel allocation and access point selection using multi-armed bandits in multi BSS WLANs

TL;DR: In this paper, the authors proposed an adaptive channel allocation and AP selection in enterprise WLANs using reinforcement learning techniques, where the Thompson sampling algorithm is used to explore and learn which channel to use and which AP to associate, respectively.
References
More filters
Proceedings ArticleDOI

Performance anomaly of 802.11b

TL;DR: In this paper, the performance of the IEEE 802.11b wireless local area networks is analyzed theoretically by deriving simple expressions for the useful throughput, validate them by means of simulation, and compare with several performance measurements.
Proceedings ArticleDOI

Characterizing mobility and network usage in a corporate wireless local-area network

TL;DR: This paper studies user mobility patterns and introduces new metrics to model user mobility and finds that average user transfer-rates follow a power law, and models user mobility with persistence and prevalence find that the probability distributions of both measures follow power laws.
Proceedings ArticleDOI

Fairness and load balancing in wireless LANs using association control

TL;DR: This paper presents an efficient solution to determine the user-AP associations for max-min fair bandwidth allocation, and shows the strong correlation between fairness and load balancing, which enables them to use load balancing techniques for obtaining optimal maximum-minFair bandwidth allocation.
Proceedings ArticleDOI

CARA: Collision-Aware Rate Adaptation for IEEE 802.11 WLANs

TL;DR: This paper proposes a novel rate-adaptation scheme, called CARA (Collision-Aware Rate Adaptation), which combines adaptively the Request-to-Send/Clear- to-Send (RTS/CTS) exchange with the Clear Channel Assessment (CCA) functionality to differentiate frame collisions from frame transmission failures caused by channel errors.
Proceedings ArticleDOI

Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks

TL;DR: Two fully distributed algorithms that allow multiple interfering 802.11 access points to select their operating frequency in order to minimize interference, and users to choose the access point they attach to, are proposed to lead to optimal bandwidth sharing.
Related Papers (5)