• DocumentCode
    86689
  • Title

    Whether and where to code in the wireless packet erasure relay channel

  • Author

    Shi, Xinzhi ; Medard, Muriel ; Lucani, Daniel E.

  • Author_Institution
    Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, 02139-4307
  • Volume
    31
  • Issue
    8
  • fYear
    2013
  • fDate
    Aug. 2013
  • Firstpage
    1379
  • Lastpage
    1389
  • Abstract
    The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations. In energy-constrained systems, however, coding subgraphs should be chosen to control the number of coding nodes while maintaining throughput. In this paper, we explore the strategic use of network coding in the wireless packet erasure relay channel according to both throughput and energy metrics. In the relay channel, a single source communicates to a single sink through the aid of a halfduplex relay. The fluid flow model is used to describe the case where both the source and the relay are coding, and Markov chain models are proposed to describe packet evolution if only the source or only the relay is coding. In addition to transmission energy, we take into account coding and reception energies. We show that coding at the relay alone while operating in a rateless fashion is neither throughput nor energy efficient. Given a set of system parameters, our analysis determines the optimal amount of time the relay should participate in the transmission, and where coding should be performed.
  • Keywords
    Encoding; Markov processes; Network coding; Relays; Throughput; Wireless communication; Wireless sensor networks; Random linear network coding; packet delivery energy; wireless relaychannel;
  • fLanguage
    English
  • Journal_Title
    Selected Areas in Communications, IEEE Journal on
  • Publisher
    ieee
  • ISSN
    0733-8716
  • Type

    jour

  • DOI
    10.1109/JSAC.2013.130803
  • Filename
    6658242