Optimal scheduling for dynamic channel allocation in wireless LANs

• Authors: S. Jamaloddin Golestani;Rajeev Rastogi;Mark A. Smith
• Venue: Wireless Networks
• Year: 2010

Channel allocation schemes that have been used in cellular wireless ave limited applicability to Wireless LANs (WLANs) because of the small number of available channels and irregular cell geometries in WLAN environments. In this paper, we propose a dynamic, frame-based channel allocation architecture for WLANs. In this architecture, time is divided into a sequence of consecutive frames (in the order of milliseconds), and in each frame, only a non-interfering subset of access points (APs) is activated. Under broad traffic assumptions, we prove that the attainable system throughput can be optimized by scheduling APs and allocating channels in each frame such that a weighted sum of queue sizes at the activated APs is maximized. This optimality criterion for AP scheduling and channel allocation leads to a novel graph problem which is a variant of the well-known maximum independent set problem. We develop two heuristics for solving this problem. The first is a greedy heuristic that yields an approximation algorithm that has quadratic time complexity (in the number of APs) and, under certain conditions, yields a constant (6) factor approximation bound. The second heuristic is a graph decomposition heuristic. This heuristic, again under certain conditions, yields better approximation ratio, $$1+\epsilon,$$ but has complexity that grows exponentially with $$1/\epsilon^{2}$$ for arbitrarily small $$\epsilon 0.$$ Using the ns2 simulator we conducted experiments to compare our frame-based approach to static channel allocation. Results of our simulation indicate that our approach is able to deliver system throughput improvements of more than 50%.