New concatenated code schemes for data gathering in WSN's using rank metric codes
Imad El Qachchach, Abdul Karim Yazbek, Oussama Habachi, Jean‐Pierre Cances, Vahid Meghdadi · 2018
In wireless sensor networks (WSNs), data produced by sensors are usually routed through several intermediate nodes to reach the sink Base Station (BS). In fact, since a WSN is usually composed of low-cost and limited capability sensors, their transmission range prevents the establishment of a reliable communication with the sink. When an intermediate node fails, errors may occur and the message is not delivered to the sink. The reliability of the system can be increased by using Network Coding (NC) techniques. In this paper, we consider the problem of data gathering in WSNs and we propose a novel error correction mechanism using Low Rank Parity Check code (LRPC), which is known to be good at correcting burst errors, as an outer code and a convolutional code as an inner code to correct sparse errors. Furthermore, we investigate the performance of the proposed system in terms of the packet error probability and the decoding complexity. We also propose a theoretical approximation of the decoding probability for LRPC codes in the case of network coding for binary and non-binary fields. We show, through Matlab simulations, that the proposed concatenated code outperforms the proposed coding schemes in the literature for data gathering in terms of decoding rate and complexity.