Network based Dynamic per User Threshold Scheduling to improve Packet Delivery Ratio over Threshold based Fair Scheduling

Aim: The purpose of this research is the improvisation of the Packet Delivery Ratio (PDR) of dynamic per user threshold algorithm for multi user multi input multi output (MU-MIMO) system and comparing with threshold based fair scheduling (TFS). Materials and Methods: Novel dynamic per user threshold scheduling (DPUTS) is implemented for MU-MIMO under Alamouti Space Time Block Code (STBC) transmission to improve the performance of PDR and fairness among the users. Two groups (DPUTS and TFS) are simulated for 16 iterations (each group 10 samples). Sample size estimation is done using the G Power statistical tool with probability of 80%, confidence interval of 95% and alpha of 0.05. Results: The simulation results show that at $R=15$, DPUTS has obtained a PDR value of 0.97 and TFS has obtained 0.88. Attained significance value of PDR is $p < 0.001$ (two tailed). Conclusion: It is observed from the simulation that the DPUTS performs significantly better in terms of PDR than priority resource allocation.