سند علمی

Geographic Wormhole Detection in Wireless Sensor Networks

چکیده

Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols.

اسناد مشابه

  • Attacks and Secure Geographic Routing in Wireless Sensor Networks

    سند علمی۲۰۱۷Yassine Sabri, Najib El Kamoun

    Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effec

  • Statistical Wormhole Detection in Sensor Networks

    سند علمی۲۰۰۵ESASLevente Buttyán, László Dóra, István Vajda

    In this paper, we propose two mechanisms for wormhole detection in wireless sensor networks. The proposed mechanisms are based on hypothesis testing and they provide probabilistic results. The first mechanism, called the Neighbor Number Test (NNT), detects the increase in the num

  • Circumventing Sinkholes and Wormholes in Wireless Sensor Networks

    سند علمی۲۰۰۵Asad Amir Pirzada, Chris McDonald

    Sensor networks are formed with the help of a large number of wireless nodes, generally with limited energy, computation and transmission powers. Each node helps every other node in the network by forwarding their packets. All is well if such an altruistic attitude is upheld by a

  • Hole Detection and Shape-Free Representation and Double Landmarks Based Geographic Routing in Wireless Sensor Networks

    سند علمی۲۰۰۹CoRRJianjun Yang, Zongming Fei, Ju Shen

    In wireless sensor networks, an important issue of Geographic Routing is “local minimum” problem, which is caused by “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a si

  • Distributed load balancing mechanism for detouring schemes of geographic routing in wireless sensor networks

    سند علمی۲۰۱۳IJPEDSFan Li, Jinnan Gao, Yu Wang

    Well-known ‘routing hole’ problem of geographic routing is hardly avoided in wireless sensor networks because of various actual geographical environments. Existing geographic routing protocols use perimeter routing strategies to find a detour path around the boundary of holes whe

  • Geographic Routing in Wireless Sensor Networks based on a Partitioned Architecture

    سند علمی۲۰۱۶Yassine Sabri, Najib El Kamoun, Anju Arya, Amita Malik

    Multiple sinks routing is envisioned as a possible solution to the bottleneck research problem in Wireless Sensor Networks (WSN). In addition to focusing on minimizing the energy consumption in a WSN, it is also equally important to design routing protocols that fairly and evenly