Evidence map›Paper›PMID 41013139›Full record

ArticleSensors (Basel, Switzerland)2025

Interior Point-Driven Throughput Maximization for TS-SWIPT Multi-Hop DF Relays: A Log Barrier Approach.

Yang Yu, Xiaoqing Tang, Guihui Xie

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Yang YuElectronic Information School, Hubei Three Gorges Polytechnic, Yichang 443199, China.ORCID 0009-0009-3845-2401
Xiaoqing TangSchool of Artificial Intelligence, Hubei University, Wuhan 430062, China.ORCID 0000-0001-9704-3282
Guihui XieSchool of Automation, China University of Geosciences (Wuhan), Wuhan 430074, China.ORCID 0000-0002-7288-7080

Funding

Hubei Provincial Natural Science Foundation of China 2025AFC093
6 · The paper itself

Abstract

This paper investigates a simultaneous wireless information and power transfer (SWIPT) decode-and-forward (DF) relay network, where a source node transmits data to a destination node through the assistance of multi-hop passive relays. We employ the time-switching (TS) protocol, enabling the relays to harvest energy from the received previous hop signal to support data forwarding. We first prove that the system throughput monotonically increases with the transmit power of the source node. Next, by employing logarithmic transformations, we convert the non-convex problem of obtaining optimal TS ratios at each relay to maximize the system throughput into a convex optimization problem. Comprehensively taking into account the convergence rate, computational complexity per iteration, and robustness, we selected the log barrier method-a type of interior point method-to address this convex optimization problem, along with providing a detailed implementation procedure. The simulation results validate the optimality of the proposed method and demonstrate its applicability to practical communication systems. For instance, the proposed scheme achieves 1437.3 bps throughput at 40 dBm maximum source power in a 2-relay network-278.6% higher than that of the scheme with TS ratio fixed at 0.75 (379.68 bps). On the other hand, it converges within a 1.36 ms computation time for 5 relays, 6 orders of magnitude faster than exhaustive search (1730 s).

Indexed as

decode and forwardinterior point methodlog barrier methodmulti-hop relaysimultaneous wireless information and power transfertime-switching

Identifiers

PMID41013139
PMCPMC12473274

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.