Demo Data from VLDB 2026 / reviewers in the wild / expert
Mengchen Yao
dblp:397/5999
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0008-2164-2287ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 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 |
Vehicular, aerial and satellite networks · 44% Routing and switching · 44% Wireless networking · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
path planning |
1.0 | 1 | 2026 | Interference-Aware UAV Path Planning on Grid SINR Maps With Event-Triggered Updates · IEEE Trans. Mob. Comput. 2026 |
Vehicular, aerial and satellite networks › aerial networks
UAV networks |
1.0 | 1 | 2026 | Interference-Aware UAV Path Planning on Grid SINR Maps With Event-Triggered Updates · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.0mixture of experts · 1.0dueling double DQN · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Interference-Aware UAV Path Planning on Grid SINR Maps With Event-Triggered UpdatesabstractUrban unmanned aerial vehicle (UAV) navigation operates under tight bandwidth, compute, and latency budgets. Interference and building blockage cause rapid link fluctuations, making interference-aware path planning on grid signal-to-interference-plus-noise ratio (SINR) maps essential for reliable communication. In this paper, we formulate the problem as a joint update–navigation decision: map uncertainty triggers on-demand partial refreshes that are co-optimized with motion under a bandwidth budget. We introduce UT-Grid, an uncertainty-triggered grid-update framework, that refreshes conditionally triggered upon necessity to reduce overall map-update traffic, and MoE-D3QN, a Dueling Double DQN with sparse Mixture-of-Experts (Top-1 routing) that activates a single expert per step, cutting per-decision active parameters and FLOPs while matching or surpassing comparable dense D3QN planners. In an urban simulation with multi-source interference, the framework outperforms static-map, periodic-refresh, and dense D3QN baselines, increasing reaching probability and path efficiency while markedly reducing communication overhead. Lantu Guo, Mengchen Yao, Han Zhang 0009, Weiqing Mu, Yun Lin 0005 |
IEEE Trans. Mob. Comput. | 2 |
| 2025 | CL-MFGCN: Graph Structure Contrastive Learning and Multiscale Feature Fusion Graph Convolutional Network for Spectrum PredictionabstractTo address the conflict between the limited availability of spectrum resources and the swiftly growing number of frequency equipment in the Internet of Vehicles, this article starts from the solution of dynamic access of radio equipment and studies the problem of power spectrum density prediction of different channels, which is called spectrum prediction. We first propose the graph structure learning problem of electromagnetic spectrum data under the graph contrastive learning (GCL) framework from the causal perspective, and establishes a graph structure representation model between channel signal activity rules. Then, we establish the statistical distribution models of different channels at fine resolution based on the Gaussian mixture model. Then, the statistical model is embedded as prior knowledge using a graph convolutional network (GCN), and the channel association features are mapped to the association knowledge embedding using a graph structure encoder. This article proposes a novel spectrum prediction architecture based on GCL and multiscale feature fusion GCN (CL-MFGCN) to mine the time-frequency implicit knowledge of spectrum data, and the above knowledge embedding is integrated. This article visualizes the channel association relationship in the form of a graph structure. The experimental results indicate that the CL-MFGCN, reduces the average MAE by 14.6% (from 1.436 to 1.226) and the average MAPE by 12.9% (from 0.017 to 0.0148) compared to the second-best Pyraformer model, while maintaining a lower model complexity. Yaxiu Sun, Yu Han 0003, Mengchen Yao, Qiao Tian 0002, Yun Lin 0005 |
IEEE Internet Things J. | 5 |