Delay analysis of scheduling policies in wireless networks

We consider a class of wireless networks with general interference constraints and heterogeneous transmission rates under single-hop traffic. The delay analysis of throughput optimal (queue length based) scheduling policies in such systems is extremely difficult due to complex correlations arising between the arrival, service and the queue length process. We use the underlying interference constraints to obtain a fundamental lower bound on the delay performance of any scheduling scheme for this system. We also present upper bounds for the performance of these networks operating under the well-known maximum weighted matching (MWM) scheduling policy.