Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks
Author(s)
Modiano, Eytan H.; Le, Long Bao; Jagannathan, Krishna Prasanna
DownloadLe-2009-Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks.pdf (137.9Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
This paper studies delay properties of the well-known maximum weight scheduling algorithm in wireless ad hoc networks. We consider wireless networks with either one-hop or multihop flows. Specifically, this paper shows that the maximum weight scheduling algorithm achieves order optimal delay for wireless ad hoc networks with single-hop traffic flows if the number of activated links in one typical schedule is of the same order as the number of links in the network. This condition would be satisfied for most practical wireless networks. This result holds for both i.i.d and Markov modulated arrival processes with two states. For the multi-hop flow case, we also derive tight backlog bounds in the order sense.
Date issued
2009-06Department
Massachusetts Institute of Technology. Communications and Networking Research Group; Massachusetts Institute of Technology. Department of Aeronautics and AstronauticsJournal
43rd Annual Conference on Information Sciences and Systems, 2009. CISS 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Long Bao Le, K. Jagannathan, and E. Modiano. “Delay analysis of maximum weight scheduling in wireless Ad Hoc networks.” Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on. 2009. 389-394.
© 2009Institute of Electrical and Electronics Engineers.
Version: Final published version
Other identifiers
INSPEC Accession Number: 10685256
ISBN
978-1-4244-2733-8