Wen Chen

Wen Chen


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 January 2020 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
WCWen Chen
Wen Chen
SXSuchao Xiao
Suchao Xiao
LLLeijie Liu
Leijie Liu
XJXueqin Jiang
Xueqin Jiang
ZTZhangbin Tang
Zhangbin Tang

1 November 2018
Verified
Conference Paper
Closed access
SXSuchao Xiao
Suchao Xiao
WCWen Chen
Wen Chen
5G networks will be characterized by the extremely wide bandwidth that will be available to the user. A more flexible transmission network is necessary to support the demand generated by the access network to continuously increase network bandwidth. Transport network slicing will be a promising technology to address those challenges. In this paper, we focused on the dynamic resource allocation problem of bandwidth in transport network slices. We introduce a novel LSTM -based traffic-predict dynamic transport network slicing framework (LSTM-TPDTNS). Our approach consists of two phases: the traffic prediction phase and the bandwidth configuration phase. For the first phase, we use long and short memory models to predict traffic. For the second phase, we model our problem as a fractional knapsack problem, and we use greedy algorithms to find approximate solutions. Dynamic allocation of resources to services of different priorities can be realized, thereby improving the service quality and user experience of the entire system.

30 April 2021 in Sensors
Verified
Journal Article
Open access
PDF file
WCWen Chen
Wen Chen
Yongqi ZhuYongqi Zhu
Yongqi Zhu
JLJiawei Liu
Jiawei Liu
Yuhu ChenYuhu Chen
Yuhu Chen
With the exponential growth of mobile devices and the emergence of computationally intensive and delay-sensitive tasks, the enormous demand for data and computing resources has become a big challenge. Fortunately, the combination of mobile edge computing (MEC) and ultra-dense network (UDN) is considered to be an effective way to solve these challenges. Due to the highly dynamic mobility of mobile devices and the randomness of the work requests, the load imbalance between MEC servers will affect the performance of the entire network. In this paper, the software defined network (SDN) is applied to the task allocation in the MEC scenario of UDN, which is based on routing of corresponding information between MEC servers. Secondly, a new load balancing algorithm based on load estimation by user load prediction is proposed to solve the NP-hard problem in task offloading. Furthermore, a genetic algorithm (GA) is used to prove the effectiveness and rapidity of the algorithm. At present, if the load balancing algorithm only depends on the actual load of each MEC, it usually leads to ping-pong effect. It is worth mentioning that our method can effectively reduce the impact of ping-pong effect. In addition, this paper also discusses the subtask offloading problem of divisible tasks and the corresponding solutions. At last, simulation results demonstrate the efficiency of our method in balancing load among MEC servers and its ability to optimize systematic stability.

7 December 2017 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
Xue-qin JiangXue-qin Jiang
Xue-qin Jiang
YZYanyan Zheng
Yanyan Zheng
WCWen Chen
Wen Chen
Miaowen WenMiaowen Wen
Miaowen Wen
JLJun Li
Jun Li
Although Maximum-Likelihood (ML) detection is able to achieve optimal performance in Generalized Spatial Modulation (GSM) systems, its exhaustive search leads to an intractable computational complexity. In this letter, Two-Layer Low-Density Parity-Check (TL-LDPC) codes are proposed to reduce the combinations of Transmission Vectors (TV) in LDPC coded GSM systems. Simulation results show that the complexity of the ML detection in the TL-LDPC coded GSM systems is much lower than that of the ML detection in conventional LDPC coded GSM systems with a negligible performance loss.

13 June 2024 in Computer Networks
Verified
Journal Article
Closed access
WCWen Chen
Wen Chen
YYYuxiao Yang
Yuxiao Yang
SLSibin Liu
Sibin Liu
WHWenjing Hu
Wenjing Hu

28 February 2025 in Sensors
Verified
Journal Article
Open access
PDF file
WCWen Chen
Wen Chen
SLSibin Liu
Sibin Liu
YYYuxiao Yang
Yuxiao Yang
WHWenjing Hu
Wenjing Hu
JYJinming Yu
Jinming Yu
In mobile edge computing networks, achieving effective load balancing across edge server nodes is essential for minimizing task processing latency. However, the lack of a priori knowledge regarding the current load state of edge nodes for user devices presents a significant challenge in multi-user, multi-edge node scenarios. This challenge is exacerbated by the inherent dynamics and uncertainty of edge node load variations. To tackle these issues, we propose a deep reinforcement learning-based approach for task offloading and resource allocation, aiming to balance the load on edge nodes while reducing the long-term average cost. Specifically, we decompose the optimization problem into two subproblems, task offloading and resource allocation. The Karush–Kuhn–Tucker (KKT) conditions are employed to derive the optimal strategy for communication bandwidth and computational resource allocation for edge nodes. We utilize Long Short-Term Memory (LSTM) networks to forecast the real-time activity of edge nodes. Additionally, we integrate deep compression techniques to expedite model convergence, facilitating faster execution on user devices. Our simulation results demonstrate that our proposed scheme achieves a 47% reduction in terms of the task drop rate, a 14% decrease in the total system cost, and a 7.6% improvement in the runtime compared to the baseline schemes.