Full Text:
<2630>
CLC number: TN915
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 2010-05-31
Cited: 1
Clicked: 7920
Retransmission in the network-coding-based packet network
| |||||||||||||
Zheng Wang, Hui-fang Chen, Lei Xie, Kuang Wang. Retransmission in the network-coding-based packet network[J]. Journal of Zhejiang University Science C, 2010, 11(7): 544-554.
@article{title="Retransmission in the network-coding-based packet network",
author="Zheng Wang, Hui-fang Chen, Lei Xie, Kuang Wang",
journal="Journal of Zhejiang University Science C",
volume="11",
number="7",
pages="544-554",
year="2010",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.C0910475"
}
%0 Journal Article
%T Retransmission in the network-coding-based packet network
%A Zheng Wang
%A Hui-fang Chen
%A Lei Xie
%A Kuang Wang
%J Journal of Zhejiang University SCIENCE C
%V 11
%N 7
%P 544-554
%@ 1869-1951
%D 2010
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.C0910475
TY - JOUR
T1 - Retransmission in the network-coding-based packet network
A1 - Zheng Wang
A1 - Hui-fang Chen
A1 - Lei Xie
A1 - Kuang Wang
J0 - Journal of Zhejiang University Science C
VL - 11
IS - 7
SP - 544
EP - 554
%@ 1869-1951
Y1 - 2010
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.C0910475
Abstract: In this paper, retransmission strategies of the network-coding-based packet network are investigated. We propose two retransmission strategies, the packet-loss-edge-based retransmission strategy (PLERT) and the minimum retransmission strategy (MRT), which focus on optimizing the retransmission efficiency without the constraint on the encoding field size. We compared the performances of the proposed retransmission strategies with the traditional automatic repeat-request (ARQ) strategy and the random retransmission strategy. Simulation results showed that the PLERT strategy works well when the packet loss rate is small. Among these retransmission strategies, the performance of the MRT strategy is the best at the cost of the high complexity that is still polynomial. Furthermore, neither of the proposed strategies is sensitive to the encoding field size.
[1]Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W., 2000. Network information flow. IEEE Trans. Inform. Theory, 46(4):1204-1216.
[2]Cai, N., Yeung, R.W., 2006. Network error correction, part II: lower bounds. Commun. Inform. Syst., 6(1):37-54.
[3]Chou, P.A., Wu, Y., Jain, K., 2003. Practical Network Coding. 41st Allerton Conf. on Communication, Control, and Computing, p.1-10.
[4]Ghaderi, M., Towsley, D., Kurose, J., 2008. Reliability Gain of Network Coding in Lossy Wireless Networks. 27th IEEE Conf. on Computer Communications, p.2171-2179.
[5]Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B., 2006. A random linear network coding approach to multicast. IEEE Trans. Inform. Theory, 52(10):4413-4430.
[6]Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.M.G.M., 2005. Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theory, 51(6):1973-1982.
[7]Koetter, R., Kschischang, F.R., 2008. Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory, 54(8):3579-3591.
[8]Koetter, R., Médard, M., 2003. An algebraic approach to network coding. IEEE/ACM Trans. Network., 11(5):782-795.
[9]Larsson, P., Johansson, N., 2006. Multi-User ARQ. 66th IEEE Vehicular Technology Conf., p.2052-2057.
[10]Li, S.Y.R., Yeung, R.W., Cai, N., 2003. Linear network coding. IEEE Trans. Inform. Theory, 49(2):371-381.
[11]Luby, M., 2002. LT Codes. 43rd Annual IEEE Symp. on Foundations of Computer Science, p.271-280.
[12]Lun, D.S., Médarda, M., Koetter, R., Effros, M., 2008. On coding for reliable communication over packet networks. Phys. Commun., 1(1):3-20.
[13]Maymounkov, P., Harvey, N., Lun, D., 2006. Methods for Efficient Network Coding. 44th Annual Allerton Conf. on Communication, Control, and Computing, p.1-10.
[14]Nguyen, D., Tran, T., Nguyen, T., Bose, B., 2009. Wireless broadcast using network coding. IEEE Trans. Veh. Technol., 58(2):914-925.
[15]Shokrollahi, A., 2006. Raptor codes. IEEE Trans. Inform. Theory, 52(6):2551-2567.
[16]Silva, D., Kschischang, F.R., Koetter, R., 2008. A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory, 54(9):3951-3967.
[17]Sundararajan, J.K., Shah, D., Médard, M., 2008. ARQ for Network Coding. IEEE Int. Symp. on Information Theory, p.1651-1655.
[18]Sundararajan, J.K., Shah, D., Médard, M., Mitzenmacher, M., Barros, J., 2009. Network Coding Meets TCP. 28th IEEE Conf. on Computer Communications, p.280-288.
[19]Wu, X., Zhao, C., You, X., 2008. Generation-Based Network Coding over Networks with Delay. IFIP Int. Conf. on Network and Parallel Computing, p.365-368.
[20]Yeung, R.W., Cai, N., 2006. Network error correction, part I: basic concepts and upper bounds. Commun. Inform. Syst., 6(1):19-36.
[21]Yeung, R.W., Li, S.Y.R., Cai, N., Zhang, Z., 2005. Network coding theory. Found. Trends Commun. Inform. Theory, 2(4-5):241-381.
[22]Zhang, Z., 2008. Linear network error correction codes in packet networks. IEEE Trans. Inform. Theory, 54(1):209-218.
[23]Zheng, Z., Sinha, P., 2007. XBC: XOR-Based Buffer Coding for Reliable Transmissions over Wireless Networks. 4th Int. Conf. on Broadband Communications, Networks, and Systems, p.76-85.
Open peer comments: Debate/Discuss/Question/Opinion
<1>