TY - JOUR
T1 - Performance analysis of rateless codes in an aloha wireless ad hoc network
AU - Rajanna, Amogh
AU - Bergel, Itsik
AU - Kaveh, Mostafa
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2015/11
Y1 - 2015/11
N2 - In this paper, we study the performance of rateless error correction codes in a wireless ad hoc network (WANET). The salient features of a WANET are Rayleigh fading, constant power transmission, pure ALOHA as the channel access protocol, and the nodes being modeled by a homogeneous space-time Poisson point process. For such a WANET, this paper quantifies the rate density (RD) and the dynamic variations of the packet transmission time by deriving an upper bound on the CCDF of the packet transmission time. The performance of rateless codes is compared with two benchmarks, i.e., the ergodic RD (ERD) and the RD of fixed-rate codes. The proposed rateless coding scheme does not require time diversity as each packet is transmitted within a single coherence time. Yet, it is shown that the RD can be up to 76% and 50% of the ERD in noise- and interference-limited regimes, respectively. Thus, the presented network nearly achieves the ERD while requiring significantly shorter delays. This paper shows that a low-complexity Gaussian receiver with a nearest neighbor decoder has almost the performance of an ideal matched receiver. We also show that power control in the form of channel thresholding leads to a 72% gain in the RD relative to a constant power transmission.
AB - In this paper, we study the performance of rateless error correction codes in a wireless ad hoc network (WANET). The salient features of a WANET are Rayleigh fading, constant power transmission, pure ALOHA as the channel access protocol, and the nodes being modeled by a homogeneous space-time Poisson point process. For such a WANET, this paper quantifies the rate density (RD) and the dynamic variations of the packet transmission time by deriving an upper bound on the CCDF of the packet transmission time. The performance of rateless codes is compared with two benchmarks, i.e., the ergodic RD (ERD) and the RD of fixed-rate codes. The proposed rateless coding scheme does not require time diversity as each packet is transmitted within a single coherence time. Yet, it is shown that the RD can be up to 76% and 50% of the ERD in noise- and interference-limited regimes, respectively. Thus, the presented network nearly achieves the ERD while requiring significantly shorter delays. This paper shows that a low-complexity Gaussian receiver with a nearest neighbor decoder has almost the performance of an ideal matched receiver. We also show that power control in the form of channel thresholding leads to a 72% gain in the RD relative to a constant power transmission.
KW - ALOHA
KW - Ergodic Rate Density
KW - PPP
KW - Packet Transmission Time
KW - Rateless Codes
KW - WANET
UR - http://www.scopus.com/inward/record.url?scp=84959543426&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959543426&partnerID=8YFLogxK
U2 - 10.1109/TWC.2015.2450716
DO - 10.1109/TWC.2015.2450716
M3 - Article
AN - SCOPUS:84959543426
SN - 1536-1276
VL - 14
SP - 6216
EP - 6229
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 11
M1 - 7138632
ER -