Abstract
In an automatic repeat request (ARQ) scheme, a packet is retransmitted if it gets corrupted due to transmission errors caused by the channel. Here we describe a ready-to-implement ARQ scheme with packet combining. An analytical description of the scheme in random error channel shows excellent agreement with simulation results. An upper bound for type-II schemes is defined. For smaller packet sizes, throughput of the proposed scheme is sufficiently close to the upper bound till a very high bit error rate.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
