Stability Analysis of Reservation-Based Scheduling Policies in Wireless Networks

A major challenge in wireless networks is the ability to maximize the throughput. High throughput in a wireless network requires a relatively low complex scheduling policy with a provable efficiency ratio, which is a measure of the performance of the policy in terms of throughput and stability. For most scheduling policies that achieve provable ratios, at the onset of every frame, a selection is made of a subset of links to transmit data in the immediately following frame. In this paper, we propose a policy that allows links to transmit data in any future frame by means of frame reservations. The new, reservation-based distributed scheduling approach will improve the capacity of the system and provide greater throughput. First, we create a framework to analyze the stability of reservation-based scheduling systems. Then, to demonstrate its efficacy, we propose a reservation-based distributed scheduling policy for IEEE 802.16 mesh networks and use the new framework to find sufficient conditions for the stability of the network under this policy, i.e., we find a lower bound for its efficiency ratio. Finally, by means of simulation, we validate the mathematical analysis and compare the performance of our policy with nonreservation-based policies.

[1]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[2]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[4]  Changhee Joo,et al.  A local greedy scheduling scheme with provable performance guarantee , 2008, MobiHoc '08.

[5]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[6]  Janise McNair,et al.  Reservation-based distributed scheduling in wireless networks , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Koushik Kar,et al.  Fairness and Throughput Guarantees with Maximal Scheduling in Multi-hop Wireless Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[9]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, CDC.

[10]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[12]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 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.

[14]  Koushik Kar,et al.  Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks , 2006 .

[15]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[16]  Xiaodong Wang,et al.  Analysis of IEEE 802.16 Mesh Mode Scheduler Performance , 2007, IEEE Transactions on Wireless Communications.

[17]  Leandros Tassiulas,et al.  Low-complexity distributed fair scheduling for wireless multi-hop networks , 2005 .

[18]  Janise McNair,et al.  WiMAX-RBDS-Sim: an OPNET simulation framework for IEEE 802.16 mesh networks , 2010, SimuTools.

[19]  N. Shroff,et al.  Distributed Scheduling Schemes for Throughput Guarantees in Wireless Networks , 2007 .

[20]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[21]  Shie-Yuan Wang,et al.  Improving the Performances of Distributed Coordinated Scheduling in IEEE 802.16 Mesh Networks , 2008, IEEE Transactions on Vehicular Technology.

[22]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[23]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[24]  R. Srikant,et al.  Asynchronous Congestion Control in Multi-Hop Wireless Networks With Maximal Matching-Based Scheduling , 2008, IEEE/ACM Transactions on Networking.

[25]  Ieee Standards Board.  IEEE Standard for local and metropolitan area networks : supplement to Integrated Services (IS) LAN Interface at the Medium Access Control (MAC) and Physical (PHY) layers : Managed Object Conformance (MOCS) Proforma , 1996 .