Depending on where resource allocation is performed, RRM can be classified as either

centralized or distributed or hierarchical.

1. Centralized Resources Management In centralized RRM schemes, a central entity such

as an RRM server connects to all BSs and knows all the channel quality indicators (CQI) of all
users in all the subcarriers available in the system. The allocation of resources is executed by the
central entity. Some of the resources that need distribution through the central entity include
subcarriers, power applied to each subcarrier and MCSs used in each subcarrier. Although, the
centralized scheme can be used as a benchmark for performance evaluation, it has the
disadvantage of exhibiting high computational overhead due to the requirement to send the
assignment information.
2. Distributed Resources Management High signaling overhead is a characteristic of the
centralized RRM scheme. To reduce the high signaling overhead, distributed schemes were
naturally devised. In distributed schemes, no central entity is responsible for receiving all the
measurement reports from the users and BSs. Neither, is there a central entity to distribute
resources to MTs and BSs. Rather, several distributed systems share the responsibility of
resource allocation. In [29], the authors formulated distributed RRA algorithms for OFDMA
systems. 20
3. Hierarchical Resources Management In hierarchical RRM scheme, different entities are
involved in resource allocation. The different entities, such as RRM server and the BSs, are
placed in different levels of the hierarchy and share the resource allocation tasks based on its
level. Hierarchical RRM algorithms, studied in [30], offers a good trade-off between the
centralized and distributed schemes. In this dissertation the evaluation of the proposed RRA
techniques will be carried out in a single cell scenario where all resource allocation information
needed by the RRM techniques reside in the BS. This has been necessitated by the fact that, the
trend in the next generation mobile communication network require that the RRM techniques
should be executed in the BSs and not in the radio network controllers anymore, as was the case
for the Third Generation (3G) systems

Fairness function This function computes fairness according to [14] for four different scheduling
algorithms: PFS, RR, MASS and MSR. Fairness F lies between 0 < F < 1. If F = 1, then all users in the
system consume exactly their fair share of resources. If F = 0, then one user consumes all resources
allocated. Graphs of fairness versus number of users for different scenarios for the four algorithms are
plotted.

Throughput function This function computes the system throughput for different set of users according
to different algorithms PFS, RR, MASS and MSR. It then plots graphs showing throughput versus number
of users in three different scenarios for the four different algorithms. 31 Throughput and fairness versus
t parameter This function computes the system fairness and system capacity versus t parameter
according to three different algorithms, PFS, MSR and RR. Graphs showing throughput versus t
parameter and fairness versus t parameter for the three algorithms were plotted.

Delay function This function computes the probability that a user k is transmitting less than R min bits
per unit time. Graphs showing the outage probability versus delay are plotted. Outage probability in this
context means the probability that a user k is transmitting less that R min bits/time