Dynamic Channel Bonding Algorithm for Densely Deployed 802.11ac Networks

Seung seob Lee; Tae Young Kim; Su Kyoung Lee; Kyungsoo Kim; Yoon Hyuk Kim; Nada Golmie

doi:10.1109/TCOMM.2019.2944382

Dynamic Channel Bonding Algorithm for Densely Deployed 802.11ac Networks

Seung seob Lee, Tae Young Kim, Su Kyoung Lee, Kyungsoo Kim, Yoon Hyuk Kim, Nada Golmie

College of Computing

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

Abstract

To meet the rising demand of mobile data, IEEE 802.11ac was recently developed to offer better network performance than previous IEEE 802.11 standards, representing the 5G Wi-Fi technology. One of the new technologies added to IEEE 802.11ac is a dynamic bandwidth channel access scheme that supports channel bonding (CB) with an up to 160 MHz bandwidth. However, the use of CB increases the number of stations sharing the same medium, resulting in an increased collision rate and severe interference caused by overlapping sub-channels. This problem is further aggravated in densely deployed wireless networks where the service ranges of access points (APs) are likely to be highly overlapping. To resolve these issues, we present an analytical throughput model that considers the effect of both collisions and interference. With this analytical model, we formulate the CB problem to optimize the throughput along with the traffic demand and propose a genetic algorithm for solving the problem. Further, a dynamic channel bonding algorithm (named DCB) is proposed to solve the problem with lower complexity. Extensive simulation results demonstrate that our proposed algorithm provides a higher performance than other recent dynamic CB algorithms with respect to the throughput achieved for the traffic demand.

Original language	English
Article number	8851263
Pages (from-to)	8517-8531
Number of pages	15
Journal	IEEE Transactions on Communications
Volume	67
Issue number	12
DOIs	https://doi.org/10.1109/TCOMM.2019.2944382
Publication status	Published - 2019 Dec

Bibliographical note

Funding Information:
Manuscript received October 7, 2018; revised March 12, 2019 and July 9, 2019; accepted September 19, 2019. Date of publication September 27, 2019; date of current version December 17, 2019. This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea Government (MSIT) (No. NRF-2019R1A2C1086191). The associate editor coordinating the review of this article and approving it for publication was L. Huang. (Corresponding author: SuKyoung Lee.) S.-s. Lee, T. Kim, and S. Lee are with the Department of Computer Science, Yonsei University, Seoul 03722, South Korea (e-mail: sklee@yonsei.ac.kr).

Publisher Copyright:
© 1972-2012 IEEE.

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2019.2944382

Cite this

@article{c11cddbdc53a47c5b9e8567b5a330d98,

title = "Dynamic Channel Bonding Algorithm for Densely Deployed 802.11ac Networks",

abstract = "To meet the rising demand of mobile data, IEEE 802.11ac was recently developed to offer better network performance than previous IEEE 802.11 standards, representing the 5G Wi-Fi technology. One of the new technologies added to IEEE 802.11ac is a dynamic bandwidth channel access scheme that supports channel bonding (CB) with an up to 160 MHz bandwidth. However, the use of CB increases the number of stations sharing the same medium, resulting in an increased collision rate and severe interference caused by overlapping sub-channels. This problem is further aggravated in densely deployed wireless networks where the service ranges of access points (APs) are likely to be highly overlapping. To resolve these issues, we present an analytical throughput model that considers the effect of both collisions and interference. With this analytical model, we formulate the CB problem to optimize the throughput along with the traffic demand and propose a genetic algorithm for solving the problem. Further, a dynamic channel bonding algorithm (named DCB) is proposed to solve the problem with lower complexity. Extensive simulation results demonstrate that our proposed algorithm provides a higher performance than other recent dynamic CB algorithms with respect to the throughput achieved for the traffic demand.",

author = "Lee, {Seung seob} and Kim, {Tae Young} and Lee, {Su Kyoung} and Kyungsoo Kim and Kim, {Yoon Hyuk} and Nada Golmie",

note = "Funding Information: Manuscript received October 7, 2018; revised March 12, 2019 and July 9, 2019; accepted September 19, 2019. Date of publication September 27, 2019; date of current version December 17, 2019. This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea Government (MSIT) (No. NRF-2019R1A2C1086191). The associate editor coordinating the review of this article and approving it for publication was L. Huang. (Corresponding author: SuKyoung Lee.) S.-s. Lee, T. Kim, and S. Lee are with the Department of Computer Science, Yonsei University, Seoul 03722, South Korea (e-mail: sklee@yonsei.ac.kr). Publisher Copyright: {\textcopyright} 1972-2012 IEEE.",

year = "2019",

month = dec,

doi = "10.1109/TCOMM.2019.2944382",

language = "English",

volume = "67",

pages = "8517--8531",

journal = "IEEE Transactions on Communications",

issn = "1558-0857",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - Dynamic Channel Bonding Algorithm for Densely Deployed 802.11ac Networks

AU - Lee, Seung seob

AU - Kim, Tae Young

AU - Lee, Su Kyoung

AU - Kim, Kyungsoo

AU - Kim, Yoon Hyuk

AU - Golmie, Nada

N1 - Funding Information: Manuscript received October 7, 2018; revised March 12, 2019 and July 9, 2019; accepted September 19, 2019. Date of publication September 27, 2019; date of current version December 17, 2019. This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea Government (MSIT) (No. NRF-2019R1A2C1086191). The associate editor coordinating the review of this article and approving it for publication was L. Huang. (Corresponding author: SuKyoung Lee.) S.-s. Lee, T. Kim, and S. Lee are with the Department of Computer Science, Yonsei University, Seoul 03722, South Korea (e-mail: sklee@yonsei.ac.kr). Publisher Copyright: © 1972-2012 IEEE.

PY - 2019/12

Y1 - 2019/12

N2 - To meet the rising demand of mobile data, IEEE 802.11ac was recently developed to offer better network performance than previous IEEE 802.11 standards, representing the 5G Wi-Fi technology. One of the new technologies added to IEEE 802.11ac is a dynamic bandwidth channel access scheme that supports channel bonding (CB) with an up to 160 MHz bandwidth. However, the use of CB increases the number of stations sharing the same medium, resulting in an increased collision rate and severe interference caused by overlapping sub-channels. This problem is further aggravated in densely deployed wireless networks where the service ranges of access points (APs) are likely to be highly overlapping. To resolve these issues, we present an analytical throughput model that considers the effect of both collisions and interference. With this analytical model, we formulate the CB problem to optimize the throughput along with the traffic demand and propose a genetic algorithm for solving the problem. Further, a dynamic channel bonding algorithm (named DCB) is proposed to solve the problem with lower complexity. Extensive simulation results demonstrate that our proposed algorithm provides a higher performance than other recent dynamic CB algorithms with respect to the throughput achieved for the traffic demand.

AB - To meet the rising demand of mobile data, IEEE 802.11ac was recently developed to offer better network performance than previous IEEE 802.11 standards, representing the 5G Wi-Fi technology. One of the new technologies added to IEEE 802.11ac is a dynamic bandwidth channel access scheme that supports channel bonding (CB) with an up to 160 MHz bandwidth. However, the use of CB increases the number of stations sharing the same medium, resulting in an increased collision rate and severe interference caused by overlapping sub-channels. This problem is further aggravated in densely deployed wireless networks where the service ranges of access points (APs) are likely to be highly overlapping. To resolve these issues, we present an analytical throughput model that considers the effect of both collisions and interference. With this analytical model, we formulate the CB problem to optimize the throughput along with the traffic demand and propose a genetic algorithm for solving the problem. Further, a dynamic channel bonding algorithm (named DCB) is proposed to solve the problem with lower complexity. Extensive simulation results demonstrate that our proposed algorithm provides a higher performance than other recent dynamic CB algorithms with respect to the throughput achieved for the traffic demand.

UR - http://www.scopus.com/inward/record.url?scp=85077066294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85077066294&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2019.2944382

DO - 10.1109/TCOMM.2019.2944382

M3 - Article

AN - SCOPUS:85077066294

SN - 1558-0857

VL - 67

SP - 8517

EP - 8531

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

M1 - 8851263

ER -

Dynamic Channel Bonding Algorithm for Densely Deployed 802.11ac Networks

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this