Bingkun Yao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bingkun Yao has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hong Gao
Zhejiang Normal University
3 shared publications - Jianzhong Li
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
3 shared publications - Jie Zhou
Southeast University, Nanjing, Jiangsu, China
2 shared publications - Nan Guan
City University of Hong Kong
2 shared publications - Ning Wang
City University of Hong Kong, Hong Kong, Hong Kong, Hong Kong
2 shared publications - Xi Wang
Southeast University, Nanjing, Jiangsu, China
2 shared publications
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
CircuitDiff: Bridging Netlist Knowledge with RTL based on Graph Denoising Diffusion
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCircuitDiff: Bridging Netlist Knowledge with RTL based on Graph Denoising Diffusion
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Insights from Verification: Training a Verilog Generation LLM using Reinforcement Learning with Testbench Feedback
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessInsights from Verification: Training a Verilog Generation LLM using Reinforcement Learning with Testbench Feedback
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (3) , 3663-3679
Minimizing the AoI for Pull-Based Target-Level Data Collection in Energy-Harvesting IoTs
Data collection is a crucial task of IoTs. According to the data collection scheme and the required data granularity, data collection in IoTs can be classified into pull-based/push-based data collection as well as node-level/target-level data collection. Thus, there are four scenarios for data collection: Push-based node-level data collection (Push-Node), Push-based target-level data collection (Push-Target), Pull-based node-level data collection (Pull-Node), and Pull-based target-level data collection (Pull-Target). Energy-Harvesting IoT (EH-IoT) is an important component of IoTs and the Age of Information (AoI) minimization problem has been studied extensively for data collection in EH-IoTs. However, existing works only studied the problem under the scenario of Push-Node, Push-Target and Pull-Node. Therefore, this paper investigates the AoI minimization problem for Pull-based Target-level data collection in EH-IoTs (AoI-Pull-Target) for the first time. AoI-Pull-Target is formally defined and proved to be NP-hard. A two-stage dynamic programming-based node scheduling algorithm and a real-time schedule adjustment scheme are proposed to solve the problem. The proposed algorithm is analyzed theoretically. Extensive simulations and real-world testbed experiments verify the high performance of our algorithm.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (3) , 3663-3679
Minimizing the AoI for Pull-Based Target-Level Data Collection in Energy-Harvesting IoTs
Data collection is a crucial task of IoTs. According to the data collection scheme and the required data granularity, data collection in IoTs can be classified into pull-based/push-based data collection as well as node-level/target-level data collection. Thus, there are four scenarios for data collection: Push-based node-level data collection (Push-Node), Push-based target-level data collection (Push-Target), Pull-based node-level data collection (Pull-Node), and Pull-based target-level data collection (Pull-Target). Energy-Harvesting IoT (EH-IoT) is an important component of IoTs and the Age of Information (AoI) minimization problem has been studied extensively for data collection in EH-IoTs. However, existing works only studied the problem under the scenario of Push-Node, Push-Target and Pull-Node. Therefore, this paper investigates the AoI minimization problem for Pull-based Target-level data collection in EH-IoTs (AoI-Pull-Target) for the first time. AoI-Pull-Target is formally defined and proved to be NP-hard. A two-stage dynamic programming-based node scheduling algorithm and a real-time schedule adjustment scheme are proposed to solve the problem. The proposed algorithm is analyzed theoretically. Extensive simulations and real-world testbed experiments verify the high performance of our algorithm.
- 24 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 22 (8) , 4754-4772
Maximum AoI Minimization for Target Monitoring in Battery-Free Wireless Sensor Networks
Age of Information (AoI) has been proposed to measure the freshness of the sensory data for IoT applications. In Battery-free WSNs (BF-WSNs), The AoI minimization data collection problem has been extensively studied. Apart from data collection, target monitoring is also an important application for BF-WSNs. To capture the freshness of the sensory data, the AoI related to targets (The AoI of targets) needs to be considered. To guarantee the performance of the target monitoring system, the maximum AoI of all targets should be minimized. However, existing works mainly investigated the AoI related to nodes (The AoI of nodes), which is different from the AoI of targets. Also, existing energy models are not practical enough for battery-free nodes. To deal with those problems, in this paper, we first propose a more practical energy model. Then the problem of Maximum AoI minimization for Target monitoring in Battery-free WSNs (MTB) is formally defined based on the proposed energy model. A two-stage algorithm is proposed to solve MTB optimally, in which all nodes in the network are scheduled collaboratively to monitor all the targets in the monitoring field. Extensive simulations and real-world experiments verify the high performance of our algorithm and energy model.
- 24 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 22 (8) , 4754-4772
Maximum AoI Minimization for Target Monitoring in Battery-Free Wireless Sensor Networks
Age of Information (AoI) has been proposed to measure the freshness of the sensory data for IoT applications. In Battery-free WSNs (BF-WSNs), The AoI minimization data collection problem has been extensively studied. Apart from data collection, target monitoring is also an important application for BF-WSNs. To capture the freshness of the sensory data, the AoI related to targets (The AoI of targets) needs to be considered. To guarantee the performance of the target monitoring system, the maximum AoI of all targets should be minimized. However, existing works mainly investigated the AoI related to nodes (The AoI of nodes), which is different from the AoI of targets. Also, existing energy models are not practical enough for battery-free nodes. To deal with those problems, in this paper, we first propose a more practical energy model. Then the problem of Maximum AoI minimization for Target monitoring in Battery-free WSNs (MTB) is formally defined based on the proposed energy model. A two-stage algorithm is proposed to solve MTB optimally, in which all nodes in the network are scheduled collaboratively to monitor all the targets in the monitoring field. Extensive simulations and real-world experiments verify the high performance of our algorithm and energy model.
- 21 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (10) , 8514-8529
Energy-Adaptive and Bottleneck-Aware Many-to-Many Communication Scheduling for Battery-Free WSNs
Battery-Free Wireless Sensor Networks (BF-WSNs) have captured the interest of research community in recent years. Compared with traditional Battery-powered WSNs (BP-WSNs), BF-WSNs can prolong the lifetime of the network by exploiting ambient energy. Many-to-many communication is widely used in many applications of WSNs and the problem of minimum-latency many-to-many communication scheduling in BF-WSNs is of great significance. However, this problem has not been studied yet. Existing algorithms for BP-WSNs and BF-WSNs are not suitable for minimum-latency many-to-many scheduling problem in BF-WSNs. Also, different from BP-WSNs, energy-bottleneck nodes with low recharge rate and high workload in BF-WSNs make the problem more challenging. To address these issues, in this paper, we first study the problem of many-to-many scheduling in BF-WSNs with the purpose of minimizing communication latency. The problem is formally defined and proved to be NP-Hard. The energy-adaptive and bottleneck-aware scheduling algorithm for many-to-many in BF-WSNs is proposed. The correctness and average latency of proposed algorithm are carefully analysed. Extensive simulations show that our algorithm has high performance, in terms of communication latency and energy usage ratio. Further, we also extend the proposed algorithm to other network models.
- 21 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (10) , 8514-8529
Energy-Adaptive and Bottleneck-Aware Many-to-Many Communication Scheduling for Battery-Free WSNs
Battery-Free Wireless Sensor Networks (BF-WSNs) have captured the interest of research community in recent years. Compared with traditional Battery-powered WSNs (BP-WSNs), BF-WSNs can prolong the lifetime of the network by exploiting ambient energy. Many-to-many communication is widely used in many applications of WSNs and the problem of minimum-latency many-to-many communication scheduling in BF-WSNs is of great significance. However, this problem has not been studied yet. Existing algorithms for BP-WSNs and BF-WSNs are not suitable for minimum-latency many-to-many scheduling problem in BF-WSNs. Also, different from BP-WSNs, energy-bottleneck nodes with low recharge rate and high workload in BF-WSNs make the problem more challenging. To address these issues, in this paper, we first study the problem of many-to-many scheduling in BF-WSNs with the purpose of minimizing communication latency. The problem is formally defined and proved to be NP-Hard. The energy-adaptive and bottleneck-aware scheduling algorithm for many-to-many in BF-WSNs is proposed. The correctness and average latency of proposed algorithm are carefully analysed. Extensive simulations show that our algorithm has high performance, in terms of communication latency and energy usage ratio. Further, we also extend the proposed algorithm to other network models.