Weakly-hard real-time scheduling algorithm for wireless networks

[1] Bernat G,Burns A,Llamosi A.Weakly hard real-time systems [J].IEEE Transactions on Computers,2001,50(4):308-321 [2] Hamdaoui M,Ramanathan P.A dynamic priority assignment technique for streams with (m,k)-firm deadlines [J].IEEE Transactions on Computers,1995,44(12):1443-1451 [3] Koren G,Shasha D.Skip-over:algorithms and complexity for overloaded systems that allow skips [C]//Real-Time Systems Symposium.Pisa:IEEE,1995:110-117 [4] Ramanathan P.Overload management in real-time control applications using (m,k)-firm guarantee [J].IEEE Transactions on Parallel And Distributed Systems,1999,10(6):549-559 [5] Quan G,Hu X.Enhanced fixed-priority scheduling with (m,k)-firm guarantee [C]//Real-Time Systems Symposium.Orlando:IEEE,2000:79-88 [6] Kim K H,Kim J.An energy-efficient FEC scheme for weakly hard real-time communications in wireless networks[C]//Embedded and Real-Time Computing Systems and Applications.Sydney:IEEE,2006:415-419 [7] Willig A.Scheduling multiple streams with (m,k)-firm deadlines having different importance over markovian Channels[C]//Emerging Technologies and Factory Automation.Catania:IEEE,2005:79-85 [8] Semprebom T,Montez C,Moraes R.Distributed DBP:a (m,k)-firm based distributed approach for QoS provision in IEEE 802.15.4 networks [C]//Emerging Technologies & Factory Automation.Mallorca:IEEE,2009:1-8 [9] Gilbert E N.Capacity of a burst-noise channel [J].Bell System Technical Journal,1960,39(8):1253-1265 [10] Niu Linwei,Quan gang.Energy minimization for real-time systems with (m,k)-guarantee [J].IEEE Transactions on Very Large Scale Integration Systems,2006,14(7):717-729 [11] Zheng Q,Shin K G.On the ability of establishing real-time channels in point-to-point packet-switched networks [J].IEEE Transactions on Communication,1994,42(234):1096-1105 [12] Shakkottai S,Srikant R.Scheduling real-time traffic with deadlines over a wireless channel [J].Wireless Networks,2002,8:13-26