The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2012 vol.23)
pp: 760-767
Gustavo Vejarano , University of Florida, Gainesville
Janise McNair , University of Florida, Gainesville
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.
Distributed scheduling, wireless networks, greedy algorithms, IEEE 802.16, WiMAX.
Gustavo Vejarano, Janise McNair, "Stability Analysis of Reservation-Based Scheduling Policies in Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 4, pp. 760-767, April 2012, doi:10.1109/TPDS.2011.201
[1] G. Vejarano and J. McNair, "Reservation-Based Distributed Scheduling in Wireless Networks," Proc. IEEE Int'l Symp. World of Wireless Mobile and Multimedia Networks (WoWMoM '10), June 2010.
[2] L. Tassiulas and A. Ephremides, "Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks," IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
[3] B. Hajek and G. Sasaki, "Link Scheduling in Polynomial Time," IEEE Trans. Information Theory, vol. 34, no. 5, pp. 910-917, Sept. 1988.
[4] C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
[5] G. Sharma, R. Mazumdar, and N. Shroff, "On the Complexity of Scheduling in Wireless Networks," Proc. MobiCom '06, pp. 227-238, Sept. 2006.
[6] L. Tassiulas, "Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches," Proc. IEEE INFOCOM '98, pp. 533-539, Mar./Apr. 1998.
[7] X. Wu and R. Srikant, "Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks with Node-exclusive Spectrum Sharing," Proc. 44th IEEE Conf. Decision and Control and European Control Conf. (CDC-ECC '05), pp. 5342-5347, Dec. 2005.
[8] G. Sharma, C. Joo, and N. Shroff, "Distributed Scheduling Schemes for Throughput Guarantees in Wireless Networks," Proc. 44th Ann. Allerton Conf. (Allerton '06), Sept. 2006.
[9] C. Joo and N. Shroff, "Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks," Proc. IEEE INFOCOM '97, pp. 19-27, May 1997.
[10] S. Sanghavi, L. Bui, and R. Srikant, "Distributed Link Scheduling with Constant Overhead," SIGMETRICS '07: Proc. Int'l Conf. Measurement and Modeling of Computer Systems, pp. 313-324, June 2007.
[11] P. Chaporkar, K. Kar, and S. Sarkar, "Throughput Guarantees through Maximal Scheduling in Multi-Hop Wireless Networks," Proc. 43rd Ann. Allerton Conf. Comm., Control and Computing (Allerton '05), Sept. 2005.
[12] S. Sarkar, P. Chaporkar, and K. Kar, "Fairness and Throughput Guarantees with Maximal Scheduling in Wireless Networks," Proc. Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '06), Apr. 2006.
[13] P. Chaporkar, K. Kar, and S. Sarkar, "Achieving Queue-length Stability through Maximal Scheduling in Wireless Networks," Proc. Information Theory and Applications Inaugural Workshop (ITA '06), Feb. 2006.
[14] X. Wu, R. Srikant, and J. Perkins, "Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks," IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 595-605, June 2007.
[15] A. Gupta, X. Lin, and R. Srikant, "Low-Complexity Distributed Scheduling Algorithms for Wireless Networks," Proc. IEEE INFOCOM '97, pp. 1631-1639, May 1997.
[16] C. Joo, "A Local Greedy Scheduling Scheme with Provable Performance Guarantee," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MOBIHOC '08), pp. 111-120, May 2008.
[17] L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Asynchronous Congestion Control in Multi-Hop Wireless Networks with Maximal Matching-Based Scheduling," IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 826-839, Aug. 2008.
[18] C. Joo, X. Lin, and N. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling in Multi-Hop Wireless Networks," Proc. IEEE INFOCOM '08, pp. 1777-1785, Apr. 2008.
[19] L. Chen, S.H. Low, M. Chiang, and J.C. Doyle, "Cross-Layer Congestion Control, Routing and Scheduling in Ad Hoc Wireless Networks," Proc. IEEE INFOCOM '06, pp. 1-13, Apr. 2006.
[20] X. Lin and N. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks," IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, Apr. 2006.
[21] IEEE Standard for Local and Metropolitan Area Networks, IEEE Std. 802.16, 2004.
[22] M. Cao, Q. Zhang, and X. Wang, "Analysis of IEEE 802.16 Mesh Mode Scheduler Performance," IEEE Trans. Wireless Comm., vol. 6, no. 4, pp. 1455-1464, Apr. 2007.
[23] S.-Y. Wang, C.-C. Lin, H.-W. Chu, T.-W. Hsu, and K.-H. Fang, "Improving the Performance of Distributed Coordinated Scheduling in IEEE 802.16 Mesh Networks," IEEE Trans. Vehicular Technology, vol. 57, no. 4, pp. 2531-2547, July 2008.
[24] A. Penttinen, I. Koutsopoulos, and L. Tassiulas, "Low-Complexity Distributed Fair Scheduling for Wireless Multi-Hop Networks," Proc. Resource Allocation in Wireless NETworks (RAWNET '06), Apr. 2006.
[25] X. Lin and S.B. Rasool, "Constant-Time Distributed Scheduling Policies for Ad Hoc Networks," Proc. 45th IEEE Conf. Decision and Control (CDC '06), pp. 1258-1263, Dec. 2006.
[26] G. Vejarano and J. McNair, "Wimax-rbds-sim: An Opnet Simulation Framework for IEEE 802.16 Mesh Networks," Proc. Third Int'l ICST Conf. Simulation Tools and Techniques (SIMUTools '10), Mar. 2010.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool