Open AccessLearning automaton‐based self‐protection algorithm for wireless sensor networks
Author(s) -
Mostafaei Habib,
Obaidat Mohammad S.
Publication year - 2018
Publication title -
iet networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.466
H-Index - 21
eISSN - 2047-4962
pISSN - 2047-4954
DOI - 10.1049/iet-net.2018.0005
Subject(s) - wireless sensor network , computer science , learning automata , cellular automaton , set (abstract data type) , node (physics) , reduction (mathematics) , automaton , key distribution in wireless sensor networks , algorithm , simple (philosophy) , distributed computing , computer network , wireless , wireless network , theoretical computer science , mathematics , engineering , telecommunications , geometry , structural engineering , programming language , philosophy , epistemology
Wireless sensor networks (WSNs) have been widely used for many applications such as surveillance and security applications. Every simple sensor in a WSN plays a critical role and it has to be protected from any attack and failure. The self‐protection of WSNs focuses on using sensors to protect themselves to resist against attacks targeting them. Therefore, it is necessary to provide a certain level of protection to each sensor. The authors propose an irregular cellular learning automaton (ICLA)‐based algorithm, which is called SPLA, to preserve sensors protection. Learning automaton at each cell of ICLA with proper rules aims at investigating the minimum possible number of nodes in order to guarantee the self‐protection requirements of the network. To evaluate the performance of SPLA, several simulation experiments were carried out and the obtained results show that SPLA performs on average of 50% better than maximum independent set and minimum connected dominating set algorithms in terms of active node ratio and can provide two times reduction in energy consumption.