Xiaojun Tong

Dr. Xiaojun Tong


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
4 February 2016 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
XTXiaojun Tong
Xiaojun Tong
MZMiao Zhang
Miao Zhang
ZWZhu Wang
Zhu Wang
JMJing Ma
Jing Ma

20 February 2015 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
XTXiaojun Tong
Xiaojun Tong
ZWZhu Wang
Zhu Wang
MZMiao Zhang
Miao Zhang
YLYang Liu
Yang Liu
HXHui Xu
Hui Xu
JMJing Ma
Jing Ma

31 October 2009 in Computer Physics Communications
Verified
Journal Article
Closed access
XTXiaojun Tong
Xiaojun Tong
ZWZhu Wang
Zhu Wang
HYHaining Yu
Haining Yu

15 April 2019 in IEEE Access
Verified
Journal Article
Open access
LYLongteng Yi
Longteng Yi
XTXiaojun Tong
Xiaojun Tong
ZWZhu Wang
Zhu Wang
MZMiao Zhang
Miao Zhang
HZHonghong Zhu
Honghong Zhu
JLJing Liu
Jing Liu
In order to ensure the basic security of wireless sensor networks (WSNs), a block encryption algorithm based on chaotic substitution box (S-box) is proposed. In this paper, we generated a new S-box based on the compound chaotic map, sinusoidal chaotic map, Baker map, and linear congruence generator. In addition, the limited computing power and communication capability of WSN are also considered in this paper. The method of generating round subkeys and F function is constructed based on the S-box. The extensive security and performance tests show that the proposed encryption algorithm has high security and low resource consumption which is suitable for WSN.

18 August 2022 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
XLXilin Liu
Xilin Liu
XTXiaojun Tong
Xiaojun Tong
ZWZhu Wang
Zhu Wang
MZMiao Zhang
Miao Zhang

20 April 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YYYihan Yan
Yihan Yan
XTXiaojun Tong
Xiaojun Tong
SWShen Wang
Shen Wang
Federated learning (FL) is a distributed machine learning framework that allows resource-constrained clients to train a global model jointly without compromising data privacy. Although FL is widely adopted, high degrees of systems and statistical heterogeneity are still two main challenges, which leads to potential divergence and nonconvergence. Clustered FL handles the problem of statistical heterogeneity straightly by discovering the geometric structure of clients with various data generation distributions and getting multiple global models. The number of clusters contains prior knowledge about the clustering structure and has a significant impact on the performance of clustered FL methods. Existing clustered FL methods are inadequate for adaptively inferring the optimal number of clusters in environments with high systems’ heterogeneity. To address this issue, we propose an iterative clustered FL (ICFL) framework in which the server dynamically discovers the clustering structure by successively performing incremental clustering and clustering in one iteration. We focus on the average connectivity within each cluster and give incremental clustering and clustering methods that are compatible with ICFL based on mathematical analysis. We evaluate ICFL in experiments on high degrees of systems and statistical heterogeneity, multiple datasets, and convex and nonconvex objectives. Experimental results verify our theoretical analysis and show that ICFL outperforms several clustered FL baseline methods.