Abstract

One of the most common attacks against Wireless Sensor Networks is the wormhole attack. In this attack, the enemy deploys two malicious nodes in two different areas of the network and establishes a high-speed dedicated channel between these two. This will cause the normal nodes in two different areas wrongly think that they are two-hop neighbors. Therefore, this attack will greatly affect the routing algorithms. In this paper, a new distributed algorithm is provided to deal with the wormhole attack. The main idea of the proposed algorithm is to discover separate routes between pairs of two-hop neighboring nodes. The proposed algorithm was implemented and evaluated in terms of true and false detection rate by performing a series of experiments and the results were compared with the base algorithm. The test results showed that the proposed algorithm has desirable efficacy.

Highlights

  • Today, wireless sensor networks have an increasing application in military, environment, urban services, discoveries and monitoring fields

  • In [5], an algorithm is proposed based on probability distribution of the number of neighboring nodes called WAPN to cope with wormhole attacks

  • True detection rate: a percentage of legal nodes is the neighbor of malicious nodes of wormhole attack which have succeed to detect an attack in their neighborhood

Read more

Summary

Department of Electrical Engineering Kermanshah University of Technology

Abstract—One of the most common attacks against Wireless Sensor Networks is the wormhole attack. In this attack, the enemy deploys two malicious nodes in two different areas of the network and establishes a high-speed dedicated channel between these two. The enemy deploys two malicious nodes in two different areas of the network and establishes a high-speed dedicated channel between these two This will cause the normal nodes in two different areas wrongly think that they are two-hop neighbors. This attack will greatly affect the routing algorithms. The main idea of the proposed algorithm is to discover separate routes between pairs of two-hop neighboring nodes. The test results showed that the proposed algorithm has desirable efficacy

INTRODUCTION
SIMULATION RESULTS
CONCLUSION

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.