On the Capacity Requirement of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks

We consider ad hoc wireless networks with real-time traf-fic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoreti-cal upper and lower bounds for general traffic. The bounds depend on the interference degree of the network and the max/min delay bound ratio. The performance of LDF is further evaluated using simulations and compared with two other algorithms. The simulation results show that LDF significantly outperforms the other two algorithms