Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks

Dept. of Electr. & Comput. Eng., Yokohama Nat. Univ.
IEEE Transactions on Information Theory (Impact Factor: 2.33). 10/2006; 52(9):4299 - 4313. DOI: 10.1109/TIT.2006.880055
Source: IEEE Xplore


The performance of two-phase collaborative communication protocols is studied for wireless networks. All the communication nodes in the cluster are assumed to share the same channel and transmit or receive collaboratively in a quasi-static Rayleigh flat-fading environment. In addition to small-scale fading, the effect of large-scale path loss is also considered. Based on a decode-and-forward approach, we consider various variable-rate two-phase protocols that can achieve full diversity order and analyze the effect of node geometry on their performance in terms of the outage probability of mutual information. For the single-relay node case, it is shown that if the collaborator node is close to the source node, a protocol based on space-time coding (STC) can achieve good diversity gain. Otherwise, a protocol based on receiver diversity performs better. These protocols are also compared with one based on fixed-rate repetition coding and their performance tradeoffs with node geometry are studied. The second part deals with multiple relays. It is known that with N relays an asymptotic diversity order of N+1 is achievable with STC-based protocols in the two-phase framework. However, in the framework of collaborative STC, those relay nodes which fail to decode remain silent (this event is referred to as a node erasure). We show that this node erasure has the potential to considerably reduce the diversity order and point out the importance of designing the STC to be robust against such node erasure

Full-text preview

Available from:
  • Source
    • "Calculation of P S k R m (e): The probability of error in the S k → R m link P S k R m (e) can be calculated following the similar steps used for the calculation of P k (e|A k ). An upper bound for P S k R m (e) can be calculated by using the union bound [16] "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we investigate the performance of a cooperative orthogonal frequency-division multiple-access (OFDMA) system with decode-and-forward (DaF) relaying. Specifically, we derive a closed-form approximate symbol-error-rate expression and analyze the achievable diversity orders. Depending on the relay location, a diversity order up to $(L_{S_{k}D} + hbox{1}) +break sum_{m = 1}^{M}min(L_{S_{k}R_{m}} + hbox{1}, L_{R_{m}D} + hbox{1})$ is available, where $M$ is the number of relays, and $L_{S_{k}D} + hbox{1}$, $L_{S_{k}R_{m}} + hbox{1}$, and $L_{R_{m}D} + hbox{1}$ are the lengths of channel impulse responses of source-to-destination, source-to- $m$th relay, and $m$th relay-to-destination links, respectively. Monte Carlo simulation results are also presented to confirm the analytical findings.
    Full-text · Article · Jun 2014 · IEEE Transactions on Vehicular Technology
  • Source
    • "The path loss is proportional to d −β where d is the propagation distance and β is the path loss coefficient [17]. Normalizing the path loss in S→D to be unity, the relative path gains of S→R and R→D links are defined as G SR = (d SD /d SR ) β and G RD = (d SD /d RD ) β [18]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study joint time delay and channel estimation for a cooperative communication system with amplify-and-forward (AF) relaying. The proposed joint estimator is based on Expectation-Maximization (EM) algorithm and presents a low-complexity solution for iterative maximum likelihood (ML) estimation. Our simulation results demonstrate that the performance of proposed cooperative system lies within 0.5dB of the genie bound (i.e., perfect knowledge of time delays and fading coefficients) at a target bit error rate of 10−4 assuming the deployment of 4 pilot symbols and 3 iterations.
    Full-text · Conference Paper · Nov 2011
  • Source
    • "where í µí°¾ is a constant that depends on the environment, and í µí¼€ is the path-loss exponent [14]. For free space path loss, this paper considers í µí¼€ = 2 and í µí°¾ = í µí°º í µí±¡ í µí°º í µí±Ÿ í µí¼† "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents the effects of relay-node ge-ometry on bit error rate (BER) performance of an amplifying and forward (AF) relay cooperative distributed wireless network. This paper considers one-source-one-destination pair and íµí± relay nodes. In addition, this paper assumes that all relay nodes share their received signals from the source node and the channel coefficients for cooperation. Then, an optimal relay-amplifying matrix is derived using the minimum mean square error (MMSE) criterion under a total power constraint at the relay nodes. Simulation results are presented using the analytically derived amplifying matrix. Index Terms—Amplify-and-forward, minimum mean square error, relay-amplifying matrix, node geometry, wireless relay networks.
    Full-text · Article · Sep 2011
Show more