Simple, secure, and lightweight mechanism for mutual authentication of nodes in tiny wireless sensor networks. (10th March 2020)

• Record Type: Journal Article
• Authors: Jain, Usha; Hussain, Muzzammil; Kakarla, Jagadeesh
• Is Part Of: International journal of communication systems. Volume 33:Number 9(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-03-10
• Subjects: mathematical mechanism -- cryptographic -- node authentication -- tiny nodes -- wireless sensor networks; Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.4384
• Languages: English
• ISSNs: 1074-5351

Abstract

Summary: Wireless sensor networks (WSNs) are widely used in large areas of applications; due to advancements in technology, very tiny sensors are readily available, and their usage reduces the cost. The mechanisms designed for wireless networks cannot be implied on networks with tiny nodes due to battery and computational constraints. Understanding the significance of security in WSNs and resource constraintness of tiny WSNs, we propose a node authentication mechanism for nodes in wireless sensor networks to avoid security attacks and establish secure communication between them. In the proposed mechanism, a base station (BS) generates a secret value and random value for each sensor node and stores at the node. The sensor node authenticates using secret value and random number. Random nonce ensures freshness, efficiency, and robustness. The proposed mechanism is lightweight cryptographic, hence requires very less computational, communication, and storage resources. Security analysis of the proposed mechanism could not detect any security attack on it, and the mechanism was found to incur less storage, communication, and computation overheads. Hence, the proposed mechanism is best suitable for wireless sensor networks with tiny nodes. Abstract : In this, we have proposed a mutual node authentication mechanism for tiny wireless sensor networks (WSNs). The proposed mechanism uses lightweight operations like exclusive OR (XOR) and one‐way hash; it is secure, lightweight, and most suitable for tiny networks. The proposed mechanism is proved to be secure and also consumes very less resources compared to the existing mechanisms.