Huasen He

Dr. Huasen He

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
3 February 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JYJian Yang
Jian Yang
QYQifeng Yuan
Qifeng Yuan
SCShuangwu Chen
Shuangwu Chen
HHHuasen He
Huasen He
XJXiaofeng Jiang
Xiaofeng Jiang
XTXiaobin Tan
Xiaobin Tan
Driven by the prevalence of the computation-intensive and delay-intensive mobile applications, Mobile Edge Computing (MEC) is emerging as a promising solution. Traditional task offloading methods usually rely on centralized decision making, which inevitably involves a high computational complexity and a large state space. However, the MEC is a typical distributed system, where the edge servers are geographically separated, and independently perform the computing tasks. This fact inspires us to conceive a distributed cooperative task offloading system, where each edge server makes its own decision on how to allocate local computing resources and how to migrate tasks among the edge servers. To characterize diverse task requirements, we divide the arrival tasks into different priorities according to the tolerance time, which enables to dynamically schedule the local computing resources for reducing the task timeout. In order to coordinate the independent decision makings of geographically separate edge servers, we propose a priority driven cooperative task offloading algorithm based on multi-agent deep reinforcement learning, where the decision making of each edge server not only depends on its own state but also on the shared global information. We further develop a Variational Recurrent Neural Network (VRNN) based global state sharing model which significantly reduces the communication overhead among edge servers. The performance evaluation conducted on a movement trajectories dataset of mobile devices verifies that the proposed algorithm can reduce the task consumption time and improve the edge computing resources utilization.

5 February 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HHHuasen He
Huasen He
WYWenke Yuan
Wenke Yuan
SCShuangwu Chen
Shuangwu Chen
XJXiaofeng Jiang
Xiaofeng Jiang
FYFeng Yang
Feng Yang
JYJian Yang
Jian Yang
The deployment of UAVs as aerial base stations (BSs) has been considered as a promising supplement to the ground networks, which can quickly build an emergency communication network in a disaster area or significantly relief the communication burden imposed by hot-spots. However, the application of UAVs as aerial BSs is constrained by the limited onboard energy and communication coverage of UAVs. In particular, for a large target area, multiple UAVs should be deployed to meet the communication requirements. Therefore, designing the optimal trajectories of multiple UAVs is crucial to boost the UAV network performance. Inspired by the promising future of UAV BSs, this paper aims at proposing a distributed 3-dimensional (3D) trajectory design algorithm for multiple UAVs to optimize the system performance. We formulate the trajectory design problem as a multi-objective optimization problem to improve the user equipment (UE) access rate, ensure fair access opportunities, increase transmitted data volume and reduce energy consumption. Further inspired by the decision-making ability of deep reinforcement learning (DRL) in complex environments, we propose a DRL based trajectory design algorithm for multiple UAVs, namely DMTD, in which UAVs can explore both the optimal flight altitude and the potential UE distribution area in the iterative interactions with the environment, and then select the optimal flight trajectories to boost the network performance from multiple aspects. Extensive experimental results under different UE distributions have demonstrated that the proposed DMTD algorithm can find the optimal altitude to provide maximum coverage. Moreover, DMTD beats existing algorithms by providing high UE access rate, ensuring fair network service and increasing total transmitted data volume at the cost of a relatively low energy consumption. Especially in the scenes with dense and randomly distributed UEs, DMTD provides a UE access rate close to 0.9 and transmits 6 times of data volume than existing algorithms.

23 May 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JYJian Yang
Jian Yang
KSKaixuan Sun
Kaixuan Sun
HHHuasen He
Huasen He
XJXiaofeng Jiang
Xiaofeng Jiang
SCShuangwu Chen
Shuangwu Chen
Aeronautical Ad-hoc Networks (AANETs) have been proposed as the promising complement to terrestrial networks for promoting the global interconnection to provide in-flight network service, emergency communication, vessel traffic service, etc. However, the large network scale of AANETs may induce severe synchronization overhead when the traditional topology-based networking algorithms are adopted. Moreover, the high-dynamic topology and changeable flight routes make the existing position-based routing algorithms suffer loop routing and forwarding failure. Motivated by these problems, this paper aims at developing efficient and low-cost networking and routing algorithms relying on the concept of dynamic virtual topology which organizes the disordered topology of AANETs into a structural and simplified one. The basic idea is that each connected aircraft is assigned with a unique and sequentially increased Virtual Identifier (VID) and thus all the connected aircrafts are organized into a virtual cluster consisting of one trunk and several branches. An event-driven synchronization mechanism is leveraged for maintaining the virtual topology as well as relieving the communication burden imposed by periodical broadcasting. By jointly considering the geographic locations and the virtual locations of aircrafts, we formulate the routing problem in AANETs as a weighted distance minimization problem, and further propose a novel routing algorithm, namely Trunk-Branch Cooperation aided Routing (TBCR) algorithm. Specifically, TBCR employs the geographic greedy forwarding strategy for enhancing its flexibility and boosts the routing efficiency by adopting the loop-free virtual topology based local forwarding. For extending the networking and routing algorithms to the global range, a multi-domain routing solution is also provided. Extensive experimental results show that the proposed Virtual Topology based Networking (VTN) cooperated with TBCR can reduce at least 30% average end-to-end transmission delay in large-scale AANETs and provide more than 90% lower synchronization overhead than the existing solutions.

2 March 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XJXiaofeng Jiang
Xiaofeng Jiang
YHYunhui Huang
Yunhui Huang
JLJunjun Li
Junjun Li
HHHuasen He
Huasen He
SCShuangwu Chen
Shuangwu Chen
JYJian Yang
Jian Yang
Widespread deployment of Small Satellite Networks (SSN) fosters the foreseen integration of space-air-ground networks to provide worldwide Internet access to oceanic and remote airspace. However, the dynamic topology of SSN, the lossy wireless link, and the limited transmission resources induce unprecedented challenges to Deterministic Satellite Network Transmission (DSNT) for the sake of improving the utility of the SSN facility. Motivated by these challenges, this work aims to develop a Deterministic Satellite Network Transmission approach with deterministic Spatio-temporal routing, Redundant coding and Multipath scheduling (DSNT-SRM) for bolstering superior communications of SSN. DSNT-SRM uses the ephemeris information and dynamic resource update mechanism to predict all upcoming communication opportunities and construct the deterministic spatio-temporal routing paths. By combining sparse and redundant network coding mechanisms, DSNT-SRM no longer cares about the arrival of each packet, but the number of coded packets it receives, since the lost packets can be compensated with deterministic redundant traffic. Moreover, the adaptive traffic balance between multiple spatio-temporal paths is designed to provide a deterministic delay guarantee when facing limited node resources and multi-user competition. Extensive experiments show that DSNT-SRM can achieve satisfactory performance improvement in reducing delay and improving delivery rate.

21 June 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
SCShuangwu Chen
Shuangwu Chen
QYQifeng Yuan
Qifeng Yuan
JLJiangming Li
Jiangming Li
HHHuasen He
Huasen He
SLSen Li
Sen Li
JYJian Yang
Jian Yang
Deploying microservices on the cooperative edge computing system greatly shortens the interaction delay between users and service and alleviates the traffic burden on the backbones, which has emerged as a new paradigm for service provision. However, it is challenging to embed microservices, having diverse resource demands and heterogeneous invocation relationships, into a distributed edge computing system with irregular network topology. In order to characterize the invocation relationship, we conceive a graph attention network based model to capture the structural features of microservices. Similarly, we propose a multi-channel directed graph convolutional network model to capture the spatial dynamic of edge resources distribution, which jointly considers the heterogeneity of the edge nodes and the links between them. Then, we develop a sequence-to-sequence based multi-step decision model, which maps the feature sequence of the current state to a sequence of deployment actions. Using this model, we further propose a microservice deployment algorithm based on graph neural network aided deep reinforcement learning, where a parallel asynchronous training process is used to accelerate convergence. The performance evaluation shows that the proposed algorithm can improve the deployment success ratio and resource utilization, while ensuring the load balance of edge nodes.

7 July 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
JLJiangming Li
Jiangming Li
HHHuasen He
Huasen He
SCShuangwu Chen
Shuangwu Chen
DJDong Jin
Dong Jin
JYJian Yang
Jian Yang
Anomaly diagnosis relying on system logs to record runtime events is essential for improving the service quality of distributed systems and reducing economic losses. However, most existing log-based anomaly detection approaches depend on the assumption of the fixed quantitative or sequential patterns of a normal log event sequence. This assumption is challenged in the context of practical distributed and parallel systems due to the dynamic pattern of the log sequence, log data noise as well as concurrency of multiple anomalies. Against these challenges, this paper aims to perform the robust log-based anomaly diagnosis by capturing the event context information of the log event graph, called LogGraph, instead of straightforwardly employing the fixed quantitative or sequential patterns of the log records, thus reducing its sensitivity to the log flaws and the concurrency of multiple anomalies. Specifically, in order to handle multiple anomalies concurrency, LogGraph invokes the association rule to decouple log sequences. It further reinterprets a log record sequence into a log event graph modeled by event semantic embedding and event adjacency matrix. An attention-based Gated Graph Neural Network (GGNN) model is developed to capture the semantic information of the log graph, which enables the fine-grained and robust anomaly identification of the proposed scheme. We use real log data sets collected from Hadoop systems and network switches to verify the effectiveness of the proposed LogGraph in log data scenarios that contain noise and multiple anomalies concurrency problems. The experimental results show that the proposed LogGraph achieves high performance and strong robustness in anomaly diagnosis.