Network coding-based block acknowledgement scheme for wireless regenerative relay networks
Author(s) -
QuocTuan Vien,
Jinho Choi,
Brian Stewart,
Huaglory Tianfield,
Huan X. Nguyen
Publication year - 2012
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2011.0681
Subject(s) - relay , acknowledgement , linear network coding , computer science , network packet , computer network , block (permutation group theory) , throughput , wireless , wireless network , telecommunications , mathematics , power (physics) , physics , geometry , quantum mechanics
This paper is concerned with block acknowledgement (ACK) mechanisms in wireless regenerative relay networks. In an N-relay network, a total of (2N+1) block ACK packets is required to acknowledge the data transmission between source and destination nodes via the N-relay nodes. In this paper, the authors propose a block ACK scheme based on network coding (NC) to significantly reduce the ACK overheads by N block ACK packets. In addition, this achieves a reduction of N(N-1) computational operators. Particularly, we derive the error probability of the determination of the packets to be retransmitted at the source and relays, which shows that the NC-based scheme also improves the reliability of block ACK transmissions. Furthermore, asymptotic signal-to-noise (SNR) scenarios for forward links are considered and a general expression of error probability in multi-relay networks is derived for each SNR scenario. Finally, simulation results are presented to verify the analytical findings and demonstrate a lower number of data retransmissions for a higher system throughput.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom