Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Physical Communicati...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Physical Communication
Article . 2018 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2018
Data sources: DBLP
versions View all 2 versions
addClaim

Non-renewable energy efficiency optimization in energy harvesting relay-assisted system

Authors: Ming Zhao 0008; Dan Deng; Wuyang Zhou; Lisheng Fan;

Non-renewable energy efficiency optimization in energy harvesting relay-assisted system

Abstract

Abstract In this paper, we consider a scenario where the source node powered by the conventional power grid transmits data with the assistance of some energy harvesting (EH) decode-and-forward (DF) relay nodes. Unlike EH providing renewable energy, most power grids are supported by the non-renewable fossil fuels. So our goal is to maximize the non-renewable energy efficiency (EE) of the non-EH source throughout multiple timeslots. To deal with the randomness of energy arrivals and non-ideal circuit power, we formulate the EE optimization problem of the relaying system by combining the power allocation and the sleep mode in both the source and the relay. We firstly deal with this problem in a special case with just one timeslot and then solve it in a multi-timeslot scenario with dynamic programming (DP) approach. We also propose a heuristic algorithm with a complexity lower than the DP algorithm. We compare the performance of the two algorithms with a baseline scheme. Simulation results show that the heuristic algorithm provides close EE with the DP algorithm, and a significant EE gain over the baseline scheme.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    8
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
8
Top 10%
Average
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!