Title | ||
---|---|---|
Minimizing Completion Time for Relay-Assisted Multicast With Instantly Decodable Network Coding. |
Abstract | ||
---|---|---|
We propose a selective retransmission (SR) protocol for relay-assisted multicast systems with instantly decodable network coding (IDNC). Our protocol consists of three stages, the initial transmission stage, selective retransmission stage, and relay retransmission stage. To reduce the computational complexity, weighted packet scheduling (WPS) algorithm, which is used to select coded packets in greed manner has been presented. The object of our protocol and algorithm is to maximize transmission gain so as to minimize completion time. The simulation results indicate that our new SR-WPS scheme achieves good performance in terms of block completion time. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/LCOMM.2016.2518163 | IEEE Communications Letters |
Keywords | Field | DocType |
Relays,Protocols,Scheduling algorithms,Encoding,Schedules,Feeds,Decoding | Linear network coding,Scheduling (computing),Computer science,Retransmission,Network packet,Computer network,Real-time computing,Decoding methods,Multicast,Relay,Computational complexity theory | Journal |
Volume | Issue | ISSN |
20 | 3 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
liang gou | 1 | 2 | 1.39 |
Gengxin Zhang | 2 | 29 | 13.80 |
Zhengguo Bian | 3 | 0 | 0.68 |
Dongming Bian | 4 | 21 | 8.58 |
Zhidong Xie | 5 | 10 | 4.94 |