A Survey on Cooperative Diversity for Wireless Networks

IEEE Communications Surveys &amp Tutorials (Impact Factor: 6.81). 01/2012; 14(99):1 - 14. DOI: 10.1109/SURV.2011.082611.00047
Source: IEEE Xplore


Diversity, i.e. transmitting multiple replicas of a signal, may mitigate fading in wireless networks. Among other diversity techniques, the space diversity of multi-antenna systems is particularly interesting since it can complement other forms of diversity. The recent cooperative diversity paradigm brings the advantages of multi-antenna space diversity to single antenna networked devices, which, through cooperation and antenna sharing, form virtual antenna arrays. However, cooperative diversity is a complex technique and research on this topic is still in its early stages. This paper aims at providing a general survey on the theoretical framework; and the physical and medium access control proposals in the literature.

Download full-text


Available from: Felipe Gomez Cuba, Jun 17, 2014
  • Source
    • "Cooperative communication by exploiting spatial diversity through distributed neighbors, called relays, is emerging as one of the most promising paradigms to combat wireless fading in single-antenna networks. Among various relaying protocols for cooperative communication, the two most popular are amplify-and-forward (AnF) and decode-and-forward (DnF) [1]. In addition, a relay can operate in either halfduplex (HD) or full-duplex (FD) modes. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates single relay selection problem for secure communication in a cooperative system with multiple full-duplex decode-and-forward relays, in which an eavesdropper may overhear the source confidential message through relays' transmission. We propose an opportunistic relay selection scheme which selects the relay that maximizes the system secrecy capacity. We then evaluate performance of the proposed scheme in terms of secrecy outage probability. As a comparison, we also derive the secrecy outage probability of the conventional Max-Min relay selection scheme proposed for full-duplex relaying systems without the existence of eavesdroppers. We show that our proposed scheme outperforms the conventional counterpart. Our analytic derivations are also extensively verified by Monte-Carlo simulations.
    7th IEEE International Workshop on Information Forensics and Security, Rome, Italy; 11/2015
  • Source
    • "Moreover, BS can also act as relays for the legacy network as well as for its own subscribed users. Cooperative diversity appeared as a way to combat the effects of the fading, by allowing a single antenna user to experience spatial diversity [5]. Such schemes perform even better when the relay operates in a FD fashion [6]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating in either half- or full-duplex mode -- are scattered according to a two-dimensional homogeneous Poisson point process to compute the relay selection cost by using a semi-Markov process. Our results show: ($i$) fixed relay outperforms the reactive option in either cases, ($ii$) the performance of both reactive and fixed relay strategies depends on the self-interference attenuation in full-duplex scenarios, evincing when they outperform the half-duplex option, and ($iii$) the reactive relay selection suffers from selecting relays at hop basis, while the fixed relay selection benefits most from the full-duplex communication.
  • Source
    • "Let D > 0 be the distance from the aggregator to the central unit, assuming that there exist in-between relay nodes employing a decode-and-forward strategy [12]. We consider that the relay nodes are deployed in the straight line defined by the aggregator and the central unit such that the distance d > 0 between any two nodes is the same. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitimate link. The communication design problem posed here is how to maximize the multi-hop throughput from the aggregator to the control unit by finding the best combination of relay positions (i.e. hop length: short or long) and coding rates (i.e. high or low spectral efficiency) so that the secrecy constraint is satisfied. Using a stochastic-geometry approach, we show that the optimal choice of coding rate depends only on the path- loss exponent and is normally high while greater number of shorter hops are preferable to smaller number of longer hops. For the scenarios of interest, we prove that the optimal throughput subject to the secrecy constraint achieves the unconstrained optimal performance if a feasible solution exists.
Show more