Stability and maximum stable throughput of blind retransmission diversity multiple access

Building on the concept of retransmission diversity, a class of collision resolution protocols has recently been introduced - NDMA (network-assisted diversity multiple access) (see Tsatsanis, M. et al., IEEE Trans. Sig. Processing, vol.48, no.3, p.702-11, 2000) and BNDMA (blind NDMA) (see Zhang, R. et al., IEEE Trans. on Commun., vol.50, no.1, p.146-55, 2002) - using signal separation tools from array processing to resolve, as opposed to discard, collided data packets. Formal analysis of the stability and maximum stable throughput for xNDMA protocols is difficult, because the associated Markov chain is non-separable multidimensional. We tackle this problem for BNDMA. We show that BNDMA is stable if /spl Sigma//sub j/(/spl lambda//sub j/)+max/sub j/(/spl lambda//sub j/)<1, where /spl lambda//sub j/ stands for the arrival rate of the j-th user.