Abstract | ||
---|---|---|
We are concerned with designing feedback-based adaptive Instantly Decodable Network Coding (IDNC) schemes with the aim of minimizing retransmission times in wireless multicast and broadcast scenarios. In this paper, we first analyze the multiple factors influencing the transmission times and give the quantitative formula. Meantime, we introduce the concept of Cache-based Instantly Decodable Network Coding (C-IDNC) that the correctly received undecodable retransmission packets are waited in the cache for a future network decoding opportunity rather than delete. Then, we formulate the retransmission times minimization problem as an max-weight search problem and propose efficient algorithms for finding its optimal solution. Further, we propose a heuristic algorithms with worst case linear execution complexity based on sorting and iteration. Simulation results show that our proposed algorithms significantly reduce the IDNC retransmission times compared to previous works. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/ICCS.2016.7833611 | 2016 IEEE International Conference on Communication Systems (ICCS) |
Keywords | Field | DocType |
Retransmission Times,C-IDNC,Wireless Multicast and Broadcast,Network Coding | Linear network coding,Broadcasting,Heuristic,Computer science,Retransmission,Cache,Network packet,Computer network,Search problem,Decoding methods,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-5090-3424-6 | 0 | 0.34 |
References | Authors | |
11 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Teng Niu | 1 | 0 | 0.68 |
Dongmei Zhang | 2 | 1439 | 132.94 |
Kui Xu | 3 | 61 | 11.07 |
Fei Wang | 4 | 125 | 45.09 |