Many-to-many space-time network coding for amplify-and-forward cooperative networks: node selection and performance analysis

Abstract

In this paper, the multinode amplify-and-forward cooperative communications for a network of N nodes is studied via the novel concept of many-to-many space-time network coding (M2M-STNC). Communication under the M2M-STNC scheme is performed over two phases: (1) the broadcasting phase and (2) the cooperation phase. In the former phase, each node broadcasts its data symbol to all the other nodes in the network in its allocated time slot, while in the latter phase, simultaneous transmissions from N − 1 nodes to a destination node take place in their time slot. In addition, the M2M-STNC scheme with optimal node selection (i.e., M2M-STNC-ONS) is proposed. In this scheme, the optimal relay node is selected based on the maximum harmonic mean value of the source, intermediate, and destination nodes' scaled instantaneous channel gains. Theoretical symbol-error-rate analysis for M-ary phase shift keying (M-PSK) modulation is derived for both the M2M-STNC and M2M-STNC-ONS schemes. Also, the effect of timing synchronization errors and imperfect channel state information on the SER performance and achievable rates is analytically studied. It is shown that the proposed M2M-STNC-ONS scheme outperforms the M2M-STNC scheme and is less sensitive to timing offsets and channel estimation errors. It is envisioned that the M2M-STNC-ONS scheme will serve as a potential many-to-many cooperative communication scheme with applications spanning sensor and mobile ad hoc networks.

A matching-theoretic approach to energy-efficient partner selection in wireless networks

“…, N} and all network nodes are assumed to be half-duplex single-antenna amplify-and-forward nodes. Additionally, each node U i is assigned a signature waveform c i (t) for multiuser transmission and detection, where it is assumed that each node knows the signature waveform of all other nodes [7]. The cross-correlation coefficient between waveforms c i (t) and c j (t) is denoted ρ i,j , where 0 ≤ ρ i,j ≤ 1 for i = j, and ρ i,i = 1, ∀i ∈ {1, 2, .…”

“…Furthermore, n i,d (t) and n i,d (t) are the zero-mean N 0 −variance complex AWGN processes at node U j and the destination, respectively. The end-to-end signal-to-noise ratio (SNR) of the received signal at the destination is given by [7] γi = EB i |hi,d| 2 N0 .…”

“…Assuming that ρ i,j = ρ, ∀i = j, then after passing the received signal through a matched-filter bank (MFB), the decorrelated signal of U i relayed by U j can be shown to be [7] yi,j,d = EB i EC j,i hi,jhj,dβi,jxi + ni,j,d,…”

HCOR: a high-throughput coding-aware opportunistic routing for inter-flow network coding in wireless mesh networks

“…Since then, many various studies have proved the benefits of network coding [10,11] and given many coding methods to achieve the gain of network coding for different networks [12][13][14][15][16][17]. For inter-flow network coding, COPE [18] was proposed in 2008 as the first practical XOR (exclusive or)-based network coding scheme.…”

Topology-aware space-time network coding

“…A step towards increasing the capacity of the previous approach was taken in [2] and in [3], where the authors propose that each relay decodes the transmission not only from the source nodes but also from the previous relays. Furthermore, the source nodes can also be used as relays, avoiding in this way the deployment of relays, as proposed in clustering-based STNC [4] and optimal node selection-based STNC schemes [5].…”