Throughput delay tradeoff for wireless multicast using hybrid-ARQ protocols

Authors:
Jianqi Wang;Seung Young Park;David J. Love;Michael D. Zoltowski
Affiliations:
School of Electrical and Computer Engineering, Purdue University;Department of Electrical and Electronic Engineering, Kangwon National University, Republic of Korea;School of Electrical and Computer Engineering, Purdue University;School of Electrical and Computer Engineering, Purdue University
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 7
Cited 0

Parity-based loss recovery for reliable multicast transmission

IEEE/ACM Transactions on Networking (TON)
RMDP: an FEC-based reliable multicast protocol for wireless environments

ACM SIGMOBILE Mobile Computing and Communications Review
Multicast over wireless networks

Communications of the ACM
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Cross-Layer Design Approach to Multicast in Wireless Networks

IEEE Transactions on Wireless Communications
The throughput of hybrid-ARQ protocols for the Gaussian collision channel

IEEE Transactions on Information Theory
Wireless multicast: theory and approaches

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a hybrid automatic repeat request (ARQ) scheme for wireless multicast with incremental redundancy channel coding and packet retransmission. With this scheme, we can reliably deliver the same copy of information to different users with mild delay. In addition, the design of the feedback channel for this scheme can be greatly simplified as no effort must be expended to combat cross user interference. We assume that there is always a packet for the transmitter to send whenever the channel is available. The transmitter is assumed to have a buffer of infinite length so that there is no packet-dropping. Three specific schemes are studied, including generalized slotted ALOHA (GSA), repetition time diversity (RTD), and general incremental redundancy (IR). The scaling laws of the average delay and average throughput with respect of the number of users are derived. In addition, we also derive a condition to obtain a linear scaling for both the throughput and the delay with respect to the number of users. Since every user can achieve no more than the ergodic capacity, we actually achieve the optimal scaling law in this case. Simulation results confirm our findings.