Scalable Multiple Channel Scheduling with Optimal Utility in Wireless Local Area Networks

This paper studies scheduling algorithms for an infra-structure based wireless local area network with multiple simultaneous transmission channels. A reservation-based medium access control protocol is assumed where the base station (BS) allocates transmission slots to the system mobile stations based on their requests. Each station is assumed to have a tunable transmitter and tunable receiver. For this network architecture, the scheduling algorithms can be classified into two categories: contiguous and non-contiguous, depending on whether slots are allocated contiguously to the mobile stations. The main objective of the scheduling algorithms is to achieve high channel utility while having low time complexity. In this paper, we propose three scheduling algorithms termed contiguous sorted sequential allocation (CSSA), non-contiguous round robin allocation (NCRRA) and non-contiguous sorted round robin allocation (NCSRRA). Among these, CSSA schedules each station in contiguous mode, while other two algorithms, NCRRA and NCSRRA, schedule stations in non-contiguous mode. Through extensive analysis and simulation, the results demonstrate that the CSSA with only slightly increased complexity can achieve much higher channel utility when compared to the existing contiguous scheduling algorithms. The NCRRA and NCSRRA on the other hand, results in significantly lower complexity, while still achieving the optimal channel utility compared to existing non-contiguous scheduling algorithms.

[1]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[2]  Bin Li,et al.  An effective collision resolution mechanism for wireless LAN , 2003, 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003..

[3]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[4]  Michael G. Barry,et al.  Distributed control algorithms for service differentiation in wireless packet networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Claude Castelluccia,et al.  Differentiation mechanisms for IEEE 802.11 , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Han Hoogeveen,et al.  Three, four, five, six, or the complexity of scheduling with communication delays , 1994, Oper. Res. Lett..

[7]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Krishna M. Sivalingam,et al.  Design and analysis of low‐power access protocols for wireless and mobile ATM networks , 2000, Wirel. Networks.

[10]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[11]  Sujata Banerjee,et al.  Distributed mechanisms for quality of service in wireless LANs , 2003, IEEE Wirel. Commun..

[12]  Songwu Lu,et al.  Fair queuing in wireless networks: issues and approaches , 1999, IEEE Wirel. Commun..

[13]  Paramvir Bahl,et al.  Distributed fair scheduling in a wireless LAN , 2000, IEEE Transactions on Mobile Computing.

[14]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[15]  Krishna M. Sivalingam,et al.  Scheduling algorithms for multiple channel wireless local area networks , 2002, Comput. Commun..