EURASIP Journal on Wireless Communications and Networking

Impact Factor 1.529

EURASIP Journal on Wireless Communications and Networking Cover Image
Research Article
Open Access

Adaptive Rate-Scheduling with Reactive Delay Control for Next Generation CDMA Wireless Mobile Systems

EURASIP Journal on Wireless Communications and Networking20062006:043759

https://doi.org/10.1155/WCN/2006/43759

©  Oliver Yu et al. 2006

Received: 1 October 2005

Accepted: 26 May 2006

Published: 10 September 2006

Abstract

To minimize QoS degradations during nonstationary packet loadings, predictive rate schedulers adapt the operation according to anticipated packet arrival rates deduced via specified estimation algorithm. Existing predictive rate schedulers are developed under the assumption of perfect estimation, which may not be possible in future CDMA-based cellular networks characterized with highly nonstationary and bursty traffic. Additional shortcoming of existing rate schedulers is the coupling of delay and bandwidth, that is, close interdependence of delay and bandwidth (rate), whereby controlling one is accomplished solely by changing the other. In order to mitigate for the arrival rate estimation errors and delay-bandwidth coupling, this paper presents the feedback-enhanced target-tracking weighted fair queuing (FT-WFQ) rate scheduler. It is an adaptive rate scheduler over multiclass CDMA systems with predictive adaptation control to adapt to nonstationary loadings; and feedback-enhanced reactive adaptation control to counteract arrival rate estimation errors. When the predictive adaptation control is not able to maintain long-term delay targets, feedback information will trigger reactive adaptation control. The objective of FT-WFQ scheduler is to minimize deviations from delay targets subject to maximum throughput utilization. Analytical and simulation results indicate that FT-WFQ is able to substantially reduce degradations caused by arrival rate estimation errors and to minimize delay degradations during nonstationary loading conditions.

[123456789101112131415161718]

Authors’ Affiliations

(1)
Department of ECE, University of Illinois at Chicago

References

  1. Holma H, Toskala A: WCDMA for UMTS. John Wiley & Sons, West Sussex, UK; 2000.Google Scholar
  2. Yu O, Saric E, Li A: Fairly adjusted multimode dynamic guard bandwidth admission control over CDMA systems. IEEE Journal on Selected Areas in Communications 2006,24(3):579-592.View ArticleGoogle Scholar
  3. Xu L, Shen X, Mark JW: Dynamic bandwidth allocation with fair scheduling for WCDMA systems. IEEE Wireless Communications 2002,9(2):26-32. 10.1109/MWC.2002.998522View ArticleGoogle Scholar
  4. Xu L, Shen X, Mark JW: Dynamic fair scheduling with QoS constraints in multimedia wideband CDMA cellular networks. IEEE Transactions on Wireless Communications 2004,3(1):60-73. 10.1109/TWC.2003.819028View ArticleGoogle Scholar
  5. Wang X: An FDD wideband CDMA MAC protocol with minimum-power allocation and GPS-scheduling for wireless wide area multimedia networks. IEEE Transactions on Mobile Computing 2005,4(1):16-28.View ArticleGoogle Scholar
  6. Li C, Papavassiliou S: Fair channel-adaptive rate scheduling in wireless networks with multirate multimedia services. IEEE Journal on Selected Areas in Communications 2003,21(10):1604-1614. 10.1109/JSAC.2003.815596View ArticleGoogle Scholar
  7. Moustafa M, Habib I, Naghshineh MN: Efficient radio resource control in wireless networks. IEEE Transactions on Wireless Communications 2004,3(6):2385-2395. 10.1109/TWC.2004.837472View ArticleGoogle Scholar
  8. Akyildiz IF, Levine DA, Joe I: A slotted CDMA protocol with BER scheduling for wireless multimedia networks. IEEE/ACM Transactions on Networking 1999,7(2):146-158. 10.1109/90.769764View ArticleGoogle Scholar
  9. Wang X: A new scheduling scheme for the wideband TD-CDMA MAC protocol. Proceedings of IEEE International Conference on Communications (ICC '01), June 2001, Helsinki, Finland 3: 974-978.Google Scholar
  10. Wong WK, Zhu H, Leung VCM: Soft QoS provisioning using the token bank fair queuing scheduling algorithm. IEEE Wireless Communications 2003,10(3):8-16. 10.1109/MWC.2003.1209591View ArticleGoogle Scholar
  11. Wong WK, Tang HY, Leung VCM: Token bank fair queuing: a new scheduling algorithm for wireless multimedia services. International Journal of Communication Systems 2004,17(6):591-614. 10.1002/dac.670View ArticleGoogle Scholar
  12. Stamoulis A, Sidiropoulos ND, Giannakis GB: Time-varying fair queueing scheduling for multicode CDMA based on dynamic programming. IEEE Transactions on Wireless Communications 2004,3(2):512-523. 10.1109/TWC.2003.821151View ArticleGoogle Scholar
  13. Li C-C, Tsao S-L, Chen MC, Sun Y, Huang Y-M: Proportional delay differentiation service based on weighted fair queuing. Proceedings of the 9th International Conference on Computer Communications and Networks (ICCCN '00), October 2000, Las Vegas, Nev, USA 418-423.Google Scholar
  14. Jennings OB, Massey WA: A modified offered load approximation for nonstationary circuit switched networks. Telecommunication Systems 1997,7(1–3):229-251.View ArticleGoogle Scholar
  15. Green L, Kolesar P: The pointwise stationary approximation for queues with nonstationary arrivals. Management Science 1991,37(1):84-97. 10.1287/mnsc.37.1.84View ArticleGoogle Scholar
  16. Robertazzi T: Computer Networks and Systems: Queueing Theory and Performance Evaluation. Springer, New York, NY, USA; 2000.View ArticleGoogle Scholar
  17. Katzela I: Modeling and Simulating Communication Networks: A Hands-on Approach Using OPNET. Prentice Hall, Upper Saddle River, NJ, USA; 1998.Google Scholar
  18. Dham V, DaSilva LA, Annamalai A, Srivastava V: A phased array antenna model for space division multiple access in wireless networks. Proceedings of OPNETWORK Conference, August 2002, Washington, DC, USAGoogle Scholar

Copyright

© Oliver Yu et al. 2006

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.