Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Self-management in chaotic wireless deployments
Proceedings of the 11th annual international conference on Mobile computing and networking
Distributed channel management in uncoordinated wireless environments
Proceedings of the 12th annual international conference on Mobile computing and networking
Exploiting partially overlapping channels in wireless networks: turning a peril into an advantage
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Complexity analysis of a decentralised graph colouring algorithm
Information Processing Letters
Channel dependent interference and decentralized colouring
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Hi-index | 0.00 |
We propose a new class of channel allocation algorithms that are simple, robust and require no communication between interfering WLANs. We show they are provably correct and yet remarkably efficient under a wide range of network conditions and topologies. The algorithms are suited to implementation on standard equipment, requiring no special hardware support and making only light demands on computational resources. We demonstrate this by implementing algorithms on an experimental testbed using commodity hardware. We present detailed measurements of performance in a real office environment. This environment includes complex spatially-varying noise, channel-dependent interference between WLANs, time-varying channel quality and external interference sources. Despite these challenges the algorithm performs well.