Secure and energy efficient optimal routing scheme for wireless sensor networks using IBFA and LDCSN-BSHHO algorithms
Main Article Content
Abstract
Wireless sensors networks (WSN) are very common because of their advancements in a big quantity of applications. The most vital design-goals aimed at WSN are energy efficiency in addition to secured Data Transmission (DT). This paper addresses the energy as well as security issues of the WSN and proposes a secure and energy-aware optimal routing scheme for WSN using learning of dynamic characteristics of sensor nodes with Bidirectional search based Harris Hawk optimizations (LDCSN-BSHHO). The proposed optimal routing is performed utilizing ‘4’ steps: i) clustering, ii) Cluster Heads (CH) selection, iii) data encryption, and iv) routing. Initially, to expand the Network Life-Time (NLT), the Weigh Utility-based Stratified Sampling (WUSS) method clusters the Sensor Nodes (SN). Next, the Elite Opposition and Ranking Mutation based Butterfly Optimization Algorithm (EORM-BOA) method optimally select the CH for the clusters. After that, an Improved Blowfish Algorithm (IBFA) encrypts the Data Packets (DP) to render data security. Finally, the LDCSN-BSHHO sent the encrypted DP to the Base Stations (BS) via the optimum path. It dynamically studies the node's behavior and selects an optimal path utilizing the BSHHO algorithm for data transfer. This kind of energy and security-centered method for WSN routing is labeled as secure and Energy-Aware Routing (EAR) of WSN. The proposed method’s outcomes are examined and weighed against the other prevailing techniques, which shows the proposed methods’ efficiency for optimal routing and the data’s security.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.