Low complexity resource allocation in the relay channels with energy harvesting transmitters

Low complexity resource allocation in the relay channels with energy harvesting transmitters Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless Ad-hoc and sensor networks with replenishable nodes. In this sense, it has emerged as a promising technique for Green Communications. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks. In this paper, we investigate the cooperation in EH nodes. We consider the optimal power and rate allocation in the full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. In our model, the energy arrivals at the source and the relay are general stochastic processes with known EH times and amounts before the start of transmission. This problem has a constrained min-max optimization form that is not easy to solve. We propose a method based on a mathematical theorem to decompose it into two problems: the first problem has a tractable convex optimization form and can be solved efficiently. We show that the second problem is an unconstrained discrete convex optimization problem, which has the complexity of O(K2), instead of O(2K), where K is the dimension of variables. Also, we provide some numerical examples that confirm our results. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Ad Hoc Networks Elsevier

Low complexity resource allocation in the relay channels with energy harvesting transmitters

Loading next page...
 
/lp/elsevier/low-complexity-resource-allocation-in-the-relay-channels-with-energy-ffUx3VOf0M
Publisher
Elsevier
Copyright
Copyright © 2018 Elsevier B.V.
ISSN
1570-8705
D.O.I.
10.1016/j.adhoc.2018.05.004
Publisher site
See Article on Publisher Site

Abstract

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless Ad-hoc and sensor networks with replenishable nodes. In this sense, it has emerged as a promising technique for Green Communications. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks. In this paper, we investigate the cooperation in EH nodes. We consider the optimal power and rate allocation in the full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. In our model, the energy arrivals at the source and the relay are general stochastic processes with known EH times and amounts before the start of transmission. This problem has a constrained min-max optimization form that is not easy to solve. We propose a method based on a mathematical theorem to decompose it into two problems: the first problem has a tractable convex optimization form and can be solved efficiently. We show that the second problem is an unconstrained discrete convex optimization problem, which has the complexity of O(K2), instead of O(2K), where K is the dimension of variables. Also, we provide some numerical examples that confirm our results.

Journal

Ad Hoc NetworksElsevier

Published: Aug 1, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off