Resolving Collisions Via Incremental Redundancy: ARQ Diversity

A cross-layer approach is adopted for the design of finite-user symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical layer model is adopted. An incremental redundancy automatic repeat request (IR-ARQ) scheme, tailored to jointly combat the effects of user collisions, multi-path fading, and channel noise, is proposed. The diversity-multiplexing-delay tradeoff of the proposed scheme is analyzed for fully-loaded queues, and compared with that of the Gallager tree algorithm for collision resolution and the network-assisted diversity multiple access (NDMA) protocol of Tsatsanis et at.. The fully-loaded queue model is then replaced by one with random arrivals, where the three protocols are compared in terms of the stability region and average delay. Overall, our analytical and numerical results establish the superiority of the proposed IR-ARQ scheme and reveal some important insights. For example, it turns out that the performance is optimized, for a given total throughput, by maximizing the probability that a certain user will send a new packet and minimizing the transmission rate employed by each user.

[1]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[2]  Hesham El Gamal,et al.  ARQ Diversity in Fading Random Access Channels , 2006, ArXiv.

[3]  Nikos D. Sidiropoulos,et al.  Stability analysis of collision resolution protocols with retransmission diversity , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Giuseppe Caire,et al.  The MIMO ARQ Channel: Diversity-Multiplexing-Delay Tradeoff , 2006, IEEE Trans. Inf. Theory.

[7]  Subrata Banerjee,et al.  Network-assisted diversity for random access wireless networks , 2000, IEEE Trans. Signal Process..

[8]  Lang Tong,et al.  Exploiting decentralized channel state information for random access , 2005, IEEE Transactions on Information Theory.

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Andrew S. Tanenbaum,et al.  Computer networks (3rd ed.) , 1996 .

[11]  George C. Polyzos,et al.  Conflict Resolution Algorithms and their Performance Analysis , 1993 .

[12]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[13]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[14]  Lang Tong,et al.  Stability and delay of finite-user slotted ALOHA with multipacket reception , 2005, IEEE Transactions on Information Theory.

[15]  Giuseppe Caire,et al.  Modulation and coding for the Gaussian collision channel , 2000, IEEE Trans. Inf. Theory.

[16]  Nikos D. Sidiropoulos,et al.  Collision resolution in packet radio networks using rotational invariance techniques , 2002, IEEE Trans. Commun..

[17]  Lizhong Zheng,et al.  Diversity-multiplexing tradeoff in multiple-access channels , 2004, IEEE Transactions on Information Theory.

[18]  Leandros Tassiulas,et al.  Wireless networks with retransmission diversity access mechanisms: stable throughput and delay properties , 2003, IEEE Trans. Signal Process..