enormous speed communication networks become a persistent need nowadays due to the huge
traffic demand. Hence, researchers direct their interests towards 5G networks to tackle these
needs. Immigration to millimeter Wave (mmWave) band, i.e., 60 GHz band, seems to be a
promising candidate to enable 5G networks because it has a wide unlicensed available
spectrum. However, it faces big technical challenges that impede its work. MmWave signal is
highly attenuated in space due to propagation and penetration losses. Also, mmWave faces the
issue of high blocking probability due to human shadowing. Hence, directional transmission
with phased antenna array is defined by IEEE 802.11 ad standard as a beamforming training
(BT) process to overcome these issues and increase mmWave beam gain. However, BT is
highly complicated and needs long setup time to find out the mmWave beam that obtains the
maximum received power. Also, IEEE 802.11ad proposes using scheduled medium access
control (MAC) based on time division multiple access (TDMA) to share radio resources among
active mmWave users but it didn’t define a certain scheduling scheme to be used. Thus, a
performance evaluation of scheduling schemes is needed before implementing one of them in
mmWave network. Moreover, in concurrent transmission (CT) scenarios, selecting the
mmWave concurrent links that maximizing the total system data rate is another big problem.
Because, BT process is performed with no knowledge about mutual interference between
concurrent links hence losing the chance to select low interfering concurrent beams that provide
high data rate to the end user. In this thesis, a performance evaluation of different scheduling
schemes, e.g., round robin and proportional fairness scheduling, is studied in mmWave
networks under different mmWave channel conditions, i.e., with different blocking probability
scenarios, and various mmWave beamwidths regarding the total system data rate and fairness
between users. Also, the problem of selecting multiple mmWave concurrent links in downlink
scenario in wireless local area network is discussed. Where, a joint proportional fairness
scheduling (JPFS) optimization problem is formulated to maximize the total system data rate
with obtaining acceptable fairness among users. Then, an iterative search based JPFS is
proposed to find out a sub-optimal solution to this problem with a very low complexity
comparable to exhaustively search based scheme. This reduction in complexity is proven using
numerical analysis.