Hongjia Wu

Hongjia Wu

Auto-generated profile, based on publicly available information

Hongjia Wu

Department of Mathematics and Information Technology, The Education University of Hong Kong, Hong Kong, China

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
16 March 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHongjia Wu
Hongjia Wu
JZJiao Zhang
Jiao Zhang
ZCZHIPING CAI
ZHIPING CAI
FLFang Liu
Fang Liu
Yangyang LiYangyang Li
Yangyang Li
Anfeng LiuAnfeng Liu
Anfeng Liu
With the widespread application of infotainment services in intelligent connected vehicles (ICV), network traffic has grown exponentially, bringing huge burden and energy consumption to ICV network. Edge caching, which enables edges (e.g., vehicles or roadside units) with cache storages, is a promising technology to alleviate this problem. In this paper, in terms of the hybrid communication mode of vehicle to vehicle (V2V) and vehicle to roadside unit (V2R), an energy aware caching scheme for infotainment services is proposed. Considering the geographical distribution of vehicles and roadside units as well as the size of transmission content, the energy consumption model in ICV network is formulated to implement the optimal selection of cache nodes. Then the selection of cache node in ICV network is transformed into the optimal stopping problem and solved by the optimal stopping theory. Finally, we propose a new algorithm for optimal energy efficiency cache node selection (OEECS). Simulation results show that the proposed OEECS can obtain higher energy saving and lower average access latency than other baseline schemes.

26 April 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHongjia Wu
Hongjia Wu
JZJiao Zhang
Jiao Zhang
ZCZHIPING CAI
ZHIPING CAI
Qiang NiQiang Ni
Qiang Ni
TZTongqing Zhou
Tongqing Zhou
FLFang Liu
Fang Liu
With the explosive emergence of computation-intensive and latency-sensitive applications, data processing could be envisioned to perform closer to the data source. Similar to edge and fog computing, dispersed computing is considered as a complementary computing paradigm, which can excavate potential computation resources in the network to users, and serve as a supplement for sharing the computational burden when the edge is overloaded. In this article, we first make full use of idle and geographically dispersed computation resources via task offloading, contributing to conserve energy for mobile devices. Especially, a dispersed computing offloading framework concerning the interests of users and networked computation points is proposed. We further transform the initial problem into a multiobjective optimization problem subject to latency and resource constraints. To tackle such a complex problem, an energy-saving bilateral matching algorithm is designed to obtain the optimal task offloading strategy. The simulation results demonstrate that our proposed algorithm can outperform the benchmark schemes in terms of user fairness and can achieve a relatively balanced energy cost ratio. Furthermore, comparative experiments with edge computing are implemented in Amber Response and Disaster Relief scenarios, respectively, to reveal the advantages of the proposed framework.

13 April 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HWHongjia Wu
Hongjia Wu
JNJiangtian Nie
Jiangtian Nie
ZXZehui Xiong
Zehui Xiong
ZCZHIPING CAI
ZHIPING CAI
TZTongqing Zhou
Tongqing Zhou
DNDusit Niyato
Dusit Niyato
The popularization of smart Internet of Things (IoT) devices has facilitated the development of fog/edge computing. However, these infrastructure-based service paradigms may fail to complete tasks successfully due to computation and communication overload, or damage in challenging scenarios such as disasters or traffic jams. Noticing that a crowd of devices with considerable idle resources could be available, we investigate the problems of addressing the computation and communication unavailability with peer assistance in this work. To this end, we propose a dispersed service framework for resource-exhausted scenarios that adaptively offloads users’ data to available network computation points. However, the users may not be able to achieve the offloading due to geographical hindrances. Consequently, the relay is introduced as a bridge for data offloading between the users and the network computation points. Furthermore, a game-based incentive-driven offloading mechanism is designed by analyzing and balancing the cost and gain factors of three main entities (users, relays, and network computation points). Considering the interactions among the entities, a two-level Stackelberg game is established for efficiently allocating potential computation resource, as well as balancing the utility conflicts due to the data offloading. Given the hierarchical interaction structure, the upper level game involves network computation points as followers and the relay as a leader, while the lower level game includes the relay as a follower and users as leaders. Moreover, to facilitate applicability in large-scale scenarios with multiple relays, we decompose multiple relays into multiple single relay problems using a tripartite matching strategy that assigns appropriate relays to users and network computation points. The simulation results demonstrate the effectiveness of the proposed game-based incentive-driven mechanism and show that it outperforms the baselines in terms of the overall utilities of the involved entities and the average energy consumption of users.

19 December 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHongjia Wu
Hongjia Wu
HZHui Zeng
Hui Zeng
TZTongqing Zhou
Tongqing Zhou
ZCZHIPING CAI
ZHIPING CAI
ZXZehui Xiong
Zehui Xiong
ZHZhu Han
Zhu Han
Massive amounts of high-quality data are the prerequisite and support for AI technologies. Due to the nature of privacy-preserving and low communication overheads, federated learning (FL) has garnered considerable attention in comparison with traditional data collection methods. However, the performance of FL is hampered by the lack of interested clients and limited local data due to selfishness and individual behavioral preferences. To this end, we propose PractFL, a proactive and distributed framework that incorporates the concept of mobile crowdsensing into the FL paradigm. Specifically, we design an incentive mechanism in the form of virtual red packets, which are a widely used way of monetary reward and gift-giving in social lives. In this article we extend this further by giving meaning to the locations, i.e., the red packets are only accessible at specific places. The virtual red packets’ locations and monetary amounts can be dynamically updated by the cloud center to encourage clients to collect additional data that may benefit the FL process. Further, we propose a distributed behavioral decision engine based on multiarmed bandits (i.e., choose which red packet to go for) in response to the incentive mechanism enforced by the cloud. Considering the movement cost and conflicts with other clients, $K$ -anonymity and probabilistic selection are introduced in the distributed behavioral decision to recommend the optimal red packet choice for clients without revealing their privacy. The experimental results demonstrate that PractFL outperforms the baselines in terms of classification accuracy. We also find that PractFL can effectively alleviate the overfitting problem caused by class imbalance during the training.

24 March 2025 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
HMHaimiao Mo
Haimiao Mo
JLJuan Liang
Juan Liang
BLBing Li
Bing Li
ZHZhijian Hu
Zhijian Hu
MYMeng Yi
Meng Yi
ZXZeyuan Xu
Zeyuan Xu
Accurate assessment of cardiac function is vital for preventing and managing cardiovascular diseases. Recent advancements in machine learning, especially convolutional neural networks, and multi-task learning, have improved the precision of echocardiogram evaluations. However, existing methods often overlook the intrinsic relationships among ejection fraction, end-diastolic volume, and end-systolic volume, which are essential for accurate assessments. We propose a Non-Invasive Framework for Heart Function Assessment using Multi-Task Learning that utilizes a 3D convolutional neural network to extract key spatiotemporal features from echocardiogram videos. By employing a multi-task learning strategy and weight distribution mechanism, this framework enhances the accuracy of ejection fraction predictions and provides a comprehensive assessment of cardiac structure and function. This approach ensures that the model effectively integrates auxiliary task information while focusing on the primary task, resulting in a more precise analysis of cardiac function. The experimental results on the Echonet- Dynamic dataset demonstrate that our method achieves an average absolute error of 3.89, a root mean square error of 5.13, and an R² value of 0.82, outperforming existing methods. Future work will focus on automatic weight optimization, model compression, and improving computational efficiency for broader clinical applications.

16 June 2025 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
HMHaimiao Mo
Haimiao Mo
HWHongjia Wu
Hongjia Wu
QRQian Rong
Qian Rong
ZHZhijian Hu
Zhijian Hu
MYMeng Yi
Meng Yi
PCPeipei Chen
Peipei Chen