Demo Data from EDBT 2026 / reviewers in the wild / expert
Yanlei Chen
dblp:139/0395
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Internet of things and sensor networks · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet of things and sensor networks › wireless sensor network › energy-constrained sensor network
battery-free wireless sensor networks |
1.0 | 1 | 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNs · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks › wireless sensor network
coverage problem |
1.0 | 1 | 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNs · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks › wireless sensor network › coverage problem
k-coverage |
1.0 | 1 | 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNs · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks › wireless sensor network › sensor scheduling
sleep scheduling |
1.0 | 1 | 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNs · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks
wireless sensor network |
1.0 | 1 | 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNs · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
distributed iterative grouping · 2.0adaptive sampling · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Sleep Scheduling Algorithm for the $k$k-Coverage Problem in 3D Heterogenous BF-WSNsabstractBattery-free Wireless Sensor Networks (BF-WSNs) have emerged as an essential part of Internet of Things (IoT) systems. Although two-dimensional (2D) BF-WSNs have been researched, three-dimensional (3D) ones are more indicative of real-world applications. Achieving$k$-coverage in this scenario is a greater challenge and has yet to be investigated. This paper presents an optimization problem in heterogeneous 3D BF-WSNs to maximize$k$-coverage quality while considering the recharging and sampling rates. We prove the problem is NP-Hard and decouple it into two subproblems. The first optimizes$k$-coverage quality for each time slot without energy constraints. The second ensures that nodes scheduled for operation in each time slot can be immediately replenished with sufficient energy. We prove the near-optimal and optimal solutions to the two subproblems composes the near-optimal solution to the original problem. Following the development of Distributed Iterative Grouping (DIG) algorithm and Adaptive Sampling (AS) method to address two subproblems each, we propose a sleep scheduling algorithm to integrate them and solve the original problem. Simulation results verify the effectiveness and efficiency of the proposed algorithm. Yanlei Chen, Haoyang Zhou, Jingjing Li 0002, Na Tang |
IEEE Trans. Mob. Comput. | 1 |