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.