Name
Title | ||
|---|---|---|
Deadline-Aware Opportunistic Network Coding for Multi-Relay-Aided Single-Source Single-Destination Network. |
Abstract | ||
|---|---|---|
An opportunistic network coding (NC) scheme is proposed for the multi-relay-aided single-source single-destination network with transmission deadline. With the help of matrix analysis, the lower bound of decoding failure probability of the proposed scheme is given. Simulation results show that: 1) the proposed scheme outperforms NC based on direct recoding scheme and the lower bound is tight when the source-to-relay channel erasure probability is relatively small and 2) given fixed network parameters, the optimal number of systematic packets delivered within deadline could be determined by using the derived bound for maximizing the throughput. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2017.2721371 | IEEE Communications Letters |
Keywords | Field | DocType |
Relays,Systematics,Decoding,Network coding,Pins,Linear matrix inequalities,Throughput | Linear network coding,Upper and lower bounds,Computer science,Network packet,Computer network,Communication channel,Throughput,Decoding methods,Relay,Erasure | Journal |
Volume | Issue | ISSN |
21 | 10 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||