Stability and Fairness of AP Selection Games in IEEE 802.11 Access Networks

Yen, Li-Hsing; Li, Jiajun; Lin, Che-Ming

doi:10.1109/tvt.2010.2104167

Cited by 47 publications

(19 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, a specific example is provided to demonstrate the throughput loss caused by performance anomaly. Consider a WLAN with 2 APs (AP1 and AP2) and 4 STAs, enumerated from 1 to 4, as depicted in Figure 1 [19]. STA1 and STA2 experience a bit rate of 11 Mbps from AP1, while STA4 also experiences a bit rate of 11 Mbps from AP2.…”

Section: Motivationmentioning

confidence: 99%

“…However, if it chooses AP2, it will have a bit rate of 1 Mbps, and when all STAs associating with AP2 have different bit rates, AP2 will suffer performance anomaly. The analysis from the experimental data in Table 1 demonstrates the performance anomaly that is a main factor to degrade system throughput [19].…”

Section: Motivationmentioning

confidence: 99%

“…Therefore, the bandwidth allocation scheme needs to be considered to eliminate the performance anomaly problem, preventing low rate clients from dominating the channel. Scenario illustrating performance anomaly [19]. Figure 1.…”

Section: Motivationmentioning

confidence: 99%

See 2 more Smart Citations

Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs

2018

View full text Add to dashboard Cite

Regarding access point (AP) overload and performance anomaly which is caused by mobile terminals with different bitrates, a joint AP association and bandwidth allocation optimization algorithm is presented in this paper. Meanwhile, load balancing and proportional fairness are analyzed and formulated as an optimization model. Then, we present a Fair Bandwidth Allocation algorithm based on clients' Business Priority (FBA-BP), which allocates bandwidth based on the bandwidth demand of clients and their business priority. Furthermore, we propose a Categorized AP Association algorithm based on clients' demands (CAA-BD), which classifies APs by different types of clients and chooses an optimal associating AP for a new client according to AP categories and the aggregated demand transmission time that are calculated by the FBA-BP algorithm. The CAA-BD can achieve load balance and solve the performance anomaly caused by multi-rate clients coexisting. The simulation results show that our proposed algorithm obtains significant performance in terms of AP utilization, throughput, transmission delay and channel fairness in different client density levels compared with the categorized and Strong Signal First (SSF) algorithms.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs

2018

View full text Add to dashboard Cite

show abstract

“…The cost function that each user aims at minimizing depends on the AP load and the distance the associating device needs to travel to be able to associate to the desired AP. Wi-Fi association is addressed through game-theoretic tools also in [26]- [28]. Those works consider noncooperative game models with the users trying to selfishly minimize a cost function that depends on the current congestion of the Wi-Fi access points.…”

Section: Related Workmentioning

confidence: 99%

A Framework for Dynamic Network Architecture and Topology Optimization

Shafigh

Lorenzo

Glisic

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-A new paradigm in wireless network access is presented and analyzed. In this concept, certain classes of wireless terminals can be turned temporarily into an access point (AP) anytime while connected to the Internet. This creates a dynamic network architecture (DNA) since the number and location of these APs vary in time. In this paper, we present a framework to optimize different aspects of this architecture. First, the dynamic AP association problem is addressed with the aim to optimize the network by choosing the most convenient APs to provide the quality-of-service (QoS) levels demanded by the users with the minimum cost. Then, an economic model is developed to compensate the users for serving as APs and, thus, augmenting the network resources. The users' security investment is also taken into account in the AP selection. A preclustering process of the DNA is proposed to keep the optimization process feasible in a high dense network. To dynamically reconfigure the optimum topology and adjust it to the traffic variations, a new specific encoding of genetic algorithm (GA) is presented. Numerical results show that GA can provide the optimum topology up to two orders of magnitude faster than exhaustive search for network clusters, and the improvement significantly increases with the cluster size.

show abstract

“…WiFi association is addressed through game theoretic tools also in [25], [26], and [27]. All the three works consider noncooperative game models with the users trying to selfishly minimize a cost function that depends on the current congestion of the WiFi access points.…”

Section: Introductionmentioning

confidence: 99%

Network Selection and Resource Allocation Games for Wireless Access Networks

Malanchini

Cesana

Gatti

2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Wireless access networks are often characterized by the interaction of different end users, communication technologies, and network operators. This paper analyzes the dynamics among these "actors" by focusing on the processes of wireless network selection, where end users may choose among multiple available access networks to get connectivity, and resource allocation, where network operators may set their radio resources to provide connectivity. The interaction among end users is modeled as a noncooperative congestion game, where players (end users) selfishly select the access network that minimizes their perceived selection cost. A method based on mathematical programming is proposed to find Nash equilibria and characterize their optimality under three cost functions, which are representative of different technological scenarios. System level simulations are then used to evaluate the actual throughput and fairness of the equilibrium points. The interaction among end users and network operators is then assessed through a two-stage multileader/multifollower game, where network operators (leaders) play in the first stage by properly setting the radio resources to maximize their users, and end users (followers) play in the second stage the aforementioned network selection game. The existence of exact and approximated subgame perfect Nash equilibria of the two-stage game is thoroughly assessed and numerical results are provided on the "quality" of such equilibria.

show abstract

Stability and Fairness of AP Selection Games in IEEE 802.11 Access Networks

Cited by 47 publications

References 16 publications

Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs

Joint AP Association and Bandwidth Allocation Optimization Algorithm in High-Dense WLANs

A Framework for Dynamic Network Architecture and Topology Optimization

Network Selection and Resource Allocation Games for Wireless Access Networks

Contact Info

Product

Resources

About