Performance Analysis of Buffer-Aided FSO Relaying with an Energy Harvesting Relay
In this paper, we consider a three-node free space optical (FSO) decode-and-forward (DF) cooperative network. The relay is not connected to a permanent power supply and relies solely on the optical energy harvested (EH) from the source node. This energy is accumulated in an energy buffer in order to...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Photonics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2304-6732/12/1/55 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we consider a three-node free space optical (FSO) decode-and-forward (DF) cooperative network. The relay is not connected to a permanent power supply and relies solely on the optical energy harvested (EH) from the source node. This energy is accumulated in an energy buffer in order to enable the relay–destination communications. Moreover, buffer-aided (BA) relaying is considered where the relay is equipped with a data buffer for storing the incoming packets. For such networks, we propose a relaying protocol that delineates the roles of the source and the EH BA relay in each time slot. We develop a Markov chain framework for capturing the dynamics of the data and energy buffers. We derive the transition probabilities between the states of the Markov chain after discretizing the continuous-value energy buffer allowing for the evaluation of the analytical performance of the considered system. A numerical analysis is also presented over a turbulence-induced gamma–gamma fading channel highlighting the impacts of the data rate threshold levels, relay position, relay transmit power and propagation conditions on the achievable performance levels. Results validate the accuracy of the theoretical analysis and demonstrate significant reductions in the network outage, especially when the relay’s transmit level is appropriately selected. |
|---|---|
| ISSN: | 2304-6732 |