Name
Abstract | ||
|---|---|---|
Cooperative peer-to-peer (P2P) repair (CPR) is an efficient way to recover the lost packets in wireless multicast system. Using network coding in CPR can further improve the transmission efficiency. However, there will be high computational overhead for random linear network coding and high optimization complexity for XOR-based network coding when the number of multicast data packet is relatively large. With regard to this problem, we propose a hybrid network coding based cooperative P2P repair scheme (HNC-CPR) with two efficient and light-weight scheduling algorithms. The HNC-CPR scheme can reduce the computational complexity while ensuring high transmission efficiency. Finally, example analyses and simulations demonstrate the efficiency and low-complexity of HNC-CPR. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s11277-017-4764-4 | Wireless Personal Communications |
Keywords | Field | DocType |
Cooperative P2P repair,Wireless network coding,Scheduling,Computational overhead | Linear network coding,Overhead (computing),Peer-to-peer,Computer science,Scheduling (computing),Network packet,Computer network,Real-time computing,Multicast,Wireless multicast,Computational complexity theory,Distributed computing | Journal |
Volume | Issue | ISSN |
97 | 4 | 0929-6212 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongjun Sun | 1 | 19 | 3.98 |
| Pengjun Zhao | 2 | 0 | 0.34 |
| Chang Zhou | 3 | 184 | 21.75 |
| Zujun Liu | 4 | 57 | 10.46 |