Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
AIDA: Adaptive application-independent data aggregation in wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Providing MAC QoS for multimedia traffic in 802.11e based multi-hop ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network
Proceedings of the 2007 ACM symposium on Applied computing
IEEE/ACM Transactions on Networking (TON)
Dynamic priority scheduling-based MAC for wireless sensor networks
International Journal of Sensor Networks
An energy-efficient real-time scheduling scheme on dual-channel networks
Information Sciences: an International Journal
A Low Power Real-Time Scheduling Scheme for the Wireless Sensor Network
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Wireless channel access reservation for embedded real-time systems
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Experiments study on a dynamic priority scheduling for wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Design of a hard real-time guarantee scheme for dual ad hoc mode IEEE 802.11 WLANs
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
| Hi-index | 0.01 |
Unpredictable wireless channel errors may cause applications with real-time traffic to receive degradedquality of services due to pac ketlosses.In the presence of such errors, a challenging problem is how toschedule packets to achieve fairness among real-timeflows and to maximize the overall system throughputsimultaneously.We capture fairness by minimizingthe maximum degradation in service over all flows.In this paper, we show that no online algorithm canguarantee a bounded performance ratio with respect tothe optimal algorithm.We then compare four differentonline algorithms and evaluate them using simulations.The first two are EDF (Earliest Deadline First) andGDF (Greatest Degradation First) that consider onlyone aspect of our scheduling goal respectively.EDFis naturally suited for maximizing throughput whileGDF seeks to minimize the maximum degradation.Thenext two are algorithms, called EOG (EDF or GDF)and LFF (Lagging Flows First), that consider the twoaspects of our scheduling goal. EOG simply combinesEDF and GDF, whereas LFF tries to favor lagging flowsin a non-trivial manner. Our simulation results showthat LFF is almost as good as EDF in maximizing thethroughput and also is better than GDF in minimizingthe maximum degradation. Finally, we also show thatthere is an optimal polynomial time algorithm for theoffline version of the problem.