Securing wireless sensor networks from node clone attack: a lightweight message authentication algorithm. (7th February 2020)

• Record Type: Journal Article
• Authors: Mohindru, Vandana; Singh, Yashwant; Bhatt, Ravindara
• Is Part Of: International journal of information and computer security. Volume 12:Number 2/3(2020)
• Page Start: 217
• Page End: 233
• Publication Date: 2020-02-07
• Subjects: wireless sensor network -- message authentication -- node clone attack -- hash function -- message communication -- energy efficient -- node replication; Computer security -- Periodicals; Information systems management -- Security measures -- Periodicals; Computer networks -- Security measures -- Periodicals; Information technology -- Security measures -- Periodicals; 005.805
• Languages: English
• ISSNs: 1744-1765

Abstract

Message communication in WSNs is not secure because energy-starving networks are vulnerable to numerous security attacks mainly due to their nature of distribution and unprotected communication. Securing communication in these networks not only needs to provide the elementary security but also needs resistance against countless attacks. Message authentication and integrity is a serious concern for sensor networks security, therefore, sensor network must assure the distribution of authentic message without any amendment or alteration. To solve these problems, a lightweight message authentication algorithm is proposed for securing message communication in WSNs. The algorithm uses Mod and XOR operations to compute fixed size hash value or message digest. The scheme is robust as a slight change in the message will affect the hash value extensively. The comparative analysis of the proposed algorithm is done with authentication algorithms available in the literature with the help of various metrics. Results show that the proposed message authentication algorithm is energy efficient and secure against node replication attacks. Also, proposed algorithm have 48.75 µJ communications overhead, 4.416 µJ of computational overhead and 3 bytes of storage overheads that is very less as compared to other algorithms present in the literature.