Xin He

Prof. Dr. Xin He

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
31 October 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LLLi Li
Li Li
XYXi Yu
Xi Yu
XCXuliang Cai
Xuliang Cai
XHXin He
Xin He
YLYanhong Liu
Yanhong Liu
Federated learning (FL) provides an effective solution for multiparty data processing under privacy preserving, and becomes a good choice for crowd intelligence extraction in Health CrowdSensing. The quality of the local model submitted by the data holder determines the quality of the global model in FL, and the quality of the local model depends on the data quantity, data quality, and computing power of the data holder. However, in the process of model training, the data holder will inevitably spend the cost of communication and local model training, and higher quality data acquisition and higher quality local model training require higher cost. Therefore, how to motivate data holders with a large amount of high-quality data and computing power to participate in FL has become an urgent problem to be solved. This article transforms the problem of motivating data holders into an optimization problem of utility from the perspective of maximizing the utility of the data holder, establishes the incentive mechanism based on the Contract Theory, and proves that the optimal strategy set of the data holders reaches Nash Equilibrium. A large number of experiments based on public data sets of UCI and MNIST verify that the incentive mechanism can make the baseline algorithm converge faster, while resisting malicious behaviors, such as free-riding and collusive attacks. Furthermore, the data holder with a large amount of high-quality data and computing power can obtain higher revenue.

19 January 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JAJian An
Jian An
ZWZhenxing Wang
Zhenxing Wang
XHXin He
Xin He
XGXiaolin Gui
Xiaolin Gui
JCJindong Cheng
Jindong Cheng
RGRuowei Gui
Ruowei Gui
With the rapid development of embedded smart devices, a new data collection paradigm, mobile crowd-sensing (MCS), has been proposed. MCS allows individuals from the crowd to act as sensors and contribute their observation data. However, existing MCS systems are mostly based on third-party platforms, and there is no guarantee that a center is completely credible. In addition, security and privacy issues should not be ignored. During MCS’ execution, the participants’ various information and truth value are usually exposed, and the computation related to data privacy cannot be verified. In this paper, we integrate the blockchain into the MCS scenario to design a blockchain based privacy-preserving quality control mechanism, which prevents data from being tampered with, and denied, ensuring that the reward is distributed fairly. In the new system, we propose a privacy preserving participant selection scheme and the result can be verified (i.e., security against malicious node) without any third-party arbiter. Finally, considering the issues with sensing data privacy and efficiency in the truth discovery process, we propose a new privacy-aware crowdsensing design with iterative truth discovery based on rational secure multi-party computation. The experimental results show that compared to the prior result, the proposed solutions are highly practical and facilitate quality control without violating the participant’s privacy.

20 July 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YWYalu Wang
Yalu Wang
JLJie Li
Jie Li
WZWei Zhao
Wei Zhao
ZHZhijie Han
Zhijie Han
HZHang Zhao
Hang Zhao
XHXin He
Xin He
With the rapid development of the Internet of Things (IoT)-based near-Earth remote sensing technology, the problem of network intrusion for near-Earth remote sensing systems has become more complex and large-scale. Therefore, seeking an intelligent, automated, and robust network intrusion detection method is essential. Many researchers have researched network intrusion detection methods, such as traditional feature-based and machine learning methods. In recent years, network intrusion detection methods based on graph neural networks (GNNs) have been proposed. However, there are still some practical issues with these methods. For example, they have not taken into consideration the characteristics of near-Earth remote sensing systems, the state of the nodes, and the temporal features. Therefore, this article analyzes the factors of existing near-Earth remote sensing systems and proposes a spatio-temporal graph attention network (N-STGAT) that considers the state of nodes and applies them to the network intrusion detection of near-Earth remote sensing systems. Finally, the proposed method in this article is validated using the latest flow-based datasets NF-BoT-IoT-v2 and NF-ToN-IoT-v2. The results demonstrate that the binary classification accuracy for network intrusion detection exceeds 99%, while the multi-classification accuracy exceeds 93%. These findings provide substantial evidence that the proposed method outperforms existing intrusion detection techniques.

28 November 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JAJian An
Jian An
DLDanwei Liang
Danwei Liang
XGXiaolin Gui
Xiaolin Gui
HYHe Yang
He Yang
RGRuowei Gui
Ruowei Gui
XHXin He
Xin He

29 April 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
GWGuanghui Wang
Guanghui Wang
YXYifan Xu
Yifan Xu
JHJianping He
Jianping He
JPJianping Pan
Jianping Pan
FZFang Zuo
Fang Zuo
XHXin He
Xin He
This paper investigates the problem of participant selection considering colluding attacks for crowdsourcing. Compared with existing work, a practical vulnerability-induced colluding attack model is considered, where the malicious participants with different vulnerability levels collude with each other to perform attacks, which makes the participant selection problem more challenging. To address this problem, according to the structural characteristics of the colluding attack model, we derive the necessary condition and sufficient condition of achieving the colluding possibility minimization of the selected participants. A novel resilient participant selection algorithm is developed based on the necessary condition and sufficient condition. The proposed algorithm can select participants to complete tasks with the time complexity $O(mn)$ , where $m, n$ are the numbers of participants and tasks, respectively. We analyze that the proposed algorithm achieves the colluding possibility minimization to defeat the vulnerability-induced colluding attack. It is also analyzed that the social cost of the proposed algorithm is smaller than existing algorithms in terms of the task-performing cost and the potential damage of the colluding attacks. Extensive real-world trace-based simulations are conducted to demonstrate the effectiveness of the proposed algorithm and the correctness of the theoretical results.

1 October 2023 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
YDYating Dai
Yating Dai
JWJianyu Wang
Jianyu Wang
HWHao Wang
Hao Wang
XHXin He
Xin He