To overlap or not to overlap: Enabling channel bonding in high-density WLANs

Barrachina‐Muñoz, Sergio; Wilhelmi, Francesc; Bellalta, Boris

doi:10.1016/j.comnet.2019.01.018

Cited by 39 publications

(33 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their model takes into account channel bonding and it handles unsaturated networks with collisions, however the model is limited to fully-connected WLANs. Barrachina-Muñoz et al developed Markovian models for predicting throughput in saturated [5] and unsaturated [27] WLANs using different Dynamic Channel Bonding (DCB) policies in dense networks. They find that the DCB policy has a high impact on the networks performance and that inter-node dependencies are important even outside carrier sensing zones.…”

Section: Channel Bondingmentioning

confidence: 99%

A Markov model for performance evaluation of channel bonding in IEEE 802.11

2021

View full text Add to dashboard Cite

The ever-growing popularity of Wireless Local Area Networks (WLANs) in home, public, and work environments is fuelling the need for WLANs that can accommodate more stations, each with higher throughput. This typically results in WLANs containing a larger number of heterogeneous devices, making the prediction of the network's behavior and its efficient configuration an even more elaborate problem. In this paper, we propose a Markovian model that predicts the throughput achieved by each Access Point (AP) of the WLAN as a function of the network's topology and the AP's throughput demands. By means of simulation, we show that our model achieves mean relative errors of around 10% for networks of different sizes and with diverse node configurations. The model is adapted to the specification of IEEE 802.11 standards that implement channel bonding, namely 802.11n/ac/ax, and as such it can be used to provide insight into issues of channel assignment when using channel bonding. We derive guidelines on the best practice in static channel bonding given a performance metric and for different node characteristics such as the Modulation and Coding Scheme (MCS) indexes, frame aggregation rates, saturation levels, and network topologies. We then put our findings to the test by identifying the optimal channel bonding combination in an 802.11ac WLAN containing nodes with diverse characteristics. We conclude that the optimal solution is highly dependent on the particular network configuration. However, we find that, in general, larger channels are better suited for throughput maximization and smaller (and separate) channels render higher fairness.

show abstract

Section: Channel Bondingmentioning

confidence: 99%

A Markov model for performance evaluation of channel bonding in IEEE 802.11

2021

View full text Add to dashboard Cite

show abstract

“…In [2], authors show that CB can provide significant performance gains even in high-density scenarios, though it may also cause unfairness. Non-saturation regimes are considered in [13], [14], where authors propose an analytical model for the throughput performance of CB in 11ac/11ax WLANs under both saturated and nonsaturated traffic loads. An analytical framework to study the performance of opportunistic CB where 11ac users coexist with legacy users is presented in [15].…”

Section: Related Workmentioning

confidence: 99%

“…The analysis of CSMA/CA networks through CTMN models was firstly introduced in [23]. Such models were later applied to IEEE 802.11 networks in [2], [4], [6], [13], [14], [19], [24], [25], among others. Experimental results in [26], [27] demonstrate that CTMN models, while idealized, provide remarkably accurate throughput estimates for actual IEEE 802.11 systems.…”

Section: The Ctmn Model For Wlansmentioning

confidence: 99%

Dynamic Channel Bonding in Spatially Distributed High-Density WLANs

Barrachina‐Muñoz

Wilhelmi

Bellalta

2020

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

In this paper, we discuss the effects on throughput and fairness of dynamic channel bonding (DCB) in spatially distributed high-density wireless local area networks (WLANs). First, we present an analytical framework based on continuous-time Markov networks (CTMNs) for depicting the behavior of different DCB policies in spatially distributed scenarios, where nodes are not required to be within the carrier sense range of each other. Then, we assess the performance of DCB in high-density IEEE 802.11ac/ax WLANs by means of simulations. We show that there may be critical interrelations among nodes in the spatial domain -even if they are located outside the carrier sense range of each other -in a chain reaction manner. Results also reveal that, while always selecting the widest available channel normally maximizes the individual long-term throughput, it often generates unfair situations where other WLANs starve. Moreover, we show that there are scenarios where DCB with stochastic channel width selection improves the latter approach both in terms of individual throughput and fairness. It follows that there is not a unique optimal DCB policy for every case. Instead, smarter bandwidth adaptation is required in the challenging scenarios of next-generation WLANs.

show abstract

“…That is, WLANs are only allowed to decrement their backoff and start transmissions when the CCA condition is accomplished. In (Barrachina-Muñoz et al, 2018a), authors use SFCTMN to assess the performance of high density WLANs under different traffic loads.…”

Section: Csma/ca Throughput Modelmentioning

confidence: 99%

Potential and pitfalls of Multi-Armed Bandits for decentralized Spatial Reuse in WLANs

Wilhelmi

Barrachina‐Muñoz

Bellalta

et al. 2019

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

Spatial Reuse (SR) has recently gained attention to maximize the performance of IEEE 802.11 Wireless Local Area Networks (WLANs). Decentralized mechanisms are expected to be key in the development of SR solutions for next-generation WLANs, since many deployments are characterized by being uncoordinated by nature. However, the potential of decentralized mechanisms is limited by the significant lack of knowledge with respect to the overall wireless environment. To shed some light on this subject, we show the main considerations and possibilities of applying online learning to address the SR problem in uncoordinated WLANs. In particular, we provide a solution based on Multi-Armed Bandits (MABs) whereby independent WLANs dynamically adjust their frequency channel, transmit power and sensitivity threshold. To that purpose, we provide two different strategies, which refer to selfish and environment-aware learning. While the former stands for pure individual behavior, the second one considers the performance experienced by surrounding networks, thus taking into account the impact of individual actions on the environment. Through these two strategies we delve into practical issues of applying MABs in wireless networks, such as convergence guarantees or adversarial effects. Our simulation results illustrate the potential of the proposed solutions for enabling SR in future WLANs. We show that substantial improvements on network performance can be achieved regarding throughput and fairness.

show abstract

To overlap or not to overlap: Enabling channel bonding in high-density WLANs

Cited by 39 publications

References 15 publications

A Markov model for performance evaluation of channel bonding in IEEE 802.11

A Markov model for performance evaluation of channel bonding in IEEE 802.11

Dynamic Channel Bonding in Spatially Distributed High-Density WLANs

Potential and pitfalls of Multi-Armed Bandits for decentralized Spatial Reuse in WLANs

Contact Info

Product

Resources

About