Javascript must be enabled to continue!
Detecting Sybil nodes in stationary wireless sensor networks using learning automaton and client puzzles
View through CrossRef
A well‐known harmful attack against wireless sensor networks (WSNs) is the Sybil attack. In a Sybil attack, WSN is destabilised by a malicious node which forges a large number of fake identities to disrupt network protocols such as routing, data aggregation, and fair resource allocation. In this study, the authors suggest a new algorithm based on a composition of learning automaton (LA) model and client puzzles theory to identify Sybil nodes in stationary WSNs. In the proposed algorithm, each node sends puzzles to its neighbours periodically during the network lifetime and tries to identify Sybil nodes among them, considering their response time (puzzle solving time). In this algorithm, each node equipped with a LA to reduce the communication and computation overhead of sending and solving puzzles. The proposed algorithm has been simulated using J‐SIM simulator and simulation results have shown that the proposed algorithm can detect 100% of Sybil nodes and the false detection rate is about 5% on average. Also, the performance of the proposed algorithm has been compared to a wellknown neighbour‐based algorithm through experiments and the results have shown that the proposed algorithm is significantly better than this algorithm in terms of detection and false detection rates.
Institution of Engineering and Technology (IET)
Title: Detecting Sybil nodes in stationary wireless sensor networks using learning automaton and client puzzles
Description:
A well‐known harmful attack against wireless sensor networks (WSNs) is the Sybil attack.
In a Sybil attack, WSN is destabilised by a malicious node which forges a large number of fake identities to disrupt network protocols such as routing, data aggregation, and fair resource allocation.
In this study, the authors suggest a new algorithm based on a composition of learning automaton (LA) model and client puzzles theory to identify Sybil nodes in stationary WSNs.
In the proposed algorithm, each node sends puzzles to its neighbours periodically during the network lifetime and tries to identify Sybil nodes among them, considering their response time (puzzle solving time).
In this algorithm, each node equipped with a LA to reduce the communication and computation overhead of sending and solving puzzles.
The proposed algorithm has been simulated using J‐SIM simulator and simulation results have shown that the proposed algorithm can detect 100% of Sybil nodes and the false detection rate is about 5% on average.
Also, the performance of the proposed algorithm has been compared to a wellknown neighbour‐based algorithm through experiments and the results have shown that the proposed algorithm is significantly better than this algorithm in terms of detection and false detection rates.
Related Results
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
Energy efficient cooperative node management for wireless multimedia sensor networks
Energy efficient cooperative node management for wireless multimedia sensor networks
In Wireless Multimedia Sensor Networks (WMSNs) the lifetime of battery operated visual nodes is limited by their energy consumption, which is proportional to the energy required fo...
Dynamic stochastic modeling for inertial sensors
Dynamic stochastic modeling for inertial sensors
Es ampliamente conocido que los modelos de error para sensores inerciales tienen dos componentes: El primero es un componente determinista que normalmente es calibrado por el fabri...
Computational Complexity of Jumping Block Puzzles
Computational Complexity of Jumping Block Puzzles
In the context of computational complexity of puzzles, the sliding block puzzles play an important role. Depending on the rules and set of pieces, the sliding block puzzles can be ...
Design of multi-energy-space-based energy-efficient algorithm in novel software-defined wireless sensor networks
Design of multi-energy-space-based energy-efficient algorithm in novel software-defined wireless sensor networks
Energy efficiency has always been a hot issue in wireless sensor networks. A lot of energy-efficient algorithms have been proposed to reduce energy consumption in traditional wirel...
Sybil Attack Prevention and Detection Mechanism in VANET Based on Multi-Factor Authentication
Sybil Attack Prevention and Detection Mechanism in VANET Based on Multi-Factor Authentication
In recent years, there has been fast development within the area of vehicular ad hoc networks (VANET). In the future, VANET communication will play a first-rate position in improvi...
Sybil Attack Prevention and Detection Mechanism in VANET Based on Multi-factor Authentication
Sybil Attack Prevention and Detection Mechanism in VANET Based on Multi-factor Authentication
In recent years, there has been fast development within the area of vehicular ad hoc networks (VANET). In the future, VANET communication will play a first-rate position in improvi...
Cross-layer security solution for secure communication of sensorsin Wireless Sensor Networks
Cross-layer security solution for secure communication of sensorsin Wireless Sensor Networks
Safe path-finding is extremely necessary for multihop wireless systems such as Wireless Sensor Networks. Multihop wireless systems are more unprotected to safety outbreaks as ass...

