Greedy scheduling algorithm (GSA) – Design and evaluation of an efficient and flexible WiMAX OFDMA scheduling solution

Zubow, Anatolij; Mur, Daniel Camps; Costa, Xavier Pérez; Favaro, Paolo

doi:10.1016/j.comnet.2010.01.004

Cited by 14 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheduling techniques that consider QoS have been researched [9]. Scheduling techniques that consider QoS have been researched [9].…”

Section: Problem Formulationmentioning

confidence: 99%

Performance analysis of dynamic channel allocation based on the greedy approach for orthogonal frequency‐division multiple access downlink systems

Woo

2011

Int J Communication

View full text Add to dashboard Cite

This paper presents a performance analysis of dynamic channel allocation (DCA) based on the greedy approach (GA) for orthogonal frequency-division multiple access downlink systems over Rayleigh fading channels. The GA-based DCA achieves its performance improvement using multiuser diversity. We analyze the statistics of the number of allocable users that represents the multiuser diversity order at each allocation process. The derived statistics are then used to analyze the performance of GA-based DCA. The analysis results show that the number of subcarriers allocated to each user must be equal to achieve the maximum system performance based on outage probability and data throughput. cellular systems, the average channel gain of each user has a different value depended on the large-scale fading such as path loss. However, the effect of large-scale fading is reflected in the bandwidth assignment of each user, s m . So, this assumption is feasible for the channel allocation process.

show abstract

“…Scheduling techniques that consider QoS have been researched [9]. Scheduling techniques that consider QoS have been researched [9].…”

Section: Problem Formulationmentioning

confidence: 99%

Performance analysis of dynamic channel allocation based on the greedy approach for orthogonal frequency‐division multiple access downlink systems

Woo

2011

Int J Communication

View full text Add to dashboard Cite

show abstract

“…However, the traditional studies in operational research are not applicable for the burst construction because they focus on packing objects with fixed shapes and values [13][14][15]. Thus, a number of algorithms were proposed [10,11,[16][17][18][19][20][21]. The eOCSA algorithm proposed by So-In et al [10] constructs the first burst in the bottom right-hand corner of the available bandwidth area, and subsequently constructs another burst if the available bandwidth area above the previous burst is sufficient.…”

Section: Related Studiesmentioning

confidence: 99%

“…Thus, constructing the burst on this best edge provides the most flexibility for the following burst construction. The greedy scheduling algorithm [21] was designed in a manner similar to WLFF. However, none of the bin packing solutions considers subchannel diversity.…”

Section: Related Studiesmentioning

confidence: 99%

Two-dimensional downlink burst construction in IEEE 802.16 networks

Lai

Chen

2011

J Wireless Com Network

View full text Add to dashboard Cite

Several burst construction algorithms for orthogonal frequency division multiple access were proposed. However, these algorithms did not meet the downlink burst characteristics specified in the IEEE 802.16 standard. This article therefore proposes the best corner-oriented algorithm (BCO). BCO not only complies with downlink burst characteristics, but also considers the three issues to obtain high throughput, as follows: BCO maintains all free slots as a continuous area by constructing each burst in the corner of the available bandwidth area for minimizing external fragmentation; BCO shrinks the burst area to minimize internal fragmentation, if the requested bandwidth has been satisfied; and for exploring the continuous subchannels with good channel quality, BCO ensures that the burst adopts an optimal modulation coding scheme by selecting the excellent corner that can generate the maximal throughput. The simulation results indicate that BCO achieves 2-9 times the throughput achieved by the previous algorithms under a heavy load.

show abstract

“…Similarly, aimed to maximize the available radio resources in WiMAX, the Greedy Scheduling Algorithm (GSA) is proposed [18]. This algorithm is capable of transforming 2D WiMAX OFDMA link packing problem into 1D searching problem.…”

Section: Related Research and Proposed Solutions For Bandwidth Utilizmentioning

confidence: 99%

Resource Request Mapping Techniques for OFDMA Networks

Basholli¹,

Λάγκας²

2014

Resource Management in Mobile Computing Environments

View full text Add to dashboard Cite

Wireless broadband networks are designed to provide high quality services to multiple mobile users simultaneously. The IEEE 802.16e Mobile WiMAX standard uses Orthogonally Frequency Division Multiple Access (OFDMA) schema for frame structure. OFDMA defines rectangular resource allocation of time slots and frequency carriers, separating in this way the channel into multiple subcarriers. This structure is used for arranging the incoming user requests. Aimed to increase the bandwidth utilization, while arranging the incoming user requests into an effective way, we have considered and evaluated Bin-Packing algorithms. Subsequently in the following sections are presented analysis and design of various Bin packing algorithms developed in our simulator. Moreover, a combined algorithm is proposed, named Guillotine First Fit Algorithm and a new version of the Shelf First Fit Algorithm. Simulation's results concerning performance of implemented algorithms in different input values are gathered, analyzed and compared. The results are encouraging and provide indications regarding usage of the proposed algorithms in practice.

show abstract

Greedy scheduling algorithm (GSA) – Design and evaluation of an efficient and flexible WiMAX OFDMA scheduling solution

Cited by 14 publications

References 6 publications

Performance analysis of dynamic channel allocation based on the greedy approach for orthogonal frequency‐division multiple access downlink systems

Performance analysis of dynamic channel allocation based on the greedy approach for orthogonal frequency‐division multiple access downlink systems

Two-dimensional downlink burst construction in IEEE 802.16 networks

Resource Request Mapping Techniques for OFDMA Networks

Contact Info

Product

Resources

About