Abstract
A wireless scheduling policy for real-time applications is proposed and analysed. In the short term, the policy is fairer than the near-optimal feasible earliest due date algorithm. Using the delay-model approach, a frame-level asymptotic analysis is presented. A simple and accurate approximate expression is also obtained.
| Original language | English |
|---|---|
| Pages (from-to) | 1033-1034 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 43 |
| Issue number | 19 |
| DOIs | |
| Publication status | Published - 2007 |