ArticleSensors (Basel, Switzerland)2019
Joint Source-Relay Optimization for MIMO Full-Duplex Bidirectional Wireless Sensor Networks with SWIPT.
Article in Sensors (Basel, Switzerland), 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
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.
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.
Who cites it
1 citing paper in PubMed.
- Design of a 900 MHz Dual-Mode SWIPT for Low-Power IoT Devices.Sensors (Basel, Switzerland) · 2019Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
The simultaneous wireless information and power transfer (SWIPT) technique has been considered as a promising approach to prolong the lifetime of energy-constraint wireless sensor networks (WSNs). In this paper, a multiple-input multiple-output (MIMO) full-duplex (FD) bidirectional wireless sensor network (BWSN) with SWIPT is investigated. Based on minimum total mean-square-error (total-MSE) criterion, a joint optimization problem for source and relay beamforming and source receiving subject to transmitting power and harvesting energy constraints is established. Since this problem is non-convex, an iterative algorithm based on feasible point pursuit-successive convex approximation (FPP-SCA) is derived to obtain a local optimum. Moreover, considering the scenarios in which source and relay nodes equipped with the same and different numbers of antennas, a low-complexity diagonalizing design-based scheme is employed to simplify each non-convex subproblem into convex problems and to reduce the computational complexity. Numerical results of the total-MSE and bit error rate (BER) are implemented to demonstrate the performance of the two different schemes.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.