Detecting and Locating Wormhole Attacks in Wireless Sensor Networks Using Beacon Nodes

He Ronghui; Ma Guoqing; Wang Chunlei; Fang Lan
July 2009
World Academy of Science, Engineering & Technology;Jul2009, Issue 31, p286
Academic Journal
This paper focuses on wormhole attacks detection in wireless sensor networks. The wormhole attack is particularly challenging to deal with since the adversary does not need to compromise any nodes and can use laptops or other wireless devices to send the packets on a low latency channel. This paper introduces an easy and effective method to detect and locate the wormholes: Since beacon nodes are assumed to know their coordinates, the straight line distance between each pair of them can be calculated and then compared with the corresponding hop distance, which in this paper equals hop counts × node's transmission range R. Dramatic difference may emerge because of an existing wormhole. Our detection mechanism is based on this. The approximate location of the wormhole can also be derived in further steps based on this information. To the best of our knowledge, our method is much easier than other wormhole detecting schemes which also use beacon nodes, and to those have special requirements on each nodes (e.g., GPS receivers or tightly synchronized clocks or directional antennas), ours is more economical. Simulation results show that the algorithm is successful in detecting and locating wormholes when the density of beacon nodes reaches 0.008 per m².


Related Articles

  • NODES CONTROL ALGORITHM DESIGN BASED COVERAGE AND CONNECTIVITY OF WIRELESS SENSOR NETWORK. Yin Zhouping // International Journal on Smart Sensing & Intelligent Systems;Mar2015, Vol. 8 Issue 1, p272 

    Coverage and connectivity are two important problems in wireless sensor network. This paper focuses on the wireless sensor network communication radius in the high density of sensor nodes deployed randomly and two times smaller than the sensing radius; put forward a distributed k coverage multi...

  • Security DV-hop localisation algorithm against wormhole attack in wireless sensor network. Jianpo Li; Dong Wang; Yanjiao Wang // IET Wireless Sensor Systems;2018, Vol. 8 Issue 2, p68 

    Distance vector-hop (DV-hop) is a localisation algorithm based on distance vector routing, which often suffers the wormhole attack. To solve this problem, a security DV-hop localisation algorithm against wormhole attack (AWDV-hop) is proposed. First, the algorithm establishes the neighbour node...

  • Fault-Tolerant WSN Time Synchronization. Ung-Jin Jang; Sung-Gu Lee; Jun-Young Park; Sung-Joo Yoo // Engineering;Oct2010, Vol. 2 Issue 10, p739 

    This paper proposes a new fault-tolerant time synchronization algorithm for wireless sensor networks that requires a short time for synchronization, achieves a guaranteed time synchronization level for all non-faulty nodes, accommodates nodes that enter suspended mode and then wake up, is...

  • ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks. Abidoye, Ademola P.; Azeez, Nureni A.; Adesina, Ademola O.; Agbele, Kehinde K. // Wireless Sensor Network;Sep2011, Vol. 3 Issue 9, p307 

    One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes' energy consumption during...

  • Classification of Swarm Intelligence based Clustering Methods. Nagchoudhury, Pooja; Choudhary, Kavita // International Journal of Computer Applications;Apr2014, Vol. 91, p28 

    The nodes in wireless sensor networks (WSN) need to be deployed optimally to cover whole geographic area and the communication link between them should be optimal. During deployment the proper strategy is required to optimally deploy the sensor nodes in the area. The sensor nodes can be compared...

  • An Efficient Energy, Coverage and Connectivity (Ec2) Algorithm for Wireless Sensor Networks. Anand, D. G.; Chandrakanth, H. G.; Giriprasad, M. N. // International Journal of Computer Applications;May2012, Vol. 45, p18 

    As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for applications are continually being developed, many of which involve consistent coverage with good network connectivity of a given region of interest. One of the important challenges of the...

  • Sensor Node Placement in Wireless Sensor Network Using Multi-objective Territorial Predator Scent Marking Algorithm. Zainol Abidin, H.; Din, N.; Yassin, I.; Omar, H.; Radzi, N.; Sadon, S. // Arabian Journal for Science & Engineering (Springer Science & Bu;Aug2014, Vol. 39 Issue 8, p6317 

    Optimum sensor node placement for wireless sensor network (WSN) in a monitored area is needed for cost-effective deployment. The location of sensor nodes must be able to offer maximum coverage and connectivity with minimum energy consumption. This paper proposes a sensor node placement approach...


    Wireless Sensors Networks are widely used to monitor the areas. In many WSN applications it is important to achieve a good coverage of the observed area while the energetic efficiency and the lifetime of the network are high. The task of placing the sensor nodes while addressing these objectives...

  • DETERMINATION OF OPTIMAL NUMBER OF CLUSTERS IN WIRELESS SENSOR NETWORKS. Tandon, Ravi // International Journal of Computer Networks & Communications;Jul2012, Vol. 4 Issue 4, p235 

    Prolonged network lifetime, scalability and efficient load balancing are essential for optimal performance of a wireless sensor network. Clustering provides an effective way of extending the lifetime of a sensor network. Clustering is the process that divides sensor networks into smaller...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics