In this project, we focus on a channel access mechanism for a multichannel time-slot scenario dubbed Blind Slotted ALOHA. It is a version of the legacy slotted ALOHA protocol in which each user picks a subchannel (SC) where to transmit its messages and, at each slot, it either keeps transmitting on the same SC (with persistence probability $p$) or chooses another SC among those left idle in the previous slot. This decision, however, is taken without any information about the success or failure of the previous transmission, from which the ``blindness" of the protocol. Despite its simplicity, the analysis of the protocol performance may become cumbersome because of the combinatorial nature of the multi-access problem. 

We have overcome this difficulty by applying the equilibrium point analysis to estimate some key performance indicators, such as throughput and age of information. The research project consists in expanding this work by adding some theoretical results and analyzing other performance indicators. This is a purely theoretical type of work, with MATLAB simulations/numerical methods to solve the equations or implement Monte Carlo methods.