Building on the concept of retransmission diversity, a class of collision resolution protocols has been recently introduced - NDMA  and BNDMA  - using signal separation tools from array processing to resolve, as opposed to discard, collided data packets. Formal analysis of stability and maximum stable throughput for xNDMA protocols is difficult, because the associated Markov chain is non-separable multidimensional. In this paper, we tackle this problem for BNDMA. We show that BNDMA is stable if σj (λj) + maxj(λj) < 1, where λj stands for the arrival rate of the j-th user.
|Original language||English (US)|
|Number of pages||4|
|Journal||Conference Record of the Asilomar Conference on Signals, Systems and Computers|
|State||Published - Dec 1 2002|
|Event||The Thirty-Sixth Asilomar Conference on Signals Systems and Computers - Pacific Groove, CA, United States|
Duration: Nov 3 2002 → Nov 6 2002