Mengyuan Lee

Prof. Mengyuan Lee

Zhejiang University
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 December 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MLMengyuan Lee
Mengyuan Lee
Guanding YuGuanding Yu
Guanding Yu
GLGeoffrey Ye Li
Geoffrey Ye Li
Link scheduling in device-to-device (D2D) networks is usually formulated as a non-convex combinatorial problem, which is generally NP-hard and difficult to get the optimal solution. Traditional methods to solve this problem are mainly based on mathematical optimization techniques, where accurate channel state information (CSI), usually obtained through channel estimation and feedback, is needed. To overcome the high computational complexity of the traditional methods and eliminate the costly channel estimation stage, machine leaning (ML) has been introduced recently to address the wireless link scheduling problems. In this article, we propose a novel graph embedding based method for link scheduling in D2D networks. We first construct a fully-connected directed graph for the D2D network, where each D2D pair is a node while interference links among D2D pairs are the edges. Then we compute a low-dimensional feature vector for each node in the graph. The graph embedding process is based on the distances of both communication and interference links, therefore without requiring the accurate CSI. By utilizing a multi-layer classifier, a scheduling strategy can be learned in a supervised manner based on the graph embedding results for each node. We also propose an unsupervised manner to train the graph embedding based method to further reinforce the scalability and develop a K-nearest neighbor graph representation method to reduce the computational complexity. Extensive simulation demonstrates that the proposed method is near-optimal compared with the existing state-of-art methods but is with only hundreds of training network layouts. It is also competitive in terms of scalability and generalizability to more complicated scenarios.

4 June 2018 in IEEE Wireless Communications Letters
Verified
Journal Article
Open access
MLMengyuan Lee
Mengyuan Lee
YXYuanhao Xiong
Yuanhao Xiong
Guanding YuGuanding Yu
Guanding Yu
GLGeoffrey Ye Li
Geoffrey Ye Li
Many resource allocation issues in wireless communications can be modeled as assignment problems and can be solved online with global information. However, traditional methods for assignment problems take a lot of time to find the optimal solutions. In this letter, we solve the assignment problem using machine learning (ML) approach. Specifically, the linear sum assignment problems (LSAPs) are solved by the deep neural networks (DNNs). Since LSAP is a combinatorial optimization problem, it is first decomposed into several sub-assignment problems. Each of them is a classification problem and can be solved effectively with DNNs. Two kinds of DNNs, feed-forward neural network (FNN) and convolutional neural network (CNN), are implemented to deal with the sub-assignment problems, respectively. Based on computer simulation, DNNs can effectively solve LSAPs with great time efficiency and only slight loss of accuracy.

15 November 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MLMengyuan Lee
Mengyuan Lee
Guanding YuGuanding Yu
Guanding Yu
GLGeoffrey Ye Li
Geoffrey Ye Li
Resource allocation in wireless networks, such as device-to-device (D2D) communications, is usually formulated as mixed integer nonlinear programming (MINLP) problems, which are generally NP-hard and difficult to get the optimal solutions. Traditional methods to solve these MINLP problems are all based on mathematical optimization techniques, such as the branch-and-bound (B\&B) algorithm that converges slowly and has forbidding complexity for real-time implementation. Therefore, machine leaning (ML) has been used recently to address the MINLP problems in wireless communications. In this paper, we use imitation learning method to accelerate the B\&B algorithm. With invariant problem-independent features and appropriate problem-dependent feature selection for D2D communications, a good auxiliary prune policy can be learned in a supervised manner to speed up the most time-consuming branch process of the B\&B algorithm. Moreover, we develop a mixed training strategy to further reinforce the generalization ability and a deep neural network (DNN) with a novel loss function to achieve better dynamic control over optimality and computational complexity. Extensive simulation demonstrates that the proposed method can achieve good optimality and reduce computational complexity simultaneously.

8 November 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MLMengyuan Lee
Mengyuan Lee
Guanding YuGuanding Yu
Guanding Yu
HDHuaiyu Dai
Huaiyu Dai
Graph neural network (GNN) is an efficient neural network model for graph data and is widely used in different fields, including wireless communications. Different from other neural network models, GNN can be implemented in a decentralized manner during the inference stage with information exchanges among neighbors, making it a potentially powerful tool for decentralized control in wireless communication systems. The main bottleneck, however, is wireless channel impairments that deteriorate the prediction robustness of GNN. To overcome this obstacle, we analyze and enhance the robustness of the decentralized GNN during the inference stage in different wireless communication systems in this paper. Specifically, using a GNN binary classifier as an example, we first develop a methodology to verify whether the predictions are robust. Then, we analyze the performance of the decentralized GNN binary classifier in both uncoded and coded wireless communication systems. To remedy imperfect wireless transmission and enhance the prediction robustness, we further propose novel retransmission mechanisms for the above two communication systems, respectively. Through simulations on the synthetic graph data, we validate our analysis, verify the effectiveness of the proposed retransmission mechanisms, and provide some insights for practical implementation.

26 October 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MLMengyuan Lee
Mengyuan Lee
NMNing Ma
Ning Ma
Guanding YuGuanding Yu
Guanding Yu
HDHuaiyu Dai
Huaiyu Dai
Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems, which are NP-hard and can be widely found in the area of wireless resource allocation. The main idea of GBD is decomposing an MINLP problem into a primal problem and a master problem, which are iteratively solved until their solutions converge. However, a direct implementation of GBD is time- and memory-consuming. The main bottleneck is the high complexity of the master problem, which increases over the iterations. Therefore, we propose to leverage machine learning (ML) techniques to accelerate GBD aiming at decreasing the complexity of the master problem. Specifically, we utilize two different ML techniques, classification and regression, to deal with this acceleration task. In this way, a cut classifier and a cut regressor are learned, respectively, to distinguish between useful and useless cuts. Only useful cuts are added to the master problem and thus the complexity of the master problem is reduced. By using a resource allocation problem in device-to-device communication networks as an example, we validate that the proposed method can reduce the computational complexity of GBD without loss of optimality and has good generalization ability. The proposed method is applicable for solving various MINLP problems in wireless networks since the designs are invariant for different problems.

24 March 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
RLRui Liu
Rui Liu
MLMengyuan Lee
Mengyuan Lee
Guanding YuGuanding Yu
Guanding Yu
GLGeoffrey Ye Li
Geoffrey Ye Li
Millimeter-wave (mmWave) communication has been regarded as one of the most promising means to improve the cellular system capacity in the fifth-generation (5G) era. Compared with the conventional microwave communication networks, mmWave terminals should connect with multiple base stations (BSs) simultaneously to prevent the signal blockage. Meanwhile, the accurate instantaneous channel state information (CSI) is difficult to estimate and collect due to the densification of mmWave BSs. These unique characteristics pose stiff challenges to user association in mmWave networks. To deal with these issues, we develop a novel machine learning based user association approach to support multi-connectivity in mmWave networks. Specifically, we first formulate the mmWave user association problem as a multi-label classification problem, which is then transformed into a series of single-label classification problems through efficient multi-label classification algorithms. To further reduce the requirement on the amount of training samples, we utilize graphical model to represent the user association scenario and adopt novel feature extraction methods to obtain appropriate features from both geographical location information and topological information. With appropriate features, each single-label classification problem can be trained in a supervised manner. Test results show that the proposed approach can achieve a good performance with only a few training samples and without the need of CSI.