MD PRMA on Code‐Time‐Slots
Alex Brand, Hamid Aghvami · 2002
In chapter 8, the focus is on the performance of PRMA-based protocols (in terms of packet dropping or packet loss) when the random coding assumption made in chapter 7 is abandoned. For a simplified “perfect collision slot” channel model, i.e. a blocking-limited scenario, the performances of PRMA on time-slots only (i.e. pure TDMA), MD PRMA on code-time-slots (i.e. hybrid CDMA/TDMA) and a similar protocol on code-slots only (i.e. pure CDMA) are compared, using both fixed access control and dynamic backlog-based access control strategies (the latter through an adapted pseudo-Bayesian broadcast algorithm) for MD PRMA and a frame-based variant suitable for time-division duplexing, the impact of acknowledgement delays is assessed enhancing the “collision slot model” by accounting for multiple access interference, the benefits of a hybrid access control scheme combining load-based and backlog-based access control are assessed