Abstract
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 relationship list (NNRL) by broadcast flooding. All the nodes get the ID numbers of their neighbour nodes through NNRL. The suspect beacon nodes can be found by comparing the theoretical and actual number of neighbour nodes. Then, the suspect beacon nodes calculate the distances to other beacon nodes in their NNRL to find the actual attacked beacon nodes. The attacked beacon nodes in the different areas of wormhole attack are marked with 1 or 2. Finally, the unknown nodes mark themselves with 1 or 2 according to the beacon nodes marked before. In the next round of localisation, the nodes marked with 1 and the nodes marked with 2 disconnected from each other. The simulation results show that the localisation error of the proposed AWDV-hop algorithm is reduced by about 80% than that of DV-hop algorithm suffering from the wormhole attack. Compared to label-based DV-HOP (LBDV-hop) and secure neighbour discovery based DV-HOP (NDDV-hop) algorithm, the localisation error is reduced by about 7 and 34%, respectively.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
