Channel bonding algorithm for densely deployed wireless LAN

Taewon Song, Tae Yoon Kim, Wonjung Kim, Sangheon Pack

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Channel bonding enables a transmitting device to form a wide channel in order to facilitate high data rate. From IEEE 802.11n, which is the most generally deployed wireless local area network standard, channel bonding feature has been widely applied. However, prior studies have reported that the wide channel does not always guarantee high data rate since a node using wide channel width might deprive other nodes of their resource candidate. This effect arises notably when the nodes are deployed densely. We propose a channel bonding algorithm for densely deployed wireless local area network. Our algorithm aims at improving the network throughput rather than individual throughputs by adapting 'graphical game-theoretic approach' and 'adaptive game with multiplicative weights'. Simulation results show that our algorithm outperforms a randomized approach and a basic channel width approach.

Original languageEnglish
Title of host publicationInternational Conference on Information Networking
PublisherIEEE Computer Society
Pages395-397
Number of pages3
Volume2016-March
ISBN (Print)9781509017249
DOIs
Publication statusPublished - 2016 Mar 7
Event30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia
Duration: 2016 Jan 132016 Jan 15

Other

Other30th International Conference on Information Networking, ICOIN 2016
CountryMalaysia
CityKota Kinabalu
Period16/1/1316/1/15

Fingerprint

Local area networks
Wireless local area networks (WLAN)
Throughput

Keywords

  • Channel bonding
  • dense WLAN
  • distributed MAC
  • game-theory

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Song, T., Kim, T. Y., Kim, W., & Pack, S. (2016). Channel bonding algorithm for densely deployed wireless LAN. In International Conference on Information Networking (Vol. 2016-March, pp. 395-397). [7427142] IEEE Computer Society. https://doi.org/10.1109/ICOIN.2016.7427142

Channel bonding algorithm for densely deployed wireless LAN. / Song, Taewon; Kim, Tae Yoon; Kim, Wonjung; Pack, Sangheon.

International Conference on Information Networking. Vol. 2016-March IEEE Computer Society, 2016. p. 395-397 7427142.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Song, T, Kim, TY, Kim, W & Pack, S 2016, Channel bonding algorithm for densely deployed wireless LAN. in International Conference on Information Networking. vol. 2016-March, 7427142, IEEE Computer Society, pp. 395-397, 30th International Conference on Information Networking, ICOIN 2016, Kota Kinabalu, Malaysia, 16/1/13. https://doi.org/10.1109/ICOIN.2016.7427142
Song T, Kim TY, Kim W, Pack S. Channel bonding algorithm for densely deployed wireless LAN. In International Conference on Information Networking. Vol. 2016-March. IEEE Computer Society. 2016. p. 395-397. 7427142 https://doi.org/10.1109/ICOIN.2016.7427142
Song, Taewon ; Kim, Tae Yoon ; Kim, Wonjung ; Pack, Sangheon. / Channel bonding algorithm for densely deployed wireless LAN. International Conference on Information Networking. Vol. 2016-March IEEE Computer Society, 2016. pp. 395-397
@inproceedings{f440119a4449449bbbba6608c071897c,
title = "Channel bonding algorithm for densely deployed wireless LAN",
abstract = "Channel bonding enables a transmitting device to form a wide channel in order to facilitate high data rate. From IEEE 802.11n, which is the most generally deployed wireless local area network standard, channel bonding feature has been widely applied. However, prior studies have reported that the wide channel does not always guarantee high data rate since a node using wide channel width might deprive other nodes of their resource candidate. This effect arises notably when the nodes are deployed densely. We propose a channel bonding algorithm for densely deployed wireless local area network. Our algorithm aims at improving the network throughput rather than individual throughputs by adapting 'graphical game-theoretic approach' and 'adaptive game with multiplicative weights'. Simulation results show that our algorithm outperforms a randomized approach and a basic channel width approach.",
keywords = "Channel bonding, dense WLAN, distributed MAC, game-theory",
author = "Taewon Song and Kim, {Tae Yoon} and Wonjung Kim and Sangheon Pack",
year = "2016",
month = "3",
day = "7",
doi = "10.1109/ICOIN.2016.7427142",
language = "English",
isbn = "9781509017249",
volume = "2016-March",
pages = "395--397",
booktitle = "International Conference on Information Networking",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Channel bonding algorithm for densely deployed wireless LAN

AU - Song, Taewon

AU - Kim, Tae Yoon

AU - Kim, Wonjung

AU - Pack, Sangheon

PY - 2016/3/7

Y1 - 2016/3/7

N2 - Channel bonding enables a transmitting device to form a wide channel in order to facilitate high data rate. From IEEE 802.11n, which is the most generally deployed wireless local area network standard, channel bonding feature has been widely applied. However, prior studies have reported that the wide channel does not always guarantee high data rate since a node using wide channel width might deprive other nodes of their resource candidate. This effect arises notably when the nodes are deployed densely. We propose a channel bonding algorithm for densely deployed wireless local area network. Our algorithm aims at improving the network throughput rather than individual throughputs by adapting 'graphical game-theoretic approach' and 'adaptive game with multiplicative weights'. Simulation results show that our algorithm outperforms a randomized approach and a basic channel width approach.

AB - Channel bonding enables a transmitting device to form a wide channel in order to facilitate high data rate. From IEEE 802.11n, which is the most generally deployed wireless local area network standard, channel bonding feature has been widely applied. However, prior studies have reported that the wide channel does not always guarantee high data rate since a node using wide channel width might deprive other nodes of their resource candidate. This effect arises notably when the nodes are deployed densely. We propose a channel bonding algorithm for densely deployed wireless local area network. Our algorithm aims at improving the network throughput rather than individual throughputs by adapting 'graphical game-theoretic approach' and 'adaptive game with multiplicative weights'. Simulation results show that our algorithm outperforms a randomized approach and a basic channel width approach.

KW - Channel bonding

KW - dense WLAN

KW - distributed MAC

KW - game-theory

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

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

U2 - 10.1109/ICOIN.2016.7427142

DO - 10.1109/ICOIN.2016.7427142

M3 - Conference contribution

AN - SCOPUS:84963979421

SN - 9781509017249

VL - 2016-March

SP - 395

EP - 397

BT - International Conference on Information Networking

PB - IEEE Computer Society

ER -