Abstract:
The massive multiple-input multiple-output (MIMO) has great potential to manage fast growth of wireless data traffic. As the number of user equipment (UEs) increases, while each UE intermittently accesses the network, the random access functionality becomes essential as the number of pilots remains very limited. This dissertation work focuses on random access problem in massive MIMO context. A re-engineered protocol named Strongest User Collision Resolution (SUCRe) has been developed and its performance has been verified over different fading scenarios starting from the basic Rayleigh to more
realistic channels like eta-mu and kappa-mu channels. In a crowded urban scenario where more than one UEs will be contending for the same pilot, access will be given to UE with the strongest signal at the receiver. The simulations which are done on
MATLAB 2018b show that this protocol resolves the majority of pilot collisions occurring in the crowded urban scenario and continues to admit UEs efficiently in overloaded networks.Once its collision resolution capability has been verified on a simple fading case, its performance is tested on other more realistic channels (Rician, Hoyt, Nakagami-m, eta-mu, kappa-mu, and alpha-mu channels) and the comparative analysis is done.
