Abstract
Providing delay guarantees to time-sensitive traffic in wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the variety of real-time applications expected to be handled by such networks. We propose and evaluate the performance of a channel-aware scheduling discipline and a set of policies that are capable of providing such delay guarantees in TDM-based wireless networks. First, we introduce the Channel-Dependent Earliest-Due-Date (CD-EDD) discipline. In this discipline, the expiration time of the head of line packets of users' queues is taken into consideration in conjunction with the current channel states of users in the scheduling decision. This scheme attempts to guarantee the targeted delay bounds in addition to exploiting multiuser diversity to make best utilization of the variable capacity of the channel. We also propose the violation-fair policy that can be integrated with the CD-EDD discipline and two other well-known scheduling disciplines [1, 2]. In this policy, we attempt to ensure that the number of packets dropped due to deadline violation is fairly distributed among the users. The proposed schemes can provide statistical guarantees on delays, achieve high throughput, and exhibit good fairness performance with respect to throughput and deadline violations. We provide extensive simulation results to study the performance the proposed schemes and compare them with two of the best known scheduling disciplines [1, 2] in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Andrews, K. Kumaran, K. Ramanan, A.L. Stolyar, R. Vijayakumar, and P. Whiting, “CDMA Data QoS Scheduling on the Forward Link with Variable Channel Conditions”, Bell Laboratories Technical Report, April, 2000.
S. Shakkottai and A.L. Stolyar, “Scheduling Algorithms for a Mixture of Real-Time and Non-Real-Time Data in HDR”, in Proceedings of the 17th International Teletraffic Congress - ITC-17, Salvador da Bahia, Brazil, pp. 793–804, 24–28 September, 2001.
S. Kashave, An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network, Addison Wesley, 1997, ch. 9.
Y. Cao and V. O. K. Li, “Scheduling Algorithms in Broadband Wireless Networks”, Proceedings of the IEEE, pp. 76–87, Jan. 2001.
H. Fattah and C. Leung, “An Overview of Scheduling Algorithms in Wireless Multimedia Networks”, IEEE Wireless Communications, pp. 76–83, October 2002.
R. Knopp and P.A. Humblet, “Information Capacity and Power Control in Single-Cell Multiuser Communications”, in Proceedings of IEEE International Conference on Communications (ICC'95), Seattle, USA, June 1995.
D. Wu and R. Negi, “Utilizing Multiuser Diversity for Efficient Support of Quality of Service Over a Fading Channel”, in Proceedings of IEEE ICC'03, Anchorage, Alaska, USA, May 11–15, 2003.
A. Jalali, R. Padovani, and R. Pankaj, “Data Throughput of CDMA-HDR a High Efficiency-High Data Rate Personal Communication Wireless System”, in Proceedings of Vehicular Technology Conference 2000-spring, vol. 3.
Y. Liu, S. Gruhl, and E. Knightly, “WCFQ: An Opportunistic Wireless Scheduler with Statistical Fairness Bounds”, IEEE Transactions on Wireless Communication, September 2003.
Y. Liu and E. Knightly, “Opportunistic Fair Scheduling Over Multiple Wireless Channels”, in Proceedings of IEEE INFOCOM, 2003.
X. Liu, E. K. P. Chong, and N. B. Shroff, “Transmission Scheduling for Efficient Wireless Utilization”, in Proceedings of IEEE INFOCOM, 2000.
X. Liu, E. K. P. Chong, and N. B. Shroff, “Optimal Opportunistic Scheduling in Wireless Networks”, in Proceedings of IEEE INFOCOM, 2000.
S. S. Kulkarni and C. Rosenberg, “Opportunistic Scheduling Policies for Wireless Systems with Short Term Fairness Constraints”, in Proceedings of IEEE GLOBECOM, December 2003.
Z. Jiang and N. K. Shankaranarayana, “Channel Quality Dependent Scheduling for Flexible Wireless Resource Control”, Globecom 2001, Texas.
P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, “CDMA/HDR: a Bandwidth Efficient High Speed Wireless Data Service for Nomadic Users”, IEEE Communications Magazine, vol. 38, no. 7, pp. 70–77, July 2000.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network, “Physical Layer Aspects of UTRA High Speed Downlink Packet Access (Release 4) tr25.848 v4.0.0”, Available: http://www.3gpp.org, Mar. 2001.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network, “Services Provided by the Physical Layer (Release 4) TS 25.302 v4.1.0”, Available: http://www.3gpp.org, June 2001.
P. Bhagwat, A. Krishna, and S. Tripathi, “Enhancing Throughput Over Wireless LANs Using Channel State Dependent Packet Scheduling”, in Proc. INFOCOM96, pp. 1133-1140, Mar. 1996.
S. Lu, V. Bharghavan, and R. Sirkant, “Fair Scheduling in Wireless Packet Networks”, IEEE Trans. on Networking, pp. 473–89, Aug. 1999.
T. S. Ng, I. Stoica, and H. Zhang, “Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors”, in Proc. INFOCOM98, pp. 1103–111, Mar. 1998.
R. Ramaanthan and P. Agrawal, “Adapting Packet Fair Queueing Algorithms to Wireless Networks”, in Proc. MOBICOM98, pp. 1–9, Oct. 1998.
S. Shakkottai and R. Srikant, “Scheduling Real-Time Traffic with Deadlines Over a Wireless Channel”, in Proceedings of ACM Workshop on Wireless and Mobile Multimedia, Seatle, WA, August 1999.
A.L. Stolyar and K. Ramanan, “Largest Weighted Delay First Scheduling: Large Deviations and Optimality”, Annals of Applied Probability, Vol. 11, No.1, pp. 1–48, 2001.
K. Chang and Y. Han, “QoS-Based Adaptive Scheduling for a Mixed Service in HDR System”, PIMRC 2002.
S. Shakkottai and A. L. Stolyar, “Scheduling for Multiple Flows Sharing a Time-Varying Channel: The Exponential Rule”, Analytic Methods in Applied Probability, Vol. 207, pp. 185–202, 2002.
Author information
Authors and Affiliations
Corresponding author
Additional information
Khaled M. F. Elsayed (S90-M95-SM02) received his B.Sc. (honors) in electrical engineering and M.Sc. in engineering mathematics from Cairo University in 1987 and 1990 respectively. He received his Ph.D. in computer science and computer engineering from North Carolina State University in 1995. He is now an Associate Professor in Cairo University, Egypt and is an independent telecommunications consultant. Between 1995 and 1997, he was a member of scientific staff with Nortel Wireless Systems Engineering in Richardson, TX.
Dr. Elsayed was the editor for the Internet technology series of the IEEE Communications Magazine from 1998 until 2002. He has served on technical program committees for several IEEE, IFIP, and ITC conferences. He was the technical co-chair for IFIP MWCN 2003 conference in Singapore. He also served as an expert evaluator for the European Commission FP5 and FP6 programmes. His research interest is in the area of performance evaluation of communication networks including IP, wireless and optical networks.
Ahmed Khattab received his B.Sc. (honors) and MS.C in Electronics and Communications Engineering from Cairo University in 2002 and 2004 respectively. Since August 2005, he is pursuing his PhD degree at Rice University, Texas. His research interests are in wireless networking and radio resource management.
Rights and permissions
About this article
Cite this article
Elsayed, K.M.F., Khattab, A.K.F. Channel-Aware Earliest Deadline Due Fair Scheduling for Wireless Multimedia Networks. Wireless Pers Commun 38, 233–252 (2006). https://doi.org/10.1007/s11277-006-9013-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-006-9013-1