|
|
|
|
| LEADER |
01897 am a22002653u 4500 |
| 001 |
59823 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Modiano, Eytan H.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Communications and Networking Research Group
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
|e contributor
|
| 100 |
1 |
0 |
|a Modiano, Eytan H.
|e contributor
|
| 100 |
1 |
0 |
|a Modiano, Eytan H.
|e contributor
|
| 100 |
1 |
0 |
|a Le, Long Bao
|e contributor
|
| 100 |
1 |
0 |
|a Jagannathan, Krishna Prasanna
|e contributor
|
| 700 |
1 |
0 |
|a Le, Long Bao
|e author
|
| 700 |
1 |
0 |
|a Jagannathan, Krishna Prasanna
|e author
|
| 245 |
0 |
0 |
|a Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers,
|c 2010-11-04T21:03:49Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/59823
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a Natural Sciences and Engineering Research Council of Canada
|
| 520 |
|
|
|a United States. Army Research Office (ARO Muri grant number W911NF-08-1-0238)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 43rd Annual Conference on Information Sciences and Systems, 2009. CISS 2009
|
