Hits:

Indexed by:期刊论文

Date of Publication:2014-12-01

Journal:INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS

Included Journals:SCIE、EI、Scopus

Volume:27

Issue:12

Page Number:3657-3675

ISSN No.:1074-5351

Key Words:network coding; wireless packet retransmission problem; Galois field GF(2); wireless networks

Abstract: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 (GF(2(q))), or the solutions on GF(2) 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 GF(2); 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 GF(2). 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 (c) 2013 John Wiley & Sons, Ltd.