- Research Article
- Open access
- Published:
Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications
EURASIP Journal on Wireless Communications and Networking volume 2010, Article number: 945765 (2010)
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.
Publisher note
To access the full article, please see PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Du, B., Zhang, J. Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications. J Wireless Com Network 2010, 945765 (2010). https://doi.org/10.1155/2010/945765
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1155/2010/945765