Skip to main content

Table 1 Comparisons among related studies

From: Two-dimensional downlink burst construction in IEEE 802.16 networks

Author

Year

Solution

Complexity

Requested bandwidth

Shape of DL burst

Subchannel diversity

Sheu et al. [3]

2007

Hungary algorithm

O(M4)

No

No

Yes

Chen et al. [4]

2006

DFS

O(Li)

No

No

Yes

Toufik and Knopp [5]

2004

Max-min allocation

O(M3)

No

No

Yes

Najeh et al. [6]

2005

Greedy

O(LM)

No

No

Yes

Kivanc et al. [7]

2003

 

O(LM)

No

No

Yes

Ergen et al. [8]

2003

 

O(LM)

Yes

No

Yes

So-In et al. [10]

2009

Sequentially construct bursts from one side to another

O(L2)

No

Yes

No

Sarigiannidis et al. [16]

2010

 

O(L2)

No

Yes

No

Erta et al. [17]

2007

 

O(LM)

No

Yes

No

Ohseki et al. [18]

2007

 

O(LM)

Yes

Yes

No

Cicconetti et al. [19]

2010

 

O(L2)

No

Yes

No

Eshanta et al. [20]

2011

 

O(L2)

No

Yes

No

Wang et al. [11]

2008

WLFF

O(L2)

No

Yes

No

Zubow et al. [21]

2010

GSA

O(L2)

No

Yes

No

  1. L, number of connections; M, number of subchannels; i, maximum number of repetition.