A graph theoretic approach for channel assignment in cellular networks
Wireless Networks
Optimization of AP Placement and Channel Assignment in Wireless LANs
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Frequency Allocation for WLANs Using Graph Colouring Techniques
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Self-management in chaotic wireless deployments
Proceedings of the 11th annual international conference on Mobile computing and networking
Weighted coloring based channel assignment for WLANs
ACM SIGMOBILE Mobile Computing and Communications Review
Performance Modeling of IEEE 802.11 DCF using Equilibrium Point Analysis
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
On the performance of IEEE 802.11 QoS mechanisms under spectrum competition
Proceedings of the 2006 international conference on Wireless communications and mobile computing
The Effect of the RTS/CTS Handshake on TCP
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Revisiting the Hidden Terminal Problem in a CSMA/CA Wireless Network
IEEE Transactions on Mobile Computing
Performance of wireless networks with hidden nodes: a queuing-theoretic analysis
Computer Communications
Bluetooth and WLAN coexistence: challenges and solutions
IEEE Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
It is well known that a wireless local area network (WLAN) based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms has 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 Request to send (RTS)/Clear to send (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 both a centralized channel assignment algorithm and a distributed channel assignment algorithm. 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 that they are therefore a better performing alternative in such settings.