About this document

Delay Analysis For Maximal Scheduling With Flow Control in Wireless Networks With Bursty Traffic by Nagarjuna Reddy is a document available to read on EtoBox.

This paper derives average delay bounds for one-hop Wireless Networks that use Maximal Scheduling subject to a general set of interference constraints. We show that the well known Maximal Scheduling algorithm achieves average delay that grows at most logarithmically in the largest number of interferers at any link. In the important special case when each Markov process has at most two states, we prove that average delay is independent of the number of nodes and links in the network.

Author

Nagarjuna Reddy

Language

EN