Secure and energy aware multi-hop routing protocol in WSN using Taylor-based hybrid optimization algorithm
The advancements of Wireless sensor network (WSN) in large number of applications made it common. However, the energy is a major challenge in the WSN environment as the battery-operated sensor nodes in the network consumes huge amount of energy during transmission. This work addresses the energy iss...
Saved in:
Published in | Journal of King Saud University. Computer and information sciences Vol. 34; no. 5; pp. 1857 - 1868 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.05.2022
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The advancements of Wireless sensor network (WSN) in large number of applications made it common. However, the energy is a major challenge in the WSN environment as the battery-operated sensor nodes in the network consumes huge amount of energy during transmission. This work addresses the energy issue and provides an energy efficient multi-hop routing in WSN named Taylor based Cat Salp Swarm Algorithm (Taylor C-SSA) by modifying C-SSA with Taylor series. This method undergoes two stages for attaining multi-hop routing, which includes selection of cluster head (CH), and transmission of data. Initially, the energy-efficient cluster heads are selected using the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol for effective data transmission, the sensor nodes sends data over the CH, which transmits the data to the base station through the selected optimal hop. The optimal hop selection is done using the proposed Taylor C-SSA. Moreover, the security aware multi-hop routing is performed by introducing trust model that involves indirect trust, integrity factor, direct trust, and data forwarding rate. The proposed Taylor C-SSA algorithm shows best performance in terms of energy, number of alive nodes, delay, and throughput values of 0.129, 42, 0.291, and 0.1, respectively. |
---|---|
ISSN: | 1319-1578 2213-1248 |
DOI: | 10.1016/j.jksuci.2019.11.009 |