VLDB 2026 Research / reviewers in the wild / expert
Mengke Yang
dblp:214/1069
· DBLP profile ↗
6ranked-venue papers
4as first author
5since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 4 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Base Station Sleeping Strategy for Large-Scale Scenarios With Multi-Time-Window Spatio-Temporal Graph Convolutional NetworkabstractThe explosive growth of mobile data traffic has prompted operators to deploy a large number of base stations (BSs). However, due to the uneven traffic distribution, many BSs remain underutilized or idle during off-peak periods while still consuming substantial amounts of energy. To tackle this issue, we propose a Proactive Optimization-based (PO-based) BS sleeping strategy for large scale scenarios with hundreds of BSs. Specifically, by analyzing the Autocorrelation Function (ACF) of BS traffic in real-world scenarios, we identify multiple potential periods. Guided by this insight, we introduce multi-time-window mechanism and Graph Convolutional Network (GCN), designing Multi-Time-Window Spatio-Temporal Graph Convolutional Network (MTSGCN) to effectively capture the complex spatio-temporal dependencies present large-scale settings. The forecasted results acquired by MTSGCN serve as inputs to a multiple-BSs cooperative sleeping problem with the objective to minimize the total energy consumption. To tackle this huge problem efficiently, we first use K-means++ to divide the large region into several small cooperative clusters and then adopt the Integral Linear Programming (ILP) algorithm to solve each subproblem. Experimental results demonstrate that MTSGCN reduce the forecasting error by 10.9% compared with the state-of-the-art methods. Furthermore, the proposed MTSGCN-ILP algorithm achieves over 20% energy savings gains compared to the other typical strategies. Mengke Yang, Daosen Zhai, Ruonan Zhang 0001, Lei Liu 0031, Zhiquan Liu 0001, Dusit Niyato |
IEEE Trans. Commun. | 1 |
| 2025 | Hypergraph Neural Network Assisted Robust Beamforming for Cell-Free Massive MIMOabstractCell-free massive MIMO (CF mMIMO) systems overcome inter-cell interference, enhancing overall communication rates for next-generation networks. However, the pilot contamination exacerbates channel estimation errors and the complex connectivity makes it difficult to deal with resource allocation optimization problem. In this paper, we investigate the robust beamforming problem under channel uncertainty with the goal of improving the minimum quantile rate. Specifically, we introduce hypergraph neural network (HGNN) into the wireless resource allocation of CF mMIMO ststems for the first time, leveraging hypergraph modeling to capture the many-to-many relationships between Access Points (APs) and User Equipments (UEs). Furthermore, we significantly reduce the search space of the optimization problem by applying optimal interference suppression beamforming theory. In order to soften the sorting process, we adopt the Monte Carlo sampling strategy for data augmentation. Simulation results demonstrate that the proposed algorithm outperforms conventional schemes, achieving 14.1% performance gain and converging more than twice as fast as the state-of-the-art machine learning models. Mengke Yang, Daosen Zhai, Haotong Cao, Sherif Moussa, Tamer Mohamed Abdellatif |
GLOBECOM | 1 |
| 2025 | Dynamic multi-objective optimization method for production index of cement clinker firing process based on collaborative prediction strategy
Gang Liu 0033, Shangjian Xie, Xiaochen Hao, Mengke Yang, Xunian Yang, Xingxing Xu |
Eng. Appl. Artif. Intell. | 4 |
| 2024 | Message Passing Assisted Scalable Distributed Link Management for Ubiquitous NetworkabstractThe development of the next generation ubiquitous network puts forward higher requirements for the connection density in the communication network, e.g., massive IoT and UAV swarm, which has led to a lot of research on link management. With the expansion of network scale, the weaknesses of existing algorithms in computing efficiency, performance, and realizability have become prominent. The emerging graph neural network (GNN) provides another way to solve this problem. In this paper, we design a cross-receptive distributed GNN structure from the perspective of communication system, combining measurable index of the actual scene with message passing frame. This new GNN structure and the additional input feature dimension work together to provide richer and more comprehensive information for network training. After the initial deployment of the power decision from GNN, we select some links to shut down and others to reduce their transmit power to further improve system performance and save energy. Simulation results show that our proposed method reaches 83.1% performance of the centralized mechanism. In addition, the discussion on scalability suggests that in order to save training cost, small-scale scenes with the same density can be selected for training in the application of large-scale scenes. Mengke Yang, Daosen Zhai, Haotong Cao, Bin Li 0017, Mubarak Alrashoud |
ICC | 1 |
| 2023 | Joint Admission and Power Control for Big Data Access Management Using GATabstractThe emerging artificial intelligence (AI) puts forward high requirement for big data acquisition, which is difficult to be met with the existing communication technologies in real time. In this paper, we investigate new graph learning based access management scheme for supporting the real-time big data acquisition in the sixth-generation mobile communication system (6G). We model the network scene with a mass of communication links as a fully connected graph which takes into account the accumulative interference of all links. Then, the joint admission and power control problem is formulated as a combinatorial optimization problem. We propose a graph attention network (GAT) based algorithm which can learn the system features by weighted aggregation of neighbor nodes. In addition, we construct a differentiable loss function that can accurately express the optimization objective and train the network by the change of loss. Based on the output of the GAT, we iteratively optimize the link admission and power to active more links. Simulation results demonstrate that the proposed algorithm is superior to the traditional convex optimization based algorithms and the nonmodified GAT based algorithms in the number of activated links. Moreover, the training of the constructed network is unsupervised with high computational efficiency, which makes them suitable for the big data access management. Mengke Yang, Daosen Zhai, Ruonan Zhang 0001, Haotong Cao, Lin Cai 0001, F. Richard Yu |
GLOBECOM | 1 |
| 2018 | A Grid-Based Identification Code for Buildings: Perspective from Spatial Fault ToleranceabstractBuildings are important elements in modern cities, and the identification of buildings provides the foundation to smart city construction. In this paper, we aimed to put forward a new identification code for buildings from the aspect of spatial fault tolerance. Taking the location information into consideration, buildings were identified with one-dimensional integer codes based on discrete global grid system (DGGS). Results illustrated that this identification code could express location information of buildings explicitly, and remained unchanged even when there were tiny spatial offsets. The percentage of unchanged codes was 90%, 81%, 65% 32% under different offsets of 0.5 m, 1 m, 2 m and 5 m, respectively. We concluded that this identification code was conducive to the more efficient management of buildings, and might additionally benefit the smart city construction. Kun Qi, Weixin Zhai, Yi'na Hu, Mengke Yang, Chengqi Cheng |
IGARSS | 5 |