Efficient channel assignment algorithms for infrastructure WLANs under dense deployment

  • Authors:

  • Suparerk Manitpornsut;Björn Landfeldt;Azzedine Boukerche

  • Affiliations:

  • University of Sydney, Sydney, Australia;Univerity of Sydney, Sydney, Australia;University of Ottawa, Ottawa, Canada

  • Venue:
  • Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to a limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we show that previously proposed channel assignment algorithms may lead to an increased number of hidden nodes in dense network deployments. We also show that this can significantly decrease the performance of the network. Furthermore, we present results from experiments showing that the RTS/CTS mechanism is unable to solve the hidden node problem in infrastructure WLANs and therefore, careful consideration needs to be taken when choosing channel assignment strategies in densely deployed wireless networks. To this end, we propose two novel channel assignment algorithms. Using a simulation study, we show that the proposed algorithms can outperform traditional channel assignment in densely deployed scenarios, in terms of QoS sensitive VoIP support without compromising the aggregate throughput and are therefore a better performing alternative in such settings.