Optimal Energy Sharing for Cooperative Relaying in a Random Access Network with Energy Harvesting Nodes

Author(s):  
Seyed Mohammad Mortazavi ◽  
Farid Ashtiani ◽  
Mahtab Mirmohseni
AIAA Journal ◽  
2014 ◽  
Vol 52 (2) ◽  
pp. 307-319 ◽  
Author(s):  
Mohammed R. Sunny ◽  
Cornel Sultan ◽  
Rakesh K. Kapania

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Phu Tran Tin ◽  
Phan Van-Duc ◽  
Tan N. Nguyen ◽  
Le Anh Vu

In this paper, we investigate the full-duplex (FD) decode-and-forward (DF) cooperative relaying system, whereas the relay node can harvest energy from radiofrequency (RF) signals of the source and then utilize the harvested energy to transfer the information to the destination. Specifically, a hybrid time-power switching-based relaying method is adopted, which leverages the benefits of time-switching relaying (TSR) and power-splitting relaying (PSR) protocols. While energy harvesting (EH) helps to reduce the limited energy at the relay, full-duplex is one of the most important techniques to enhance the spectrum efficiency by its capacity of transmitting and receiving signals simultaneously. Based on the proposed system model, the performance of the proposed relaying system in terms of the ergodic capacity (EC) is analyzed. Specifically, we derive the exact closed form for upper bound EC by applying some special function mathematics. Then, the Monte Carlo simulations are performed to validate the mathematical analysis and numerical results.


2021 ◽  
Author(s):  
Battina Srinuvasu Ku ◽  
S.G. Santhi ◽  
S. Narayana

Abstract Optimal energy delay scheduling for capacity allocation issues on interference chan- nel energy harvesting wireless sensor networks (EH-WSN) addresses for static data streams and energy topography. To create the optimizations issue of unique and multi-time interval corre- spondingly. The goal is for reducing overall regression of the network. Though, the optimization issue is not convex, creating it hard to get an optimal solution. The main objective of this manuscript is directly addressing the original non-convex formulation using the enhanced Beetle Antennae Search (BAS) algorithm that efficiently finds the optimal solution. This algorithm is also better for another complex optimization issues on wireless network design. The simulations under delay, delratio, drop, energy, network lifetime, overhead and throughput are carried; the expected outcome displays that improved BAS algorithm executes considerably better than the convex approximation technique. This idea is useful for other complex optimization issues on wireless network design.


2020 ◽  
Vol 7 (3) ◽  
pp. 1690-1703 ◽  
Author(s):  
Dongbin Jiao ◽  
Peng Yang ◽  
Liqun Fu ◽  
Liangjun Ke ◽  
Ke Tang

Sign in / Sign up

Export Citation Format

Share Document