An enhanced XOR-based scheme for wireless packet retransmission problem

Solving 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.

[1]  Yunnan Wu,et al.  The Local Mixing Problem , 2006 .

[2]  Qunfeng Dong,et al.  Practical network coding in wireless networks , 2007, MobiCom '07.

[3]  Li Pei Network coding based reliable multicast for wireless Ad hoc networks , 2008 .

[4]  Yunnan Wu,et al.  Reduced-complexity network coding for multicasting over ad hoc networks , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[5]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[6]  Dong Nguyen,et al.  Wireless Broadcast Using Network Coding , 2009, IEEE Transactions on Vehicular Technology.

[7]  Meng Wu,et al.  Compressed error and erasure correcting codes via rank-metric codes in random network coding , 2012, Int. J. Commun. Syst..

[8]  Klara Nahrstedt,et al.  Random Network Coding Based Schemes for Perfect Wireless Packet Retransmission Problems in Multiple Channel Networks , 2013, Wirel. Pers. Commun..

[9]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[10]  Jing Zhao,et al.  Random network coding-based optimal scheme for perfect wireless packet retransmission problems , 2013, Wirel. Commun. Mob. Comput..

[11]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[12]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

[13]  Wei Liang,et al.  Securing sensor data storage and query based on k‐out‐of‐ n coding , 2013, Int. J. Commun. Syst..

[14]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[15]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[16]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

[17]  Xiang Li,et al.  Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach , 2012, Wirel. Pers. Commun..

[18]  Meng Wu,et al.  Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding , 2013, Int. J. Commun. Syst..