Yuan Zheng

Dr. Yuan Zheng


Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 May 2026 in Electronics
Verified
Journal Article
Open access
PDF file
YZYuan Zheng
Yuan Zheng
FTFengxian Tang
Fengxian Tang
WWWeiqiang Wu
Weiqiang Wu
YWYongxue Wang
Yongxue Wang
This paper studies a backscatter-assisted pairwise cooperation scheme in a multi-user wireless powered communication network (WPCN), where pairs of wireless devices (WDs) first harvest wireless energy from an energy node (EN) and then transmit their information to an access point (AP). Under the proposed scheme, the two WDs in each pair first exchange their local messages and then cooperatively transmit to the AP in the uplink. To reduce the time and energy consumption of local information exchange, we exploit the short distance between paired users and realize message exchange through energy-conserving backscatter communication. Meanwhile, the proposed design effectively reuses the wireless power transfer (WPT) signal to enable simultaneous information exchange during the energy harvesting phase, thereby leaving more time and harvested energy for the subsequent cooperative uplink transmission. Based on this transmission protocol, we jointly optimize the time allocation, the user transmit power allocation, and the energy beamforming matrix at the EN to maximize the weighted sum rate. To tackle the resulting non-convex problem, we decompose it into two coupled subproblems and develop an alternating optimization algorithm to update the corresponding variables iteratively. Numerical results show that the proposed scheme achieves significant weighted sum rate improvement over representative benchmark methods.

13 November 2026 in Electronics
Verified
Journal Article
Open access
PDF file
FTFengxian Tang
Fengxian Tang
YZYuan Zheng
Yuan Zheng
YWYongxue Wang
Yongxue Wang
WWWeiqiang Wu
Weiqiang Wu
Remote tasks require an upload, heterogeneous processing and a return transfer. We ask the question of when final-completion selection adds value beyond upload-aware placement in bidirectional multicore elastic optical networks. Queue-aware placement (C), upload-aware placement (E) and heterogeneous direction-aware sequential completion-time scheduling (HD-SCTS, D) share temporal optical constraints. Saved standard-profile trials attribute an approximately 4% improvement to upload awareness, with E-to-D intervals spanning zero. A new twenty-seed online study evaluates COST239 and the National Science Foundation Network (NSFNET) under two workloads at M = 2, 6, 12 and 24. Standard-profile E-to-D point effects have absolute magnitude of at most 0.143%. In high-transfer-demand NSFNET, the effect decreases from 6.79% at M6 to 0.15% at M24 (95% interval 0.02–0.30%). Scan-order sensitivity also exposes unscheduled tasks in some comparator cells. Correlated-arrival and illustrative group-delay sensitivities examine additional limits, while isolated controller cost is reported separately from simulated response. Benefits depend on workload, candidate construction and the stated reservation and mean-crosstalk model.

9 July 2026 in Sensors
Verified
Journal Article
Open access
PDF file
YZYuan Zheng
Yuan Zheng
DLDongqing Li
Dongqing Li
HWHuan Wan
Huan Wan
In wireless-powered sensor networks, active uplink (UL) transmissions can support both sensed-data delivery and order-dependent RF energy recycling among energy-constrained devices. This paper studies a single hybrid access point (HAP) wireless-powered sensor network (WPSN), where one wireless device (WD) is selected as the relay, and the remaining WDs act as sources. The HAP first transfers wireless energy to all WDs in the downlink. Then, the source WDs reuse the incident wireless energy signal as a controllable carrier and deliver their information to the relay through passive backscatter communication. In the subsequent active uplink phase, the source WDs transmit according to an optimized order, while later scheduled sources recycle energy from the active signals transmitted by preceding sources. The source order therefore determines not only the transmission sequence but also the directed energy-recycling structure among source WDs, thereby reshaping the energy-causality constraints and the feasible transmit-energy region. The relay finally forwards the decoded source information to the HAP. To improve throughput fairness among sensor devices, a max-min throughput optimization problem is formulated by jointly designing the source transmission order, time allocation, and transmit-power allocation. For a given order, the continuous resource allocation problem is transformed into a convex problem through transmit-energy variables, and the optimal order is obtained by searching over all candidate orders. Numerical results show that the proposed scheme achieves higher minimum throughput than the three representative comparison schemes, demonstrating the benefit of jointly exploiting passive source-to-relay collection, relay-assisted forwarding, and order-aware energy recycling.

2 September 2026 in Sensors
Verified
Journal Article
Open access
PDF file
YZYuan Zheng
Yuan Zheng
FTFengxian Tang
Fengxian Tang
DLDongqing Li
Dongqing Li
YWYongxue Wang
Yongxue Wang
This paper investigates joint computing and relaying for multiuser task offloading in a wireless-powered mobile edge computing (MEC) system comprising an energy node (EN), an edge server (ES), and multiple energy-harvesting users. One user is selected as the helper for the remaining task users. Each task user partitions its workload among local computing, cooperative computing at the helper, and remote execution at the ES. During a parallel cooperation stage, the helper computes one portion of the uploaded tasks locally while forwarding the remaining portion to the ES and also processes its own task through local computing or edge offloading. The weighted sum computation rate (WSCR) is maximized by jointly optimizing helper selection, task partitioning, time allocation, transmission-energy allocation, and CPU-resource allocation under frame-duration, energy-neutrality, communication, and computation constraints. For each candidate helper, transmission-energy variables are introduced to decouple transmission time and power, and the perspective structure of the achievable-rate functions is exploited to reformulate the continuous resource-allocation problem as an equivalent convex problem. By solving the convex problem for all the candidate helpers, the globally optimal helper selection and resource allocation are obtained. The numerical results show that the proposed joint computing-and-relaying scheme consistently outperforms computing-only, relaying-only, and dedicated-helper cooperation. The performance gain stems from adaptively balancing helper computing and ES processing according to the prevailing communication, computation, and energy bottlenecks.

20 June 2026 in Sensors
Verified
Journal Article
Open access
PDF file
YZYuan Zheng
Yuan Zheng
HCHaisong Chen
Haisong Chen
HWHuan Wan
Huan Wan
YWYongxue Wang
Yongxue Wang
This paper investigates backscatter-aided relaying for interactive dual-HAP wireless-powered sensor networks (WPSNs), in which two cooperative sensor groups transmit sensed data to opposite hybrid access points (HAPs) using harvested radio-frequency energy. Each group consists of multiple source sensor nodes (SNs) and one relay SN selected according to its proximity to the target HAP. To reduce local cooperation overhead, source SNs reuse the wireless power transfer (WPT) signal as a controllable carrier and convey their information to the relay SN through passive backscatter communication. The collected information is then delivered to the target HAPs through direct source transmission and relay forwarding. A source common-throughput maximization problem is formulated by jointly optimizing time allocation, transmit energy allocation, and dual-HAP energy beamforming, subject to energy-causality and relay minimum-rate constraints. To address the resulting non-convexity, an alternating optimization algorithm is developed, where the time-and-energy allocation subproblem is transformed into a convex form and the energy beamforming matrices are updated through energy-feasibility margin maximization. Numerical results show that the proposed scheme outperforms active cooperation without backscatter and direct transmission, demonstrating the effectiveness of integrating passive local information collection, relay-assisted uplink transmission, and optimized dual-HAP WPT.

19 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
FTFengxian Tang
Fengxian Tang
YZYuan Zheng
Yuan Zheng
YWYongxue Wang
Yongxue Wang
WWWeiqiang Wu
Weiqiang Wu
In multi-core fiber elastic optical networks (MCF-EONs), a single fiber-link failure can disrupt traffic across every core of the failed fiber. This paper studies bandwidth-squeezed restoration (BSR) in IP over MCF-EON, where an admitted service must recover a demand-specific fraction of its original bandwidth. Four policy-matched mechanisms are considered: single-route IP-BSR, single-path optical SP-BSR, optical MP-BSR, and cross-layer Joint-MP-BSR. Joint-MP-BSR retains a complete IP-BSR branch and a flexible branch that assigns available bandwidth to one surviving IP route before using end-to-end optical multipath for the exact residual. A failure-scenario-indexed candidate-configuration MILP supplies an exact benchmark over an enumerated candidate set with core-slot collision, sharing, and cumulative inter-core-crosstalk constraints. In 30 paired NSFNET online-provisioning replications, Joint-MP-BSR reduces protected-service blocking by 0.0617 relative to IP-BSR (95% CI, 0.0308–0.0926) and by 0.1250 relative to MP-BSR (0.0632–0.1868); MP-BSR improves on SP-BSR by 0.2633 (0.1713–0.3553). On COST239, Joint-MP-BSR improves on IP-BSR, whereas its difference from MP-BSR is not statistically significant. In a separate 30-instance frozen N6S8 benchmark, heuristic/MILP admission totals are 112/112 for IP-BSR, 59/59 for MP-BSR, and 114/114 for Joint-MP-BSR. Joint’s conditional Tx/Rx overhead is 10.717% after the two admission objectives tie, exposing a resource refinement opportunity. These results support IP-first multipath BSR within the evaluated candidate, traffic, and physical-layer settings rather than universal or large-network dominance.