Skip to main content

Table 1 Expected time required to empty the queues for different values of initial demands, under Scenarios 1-3, assuming that t he channel starts from a good state.

From: Minimum-length scheduling with rate control in wireless networks: a shortest path approach

Demands

Good Channel

Bad Channel

E [ T ]

 

r1(G)

r2(G)

r3(G)

r1(B)

r2(B)

r3(B)

 

4 6

3 0

0 3

2 2

3 0

0 3

2 2

3.00

 

3 0

0 3

2 2

2 0

0 2

1 1

3.62

 

4 0

0 4

3 3

3 0

0 3

2 2

2.79

1 0 0 1 0 0

3 0

0 3

2 2

3 0

0 3

2 2

50.00

 

3 0

0 3

2 2

2 0

0 2

1 1

66.86

 

4 0

0 4

3 3

3 0

0 3

2 2

40.25