A multi-rate channelized wireless LAN system with fixed channel assignment

We consider a multi-rate channelized wireless LAN system for a typical office building. The problem is formulated as a fixed channel assignment problem with multi-rate traffic. We generalized several known fixed channel assignment algorithms which were originally designed for single rate cellular networks. A new lower bound called the generalized clique bound is obtained. The generalized algorithms are compared via simulations for several typical office environments. It is found that these algorithms perform almost optimally, i.e., use the least bandwidth to satisfy the call requirements, when compared with the generalized clique bound