• Corpus ID: 230435803

Achievable Rates for Binary Two-hop Channel with Energy Harvesting Relay With Finite Battery

  title={Achievable Rates for Binary Two-hop Channel with Energy Harvesting Relay With Finite Battery},
  author={Ali H. Abdollahi Bafghi and Mahtab Mirmohseni and Mohammad Reza Aref},
We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory. We model the energy saved in the battery as the channel state with the challenge that the receiver does not know the… 



On the Transfer of Information and Energy in Multi-User Systems

This letter focuses on baseline multi-user systems, namely multiple access and multi-hop channels, and demonstrates that energy transfer constraints call for additional coordination among distributed nodes of a wireless network.

Joint transfer of energy and information in a two-hop relay channel

This work model the energy saved in battery as channel state with the challenge that the receiver does not know the channel state, and derives an achievable rate for this kind of channel with memory.

Constrained Codes for Joint Energy and Information Transfer

It is demonstrated that the codewords' structure afforded by the use of constrained codes enables the transmission strategy to be better adjusted to the receiver's energy utilization pattern, as compared to classical unstructured codes.

On Capacity Under Receive and Spatial Spectrum-Sharing Constraints

  • M. Gastpar
  • Computer Science
    IEEE Transactions on Information Theory
  • 2007
This paper investigates the behavior of capacity when constraints are placed on the channel output signal (as well as generalizations thereof), finding that in certain network scenarios, including multiple-access and relay situations, both the structure of the problem and the conclusions change.

Capacity Analysis of Discrete Energy Harvesting Channels

This paper uses stationarity and ergodicity theory to compute and optimize the achievable rates for the channels, and derive a series of computable capacity upper and lower bounds on the capacity of energy harvesting channels.

A Survey of Energy-Efficient Techniques for 5G Networks and Challenges Ahead

This survey provides an overview of energy-efficient wireless communications, reviews seminal and recent contribution to the state-of-the-art, including the papers published in this special issue, and discusses the most relevant research challenges to be addressed in the future.

Network Information Theory

A system with many senders and receivers contains many new elements in the communication problem: interference, cooperation and feedback. These are the issues that are the domain of network

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

Capacity of the Energy-Harvesting Channel With a Finite Battery

The capacity of this energy harvesting channel is characterized as an n-letter mutual information rate under various assumptions on the availability of energy arrival information, and the information-theoretic capacity is shown to be equal, within a constant gap, to its long-term average throughput.

Coding for computing

  • A. OrlitskyJ. Roche
  • Computer Science
    Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.