A Channel Allocation Algorithm for Reducing the Channel Sensing/Reserving Asymmetry in 802.11ac Networks

Jang, Seowoo; Bahk, Saewoong

doi:10.1109/tmc.2014.2328580

Cited by 23 publications

(12 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large set of papers use a conflict graph to provision Wi-Fi networks or to estimate the Wi-Fi network performance. In most of these studies, the authors assume that the conflict graph is known and do not explain how to build this conflict graph (like for instance in [10]). Few papers are dedicated to the computation of the conflict graph.…”

Section: State-of-the-artmentioning

confidence: 99%

A Passive Method to Infer the Weighted Conflict Graph of an IEEE 802.11 Network

Abdewedoud

Busson

Lassous

et al. 2019

Ad-Hoc, Mobile, and Wireless Networks

View full text Add to dashboard Cite

Wi-Fi networks often consist of several Access Points (APs) to form an Extended Service Set. These APs may interfere with each other as soon as they use the same channel or overlapping channels. A classical model to describe interference is the conflict graph. As the interference level varies in the network and in time, we consider a weighted conflict graph. In this paper, we propose a method to infer the weights of the conflict graph of a Wi-Fi network. Weights represent the proportion of activity from a neighbor detected by the Clear Channel Assessment mechanism. Our method relies on a theoretical model based on Markov networks applied to a decomposition of the original conflict graph. The input of our solution is the activity measured at each AP, measurements available in practice. The proposed method is validated through ns-3 simulations performed for different scenarios. Results show that our solution is able to accurately estimate the weights of the conflict graph.

show abstract

Section: State-of-the-artmentioning

confidence: 99%

A Passive Method to Infer the Weighted Conflict Graph of an IEEE 802.11 Network

Abdewedoud

Busson

Lassous

et al. 2019

Ad-Hoc, Mobile, and Wireless Networks

View full text Add to dashboard Cite

show abstract

“…There are also some investigations on the channel allocation schemes in SCB networks. For example, [19] analyzed the hidden terminal problem and proposed a channel allocation algorithm considering the primary channel selection with a given channel width in SCB networks. Moreover, ref.…”

Section: B Channel Allocation Algorithms In Wlansmentioning

confidence: 99%

To Bond or Not to Bond: An Optimal Channel Allocation Algorithm for Flexible Dynamic Channel Bonding in WLANs

Kai

Liang

Huang

et al. 2017

2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)

View full text Add to dashboard Cite

IEEE 802.11 has evolved from 802.11a/b/g/n to 802.11ac to meet rapidly increasing data rate requirements in WLANs. One important technique adopted in 802.11ac is the channel bonding (CB) scheme that combines multiple 20MHz channels for a single transmission in 5GHz band. In order to effectively access channel after a series of contention operations, 802.11ac specifies two different CB operations: Dynamic Channel Bonding (DCB) and Static Channel Bonding (SCB). This paper proposes an optimal channel allocation algorithm to achieve maximal throughputs in DCB WLANs. Specifically, we first adopt a continuous-time Markov Chain (CTMC) model to analyze the equilibrium throughputs. Based on the throughput analysis, we then construct an integer nonlinear programming (INLP) model with the target of maximizing system throughput. By solving the INLP model, we then propose an optimal channel allocation algorithm based on the Branch-and-Bound Method (BBM). It turns out that the maximal throughput performance can be achieved under the channel allocation scheme with the least overlapped channels among WLANs. Simulations show that the proposed algorithm can achieve the maximal system throughput under various network settings. We believe that our analysis on the optimal channel allocation schemes brings new insights into the design and optimization of future WLANs, especially for those adopting channel bonding technique.

show abstract

“…As the distance increases beyond 10 m, 802.11ac AP becomes unable to detect the signals from 802.11n gradually. Therefore, 802.11ac AP aggressively attempts to access the wireless medium even though 802.11n AP is transmitting a packet, which results in collision errors [7,10]. This phenomenon is getting worse until the distance reaches to 19 m. If the distance becomes larger than 19 m, 802.11n AP also cannot detect the signals from 802.11ac.…”

Section: Problem Statementmentioning

confidence: 99%

“…The study in [8] shows measurement results of wide bandwidth operation in an indoor environment, and the work in [9] focuses on the impact of wide bandwidth operation on both energy efficiency and secondary hidden interferences using 802.11ac testbed. Additionally, Jang et al have proposed a channel allocation algorithm including the primary channel selection in 802.11ac environments for a given wider bandwidth [10]. This work also addresses hidden channel problem due to the difference of CCA sensitivity level and the difference of per-20 MHz spectral densities.…”

Section: Introductionmentioning

confidence: 99%

Enhancement of wide bandwidth operation in IEEE 802.11ac networks

Byeon

Yang

Lee

et al. 2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

IEEE 802.11 has evolved from 802.11a/b/g/n to 802.11ac in order to meet ever-increasing high throughput demand. The newest standard supports various channel widths up to 160 MHz by bonding multiple 20 MHz channels. In order to efficiently utilize multiple channel widths, 802.11ac defines two operations, namely, dynamic channel access (DCA) and dynamic bandwidth operation (DBO). In this paper, we reveal that the use of DCA improves channel utilization significantly, and DBO not only partly overcomes secondary channel hidden interference problems but also achieves better channel utilization. However, when a transmitter attempts to send an enhanced RTS frame before data transmission as part of DBO, the station has no way to know how much bandwidth will be used, thus leading to malfunction of virtual carrier sensing at neighboring stations. On the other hand, the use of enhanced RTS/CTS without hidden traffic wastes airtime significantly. To address these problems, we first define how to calculate an appropriate value of duration field for enhanced RTS/CTS, and then develop an algorithm which adaptively enables/disables DBO considering the (secondary) hidden interference. Through ns-3 simulations, we demonstrate that the proposed scheme achieves up to 2x higher throughput compared to the baseline of 802.11ac.

show abstract

A Channel Allocation Algorithm for Reducing the Channel Sensing/Reserving Asymmetry in 802.11ac Networks

Cited by 23 publications

References 17 publications

A Passive Method to Infer the Weighted Conflict Graph of an IEEE 802.11 Network

A Passive Method to Infer the Weighted Conflict Graph of an IEEE 802.11 Network

To Bond or Not to Bond: An Optimal Channel Allocation Algorithm for Flexible Dynamic Channel Bonding in WLANs

Enhancement of wide bandwidth operation in IEEE 802.11ac networks

Contact Info

Product

Resources

About