OPTIMAL BLOCKED RANDOM-ACCESS ALGORITHM FOR CDMA-RANDOM ACCESS SYSTEMS

Code-division multiple-access-random access systems are considered, Sp ecifically. th authors consider a generalised common receiver model wi th transmitter-based code assignment and study a class of random acces s algorithms known as blocked random access algorithms. it is assumed that the number of active users at the beginning of a collision resolu tion epoch is known, An appropriate state of the system and control va riables that constitute a Markovian decision process (MDP) are identif ied and it is shown that the problem of optimal collision resolution a lgorithm is equivalent to the first passage problem of this MDP. The o ptimal control actions specify the number of users to be enabled separ ately for each code. The algorithm is illustrated with numerical examp les.