Channel Bonding Based on Game Theory in Dense WLANs

Channel bonding allows for the use of multiple contiguous basic channels in Wireless Local Area Networks (WLANs), and it effectively utilizes channel resources to increase throughput. However, channel bonding increases contentions among adjacent WLANs and probably leads to a longer delay. In this paper, a scenario consisting of multiple WLANs within the carrier-sensing range is considered. According to the probabilistic game of Nash Equilibrium, a new performance metric named throughput expectation is proposed. The system throughput expectations are derived corresponding to different schemes of channel bonding. And the suitable channel bonding decision is obtained base on probability spaces. The results show our scheme that make channel bonding decision based on probability spaces is better than the dynamic channel bonding.