Hongjia Li

Hongjia Li

Auto-generated profile, based on publicly available information

Hongjia Li

Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
3 June 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HLHongjia Li
Hongjia Li
CYChang Yang
Chang Yang
LWLiming Wang
Liming Wang
NANirwan Ansari
Nirwan Ansari
DTDing Tang
Ding Tang
DHDan Hu
Dan Hu
Mobile edge computing (MEC), extending computing services from cloud to edge, is recognized as one of key pillars to facilitate real-time services and tackle backhaul bottleneck. However, it is not economically efficient to attach intensive security appliances to every MEC node to defend application-level DDoS attacks and ensure the availability of services. Thus, we explore the elasticity of security defense among MEC nodes by proposing a COoperative DEfense ( CODE ) framework for MEC, referred to as CODE4MEC . CODE4MEC aims to adapt to traffic changes by coordinating container-carried defensive resources among cooperative MEC nodes in an automatic way. Towards this aim, we propose four control plane functions to enable a life-cycle management for CODE4MEC, namely, CODE triggering, scheduling, coordination and releasing. However, an effective CODE4MEC requires non-trivial algorithmic schemes, in particular for CODE scheduling and coordination functions. We thus design an online combinatorial auction mechanism for real-time CODE scheduling, and prove a tighter performance bound relative to prior arts. As for CODE coordination, a flow-based traffic and context information coordination scheme is proposed to enable classical defense schemes to work properly and efficiently. Finally, using a combination of real testbed and simulation evaluations, we validate the effectiveness of CODE4MEC.

5 December 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
HLHongjia Li
Hongjia Li
CYChang Yang
Chang Yang
XHXueqing Huang
Xueqing Huang
NANirwan Ansari
Nirwan Ansari
ZWZejue Wang
Zejue Wang
This letter proposes a cooperative caching placement framework for coordinated multi-point joint transmission and single cell transmission, to minimize content transmission time for mobile users. The optimization problem is NP-hard. We thus transform it into a local altruistic game, and propose two evolved Spatial Adaptive Play (SAP) algorithms: the first one overcomes the main limitation of the traditional SAP that large action sets pose an unsurmountable computational burden; the second one further expedites escape from convergence traps caused by fake Nash Equilibria. Numerical results conducted based on a real-world LTE traffic data set have validated the performance of our proposed algorithms.

7 February 2017 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
ZWZejue Wang
Zejue Wang
HLHongjia Li
Hongjia Li
ZXZhen Xu
Zhen Xu

22 March 2024
Verified
Conference Paper
Open access
CZChao Zheng
Chao Zheng
LWLiming Wang
Liming Wang
ZXZhen Xu
Zhen Xu
HLHongjia Li
Hongjia Li
With the proliferation of information technologies, data has become a fundamental driver of societal development. However, issues related to data regulation, data rights confirmation, and data protection hinder data circulation, leading to "data islands" and raising concerns about data privacy and security. In this context, achieving a balance between data circulation and privacy protection is crucial. Federated Learning (FL) is a distributed machine learning methodology that allows multiple client devices to collaboratively construct a model without transmitting their local data to a cloud server. However, privacy concerns persist due to potential disclosure of clients’ private information through their submitted updates. To mitigate these risks, researchers have integrated differential privacy (DP) techniques into FL, where clients enhance the privacy of their local parameter updates by introducing random noise. This paper presents a novel approach that combines Secure Multi-Party Computation (MPC) with DP to ensure privacy without compromising accuracy. Our approach is resilient to collusion attacks and eliminates potential leakage of any input in the output. Unlike previous solutions, our approach prevents the server from inferring the noisy weights of any specific user, making the system fully private. Our contributions include a more practical assumption of network connectivity and a simplified communication structure of MPC, reducing the required MPC communication overhead and enhancing efficiency. This work provides a significant step towards achieving a balance between data circulation and privacy protection in the era of big data.

26 April 2016 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
HLHongjia Li
Hongjia Li
ZWZejue Wang
Zejue Wang
DHDan Hu
Dan Hu
SCSong Ci
Song Ci
ZXZhen Xu
Zhen Xu

18 July 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XTXinrui Tan
Xinrui Tan
HLHongjia Li
Hongjia Li
XXXiaofei Xie
Xiaofei Xie
LGLu Guo
Lu Guo
NANirwan Ansari
Nirwan Ansari
YLYang Liu
Yang Liu
The recent advances of deep learning in various mobile and Internet-of-Things applications, coupled with the emergence of edge computing, have led to a strong trend of performing deep learning inference on the edge servers located physically close to the end devices. This trend presents the challenge of how to meet the quality-of-service requirements of inference tasks at the resource-constrained network edge, especially under variable or even bursty inference workloads. Solutions to this challenge have not yet been reported in the related literature. In the present paper, we tackle this challenge by means of workload-adaptive inference request scheduling: in different workload states, via adaptive inference request scheduling policies, different models with diverse model sizes can play different roles to maintain high-quality inference services. To implement this idea, we propose a request scheduling framework for general-purpose edge inference serving systems. Theoretically, we prove that, in our framework, the problem of optimizing the inference request scheduling policies can be formulated as a Markov decision process (MDP). To tackle such an MDP, we use reinforcement learning and propose a policy optimization approach. Through extensive experiments, we empirically demonstrate the effectiveness of our framework in the challenging practical case where the MDP is partially observable.