Name
Abstract | ||
|---|---|---|
AbstractSolving wireless packet retransmission problem WPRTP using network coding NC is increasingly attracting research efforts. However, existing NC-based schemes for WPRTP are with high computational complexity resulting from computation on larger Galois field GF2q, or the solutions on GF2 found by the schemes are less efficient. In this paper, combining the basic ideas in two existing schemes, denoted as ColorNC and CliqueNC, respectively, we present a new scheme named as ColorCliqueNC. The advantages of ColorCliqueNC include the following: i it is suitable for all kinds of WPRTP instances; ii it works on GF2; thus, it is computationally efficient than the schemes working on larger Galois fields; and iii the solutions found by ColorCliqueNC usually have fewer packet retransmissions than those by ColorNC and CliqueNC despite that they all work on GF2. Theoretical analysis indicates that ColorCliqueNC is superior to ColorNC and CliqueNC. Simulation results show that ColorCliqueNC generally outperforms ColorNC and CliqueNC. Compared with ColorNC, ColorCliqueNC can save up to 10% packet retransmissions. Copyright © 2013 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/dac.2565 | Periodicals |
Keywords | Field | DocType |
network coding, wireless packet retransmission problem, Galois field GF(2), wireless networks | Linear network coding,Wireless network,Finite field,Wireless,Computer science,Retransmission,Network packet,Computer network,Galois theory,Computational complexity theory | Journal |
Volume | Issue | ISSN |
27 | 12 | 1074-5351 |
Citations | PageRank | References |
1 | 0.41 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenguo Gao | 1 | 50 | 7.09 |
| Weidong Xiang | 2 | 1 | 0.41 |
| Guozhen Tan | 3 | 1 | 0.74 |
| Nianmin Yao | 4 | 159 | 21.57 |
| Peihua Li | 5 | 466 | 37.53 |