Abstract

While there is a rapid growth of wireless sensor networks mustered in different areas such as military, agriculture, weather forecasting etc., an equal attention has also been paid on their security concern. A dangerous attack against these networks is Sybil attack in which one malicious node creates and propagates multiple fake identifiers. This attack mainly influences routing protocols and operations such as voting, data aggregation and reputation evaluation. In this paper we propose a distributed and efficient algorithm based on broadcasting two-hop messages to detect Sybil nodes in wireless sensor networks. In the proposed algorithm, by sending two-hop messages, each node finds its two-hop neighbors and the common neighbors between itself and each of its two-hop neighbors. The number of common neighbors is a good indicator to detect Sybil nodes. Experimental results show that the proposed algorithm outperforms similar existing algorithms with respect to true and false detection rates.

Highlights

  • Wireless sensor networks are a kind of ad hoc wireless ­networks, which have many usages in military, a­ griculture, health care, weather forecasting and so on

  • Detecting Sybil Nodes in Wireless Sensor Networks using Two-hop Messages radio signals are prone to be interfered with environment and, as a result, may affect accuracy of such algorithms

  • In order to evaluate the efficiency of proposed algorithm, some experiment were performed, result of which were compared with similar algorithms . 10,12,14,15,17–20 Evaluation metrics are true and false detection rates

Read more

Summary

Introduction

Wireless sensor networks are a kind of ad hoc wireless ­networks, which have many usages in military, a­ griculture, health care, weather forecasting and so on. The enemy forges fake identifiers or duplicates existing nodes identifiers in different area of the network In this way, malicious node attracts a heavy traffic and considerably disrupts routing protocols. Among solutions proposed for this attack is an algorithm based on radio source testing technique in which each node assigns an independent signaling channel to each of its neighbors[7]. In that research, another technique based on voting and registering nodes identifiers has been proposed to detect Sybil nodes. Detecting Sybil Nodes in Wireless Sensor Networks using Two-hop Messages radio signals are prone to be interfered with environment and, as a result, may affect accuracy of such algorithms.

Related Works
System Assumptions and Attack Model
Proposed Algorithm
The First Refinement Step
The Second Refinement Step
Efficiency Evaluation and Simulation Results
Memory Overhead
Energy Consumption
Simulation Results
Experiment 1
Experiment 2
Experiment 3
Experiment 4
Experiment 5
Experiment 6
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.