z-logo
open-access-imgOpen Access
An AODV Based Multifactor Authentication Scheme for Wireless Sensor Network
Author(s) -
Jane Yong,
Zi Jian Chai,
Kah Hao Chin,
Christopher Chin Fung Chee,
Daniel Soh,
Jing Yong Kwong,
Wei Yin Ooi
Publication year - 2021
Publication title -
journal of it in asia
Language(s) - English
Resource type - Journals
ISSN - 1823-5042
DOI - 10.33736/jita.3840.2021
Subject(s) - computer science , computer network , replay attack , authentication (law) , password , multi factor authentication , scheme (mathematics) , overhead (engineering) , challenge–response authentication , wireless sensor network , network packet , authentication protocol , computer security , mathematical analysis , mathematics , operating system
Wireless Sensor Network (WSN) is a type of wireless network that is fast getting a lot of attention in scientific and industrial applications, and it is a network of decentralized autonomous standalone sensor devices. However, WSN is easily prone to malicious attacks as anyone can access the server through the node without a proper security authentication. In this paper, we proposed a secure AODV based multi-factor authentication scheme for WSN to mitigate physical attack, offline guessing attack and replay attack. Our proposed scheme is preferred to keep the scheme lightweight while providing enough security that requires smart card, user identity, password, and OTP. Our proposed scheme has relatively lower computational cost with a total of 10Th than the other compared schemes except for Adil et al.’s scheme. However, we have around 8288 bits of authentication overhead due to the nature of packet and the addition of factors. Hence, our scheme is outperformed from computational cost perspective, but the scheme is slightly higher on authentication overhead perspective. In the future, multiple device authentication, implementation of biometric feature can be added to improve the scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here