The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2011 vol.10)
pp: 479-490
Jun Yi , University of Notre Dame, Notre Dame
Christian Poellabauer , University of Notre Dame, Notre Dame
Xiaobo Sharon Hu , University of Notre Dame, Notre Dame
Liqiang Zhang , Indiana University, South Bend
ABSTRACT
Reservation-based (as opposed to contention-based) channel access in WLANs provides predictable and deterministic transmission and is therefore able to provide timeliness guarantees for wireless and embedded real-time applications. Also, reservation-based channel access is energy-efficient since a wireless adaptor is powered on only during its exclusive channel access times. While scheduling for Quality of Service at the central authority (e.g., base station) has received extensive attention, the problem of determining the actual resource requirements of an individual node in a wireless real-time system has been largely ignored. This work aims at finding the minimum channel bandwidth reservation that meets the real-time constraints of all periodic streams of a given node. Keeping the bandwidth reservation of a node to a minimum leads to reduced energy and resource requirements and leaves more bandwidth for future reservations by other nodes. To obtain a solution to the minimum bandwidth reservation problem, we transform it to a generic uniprocessor task schedulability problem, which is then addressed using a generic algorithm. This algorithm works for a subclass of priority-driven packet scheduling policies, including three common ones: fixed-priority, EDF, and FIFO. Moreover, we then specialize the generic algorithm to these three policies according to their specific characteristics. Their computation complexities and bandwidth reservation efficiencies are evaluated and guidelines for choosing scheduling policies and stream parameters are presented.
INDEX TERMS
Bandwidth reservation, schedulability test, earliest deadline first, fixed-priority, first-in-first-out, medium access control, real time, wireless.
CITATION
Jun Yi, Christian Poellabauer, Xiaobo Sharon Hu, Liqiang Zhang, "Minimum Bandwidth Reservations for Periodic Streams in Wireless Real-Time Systems", IEEE Transactions on Mobile Computing, vol.10, no. 4, pp. 479-490, April 2011, doi:10.1109/TMC.2010.190
REFERENCES
[1] L. Wang and Y. Xiao, "A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks," Mobile Networks and Applications, vol. 11, no. 5, pp. 723-740, 2006.
[2] IEEE 802.11e Standard, IEEE 802.11 WG, Part II: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Medium Access Control (MAC) Enhancements for Quality of Service (QoS), Nov. 2005.
[3] A.K. Mok, X.A. Feng, and D. Chen, "Resource Partition for Realtime Systems," Proc. Seventh IEEE Real-Time Technology and Applications Symp., pp. 75-84, 2001.
[4] T.L. Crenshaw, S. Hoke, A. Tirumala, and M. Caccamo, "Robust Implicit EDF: A Wireless MAC Protocol for Collaborative Realtime Systems," ACM Trans. Embedded Computing Systems, vol. 6, no. 4, 2007.
[5] D. Rajan, C. Poellabauer, X.S. Hu, L. Zhang, and K. Otten, "Wireless Channel Access Reservation for Embedded Real-Time Systems," Proc. Seventh ACM Int'l Conf. Embedded Software, pp. 129-138, 2008.
[6] H. Hoang, G. Buttazzo, M. Jonsson, and S. Karlsson, "Computing the Minimum EDF Feasible Deadline in Periodic Systems," Proc. 12th IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, pp. 125-134, 2006.
[7] O. Redell and M. T¨orngren, "Calculating Exact Worst Case Response Times for Static Priority Scheduled Tasks with Offsets and Jitter," Proc. Eighth IEEE Real-Time and Embedded Technology and Applications Symp., pp. 164-172, 2002.
[8] R.I. Davis, A. Zabos, and A. Burns, "Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems," IEEE Trans. Computers, vol. 57, no. 9, pp. 1261-1276, Sept. 2008.
[9] J. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines," Proc. 11th Real-Time Systems Symp., pp. 201-209, Dec. 1990.
[10] C.L. Liu and J.W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1 pp. 46-61, 1973.
[11] S. Baruah, A. Mok, and L. Rosier, "Preemptively Scheduling Hardreal-Time Sporadic Tasks on One Processor," Proc. 11th IEEE Real-Time Systems Symp., pp. 182-190, Dec. 1990.
[12] S.K. Baruah, L.E. Rosier, and R.R. Howell, "Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic Real-Time Tasks on One Processor," Real-Time Systems, vol. 2, no. 4, pp. 301-324, 1990.
[13] F. Zhang and A. Burns, "Schedulability Analysis for Real-time Systems with EDF Scheduling," IEEE Trans. Computers, vol. 58, no. 9, pp. 1250-1258, Sept. 2009.
[14] L. George and P. Minet, "A FIFO Worst Case Analysis for a Hard Real-Time Distributed Problem with Consistency Constraints," Proc. 17th Int'l Conf. Distributed Computing Systems, pp. 441-448, 1997.
[15] X.A. Feng and A.K. Mok, "A Model of Hierarchical Real-Time Virtual Resources," Proc. 23rd IEEE Real-Time Systems Symp., pp. 26-35, 2002.
[16] A.K. Mok and X.A. Feng, "Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds," Proc. 22nd IEEE Real-Time Systems Symp., pp. 129-138, 2001.
[17] I. Shin and I. Lee, "Periodic Resource Model for Compositional Real-Time Guarantees," Proc. 24th IEEE Int'l Real-Time Systems Symp., pp. 2-13, 2003.
[18] I. Shin and I. Lee, "Compositional Real-Time Scheduling Framework with Periodic Model," ACM Trans. Embedded Computing Systems, vol. 7, no. 3 pp. 1-39, 2008.
[19] A. Easwaran, M. Anand, and I. Lee, "Compositional Analysis Framework Using EDP Resource Models," Proc. 28th IEEE Int'l Real-Time Systems Symp., pp. 129-138, 2007.
[20] N. Fisher and F. Dewan, "Approximate Bandwidth Allocation for Compositional Real-Time Systems," Proc. 21st Euromicro Conf. Real-Time Systems, pp. 87-96, 2009.
[21] J. Regehr and J.A. Stankovic, "HLS: A Framework for Composing Soft Real-Time Schedulers," Proc. 22nd IEEE Real-Time Systems Symp., pp. 3-14, Dec. 2001.
[22] F. Zhang and A. Burns, "Analysis of Hierarchical EDF Pre-Emptive Scheduling," Proc. 28th IEEE Int'l Real-Time Systems Symp., pp. 423-434, 2007.
[23] W. Ye, J. Heidemann, and D. Estrin, "Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks," IEEE/ACM Trans. Networks, vol. 12, no. 3, pp. 493-506, June 2004.
[24] P. Puschner and A. Burns, "A Review of Worstcase Execution Time Analysis," Real-Time Systems, vol. 18, no. 2, pp. 115-130, 2000.
[25] N. Audsley, A. Burns, M. Richardson, K. Tindell, and A.J. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Eng. J., vol. 8, pp. 284-292, 1993.
[26] J. Lehoczky, L. Sha, and Y. Ding, "The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior," Proc. 10th Real Time Systems Symp., pp. 166-171, 1989.
[27] J.W.S. Liu, Real-Time Systems. Prentice Hall, 2001.
[28] K. Albers and F. Slomka, "Efficient Feasibility Analysis for Realtime Systems with EDF Scheduling," Proc. Conf. Design, Automation and Test in Europe, pp. 492-497, 2005.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool