Articles uploaded in MyJurnal |
|
|
View Article |
Scheduling algorithm for multi-user diversity in urban area
Hamizah Mohd Mahayudin1, Nur Idora Abdul Razak2, Mohd Syarhan Idris3.
Generally knew that population density in the city is coupled with an increase in
ownership of smart phones equipped with a wireless system which allows everyone to
have access to the internet at any time anywhere. However, most of the wireless cellular
network depending on the network to reliably and efficiently distribute data to a large
number of users. We demystify the problem of radio resource sharing by users with
different requirements. We present four types of scheduling algorithm which is adopted
for allocating system resource. Here we will analyze the wireless connection attribute
such as fairness, throughput and delay occur during users demanding for different
services. Max Rate and Round Robin algorithm were used as a reference for analysing
throughput and fairness respectively. Meanwhile, Proportionally Fair Scheduling and rate
Craving Greedy attain in the concept of multiuser diversity by improving the throughput
without deal fairness. Our scope is based on the urban area and pedestrian uses
because only one fading channel that were used – Filtered Gaussian Noise. Common
technique that used to transmit signals in wireless is OFDM. The performance of these
algorithms is analyzed and compared through MATLAB computer simulations.
Affiliation:
- Universiti Teknologi MARA, Malaysia
- Universiti Teknologi MARA, Malaysia
- Universiti Teknologi MARA, Malaysia
Download this article (This article has been downloaded 126 time(s))
|
|
Indexation |
Indexed by |
MyJurnal (2021) |
H-Index
|
6 |
Immediacy Index
|
0.000 |
Rank |
0 |
Indexed by |
Scopus 2020 |
Impact Factor
|
CiteScore (1.4) |
Rank |
Q3 (Engineering (all)) |
Additional Information |
SJR (0.191) |
|
|
|
|
|