Multi-hop Routing In Wireless Sensor Networks Research Articles

Enhancing security in wireless sensor networks: A fusion of deep learning and energy-efficient routing

The development of tiny sensing nodes efficient for wireless communication in Wireless Sensor Networks (WSNs) can be attributed to the rapid advancements in processors and radio technology. Data transmission occurs through multi-hop routing in WSN, which relies on nodes’ cooperation. The collaboration between nodes has rendered these networks susceptible to various attacks. It is imperative to employ a security scheme to evaluate the dependability of nodes in distinctive malicious nodes from non-malicious nodes. In recent years, there has been a growing significance placed on security-based routing protocols with energy constraints as valuable mechanisms for enhancing the security and performance of WSNs. A novel solution called the Deep Learning-based Hybrid Energy Efficient and Security System (DL-HE2S2) is introduced to address these challenges. The research workflow encompasses various essential stages, namely the deployment of nodes, the creation of clusters, the selection of cluster heads, the detection of malevolent nodes within each group, and the determination of optimal paths intra- and inter-clusters employing the routing algorithm for efficient packet transmission. The design of the algorithm is focused on achieving energy efficiency and enhancing network security while also taking into account various performance metrics, including a mean network lifetime of 187.244 hours, a throughput of 59.88 kilobits per second, an end-to-end latency of 11.939 milliseconds, a packet loss of 14.9%, a packet delivery ratio of 99.194%, network security at 92.026%, and energy usage of 19.424 J. This research examines the algorithm’s scalability and efficiency across various network sizes using a Network Simulator (NS-2). DL-HE2S2 offers valuable insights that can be applied to practical implementations in multiple applications.

A Novel Approach for Gender Prediction through Fingerprint Analysis using Fuzzy C-Means Algorithm and Artificial Neural Network

Wireless Sensor Networks (WSN) is a group of Sensor Nodes (SNs) which are performed to intellect a normal singularity from an environment. The minimum resources and computational power of WSN creates vulnerable to number of security attacks. To addresses this problem, this paper proposes a Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm (M-TDWPOA)-based secure and energy aware multi-hop routing in WSN with the Base Station (BS). The proposed method comprises of two significant steps: Initially, dynamic energy-efficient Cluster Head (CH) selection by utilizing the multi-objective functions such as Distance between neighbor nodes, Distance between BS to CH, Energy, Centrality and Trust Threshold. Then, dynamic secure multi-hop routing is selected by the multi-objective functions such as Distance between BS to CH, Energy, Trust Threshold which is dynamically reducing the network overhead. Furthermore, a security aware multi-hop routing is employed through the different trust classes like direct, indirect, recent and authentication. The proposed M-TDWPOA approach is estimated with various performance metrics like alive nodes, dead nodes, energy consumption, Throughput and so on. The proposed M-TDWPOA achieves the minimum energy consumption of 0.4927J, 0.4851J, 0.4771J, 0.4693J and 0.4617J when compared to the existing methods like Fractional Artificial Lion (FAL).

Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm for Secure Cluster Head and Routing Selection in WSN

Wireless Sensor Networks (WSN) is a group of Sensor Nodes (SNs) which are performed to intellect a normal singularity from an environment. The minimum resources and computational power of WSN creates vulnerable to number of security attacks. To addresses this problem, this paper proposes a Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm (M-TDWPOA)-based secure and energy aware multi-hop routing in WSN with the Base Station (BS). The proposed method comprises of two significant steps: Initially, dynamic energy-efficient Cluster Head (CH) selection by utilizing the multi-objective functions such as Distance between neighbor nodes, Distance between BS to CH, Energy, Centrality and Trust Threshold. Then, dynamic secure multi-hop routing is selected by the multi-objective functions such as Distance between BS to CH, Energy, Trust Threshold which is dynamically reducing the network overhead. Furthermore, a security aware multi-hop routing is employed through the different trust classes like direct, indirect, recent and authentication. The proposed M-TDWPOA approach is estimated with various performance metrics like alive nodes, dead nodes, energy consumption, Throughput and so on. The proposed M-TDWPOA achieves the minimum energy consumption of 0.4927J, 0.4851J, 0.4771J, 0.4693J and 0.4617J when compared to the existing methods like Fractional Artificial Lion (FAL).

An optimized multi-hop routing protocol for wireless sensor network using improved honey badger optimization algorithm for efficient and secure QoS

A wireless sensor network (WSN) is a significant technology that might contribute in the industrial revolution. Sensor Nodes (SNs) in WSNs are equipped with a battery as a power source. Energy is the most critical resource for WSNs since the battery cannot be replaced or refilled. Several solutions have been devised and implemented over the years to preserve WSNs, which are a scarce resource. This study suggested a model to solves the energy issue as well as security issue and presents an optimized multi-hop routing in WSNs based on improved Honey Badger Algorithm (I-HBA). This method for multi-hop routing involves two steps: selecting a Cluster Head (CH) and routing the data packets. The I-HBA is used to pick energy-efficient CHs for efficient data transfer. The SNs then send their data through the chosen CH, which forwards it to the base station (BS) using the most efficient number of hops. The suggested I-HBA is used to select the finest hops. The proposed model employs the multi-objective fitness function including eight parameters for effective routing in the WSNs. Furthermore, security conscious multihop routing is carried out by employing a trust model that includes direct and indirect trust, data, integrity and forwarding rate factor. Additionally, the proposed I-HBA based routing protocol compared with the existing protocol such as LEACH, HEED, and PSO; and the proposed protocol outperforms the existing models. The findings show that for the same number of iterations, the whole quantity of data packets receives by the WSN using the proposed I-HBA based multihop routing protocol is substantially larger than for the PSO, LEACH, and HEED-based models.

A Minimum Spanning Tree based Clustering Algorithm for Cloud based Large Scale Sensor Networks

Wireless sensor networks (WSNs) can be composed of huge numbers of nodes collecting data from the environment. WSNs are crucial communication layer technologies of Internet of Things. The obtained data by the WSNs can grow exponentially, hence utilizing big data analysis techniques and cloud computing technologies are of utmost importance. WSNs can be used in various applications such as habitat monitoring, military surveillance, smart agriculture, miner safety and healthcare applications. Sensor nodes are generally battery-powered, so conserving the residual energy of nodes is very important to prolong the lifetime of the applications. WSNs do not own a fixed infrastructure, hence messages of the applications transmitted in an ad hoc manner to the sink node. Since the transmission range of sensor nodes are limited, multi-hop communication is used. Clustering is a very important method for supporting multi-hop routing in WSNs. Data aggregation, time synchronization and load balancing are some of the well-known operations that benefit from clustering. Selecting efficient communication paths and distribution of nodes evenly to partitions in clustering operation lead to boost the network lifetime. In this paper, we propose a minimum spanning tree based clustering and backbone formation algorithm (MICUB) for WSNs. The proposed algorithm inputs node coordinates, transmission range, sensing area dimensions and partition numbers and outputs clustering and backbone information. MICUB algorithm first forms a minimum spanning tree backbone and divides the networking area into equal partitions where each partition is a cluster. In this manner, efficient links are selected for backbone formation and the clusters are constructed evenly. The intra-cluster links are constructed by again executing a minimum spanning tree algorithm inside the clusters. We measure the coefficient of variations of the proposed MICUB algorithm and its counterparts to obtain the clustering quality. These results show us that our proposed algorithm performs very well against node counts and degrees.

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

SummaryThe technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.

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 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.

Energy Efficient Dynamic Multi-Hop Routing Technique in Wireless Sensor Networks

In Wireless Sensor Networks (WSNs) main focus is on energy conservation and thus it is most researched area. The energy in WSN is highly consumed during data transmission. That’s why, many routing protocols are developed as their sole purpose is to consume less energy during data transmission. Dynamic Multi-Hop Routing (DMR) and Static Multi-Hop Routing (SMR) has provided efficient approach by forwarding nodes data to Base Station (BS) by splitting whole sensor network into several levels and each node acts according to its position and status but network suffers from hotspot problem for large area applications. This paper aims to present a new technique to avoid hotspot problem in by introducing Relay Cluster Head (RCH), node whose sole purpose is to relay the data for multi hop routing in WSN and to improve the Cluster Head (CH) selection in the existing techniques by incorporating energy and distance factors. The network is divided into levels and nodes in a cluster send their data to CH and CH in each level forwards its data to the RCH of the lower level (near to BS). It is observed from simulation results that proposed technique improves the lifetime, stability and throughput of the network as compared to the DMR and SMR techniques.

A Credit based Security Scheme (CBSS) for Multihop Routing in Wireless Sensor Networks

most of the scenarios, communication in Wireless Sensor Network (WSN) takes place via multihop routing. Multihop routing does not provide much protection against identity deception, developed through the replay of routing information. This defect can be exploited by an opponent to launch several harmful attacks or even attacks that destroy the routing protocols, misdirecting the network traffic which results in disastrous consequences. In order to secure the multihop routing in WSNs from the adversaries, a Credit Based Security Scheme (CBSS) for WSN is proposed. CBSS, not only reduce the negative impacts from intruders but it also proves energy-efficient by incorporating the trustworthiness of the nodes into the routing decisions. The focus of this paper is to increase the Packet Delivery Ratio and offer an energy efficient route to the base station even in the presence of wormhole attack by incorporating Credit Based Security Scheme (CBSS). CBSS is proved effective through extensive evaluation with simulation using NS2. KeywordsSensor Networks, multihop routing, identity deception, credit value, energy rate.

Biological inspired secure autonomous routing mechanism for wireless sensor networks

The field of wireless sensor network (WSN) is an important and challenging research area today. Advancements in sensor networks enable a wide range of environmental monitoring applications. Multihop routing in WSN is affected by new nodes constantly entering/leaving. Moreover, secure routing is a difficult problem due to the resource limitations in WSN. Thus, biological inspired algorithms are reviewed and enhanced to tackle the problems. Ant routing and human security system have shown excellent performance. Certain parameters as energy level, velocity, packet reception, dropping, mismatch rates and packet sending power are considered while making decision. The decision will come up with the optimal route and also to take best action against security attacks. In this paper, the design and initial work of BIOlogical Inspired Secure Autonomous Routing Protocol (BIOSARP) is presented. The proposed bio-inspired mechanism will meet the enhanced WSN requirements, including better delivery ratio, less energy consumption and routing overhead.

Hop-Based Energy Aware Routing Algorithm for Wireless Sensor Networks

Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.