A distributed cooperative product code for multi-source multi-relay single-destination wireless network

In the paper, we proposed a distributed cooperative product coding scheme, for multi-source multi-relay single-destination network. The coding is jointly coded by sources and relays in a cooperative manner in two time slots. Sources send packets with row sub-code, and then relays add redundancy rows with systematic column sub-code. The iterative decoding algorithm is used to effectively decode the received block at destination. Simulation results showed an improvement of about 2.8 dB, compared with non-cooperative soft-decode scheme. Numerical results also showed the proposed system is insensitive to power allocation and relay position. The encoding process in sources and relays are of linear complexity. As a result, it is suitable for power-limited systems like wireless sensors network. Also, the decoding algorithm at the destination(sink) node is parallel, which makes the destination decoding efficient and of low-complexity. Simulation results has shown a coarse power and/or distance planning is enough for power allocation and relays´ position.