Limits...
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

Si Z, Ma J, Thobaben R - Sensors (Basel) (2015)

Bottom Line: In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding.Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes.Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

View Article: PubMed Central - PubMed

Affiliation: Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), 100876 Beijing, China. sizhongwei@bupt.edu.cn.

ABSTRACT
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

No MeSH data available.


Multi-edge-type LDPC codes.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4541830&req=5

f3-sensors-15-15265: Multi-edge-type LDPC codes.

Mentions: An MET nested LDPC code can be illustrated by the Tanner graph in Figure 3. The bit vector associated with the variable nodes V, i.e., the codeword, is denoted by X. There are K types of check nodes in the graph, C0, C1, …, Cl …, Ck−1. The parity-check matrices, which correspond to the K types of edges connecting the variable nodes and the different types of check nodes, are denoted by H0, H1, …, Hl, …, Hk-1, and have variable and check node degrees (dv0, dc0), (dv1, dc1), …, (dvl, dcl), …, (dvk−1, dck−1), respectively. The MET nested LDPC code can be described by the stacked parity-check matrix H, and we have:(2)HXT=[H0H1⋮HK−1]XT=0The definition of a multi-edge-type nested LDPC code ensemble is given in the following.


Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

Si Z, Ma J, Thobaben R - Sensors (Basel) (2015)

Multi-edge-type LDPC codes.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4541830&req=5

f3-sensors-15-15265: Multi-edge-type LDPC codes.
Mentions: An MET nested LDPC code can be illustrated by the Tanner graph in Figure 3. The bit vector associated with the variable nodes V, i.e., the codeword, is denoted by X. There are K types of check nodes in the graph, C0, C1, …, Cl …, Ck−1. The parity-check matrices, which correspond to the K types of edges connecting the variable nodes and the different types of check nodes, are denoted by H0, H1, …, Hl, …, Hk-1, and have variable and check node degrees (dv0, dc0), (dv1, dc1), …, (dvl, dcl), …, (dvk−1, dck−1), respectively. The MET nested LDPC code can be described by the stacked parity-check matrix H, and we have:(2)HXT=[H0H1⋮HK−1]XT=0The definition of a multi-edge-type nested LDPC code ensemble is given in the following.

Bottom Line: In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding.Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes.Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

View Article: PubMed Central - PubMed

Affiliation: Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), 100876 Beijing, China. sizhongwei@bupt.edu.cn.

ABSTRACT
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

No MeSH data available.