CAWS - Security Algorithms for Wireless Sensor Networks: A Cellular Automata Based Approach
Nilanjan Sen, Indrajit Banerjee

TL;DR
This paper introduces CAWS, a set of cellular automata-based security algorithms for wireless sensor networks, focusing on lightweight key management and secure data communication tailored to WSN constraints.
Contribution
It presents novel cellular automata-based algorithms, CAKD and CASC, optimized for minimal memory use and simple computation in WSN security.
Findings
CAWS algorithms require minimal memory.
They enable secure data communication in WSNs.
The approach is suitable for resource-constrained environments.
Abstract
Security in the Wireless Sensor Networks (WSN) is a very challenging task because of their dissimilarities with the conventional wireless networks. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of WSNs. In this paper we have proposed a set of cellular automata based security algorithms (CAWS) which consists of CAKD, a Cellular Automata (CA) based key management algorithm and CASC, a CA based secure data communication algorithm, which require very small amount of memory as well as simple computation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Mobile Ad Hoc Networks · Network Security and Intrusion Detection
