Geng Chen

Geng Chen

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
18 September 2020 in IEEE Access
Verified
Journal Article
Open access
QZQingtian Zeng
Qingtian Zeng
QSQiang Sun
Qiang Sun
Geng ChenGeng Chen
Geng Chen
HDHua Duan
Hua Duan
CLChao Li
Chao Li
GSGe Song
Ge Song
Wireless cellular traffic prediction is a critical issue for researchers and practitioners in the 5G/B5G field. However, it is very challenging since the wireless cellular traffic usually show high nonlinearities and complex patterns. Most existing wireless cellular traffic prediction methods, lacking abilities of modeling the dynamic spatial-temporal correlations of wireless cellular traffic data, thus cannot yield satisfactory prediction results. To improve the accuracy of 5G/B5G cellular network traffic prediction, more cross-domain data was considered, a cross-service and regional fusion transfer learning strategy (Fusion-transfer) based on the spatial-temporal cross-domain neural network model (STC-N) was proposed. Multiple cross-domain datasets were integrated. The training accuracy of the target service domain based on the data characteristics of its source service domain according to the similarity between services and the similarity between different regions was improved, so the predictive performance of the model was enhanced. The experimental results show that the prediction accuracy of the traffic prediction model is significantly improved after the integration of multiple cross-domain datasets, the RMSE performance of SMS, Call and Internet service can be improved about 8.39%, 13.76% and 5.7% respectively. In addition, compared with the existing transfer strategy, the RMSE of the three services can be improved about 2.48%~13.19%.

16 October 2020 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
XTXiaonan Tan
Xiaonan Tan
Geng ChenGeng Chen
Geng Chen
HSHongyu Sun
Hongyu Sun
A novel vertical handover algorithm based on multi-attribute and neural network for heterogeneous integrated network is proposed in this paper. The whole frame of the algorithm is constructed by setting the network environment in which we use the network resources by switching between UMTS, GPRS, WLAN, 4G, and 5G. Each network build their own three-layer BP (Back Propagation, BP) neural network model and then the maximum transmission rate, minimum delay, SINR (signal to interference and noise ratio, SINR), bit error rate, user moving speed, and packet loss rate which can affect the overall performance of the wireless network are employed as reference objects to participate in the setting of BP neural network input layer neurons and the training and learning process of subsequent neural network data. Finally, the network download rate is adopted as prediction target to evaluate performance on the five wireless networks and then the vertical handover algorithm will select the right wireless network to perform vertical handover decision. The simulation results on MATLAB platform show that the vertical handover algorithm designed in this paper has a handover success rate up to 90% and realizes efficient handover and seamless connectivity between multi-heterogeneous networks.

13 February 2024 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Geng ChenGeng Chen
Geng Chen
SQShuhu Qi
Shuhu Qi
FSFei Shen
Fei Shen
QZQingtian Zeng
Qingtian Zeng
Yudong ZhangYudong Zhang
Yudong Zhang
With the rapid development of applications with different use cases and service demands for edge network, network slicing is an emerging solution for satisfying service-oriented requirements, while the low earth orbit (LEO) satellite caching-assisted communication has been considered as one of the key elements for effective services. With limited resources at the edge of the radio access network (RAN), it is challenging to take advantage of the LEO content cache to joint allocation of communication, computing and caching space (3C) resources. To this end, we investigate the problem of resource slicing and scheduling of joint 3C resources in RAN edge scenario assisted by LEO content caching. A hierarchical resource slicing framework is proposed for dynamic allocation of multidimensional resources. The optimization variables are relaxed and the constraints are adjusted. The sequential quadratic programming (SQP) iteration algorithm is proposed as theoretical offline baseline. Due to its complex solving process and limited real-time performance, we incorporate Long Short-Term Memory (LSTM) into the Soft Actor-Critic (SAC) algorithm to aware extract the distribution characteristics of historical information and propose the deep reinforcement learning algorithm of LSTM-SAC. Meanwhile, the proportional priority based scheduling algorithm is employed in the intra-slice. Compared to SAC, TD3 and DDPG algorithms, the proposed algorithm is the closest to the theoretical value, improves the objective function by 6.95%, 9.52% and 11.52% respectively, which can significantly improve the system rate while satisfying the service level agreements.

24 February 2023 in Sensors
Verified
Journal Article
Open access
PDF file
Geng ChenGeng Chen
Geng Chen
RSRui Shao
Rui Shao
FSFei Shen
Fei Shen
QZQingtian Zeng
Qingtian Zeng
In 5G/B5G communication systems, network slicing is utilized to tackle the problem of the allocation of network resources for diverse services with changing demands. We proposed an algorithm that prioritizes the characteristic requirements of two different services and tackles the problem of allocation and scheduling of resources in the hybrid services system with eMBB and URLLC. Firstly, the resource allocation and scheduling are modeled, subject to the rate and delay constraints of both services. Secondly, the purpose of adopting a dueling deep Q network (Dueling DQN) is to approach the formulated non-convex optimization problem innovatively, in which a resource scheduling mechanism and the ϵ-greedy strategy were utilized to select the optimal resource allocation action. Moreover, the reward-clipping mechanism is introduced to enhance the training stability of Dueling DQN. Meanwhile, we choose a suitable bandwidth allocation resolution to increase flexibility in resource allocation. Finally, the simulations indicate that the proposed Dueling DQN algorithm has excellent performance in terms of quality of experience (QoE), spectrum efficiency (SE) and network utility, and the scheduling mechanism makes the performance much more stable. In contrast with Q-learning, DQN as well as Double DQN, the proposed algorithm based on Dueling DQN improves the network utility by 11%, 8% and 2%, respectively.

23 March 2020 in IEEE Access
Verified
Journal Article
Open access
TZTianyi Zhang
Tianyi Zhang
Geng ChenGeng Chen
Geng Chen
QZQingtian Zeng
Qingtian Zeng
GSGe Song
Ge Song
CLChao Li
Chao Li
HDHua Duan
Hua Duan
Compared with two-dimensional wireless sensor networks (2DWSNs), three-dimensional wireless sensor networks (3DWSNs) have higher node energy consumption and weaker load balancing. To alleviate these problems, we propose a new multi-hop routing clustering protocol for a wide range of 3DWSNs. In terms of clustering, nodes will run for cluster head (CH) by timing broadcast based on their remaining energy and their average distance from surrounding nodes. Two new identity nodes are added between the CH and the member nodes, the load transfer node responsible for transferring the energy consumption of the CH, and the secondary cluster head node (SCH) acting as the CH for the next round. In order to reduce energy consumption in key node areas, we also enable key nodes to communicate directly with the sink node. In the aspect of routing construction, SN generates the routing table corresponding to each CH through our proposed fragile ant colony algorithm. Because CH and SCH exist at the same time and have a certain replacement order, the SN only needs to obtain the location of each CH when the network is first clustered, and can continuously generate a new routing table corresponding to the CH, which reduces the energy consumption of the network in the routing path construction. We simulate this protocol, LEACH protocol, AZ-SEP protocol ,and UCNPD protocol in a three-dimensional environment. The results show that this protocol is better than the other three protocols in terms of network lifetime and network load balance, respectively.

26 March 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
Geng ChenGeng Chen
Geng Chen
FSFang Sun
Fang Sun
HLHongjia Liang
Hongjia Liang
QZQingtian Zeng
Qingtian Zeng
Yudong ZhangYudong Zhang
Yudong Zhang
With the increasing diversity of use cases and service requirements in heterogeneous networks, the concept of network slicing has emerged. However, user association, distributed resource allocation, and the high-speed data rate demands of different users still face numerous challenges. To address these issues, we propose a UAV-assisted RAN resource slicing framework in heterogeneous networks. Firstly, we employ a stable matching game algorithm to solve the access problem between UAVs ( unmanned aerial vehicles) and TBSs (terrestrial base stations). Secondly, we formulate a joint user association and slicing resource allocation problem. However, the optimization problem is non-convex, and the problem is decoupled into two sub-problems: user association and slicing resource allocation. Moreover, a Lagrangian dual algorithm is employed to solve the user association problem, while Multi-Agent Deep Deterministic Policy Gradient based on Matching Game and Lagrangian Dual (MADDPG-M&L) slicing resource allocation algorithm is proposed to determine the allocation ratio of resources for each slice. Simulation results show that the Lagrangian dual-based user association algorithm improves the system performance by 12.8%, 36.2% and 61.9% respectively compared to the other three user association methods. Furthermore, compared to MATD3-M&L, MASAC-M&L, and Hard-slicing, the proposed MADDPG-M&L algorithm improves the throughput by 36.3%, 105%, and 177%, respectively. In terms of latency, the improvements are 46%, 68%, and 86.7%, respectively. For SINR, the increases are 5.2%, 2.9%, and 6.4%, respectively. The objective function improves by 54.7%, 218%, and 336%, respectively, with the data transmission rate showing the most significant improvement.