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.


The two-way relay channel with a common message. (a) The users transmit to the relay in turn; (b) The relay broadcasts to the users.
© Copyright Policy
Related In: Results  -  Collection

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

f1-sensors-15-15265: The two-way relay channel with a common message. (a) The users transmit to the relay in turn; (b) The relay broadcasts to the users.

Mentions: We first use a special case, the two-way relay channel, to illustrate the system model. We assume that there are three users U0, U1 and U2 in the network, and they have individual messages m0, m1 and m2 to share with the others. Without loss of generality, we choose user U0 to act as the relay. In the first phase, the users U1 and U2 transmit their messages m1 and m2, respectively, in turn to the relay node U0. We assume that both messages are received successfully by U0. In the second phase, i.e., the broadcast phase, the relay U0 transmits a codeword to both U1 and U2. The goal of the transmission from U0 is to convey the messages m0, m1 and m2 efficiently, so that U1 is able to reliably decode the messages m0 and m2 and U2 is able to reliably decode the messages m0 and m1. Eventually, all three users share the three messages in the network. The channel model is illustrated in Figure 1. This model is recognized as the two-way relay channel with a common message in [6].


Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

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

The two-way relay channel with a common message. (a) The users transmit to the relay in turn; (b) The relay broadcasts to the users.
© Copyright Policy
Related In: Results  -  Collection

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

f1-sensors-15-15265: The two-way relay channel with a common message. (a) The users transmit to the relay in turn; (b) The relay broadcasts to the users.
Mentions: We first use a special case, the two-way relay channel, to illustrate the system model. We assume that there are three users U0, U1 and U2 in the network, and they have individual messages m0, m1 and m2 to share with the others. Without loss of generality, we choose user U0 to act as the relay. In the first phase, the users U1 and U2 transmit their messages m1 and m2, respectively, in turn to the relay node U0. We assume that both messages are received successfully by U0. In the second phase, i.e., the broadcast phase, the relay U0 transmits a codeword to both U1 and U2. The goal of the transmission from U0 is to convey the messages m0, m1 and m2 efficiently, so that U1 is able to reliably decode the messages m0 and m2 and U2 is able to reliably decode the messages m0 and m1. Eventually, all three users share the three messages in the network. The channel model is illustrated in Figure 1. This model is recognized as the two-way relay channel with a common message in [6].

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.