Frame-level asymptotic analysis of real-time scheduling policy for wireless networks

摘要

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.