• DocumentCode
    3548088
  • Title

    Relay selection scheme for cooperative communication networks using contract theory

  • Author

    Nazari, Bahareh ; Jamalipour, Abbas

  • Author_Institution
    Sch. of Electr. & Inf. Eng., Univ. of Sydney, Sydney, NSW, Australia
  • fYear
    2013
  • fDate
    29-31 Aug. 2013
  • Firstpage
    757
  • Lastpage
    762
  • Abstract
    Precise resource allocation such as best relay selection or optimum power allocation improves performance in cooperative communications. In this paper, we propose a strategy to select the best relay nodes in decode-and-forward parallel cooperative relay networks.We apply a contract theoretic framework over the wireless system to formulate an incentive compatible contract. The designed contract would not just stimulate relays to cooperate, but also incite relays to reveal their channel state information in a trustworthy manner. The proposed relay selection scheme is based upon minimizing the cost for the source node to send data to the destination node. However, the source node wishes to maintain a certain transmission rate to the destination node, although there is a constraint imposed on each relay node´s power. Simulation results show that the proposed scheme can improve utility of the source node, compared with the nearest neighbor relay selection algorithm.
  • Keywords
    cooperative communication; decode and forward communication; relay networks (telecommunication); best relay nodes; channel state information; contract theory; cooperative communication networks; decode-and-forward parallel cooperative relay networks; incentive compatible contract; optimum power allocation; relay selection scheme; resource allocation; wireless system; Algorithm design and analysis; Antennas; Contracts; Relays; cooperative system; relay; relay selection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (APCC), 2013 19th Asia-Pacific Conference on
  • Conference_Location
    Denpasar
  • Print_ISBN
    978-1-4673-6048-7
  • Type

    conf

  • DOI
    10.1109/APCC.2013.6766050
  • Filename
    6766050