TY - GEN
T1 - Combined fountain code with network coding for error-tolerant transmission network
AU - Yang, Jing
AU - An, Jianping
PY - 2009
Y1 - 2009
N2 - Network coding can achieve the maximum possible rate defined by the max-flow min-cut theorem through encoding of the input streams at the correlative nodes under the ideal channel condition. When error happens, encoding will bring in error propagation. By introducing redundancies in space domain, network error correction is proposed, however, with the high encoding and decoding complexity. Specifically, fountain code is a rateless code, since the rate varies according to the instant channel state information contrast to the typical fixed-rate code. Based on the fountain code, the error-tolerant network coding scheme is proposed by means of integrating fountain code with network coding at the correlative nodes. Simulation results show that the proposed scheme can obtain the lower block error rate (BLER) in butterfly and wireless network, compared with detect and forward scheme. Furthermore, it also reduces the energy consumption at the same time.
AB - Network coding can achieve the maximum possible rate defined by the max-flow min-cut theorem through encoding of the input streams at the correlative nodes under the ideal channel condition. When error happens, encoding will bring in error propagation. By introducing redundancies in space domain, network error correction is proposed, however, with the high encoding and decoding complexity. Specifically, fountain code is a rateless code, since the rate varies according to the instant channel state information contrast to the typical fixed-rate code. Based on the fountain code, the error-tolerant network coding scheme is proposed by means of integrating fountain code with network coding at the correlative nodes. Simulation results show that the proposed scheme can obtain the lower block error rate (BLER) in butterfly and wireless network, compared with detect and forward scheme. Furthermore, it also reduces the energy consumption at the same time.
KW - Error-tolerant
KW - Fountain code
KW - Max-flow min-cut theorem
KW - Network coding
UR - http://www.scopus.com/inward/record.url?scp=73149111957&partnerID=8YFLogxK
U2 - 10.1109/WICOM.2009.5304114
DO - 10.1109/WICOM.2009.5304114
M3 - Conference contribution
AN - SCOPUS:73149111957
SN - 9781424436934
T3 - Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
BT - Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
T2 - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
Y2 - 24 September 2009 through 26 September 2009
ER -