Mobile <scp>WSN</scp> Wormhole Attack Without Beacon Node Localization Based on <scp>GNDO</scp> Algorithm

ABSTRACT A wireless sensor network (WSN) accomplishes its objectives through the coordinated efforts of numerous specially designed sensor nodes positioned within the monitored area. But some protocols choose the path with the least hops or the strongest signal strength as the preferred path for data transmission; attackers can quickly forward packets from one area to another through wormhole links. However, due to the fast movement speed of sensing nodes, traditional techniques based on arrival time are based on the known position relationships between nodes, but it is difficult to obtain node positions based on the strength of the received signals from unknown nodes, resulting in low positioning accuracy. Therefore, this article focuses on the problem of beacon‐free node localization in mobile WSNs under wormhole attacks. Based on the basic structure of sensor nodes, a global mobile WSN model represented by a state transition equation is constructed. Nodes are flagged as suspicious if their number of neighbors surpasses a specific threshold, and the reference path hop count between proprietary neighbor nodes is calculated. A path trust evaluation metric is derived by integrating both direct and indirect trust to formulate a trust model, thereby detecting wormhole attacks in the path. In response to the situation where wormhole attacks damage the network topology, RSSI technology is introduced to convert the received signal strength into the distance between nodes, and the localization problem is transformed into an unconstrained minimum square error problem. The Generalized Normal Distribution Optimization (GNDO) algorithm is employed to optimize and find the solution to the objective function, and the optimal position solution of the beacon‐free node under wormhole attacks is finally output to solve the problem of difficult‐to‐obtain attack node position based on unknown nodes. The experimental outcomes demonstrate that our approach achieves a remarkably low detection error rate of 0.13 for identifying network wormhole attacks, and the positioning accuracy is between 95% and 98%. The highest F1 value for beacon‐free node positioning is 0.98.

Authors

Institutions

Publication Details

Journal
Security and Privacy
Published
2025-08-25
DOI
https://doi.org/10.1002/spy2.70088
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mobile WSN Wormhole Attack Without Beacon Node Localization Based on GNDO Algorithm

Jingjing Zhu, Yongqin Zhu
Security and Privacy
Network Security and Intrusion Detection
article

Mobile WSN Wormhole Attack Without Beacon Node Localization Based on GNDO Algorithm

Jingjing Zhu, Yongqin Zhu
article en

Abstract

ABSTRACT A wireless sensor network (WSN) accomplishes its objectives through the coordinated efforts of numerous specially designed sensor nodes positioned within the monitored area. But some protocols choose the path with the least hops or the strongest signal strength as the preferred path for data transmission; attackers can quickly forward packets from one area to another through wormhole links. However, due to the fast movement speed of sensing nodes, traditional techniques based on arrival time are based on the known position relationships between nodes, but it is difficult to obtain node positions based on the strength of the received signals from unknown nodes, resulting in low positioning accuracy. Therefore, this article focuses on the problem of beacon‐free node localization in mobile WSNs under wormhole attacks. Based on the basic structure of sensor nodes, a global mobile WSN model represented by a state transition equation is constructed. Nodes are flagged as suspicious if their number of neighbors surpasses a specific threshold, and the reference path hop count between proprietary neighbor nodes is calculated. A path trust evaluation metric is derived by integrating both direct and indirect trust to formulate a trust model, thereby detecting wormhole attacks in the path. In response to the situation where wormhole attacks damage the network topology, RSSI technology is introduced to convert the received signal strength into the distance between nodes, and the localization problem is transformed into an unconstrained minimum square error problem. The Generalized Normal Distribution Optimization (GNDO) algorithm is employed to optimize and find the solution to the objective function, and the optimal position solution of the beacon‐free node under wormhole attacks is finally output to solve the problem of difficult‐to‐obtain attack node position based on unknown nodes. The experimental outcomes demonstrate that our approach achieves a remarkably low detection error rate of 0.13 for identifying network wormhole attacks, and the positioning accuracy is between 95% and 98%. The highest F1 value for beacon‐free node positioning is 0.98.

Security and PrivacyVol. 8(5)
Jiaozuo University (CN)
Openalex Percentile: Top 75%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.