Qinghang Gao

Qinghang Gao

Auto-generated profile, based on publicly available information

Qinghang Gao

College of Intelligence and Computing, Tianjin University, Tianjin, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
20 April 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
QGQinghang Gao
Qinghang Gao
HWHao Wang
Hao Wang
LWLiyong Wan
Liyong Wan
JXJianmao Xiao
Jianmao Xiao
LWLong Wang
Long Wang
With the 5G millimeter wave (mmWave) application, ultradense cellular networks are gradually becoming one of the core characteristics of 5G cellular networks. In the edge computing environment, considering load balancing among edge nodes is beneficial to slow down the process of distributed denial of service (DDoS) attack. However, most existing studies have given less consideration to congestion in the multiuser and multiedge server models. Someone who uses the M/M/1 model also seems to ignore the effect of scheduling algorithms on the Markov property of the task arrival process. In this manuscript, based on ensuring the quality of experience (QoE) for users, the G/M/1 model is introduced to the task scheduling of edge servers for the first time to improve load balancing between edge servers. For the multi armed bandit (MAB) algorithm framework, specific metrics are established to quantify the degree of its equilibrium. The number of users assigned to the edge nodes and each edge nodes processing of specific tasks is taken into account. We experimentally evaluated its performance against two baseline approaches and three state-of-the-art approaches on a real-world dataset. And the experimental results validate the effectiveness of this method.

28 November 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
QGQinghang Gao
Qinghang Gao
JXJianmao Xiao
Jianmao Xiao
HWHao Wang
Hao Wang
Yuanlong CaoYuanlong Cao
Yuanlong Cao
Shuguang DengShuguang Deng
Shuguang Deng
ZFZhiyong Feng
Zhiyong Feng
With the development of 5G technology, ultra-dense cellular networks are becoming a trend, while the deployment of large-area and high-density base stations (BSs) will bring new energy consumption problems. In this paper, we explore the energy consumption of the edge demand response (EDR) from the two perspectives of edge users and edge facility providers. While guaranteeing the essential quality of experience (QoE), we try to improve the load balancing of edge servers and reduce system energy consumption. On the edge facility provider side, we mainly consider the physical machine turn-on problem and resource allocation of the two-phase EDR. On the user side, we start with user cost reduction and sub-channel power allocation to emphasize the QoE. Firstly, considering the density impacts of users and edge servers, we take inspiration from the classical PageRank algorithm and propose a method to calculate the edge nodes’ weights and thus determine the infrastructure’s state. Subsequently, combining distance factors, we design a sub-channel power allocation method based on dynamic planning for 5G power domain multiplexing non-orthogonal multiple access (PDM-NOMA). More importantly, based on the above work, we optimize the two-phase EDR process based on the upper confidence bound (UCB) algorithm of the multi-armed bandit (MAB) algorithm framework and dynamic planning. We compare the proposed QEL-UCB algorithm with two classical and five state-of-the-art algorithms on a real-world dataset. The experimental results demonstrate that the proposed method improves by 18.52% in load balancing and reduces by 18.59% in energy consumption, which validates the method’s effectiveness.

2 December 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
QGQinghang Gao
Qinghang Gao
JXJianmao Xiao
Jianmao Xiao
ZFZhiyong Feng
Zhiyong Feng
JLJingyu Li
Jingyu Li
YYYang Yu
Yang Yu
QYQiaoyun Yin
Qiaoyun Yin
With the rapid development of the Internet of Vehicles (IoV), vehicles will generate massive data and computation demands, necessitating computation offloading at the edge. However, existing research faces challenges in efficiency and trust. In this paper, we explore the IoV computation offloading from both user and edge facility provider perspectives, working to optimize the quality of experience (QoE), load balancing, and success rate based on challenges to efficiency and trust. First, two vehicle interconnection models are constructed to extend the linkable range of intra-road and inter-road vehicles while considering the maximum link time constraint. Then, a dynamic planning method is proposed, combining the reputation and feedback mechanisms, which can schedule edge resources online based on the cumulative computation latency of each service side, reliability value, and historical behavior. These two phases further improve the efficiency of edge services. Subsequently, blockchain is combined to optimize the trust problem of edge collaboration, and an edge-limited Byzantine fault tolerance local consensus mechanism is proposed to optimize consensus efficiency and ensure the reliability of edge services. Finally, this paper conducts dynamic experiments on real-world datasets, verifying the effectiveness of the proposed algorithm and models in multiple vehicle density datasets and experimental scenarios.

7 January 2026 in Future Generation Computer Systems
Verified
Journal Article
Closed access
SCSheng Cai
Sheng Cai
JXJianmao Xiao
Jianmao Xiao
Yuanlong CaoYuanlong Cao
Yuanlong Cao
QGQinghang Gao
Qinghang Gao
ZFZhiyong Feng
Zhiyong Feng
Shuguang DengShuguang Deng
Shuguang Deng

1 November 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJingyu Li
Jingyu Li
ZFZhiyong Feng
Zhiyong Feng
SCShizhan Chen
Shizhan Chen
Dongxiao HeDongxiao He
Dongxiao He
QGQinghang Gao
Qinghang Gao
HWHongyue Wu
Hongyue Wu

30 June 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
QGQinghang Gao
Qinghang Gao
JXJianmao Xiao
Jianmao Xiao
ZFZhiyong Feng
Zhiyong Feng
JLJingyu Li
Jingyu Li
HCHongqi Chen
Hongqi Chen
XZXinyue Zhou
Xinyue Zhou
The noncooperative game between rational vehicle users will generate unnecessary costs, manifested as the gap between user equilibrium (UE) and system optimal (SO). This issue primarily arises due to the competition or the untrusted collaboration among vehicles. The traditional marginal cost pricing (MCP) method is constrained by factors, such as vehicle density and communication protocols, resulting in suboptimal performance. In this article, the immutability of Hashgraph is leveraged to enable trusted services in the Internet of Vehicles (IoV), transforming noncooperative games into a global optimization problem, while a two-phase optimization method is proposed to achieve low-cost services. First, this article simplifies the process of determining consensus timestamps for Hashgraph and constrains the actions of participants through immutability, thereby guaranteeing trusted services more efficiently. Subsequently, this article systematically analyzes the key factors affecting travel and network service costs to optimize them in turn. Specifically, regarding the travel costs, this article introduces a segment shielding method in trusted scenarios to avoid Braess’s paradox. As for the network service costs of data sharing, this article presents a latency-sensitive dynamic programming method to integrate each server’s status to optimize resource scheduling. When the vehicle density is 400, the proposed method reduces the total cost by 20.920% and improves the quality of experience by 122.535%. The advantages become more significant as vehicle density increases.