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 language | English |
|---|---|
| Title of host publication | International Conference on Information Networking |
| Publisher | IEEE Computer Society |
| Pages | 395-397 |
| Number of pages | 3 |
| Volume | 2016-March |
| ISBN (Print) | 9781509017249 |
| DOIs | |
| Publication status | Published - 2016 Mar 7 |
| Event | 30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia Duration: 2016 Jan 13 → 2016 Jan 15 |
Other
| Other | 30th International Conference on Information Networking, ICOIN 2016 |
|---|---|
| Country | Malaysia |
| City | Kota Kinabalu |
| Period | 16/1/13 → 16/1/15 |
Fingerprint
Keywords
- Channel bonding
- dense WLAN
- distributed MAC
- game-theory
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
Cite this
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 proceeding › Conference contribution
}
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 -