Pith. sign in

REVIEW

Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.05407 v2 pith:AJHZHF22 submitted 2022-06-11 cs.IT math.IT

Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes

classification cs.IT math.IT
keywords energynetworkalgorithm-basedrelaystheoreticalbufferbufferscooperative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.