Abstract
In this letter, we present a new wireless channel induced coding (WiCiC) scheme over the binary field in order to eliminate the performance loss which occurs due to not taking the channel conditions into account while determining network code coefficients. We utilize the composite channel-state matrix composed of source-to-relay and relay-to-destination channel-state matrices, as a result of the transition from the tripartite graph model to the bipartite graph model of the network. Through the use of this composite channel-state matrix, the encoding problem can be handled as a maximum flow problem owing to the max-flow min-cut theorem. The proposed WiCiC scheme has a lower decoding complexity and decoding delay compared with the benchmark studies while achieving the optimum decoding failure performance and providing user fairness. Extensive simulation results are presented to make reasonable inferences about the decoding performance of the WiCiC scheme.
Original language | English |
---|---|
Article number | 8758166 |
Pages (from-to) | 1688-1691 |
Number of pages | 4 |
Journal | IEEE Communications Letters |
Volume | 23 |
Issue number | 10 |
DOIs | |
Publication status | Published - Oct 2019 |
Bibliographical note
Publisher Copyright:© 1997-2012 IEEE.
Keywords
- Max-flow min-cut
- network coding
- outage probability
- random network coding