Abstract

A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC) model, a common compact model in hierarchical wireless sensor networks (WSNs). The scheme uses Low-Density Parity-Check (LDPC) as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF) capacity.

Highlights

  • The demand for ubiquitous communications has motivated the deployment of a variety of wireless devices and technologies that accommodate ad hoc communications

  • As mentioned above, using Extrinsic Information Transfer Charts (EXITs), the variable-node decoder (VND) curve must be strictly greater than the reversed-axis check-node decoder (CND) curve to ensure the convergence of a propagation decoding algorithm, which requires that all the constituent codes satisfy the condition IEv (IA) > IE−c1(IA), with additional irregular Low-Density Parity-Check (LDPC) modification for all I belonging to a discrete, fine grid over (0, 1): γiS1 IESV1,i IAV, Ich

  • This study investigated a cooperative strategy based on parity-check network coding

Read more

Summary

Introduction

The demand for ubiquitous communications has motivated the deployment of a variety of wireless devices and technologies that accommodate ad hoc communications. In a two-way relay channel, the relay node combines received messages via network coding and broadcasts them to the opposite sited sources [15, 16] Such a strategy has been demonstrated to reduce the number of time slots required to exchange a packet from 4 to 2, and a significant gain in throughput. The contribution of this paper is to employ network coding with additional parity-check bits generated from the two sources’ information bits in relay nodes with linear acceptable complexity. Simulations are conducted and discussed to demonstrate the effectiveness of the network-coded cooperative strategy

System Model and Coding Strategy
Parity-Check Network Code Design
In Time Slot t1
In Time Slot t2
Cooperative Code Profile Optimization
Simulations and Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call