Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation.

Saved in:
Bibliographic Details
Title: Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation.
Authors: Qi, Nan1, Xiao, Ming2, Tsiftsis, Theodoros A.3, Skoglund, Mikael2, Cao, Phuong L.2, Li, Lixin1
Source: IEEE Transactions on Communications. Nov2016, Vol. 64 Issue 11, p4506-4519. 14p.
Subjects: Cooperative processing, Linear network coding, Electric relays, Computer scheduling, Computational complexity, Fractional programming, Electric power consumption
Abstract: The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme. [ABSTRACT FROM PUBLISHER]
Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 119593252
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Qi%2C+Nan%22">Qi, Nan</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Xiao%2C+Ming%22">Xiao, Ming</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Tsiftsis%2C+Theodoros+A%2E%22">Tsiftsis, Theodoros A.</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AR" term="%22Skoglund%2C+Mikael%22">Skoglund, Mikael</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Cao%2C+Phuong+L%2E%22">Cao, Phuong L.</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Li%2C+Lixin%22">Li, Lixin</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Communications%22">IEEE Transactions on Communications</searchLink>. Nov2016, Vol. 64 Issue 11, p4506-4519. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Cooperative+processing%22">Cooperative processing</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+network+coding%22">Linear network coding</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+relays%22">Electric relays</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+scheduling%22">Computer scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Fractional+programming%22">Fractional programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+power+consumption%22">Electric power consumption</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme. [ABSTRACT FROM PUBLISHER]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=119593252
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TCOMM.2016.2602830
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 4506
    Subjects:
      – SubjectFull: Cooperative processing
        Type: general
      – SubjectFull: Linear network coding
        Type: general
      – SubjectFull: Electric relays
        Type: general
      – SubjectFull: Computer scheduling
        Type: general
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Fractional programming
        Type: general
      – SubjectFull: Electric power consumption
        Type: general
    Titles:
      – TitleFull: Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Qi, Nan
      – PersonEntity:
          Name:
            NameFull: Xiao, Ming
      – PersonEntity:
          Name:
            NameFull: Tsiftsis, Theodoros A.
      – PersonEntity:
          Name:
            NameFull: Skoglund, Mikael
      – PersonEntity:
          Name:
            NameFull: Cao, Phuong L.
      – PersonEntity:
          Name:
            NameFull: Li, Lixin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 00906778
          Numbering:
            – Type: volume
              Value: 64
            – Type: issue
              Value: 11
          Titles:
            – TitleFull: IEEE Transactions on Communications
              Type: main
ResultId 1