2020
DOI: 10.1109/lwc.2019.2952100
|View full text |Cite
|
Sign up to set email alerts
|

Online Primary Channel Selection for Dynamic Channel Bonding in High-Density WLANs

Abstract: In order to dynamically adapt the transmission bandwidth in wireless local area networks (WLANs), dynamic channel bonding (DCB) was introduced in IEEE 802.11n. It has been extended since then, and it is expected to be a key element in IEEE 802.11ax and future amendments such as IEEE 802.11be. While DCB is proven to be a compelling mechanism by itself, its performance is deeply tied to the primary channel selection, especially in high-density (HD) deployments, where multiple nodes contend for the spectrum. Trad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(19 citation statements)
references
References 11 publications
(23 reference statements)
0
19
0
Order By: Relevance
“…However, EDMA sometimes causes the throughput to be underutilized and leads to the same dynamic multichannel access scheme results. Dynamic-wise (DyWi) [23] is an adaptive algorithm aimed for maximizing the throughput by considering primary channel selection. Channel selection depends on the empirical probability of transmitting at a higher bandwidth and it takes a number of iterations to reach a satisfactory primary channel for traffic loads.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, EDMA sometimes causes the throughput to be underutilized and leads to the same dynamic multichannel access scheme results. Dynamic-wise (DyWi) [23] is an adaptive algorithm aimed for maximizing the throughput by considering primary channel selection. Channel selection depends on the empirical probability of transmitting at a higher bandwidth and it takes a number of iterations to reach a satisfactory primary channel for traffic loads.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The channel assignment problem is solved by finding a solution that maximizes the sum of the channel utilization. Another online solution is proposed in [3]. As in [14], the algorithm is based on the activity of the channels.…”
Section: Related Workmentioning
confidence: 99%
“…The channel assignment problem is solved by finding a solution that maximizes the sum of the usage of the channel. Another online solution is proposed in [3]. As in [12] the algorithm is based on the activity of the channels.…”
Section: Related Workmentioning
confidence: 99%