• DocumentCode
    73577
  • Title

    Formation of network coding coalitions for cooperative communications

  • Author

    Dapeng Li ; Wei Zhong

  • Author_Institution
    Dept. of Commun. Eng., Nanjing Univ. of Posts & Telecommun., Nanjing, China
  • Volume
    3
  • Issue
    2
  • fYear
    2014
  • fDate
    Jun-14
  • Firstpage
    97
  • Lastpage
    109
  • Abstract
    Recent results have shown that employing NC may have an adverse effect and dimmish the advantage of NC in CC because of the existence of NC noise. The authors propose space network- coded cooperation (SNCC) in which sources transmit in turn, and relays overhear and process the data they have received from different sources. Then, they broadcast the coded data to corresponding destinations in a single time instance. In this spirit, NC can be viewed as being performed in the space, and each destination can average the NC noise that comes from different relays. The authors derive a closed-form expression for the NC noise of SNCC, and show that SNCC has a potential to significantly reduce the NC noise if sessions in the network are well organised into disjoint groups/coalitions to use SNCC. Towards the end, the formation of SNCC coalitions is interpreted as a coalition formation game. Algorithms are proposed to get the solution of the game. Finally, through numerical simulations, the authors demonstrate the effectiveness of the proposed SNCC scheme and algorithms in achieving a high spectrum efficiency for CC.
  • Keywords
    cooperative communication; distributed algorithms; game theory; network coding; numerical analysis; NC capability; NC noise; SNCC coalitions; SNCC scheme; centralised algorithm; coalition formation game; disjoint group-coalition; distributed algorithm; multisession cooperative communications; network coding coalition; numerical simulation; space network-coded cooperation; spectrum efficiency; time slot overhead reduction;
  • fLanguage
    English
  • Journal_Title
    Networks, IET
  • Publisher
    iet
  • ISSN
    2047-4954
  • Type

    jour

  • DOI
    10.1049/iet-net.2012.0210
  • Filename
    6845404