Jintao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jintao Wang has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Shaodan Ma
University of Macau
18 shared publications - Guanghua Yang
School of Intelligent Systems Science and Engineering and the GBA and BR International Joint Research Center for Smart Logistics, Jinan University, Zhuhai, China
14 shared publications - Zheng Shi
School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai, China
9 shared publications - Xu Wang
Jinan University, Zhuhai, China
6 shared publications - Chengzhi Ma
Department of Electrical and Computer Engineering, State Key Laboratory of Internet of Things for Smart City, University of Macau, Macau, SAR, China
5 shared publications - Yaru Fu
Hong Kong Metropolitan University
5 shared publications
Latest Publications
- 23 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2934-2938
Joint Sparsity and Beamforming Design for RDARS-Aided Systems
Reconfigurable distributed antennas and reflecting surface (RDARS) has emerged as a promising architecture for communication performance enhancement. In particular, the new selection gain can be achieved by leveraging the dynamic working mode selection between connection and reflection modes, whereas low-complexity element configuration remains an open issue. In this paper, we consider a RDARS-assisted communication system, where the connected elements are formed as a uniform sparse array for simplified mode configuration. The sum rate maximization problem is then formulated by jointly optimizing the active and passive beamforming matrices and sparsity of connected element array. For the special cases of a single user equipment (UE) and two UEs, the optimal sparsity designs are derived in closed-form. Then, for an arbitrary number of UEs, a weighted minimum mean-square error-based alternating optimization (AO) algorithm is proposed to tackle the non-convex optimization problem. Numerical results demonstrate the effectiveness of low-complexity sparsity optimization.
- 23 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 2934-2938
Joint Sparsity and Beamforming Design for RDARS-Aided Systems
Reconfigurable distributed antennas and reflecting surface (RDARS) has emerged as a promising architecture for communication performance enhancement. In particular, the new selection gain can be achieved by leveraging the dynamic working mode selection between connection and reflection modes, whereas low-complexity element configuration remains an open issue. In this paper, we consider a RDARS-assisted communication system, where the connected elements are formed as a uniform sparse array for simplified mode configuration. The sum rate maximization problem is then formulated by jointly optimizing the active and passive beamforming matrices and sparsity of connected element array. For the special cases of a single user equipment (UE) and two UEs, the optimal sparsity designs are derived in closed-form. Then, for an arbitrary number of UEs, a weighted minimum mean-square error-based alternating optimization (AO) algorithm is proposed to tackle the non-convex optimization problem. Numerical results demonstrate the effectiveness of low-complexity sparsity optimization.
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 75 (00189456) , 1-11
Error-Based Filtering and Adaptive Weighting for Real-Time DL-TDoA Localization
Downlink time-difference-of-arrival (DL-TDoA) localization using ultra-wideband (UWB) is well suited for supporting large-scale tagging systems, but its accuracy degrades severely under non-line-of-sight (NLOS) conditions. Existing approaches often rely on high-dimensional channel impulse response (CIR) data for NLOS mitigation, yet the associated processing overhead and latency limit their practicality for real-time applications. This paper proposes an error-based filtering and adaptive weighting strategy for DL-TDoA localization that operates without CIR data. The filtering step identifies a subset of potentially erroneous TDoAs by examining the inconsistency between Chan- and LS-based estimates and the most recent valid position, refining the measurement set by selectively removing measurements and recomputing positions to confirm reliable TDoAs. The weighting step adjusts each measurement’s contribution based on the ToF-based ranging error between anchor pairs, as well as the RSSI of the received signal. Experimental evaluations in representative indoor NLOS scenarios demonstrate that the proposed method outperforms both the conventional Chan+Taylor and CIR-Stat algorithms in localization accuracy, while maintaining a relatively low computational overhead, making it suitable for real-time applications.
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 75 (00189456) , 1-11
Error-Based Filtering and Adaptive Weighting for Real-Time DL-TDoA Localization
Downlink time-difference-of-arrival (DL-TDoA) localization using ultra-wideband (UWB) is well suited for supporting large-scale tagging systems, but its accuracy degrades severely under non-line-of-sight (NLOS) conditions. Existing approaches often rely on high-dimensional channel impulse response (CIR) data for NLOS mitigation, yet the associated processing overhead and latency limit their practicality for real-time applications. This paper proposes an error-based filtering and adaptive weighting strategy for DL-TDoA localization that operates without CIR data. The filtering step identifies a subset of potentially erroneous TDoAs by examining the inconsistency between Chan- and LS-based estimates and the most recent valid position, refining the measurement set by selectively removing measurements and recomputing positions to confirm reliable TDoAs. The weighting step adjusts each measurement’s contribution based on the ToF-based ranging error between anchor pairs, as well as the RSSI of the received signal. Experimental evaluations in representative indoor NLOS scenarios demonstrate that the proposed method outperforms both the conventional Chan+Taylor and CIR-Stat algorithms in localization accuracy, while maintaining a relatively low computational overhead, making it suitable for real-time applications.
- 16 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-6
Trajectory Planning for ISAC Systems: Variational Method to Minimization of Completion Time
Integrated sensing and communication (ISAC) en ables a unified framework for high-capacity communications and accurate sensing, where trajectory optimization plays a crucial role in jointly enhancing communication quality and sensing performance. This paper explores trajectory planning for ISAC systems, aiming to minimize the completion time for a radio target (RT) to traverse between designated starting and ending points, while fulfilling a communication task with a minimum data transmission requirement. We introduce the concept of path exposure to characterize path sensitivity by capturing the cumulative sensing intensity along a trajectory. Furthermore, path capacity is proposed to measure the end-to end throughput of a given path. The trajectory planning problem is formulated as the minimization of completion time while maintaining path sensitivity and path capacity requirements. By leveraging the Lagrangian approach, the problem is converted into a framework with calculus of variations and solved using the Euler–Lagrange equation. The boundary value problem (BVP) methodology is then employed to compute the optimal trajectory. Simulation results demonstrate the effectiveness of the proposed continuous trajectory planning approach compared to discrete methods and highlight the inherent trade-off between trajectory length and the quality-of-service requirements in both sensing and communication domains.
- 16 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-6
Trajectory Planning for ISAC Systems: Variational Method to Minimization of Completion Time
Integrated sensing and communication (ISAC) en ables a unified framework for high-capacity communications and accurate sensing, where trajectory optimization plays a crucial role in jointly enhancing communication quality and sensing performance. This paper explores trajectory planning for ISAC systems, aiming to minimize the completion time for a radio target (RT) to traverse between designated starting and ending points, while fulfilling a communication task with a minimum data transmission requirement. We introduce the concept of path exposure to characterize path sensitivity by capturing the cumulative sensing intensity along a trajectory. Furthermore, path capacity is proposed to measure the end-to end throughput of a given path. The trajectory planning problem is formulated as the minimization of completion time while maintaining path sensitivity and path capacity requirements. By leveraging the Lagrangian approach, the problem is converted into a framework with calculus of variations and solved using the Euler–Lagrange equation. The boundary value problem (BVP) methodology is then employed to compute the optimal trajectory. Simulation results demonstrate the effectiveness of the proposed continuous trajectory planning approach compared to discrete methods and highlight the inherent trade-off between trajectory length and the quality-of-service requirements in both sensing and communication domains.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 6228-6232
Robust Discrete Semantic Low-Altitude Communications With Learnable Codebook Transformation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 6228-6232
Robust Discrete Semantic Low-Altitude Communications With Learnable Codebook Transformation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 15736-15752
Diversity-Multiplexing Tradeoff of Variable-Power HARQ-IR-Assisted NOMA Schemes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 15736-15752
Diversity-Multiplexing Tradeoff of Variable-Power HARQ-IR-Assisted NOMA Schemes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3493-3497
Secure Semantic Communications With Information-Theoretic Honeypoints
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3493-3497
Secure Semantic Communications With Information-Theoretic Honeypoints
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 5244-5248
Completion Time Minimization for ISAC: Joint Trajectory Planning and Power Optimization
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 5244-5248
Completion Time Minimization for ISAC: Joint Trajectory Planning and Power Optimization
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8524-8540
HARQ-IR Aided Non-Orthogonal Multiple Access for URLLC: Tradeoff Between Transmission Reliability and Data Freshness
Many emerging artificial intelligence-driven applications rely on the availability of large-scale, stable, and fresh sensing data, underscoring the Ultra-Reliable Low-Latency Communications (URLLC). This paper proposes to amalgamate Non-Orthogonal Multiple Access (NOMA) and Hybrid Automatic Repeat reQuest with Incremental Redundancy (HARQ-IR) to accommodate reliable and real-time wireless services. The outage probability and the Average Age of Information (AAoI) are used to evaluate the transmission reliability and data freshness for HARQ-IR-NOMA schemes. To reveal physical insights as well as ease system designs, the asymptotic outage probability in the high Signal-to-Noise Ratio (SNR) regime is derived by developing a recursive dominant term approximation method. Moreover, the AAoI is deduced in terms of the outage probability by considering an M/G/1/1 queuing model. The asymptotic AAoI at high SNR is shown to be an increasing function of the diversity order-deficiency, which theoretically justifies the tradeoff between the transmission reliability and the data freshness. Furthermore, the AAoI is minimized by optimizing the transmission powers between users as well as HARQ rounds while maintaining the outage and total power constraints. The minimal AAoI is obtained by developing Geometric Programming (GP)-based and Deep Reinforcement Learning (DRL)-based methods. Finally, the numerical results are presented for verification.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8524-8540
HARQ-IR Aided Non-Orthogonal Multiple Access for URLLC: Tradeoff Between Transmission Reliability and Data Freshness
Many emerging artificial intelligence-driven applications rely on the availability of large-scale, stable, and fresh sensing data, underscoring the Ultra-Reliable Low-Latency Communications (URLLC). This paper proposes to amalgamate Non-Orthogonal Multiple Access (NOMA) and Hybrid Automatic Repeat reQuest with Incremental Redundancy (HARQ-IR) to accommodate reliable and real-time wireless services. The outage probability and the Average Age of Information (AAoI) are used to evaluate the transmission reliability and data freshness for HARQ-IR-NOMA schemes. To reveal physical insights as well as ease system designs, the asymptotic outage probability in the high Signal-to-Noise Ratio (SNR) regime is derived by developing a recursive dominant term approximation method. Moreover, the AAoI is deduced in terms of the outage probability by considering an M/G/1/1 queuing model. The asymptotic AAoI at high SNR is shown to be an increasing function of the diversity order-deficiency, which theoretically justifies the tradeoff between the transmission reliability and the data freshness. Furthermore, the AAoI is minimized by optimizing the transmission powers between users as well as HARQ rounds while maintaining the outage and total power constraints. The minimal AAoI is obtained by developing Geometric Programming (GP)-based and Deep Reinforcement Learning (DRL)-based methods. Finally, the numerical results are presented for verification.