Guihui Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guihui Xie has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoqing Tang
School of Artificial Intelligence, Hubei University, Wuhan 430062, China
8 shared publications - Yang Yu
Electronic Information School, Hubei Three Gorges Polytechnic, Yichang 443199, China
7 shared publications - Chaowei Wang
Beijing University of Posts and Telecommunications
2 shared publications - Dong Li
Nantong University
2 shared publications Ruyan Li
Wuchang Shouyi University, Wuhan, China
2 shared publications- Xin Liu
Institute of Electronic Information, Wuhan Qingchuan University, China
2 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9603
Two-Layer Non-Alternating Joint Optimization of Trajectory Planning, User Association, and Radio Resource Management for UAV-Assisted Uplink IoT Data Collection: A Weighted Sum Power Minimization Approach
Unmanned aerial vehicle (UAV)-assisted data collection from battery-constrained Internet of Things (IoT) devices faces a fundamental trade-off between communication reliability and device energy depletion. This paper jointly optimizes UAV trajectory, user association, and radio resource management (RRM) to minimize the uplink weighted sum transmit powers, where each device’s weight is dynamically and inversely related to its residual energy, while treating UAV propulsion energy as a feasibility constraint. To circumvent the initialization trap of conventional alternating optimization (AO), we propose a two-layer non-alternating framework. The inner layer solves the per-slot RRM problem analytically via KKT conditions for a fixed UAV position, yielding analytical power allocation and a unique bandwidth solution, while user association is determined by an incremental greedy algorithm. The outer layer formulates trajectory planning (TP) as a Markov decision process (MDP), enabling single-pass trajectory synthesis without cross-layer iteration, thereby inherently avoiding initialization sensitivity. The framework supports the genetic algorithm (GA) and limited depth-first search (DFS) as trajectory solvers, with the deep Q-network (DQN) as a promising future extension, each offering distinct optimality–complexity trade-offs. Simulation results show that the proposed scheme consistently outperforms conventional iterative baselines across various network configurations.
- 27 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9603
Open AccessTwo-Layer Non-Alternating Joint Optimization of Trajectory Planning, User Association, and Radio Resource Management for UAV-Assisted Uplink IoT Data Collection: A Weighted Sum Power Minimization Approach
Unmanned aerial vehicle (UAV)-assisted data collection from battery-constrained Internet of Things (IoT) devices faces a fundamental trade-off between communication reliability and device energy depletion. This paper jointly optimizes UAV trajectory, user association, and radio resource management (RRM) to minimize the uplink weighted sum transmit powers, where each device’s weight is dynamically and inversely related to its residual energy, while treating UAV propulsion energy as a feasibility constraint. To circumvent the initialization trap of conventional alternating optimization (AO), we propose a two-layer non-alternating framework. The inner layer solves the per-slot RRM problem analytically via KKT conditions for a fixed UAV position, yielding analytical power allocation and a unique bandwidth solution, while user association is determined by an incremental greedy algorithm. The outer layer formulates trajectory planning (TP) as a Markov decision process (MDP), enabling single-pass trajectory synthesis without cross-layer iteration, thereby inherently avoiding initialization sensitivity. The framework supports the genetic algorithm (GA) and limited depth-first search (DFS) as trajectory solvers, with the deep Q-network (DQN) as a promising future extension, each offering distinct optimality–complexity trade-offs. Simulation results show that the proposed scheme consistently outperforms conventional iterative baselines across various network configurations.
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2889-2893
Efficient Discrete Binary Search for Power Minimization in TS-SWIPT Multi-Hop DF Relay Networks
This letter proposes an efficient discrete binary search (DBS) algorithm for source power minimization in time-switching simultaneous wireless information and power transfer (TS-SWIPT) multi-hop decode-and-forward (DF) relay networks, subject to an end-to-end rate constraint. By exploiting the problem’s inherent monotonicity, DBS directly searches over the practical discrete power set. It yields the globally optimal source power and TS ratios, eliminating iterative convex optimization and achieving linear complexity. Simulations verify that DBS achieves optimality while being orders of magnitude faster than interior-point methods (IPMs), and remains robust under a practical nonlinear energy harvesting (EH) model.
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2889-2893
Efficient Discrete Binary Search for Power Minimization in TS-SWIPT Multi-Hop DF Relay Networks
This letter proposes an efficient discrete binary search (DBS) algorithm for source power minimization in time-switching simultaneous wireless information and power transfer (TS-SWIPT) multi-hop decode-and-forward (DF) relay networks, subject to an end-to-end rate constraint. By exploiting the problem’s inherent monotonicity, DBS directly searches over the practical discrete power set. It yields the globally optimal source power and TS ratios, eliminating iterative convex optimization and achieving linear complexity. Simulations verify that DBS achieves optimality while being orders of magnitude faster than interior-point methods (IPMs), and remains robust under a practical nonlinear energy harvesting (EH) model.
- Open Access
Optimal Resource Allocation via Unified Closed-Form Solutions for SWIPT Multi-Hop DF Relay Networks
Multi-hop relaying can solve the problems of limited single-hop wireless communication distance, poor signal quality, or the inability to communicate directly by “relaying” data transmission through multiple intermediate nodes. It serves as the cornerstone for building large-scale, highly reliable, and self-adapting wireless networks, especially for the Internet of Things (IoT) and future 6G. This paper focuses on a decode-and-forward (DF) multi-hop relay network that employs simultaneous wireless information and power transfer (SWIPT) technology, with relays operating in a passive state. We first investigate the optimization of the power splitting (PS) ratio at each relay, given the source node transmit power, to maximize end-to-end network throughput. Subsequently, we jointly optimized the PS ratios and the source transmit power to minimize the source transmit power while satisfying the system’s minimum quality of service (QoS) requirement. Although both problems are non-convex, they can be reformulated as convex optimization problems. Closed-form optimal solutions are then derived based on the Karush–Kuhn–Tucker (KKT) conditions and a recursive method, respectively. Moreover, we find that the closed-form optimal solutions for the PS ratios corresponding to the two problems are identical. Through simulations, we validate that the performance of the two proposed schemes based on the closed-form solutions is optimal, while also demonstrating their extremely fast algorithm execution speeds, thereby proving the deployment value of the two proposed schemes in practical communication scenarios.
Open AccessOptimal Resource Allocation via Unified Closed-Form Solutions for SWIPT Multi-Hop DF Relay Networks
Multi-hop relaying can solve the problems of limited single-hop wireless communication distance, poor signal quality, or the inability to communicate directly by “relaying” data transmission through multiple intermediate nodes. It serves as the cornerstone for building large-scale, highly reliable, and self-adapting wireless networks, especially for the Internet of Things (IoT) and future 6G. This paper focuses on a decode-and-forward (DF) multi-hop relay network that employs simultaneous wireless information and power transfer (SWIPT) technology, with relays operating in a passive state. We first investigate the optimization of the power splitting (PS) ratio at each relay, given the source node transmit power, to maximize end-to-end network throughput. Subsequently, we jointly optimized the PS ratios and the source transmit power to minimize the source transmit power while satisfying the system’s minimum quality of service (QoS) requirement. Although both problems are non-convex, they can be reformulated as convex optimization problems. Closed-form optimal solutions are then derived based on the Karush–Kuhn–Tucker (KKT) conditions and a recursive method, respectively. Moreover, we find that the closed-form optimal solutions for the PS ratios corresponding to the two problems are identical. Through simulations, we validate that the performance of the two proposed schemes based on the closed-form solutions is optimal, while also demonstrating their extremely fast algorithm execution speeds, thereby proving the deployment value of the two proposed schemes in practical communication scenarios.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (12) , 2909-2913
Geometric Weighted Sum Power Minimization for Energy-Efficient D2D Underlay Networks
This letter presents a computationally efficient weighted sum power (WSP) minimization framework for underlaid device-to-device (D2D) networks. Our approach circumvents the high complexity of fractional programming (FP) inherent in energy efficiency (EE) and weighted sum EE (WSEE) maximization. The core innovation lies in decoupling the problem into two tractable components: (i) closed-form geometric optimal power allocation with O(1) time complexity, eliminating iterative computations; (ii) optimal link matching via the Kuhn-Munkres (KM) algorithm. Integrated with an energy-aware heuristic for dynamic weight adaptation, the proposed scheme achieves ∼50% average network lifetime extension compared to FP-based EE maximization while maintaining real-time feasibility.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (12) , 2909-2913
Geometric Weighted Sum Power Minimization for Energy-Efficient D2D Underlay Networks
This letter presents a computationally efficient weighted sum power (WSP) minimization framework for underlaid device-to-device (D2D) networks. Our approach circumvents the high complexity of fractional programming (FP) inherent in energy efficiency (EE) and weighted sum EE (WSEE) maximization. The core innovation lies in decoupling the problem into two tractable components: (i) closed-form geometric optimal power allocation with O(1) time complexity, eliminating iterative computations; (ii) optimal link matching via the Kuhn-Munkres (KM) algorithm. Integrated with an energy-aware heuristic for dynamic weight adaptation, the proposed scheme achieves ∼50% average network lifetime extension compared to FP-based EE maximization while maintaining real-time feasibility.
- Open Access
Interior Point-Driven Throughput Maximization for TS-SWIPT Multi-Hop DF Relays: A Log Barrier Approach
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).
Open AccessInterior Point-Driven Throughput Maximization for TS-SWIPT Multi-Hop DF Relays: A Log Barrier Approach
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).
- Open Access
- 13 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4290
Spectrum Allocation and Power Control Based on Newton’s Method for Weighted Sum Power Minimization in Overlay Spectrum Sharing
As the popularity of smartphones, wearable devices, intelligent vehicles, and countless other devices continues to rise, the surging demand for mobile data traffic has resulted in an increasingly crowded electromagnetic spectrum. Spectrum sharing serves as a solution to optimize the utilization of wireless communication channels, allowing various types of users to share the same frequency band securely. This paper investigates spectrum allocation and power control problems in overlay spectrum sharing, with a focus on promoting green communication. Maximizing weighted sum energy efficiency (WSEE) requires solving complex multiple-ratio fractional programming (FP) problems. In contrast, weighted sum power (WSP) minimization offers a more straightforward approach. Moreover, because WSP is directly related to users’ power consumption, we can dynamically adjust their weights to balance their residual energy. We prioritize WSP minimization over the more common WSEE maximization. This choice not only simplifies computation but also maintains users’ quality of service (QoS) requirements. The joint optimization for multiple primary users (PUs) and secondary users (SUs) can be decomposed into two components: a weighted bipartite matching problem and a series of convex resource allocation problems. Utilizing Newton’s method, our system-level simulation results show that the proposed scheme achieves optimal performance with minimal computational time. We explore strategies to accelerate the proposed scheme by refining the selection of initial values for Newton’s method.
- 13 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4290
Open AccessSpectrum Allocation and Power Control Based on Newton’s Method for Weighted Sum Power Minimization in Overlay Spectrum Sharing
As the popularity of smartphones, wearable devices, intelligent vehicles, and countless other devices continues to rise, the surging demand for mobile data traffic has resulted in an increasingly crowded electromagnetic spectrum. Spectrum sharing serves as a solution to optimize the utilization of wireless communication channels, allowing various types of users to share the same frequency band securely. This paper investigates spectrum allocation and power control problems in overlay spectrum sharing, with a focus on promoting green communication. Maximizing weighted sum energy efficiency (WSEE) requires solving complex multiple-ratio fractional programming (FP) problems. In contrast, weighted sum power (WSP) minimization offers a more straightforward approach. Moreover, because WSP is directly related to users’ power consumption, we can dynamically adjust their weights to balance their residual energy. We prioritize WSP minimization over the more common WSEE maximization. This choice not only simplifies computation but also maintains users’ quality of service (QoS) requirements. The joint optimization for multiple primary users (PUs) and secondary users (SUs) can be decomposed into two components: a weighted bipartite matching problem and a series of convex resource allocation problems. Utilizing Newton’s method, our system-level simulation results show that the proposed scheme achieves optimal performance with minimal computational time. We explore strategies to accelerate the proposed scheme by refining the selection of initial values for Newton’s method.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (7) , 4811-4825
Prototype Implementation and Experimental Evaluation for LoRa-Backscatter Communication Systems With RF Energy Harvesting and Low Power Management
Battery free Internet of Things (BF IoT), which is realized by harvesting ambient energy to power the IoT devices, has many advantages such as low power, low cost, free-maintenance, easy deployment, and environmental protection. As the two key enabling technologies of BF IoT, the integration of energy harvesting, management and backscatter communication (BackCom) is expected to meet practical applications. However, several fundamental issues need to be addressed to fully develop the potential of such integration. In this paper, we propose an ultra-low power energy harvesting and management scheme that effectively reduces the startup and quiescent power consumption. In the case of extremely limited energy harvested, the Long Range (LoRa) BackCom digital waveform generation algorithm with ultra-low power consumption and low complexity is studied, which can support low-power and low-cost micro-controllers (MCUs). Then, a radio frequency (RF) front-end scheme that is compatible with RF energy harvesting (RFEH), BackCom, and On-Off-Keying (OOK) receiving is proposed. On this basis, we design and implement a fully functional BF LoRa Tag, which integrates tag antennas, LoRa BackCom, low-power OOK receiving, multi-parameter real-time sensing, RFEH and management, at a cost of only $6. Our test results show that the BF LoRa Tag can be self-powered by harvesting the RF energy as low as –19 dBm, with the cold-start power as low as 280 nW, the quiescent power as low as 49 nW, the OOK receiving power consumption as low as 1.74 μW, the LoRa BackCom power consumption of only 251 μW, and the communication distance up to 445 meters. Compared with the prototypes in existing literature, the BF LoRa Tag not only has lower power consumption, wider coverage, and the lowest cost, but also has complete system functions. Finally, we discuss the reciprocity between stations and receivers, as well as the BF LoRa cellular communication network, which provides useful references for the practical application and large-scale deployment of BF IoT in the future.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (7) , 4811-4825
Prototype Implementation and Experimental Evaluation for LoRa-Backscatter Communication Systems With RF Energy Harvesting and Low Power Management
Battery free Internet of Things (BF IoT), which is realized by harvesting ambient energy to power the IoT devices, has many advantages such as low power, low cost, free-maintenance, easy deployment, and environmental protection. As the two key enabling technologies of BF IoT, the integration of energy harvesting, management and backscatter communication (BackCom) is expected to meet practical applications. However, several fundamental issues need to be addressed to fully develop the potential of such integration. In this paper, we propose an ultra-low power energy harvesting and management scheme that effectively reduces the startup and quiescent power consumption. In the case of extremely limited energy harvested, the Long Range (LoRa) BackCom digital waveform generation algorithm with ultra-low power consumption and low complexity is studied, which can support low-power and low-cost micro-controllers (MCUs). Then, a radio frequency (RF) front-end scheme that is compatible with RF energy harvesting (RFEH), BackCom, and On-Off-Keying (OOK) receiving is proposed. On this basis, we design and implement a fully functional BF LoRa Tag, which integrates tag antennas, LoRa BackCom, low-power OOK receiving, multi-parameter real-time sensing, RFEH and management, at a cost of only $6. Our test results show that the BF LoRa Tag can be self-powered by harvesting the RF energy as low as –19 dBm, with the cold-start power as low as 280 nW, the quiescent power as low as 49 nW, the OOK receiving power consumption as low as 1.74 μW, the LoRa BackCom power consumption of only 251 μW, and the communication distance up to 445 meters. Compared with the prototypes in existing literature, the BF LoRa Tag not only has lower power consumption, wider coverage, and the lowest cost, but also has complete system functions. Finally, we discuss the reciprocity between stations and receivers, as well as the BF LoRa cellular communication network, which provides useful references for the practical application and large-scale deployment of BF IoT in the future.
- 18 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 42 (2) , 79-88
Compact and High-Performing Five-Stage Pipeline RISC-V Microprocessor Designed for IoT Applications
This paper proposes a 32-bit five-stage pipelined microprocessor based on the RISC-V instruction set architecture to enhance pipeline execution efficiency. An enhanced Harvard architecture utilizing dual-port ROM is employed to facilitate parallel execution of instruction fetch and memory access operations. Additionally, a three-level address selector is designed to minimize pipeline flush processing cycles resulting from prediction failures. Furthermore, a data forward unit is implemented to mitigate the impact of data hazards on the pipeline, and a two-stage pipeline memory access structure is devised to eliminate pipeline stalls caused by memory access operations. The experimental results show that the processor designed in this paper can operate up to 110 MHz with a CoreMark score of 2.98. The CoreMark*Freq. of the proposed processor exceeds that of the Taiga processor by approximately 15%, and surpasses the VexRiscv processor by approximately 7%. The microprocessor presented in this paper features a compact footprint and high performance, making it highly applicable in the field of Internet of Things.
- 18 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 42 (2) , 79-88
Compact and High-Performing Five-Stage Pipeline RISC-V Microprocessor Designed for IoT Applications
This paper proposes a 32-bit five-stage pipelined microprocessor based on the RISC-V instruction set architecture to enhance pipeline execution efficiency. An enhanced Harvard architecture utilizing dual-port ROM is employed to facilitate parallel execution of instruction fetch and memory access operations. Additionally, a three-level address selector is designed to minimize pipeline flush processing cycles resulting from prediction failures. Furthermore, a data forward unit is implemented to mitigate the impact of data hazards on the pipeline, and a two-stage pipeline memory access structure is devised to eliminate pipeline stalls caused by memory access operations. The experimental results show that the processor designed in this paper can operate up to 110 MHz with a CoreMark score of 2.98. The CoreMark*Freq. of the proposed processor exceeds that of the Taiga processor by approximately 15%, and surpasses the VexRiscv processor by approximately 7%. The microprocessor presented in this paper features a compact footprint and high performance, making it highly applicable in the field of Internet of Things.
- 12 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (6) , 1735-1739
Dual Chirps Direction Shift Keying Modulation
Although chirp spread spectrum (CSS) modulation in the LoRa system offers remarkable receiver sensitivity, its data rate is rather limited. Aiming at data rate enhancement, this letter presents a novel modulation scheme called Dual Chirps Direction Shift Keying (DCDSK). The DCDSK employs dual up-chirp or dual down-chirp superposition transmissions to enhance the data rate and introduces a Discrete Fourier Transform (DFT) spectral kurtosis-based non-coherent demodulation algorithm to lower the bit error rate (BER). Moreover, the theoretical BER performance of DCDSK is analysed. The simulation results validate the superiority of the DCDSK modulation over existing CSS-based modulations in terms of both the data rate and the power efficiency.
- 12 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (6) , 1735-1739
Dual Chirps Direction Shift Keying Modulation
Although chirp spread spectrum (CSS) modulation in the LoRa system offers remarkable receiver sensitivity, its data rate is rather limited. Aiming at data rate enhancement, this letter presents a novel modulation scheme called Dual Chirps Direction Shift Keying (DCDSK). The DCDSK employs dual up-chirp or dual down-chirp superposition transmissions to enhance the data rate and introduces a Discrete Fourier Transform (DFT) spectral kurtosis-based non-coherent demodulation algorithm to lower the bit error rate (BER). Moreover, the theoretical BER performance of DCDSK is analysed. The simulation results validate the superiority of the DCDSK modulation over existing CSS-based modulations in terms of both the data rate and the power efficiency.