• DocumentCode
    2564297
  • Title

    Distributed relay selection strategy based on source-relay channel

  • Author

    Bali, Zied ; Ajib, Wessam ; Boujemaa, Hatem

  • Author_Institution
    Dept. of Comput. Sci., Univ. du Quebec a Montreal, Montréal, QC, Canada
  • fYear
    2010
  • fDate
    4-7 April 2010
  • Firstpage
    138
  • Lastpage
    142
  • Abstract
    Recent results on cooperative networks have shown great potential in their ability to improve the system performance in the presence of fading channels by using different users´ antennas. However, traditional centralized relays selection needs considerable overhead and signaling to exchange the channel state information. In this paper, we propose a simple “ Amplify and Forward” distributed method to find the best source-relay path from a set of possible cooperating relays. The method requires no communication among the relays, assumes no prior knowledge of network geometry and is based only on instantaneous source-relay wireless channel measurements. Each relay compares its source-relay SNR with a threshold and decides to participate or not to the communication independently of other relays decisions. The threshold is chosen by maximizing the probability to select only one relay. Through simulations we show that the proposed threshold method achieves high capacity gains while keeping the outage probability at a reasonable level.
  • Keywords
    MIMO communication; fading channels; relays; amplify and forward; channel state information; cooperative networks; distributed relay selection strategy; fading channels; network geometry; outage probability; source-relay channel; system performance; wireless channel measurements; Antenna arrays; Channel capacity; Channel state information; Computer science; Decoding; Delay; Fading; MIMO; Power system relaying; Relays;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications (ICT), 2010 IEEE 17th International Conference on
  • Conference_Location
    Doha
  • Print_ISBN
    978-1-4244-5246-0
  • Electronic_ISBN
    978-1-4244-5247-7
  • Type

    conf

  • DOI
    10.1109/ICTEL.2010.5478647
  • Filename
    5478647