yiqing Luo

Dr. yiqing Luo


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
27 January 2022 in Sustainability
Verified
Journal Article
Open access
PDF file
LSLuona Song
Luona Song
YLyiqing Luo
yiqing Luo
ZCZixi Chang
Zixi Chang
CJChunhua Jin
Chunhua Jin
Nicolas MERVEILLENicolas MERVEILLE
Nicolas MERVEILLE
Within the context of the rise of the Internet of Things, blockchain, and other new technologies, telecommunications operators are committed to applying technologies to promote business transformation and upgrading. The government also actively applies technologies to traditional fields to promote social progress. In agriculture, the agricultural supply chain has a low information level and low degree of digitization. The application of blockchain technology in agriculture offers exceptional advantages because of its decentralization, openness, and transparency. Based on the application of blockchain in an agricultural scenario, an evolutionary game model made up of governments, telecom operators, and agricultural enterprises was established to analyze the model’s equilibrium stability and evolutionary stable strategy. Then, numerical simulation was carried out to study the influence of the initial green level, equipment deployment cost, technology operation cost, and other core factors on the tripartite evolution behaviour. The results show that each factor influences the behaviour of a third party in different ways. Finally, according to the simulation results, this paper puts forward practical suggestions, explores the long-term impact of the application cost and sustainable income of blockchain technology on cooperation, and provides new ideas for the governance of China’s traditional fields from the perspective of new technology application.

23 October 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YLyiqing Luo
yiqing Luo
MHMingshu He
Mingshu He
XWXiaojuan Wang
Xiaojuan Wang
Network threat detection and identification remain fundamental tasks in cyberspace defence. Existing graph-based detection methods exhibit limited capabilities in transformability and independence, necessitating a redefinition of network behaviour to enhance their applicability in scenarios such as unknown threat discovery and low sample detection. In response to these challenges, we propose a fine-grained threat detection method based on flow semantic structure, with independent generalization capabilities, to refine the definition of flow and behaviour representation in data analysis. By constructing a semantic association topology map for each flow, the proposed method utilizes behavioural data structure information to extract semantic structure features independently. Subsequently, it aggregates updated graph node information into flow-level semantic embeddings, facilitating behaviour prediction. The final evaluation results show that this method outperforms existing state-of-the-art models, achieving detection accuracies of 97.86%, 95.76%, and 99.62% on three publicly datasets, respectively. In addition, the evaluation through simulating real threat detection environments at different concentrations shows that this method can still maintain a high detection rate with a small amount of data involved in training, and has certain generalization ability for new samples.

18 February 2025 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YLyiqing Luo
yiqing Luo
MHMingshu He
Mingshu He
XWXiaojuan Wang
Xiaojuan Wang
The detection of network threats remains a fundamental task in cyberspace defense. Graphs are capable of capturing rich structural information and retaining content information. They are widely applicable in the field of threat detection. However, existing graph-based threat detection methods are computationally complex and challenging to apply in real-world network scenarios, where topologies may be incomplete or invisible. To address this, we propose ERFS, an efficient feature graph representation method for intrusion detection based on flow semantic correlation. This method aims to enhance the feature representation of network behavior. The proposed method first constructs a semantic correlation graph to depict the inherent semantic relationships within and between network flows. This is followed by the use of a messaging network to update and learn the information of graph nodes. The updated nodes are then aggregated into flow-level semantic feature representations for node classification, thereby achieving threat detection. The key innovation of this approach lies in graph construction and learning. The semantic correlation graph is constructed based on contextual correlation features and does not rely on topological information. It addresses the existing dependency issue of traditional graph construction methods on network topology. On the other hand, it introduces a small-window learning mechanism and a global sharing mechanism for edge weights. These mechanisms enable graph learning within a small-window range while globally sharing representations of identical nodes and edge weight values. It also addresses challenges in current graph construction methods, such as high computational complexity and low efficiency. Furthermore, the evaluation results indicate that this method achieved classification accuracies of 99.99%, 98.81%, 100%, 97.87%, and 99.64% on five public datasets (CIC IDS2017, CIC DOS2017, CIC DDoS2019, USTC-TFC2016, and ISCX VPN-nonVPN), respectively. These results surpass those of existing advanced models. The code is available on: https://github.com/sixteen23333/ERFS.

17 April 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XWXiaojuan Wang
Xiaojuan Wang
YLyiqing Luo
yiqing Luo
MHMingshu He
Mingshu He
XWXinlei Wang
Xinlei Wang
Network threat detection and identification are essential tasks in the defense of cyberspace. However, current network threat detection methods have limitations such as narrow feature extraction, targeted feature effects, and limited generalization performance. Therefore, there is a need for a more comprehensive understanding and description of network behavior. As a result, we propose a global and generalized method for semantic detection of network flow to enhance the definition of flow data and representation of network behavior. To improve the problem of narrow feature range in existing methods, this paper designs three feature embedding methods that represent global, temporal, and local semantic correlations from both temporal and spatial dimensions: global embedding, position embedding, and learning embedding. In order to overcome the problem of existing methods only targeting specific behaviours, this article focuses on constructing global correlation features to replace the detection mode of building an inherent feature set. By utilizing text analysis features, we extract global embedding features containing network flow relationship information by constructing a topology heterogeneous graph between flows and bytes. This is combined with position embedding and learning embedding to complete data detection and behavior classification through input into the transformer encoder. We validated the effectiveness of our method in three scenarios: the Internet, the Internet of Things, and encryption. The final experimental results demonstrated that our proposed method outperformed existing advanced models. Furthermore, after incorporating global embedding representing international correlation relationships, the model’s classification accuracy was further improved.

4 May 2026 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YLyiqing Luo
yiqing Luo
MHMingshu He
Mingshu He
XWXiaojuan Wang
Xiaojuan Wang
Network threat detection and identification remains a fundamental task in the defense of cyberspace. Graphs are capable of capturing rich structural information while retaining content, and they have wide applications in the field of threat detection. However, existing graph-based threat detection approaches are complex, time-consuming, and challenging to apply to real network scenarios with invisible or incomplete topologies. Therefore, we propose an efficient threat detection method based on large-scale graph parallelized learning to address these application difficulties. This method addresses the potential challenges of network topology invisibility and incompleteness by leveraging bidirectional inference between flow and behavior to construct a semantic similarity graph, where flows serve as nodes and similarity relationships between flows serve as edges. In order to improve the low efficiency of existing graph learning approaches, a non-linked subgraph sampling mechanism is introduced. This mechanism removes edge connections, induces nodes based on intimate relationships, and divides the constructed semantic similarity graph into subgraphs for parallel learning. To improve upon the issue that existing graph learning approaches embed single representations, we propose four feature embedding modes: original feature embedding, global role embedding, area position embedding, and balanced distance embedding. Subsequently, at the subgraph level, we input nodes’ four types of feature embeddings into a BERT model for learning behavior detection and classification based on updated node representations. We have validated the efficacy of the method across four publicly available datasets. Furthermore, the evaluation results demonstrate that the method achieved detection accuracies of 97.84%, 98.46%, 100%, and 96.59% on the ISCX IDS2012, CIC DDoS2019, CIC IOT2022, and USTC-TFC2016 public datasets respectively, while also exhibiting high efficiency as a characteristic. The code is available on: https://github.com/sixteen23333/LSGLM.