Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Small Parity-Check Erasure Codes " Exploration and Observations
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
| Hi-index | 0.00 |
We introduce simple yet efficient ARQ protocols in conjunction with two types of anti-jamming coding techniques - rateless coding and piecewise coding - for cognitive radios. For piecewise coding, we propose to employ systematic codes to facilitate efficient selected retransmissions and design short codes to maximize secondary user throughput. For rateless coding, we consider a protocol that transmits new parity packets during retransmission and show that this scheme is stable if the jamming rate of the system is within a certain range. For both anti-jamming coding schemes, the corresponding simple ARQ protocols provide significant improvement in secondary user throughput. Moreover, the piecewise coding together with its ARQ protocol offers similar or better throughput performance compared with the rateless coding counterpart, without incurring the stability issue.