Multi-hop Routing Research Articles

Universal Geographic Information System Productivity beneath optimum Underwater Sensor Networks Routing

Study Framework: The system of geographical information (GIS) is a computerized method for collecting, storing, disseminating, querying, updating, processing and analyzing geographic data. (GIS) enables the collection of diverse spatial data from various sources and transforms it into an information board for multiple users to boost productivity. Intelligent techniques, remote sensing, and underwater Wireless sensor networks are applied to improve GIS dramatically. Remote sensing data sources for GIS come from underwater sensor networks, The implementation of effective sensing devices, intelligent mobile nodes, and a multi-hop routing system can facilitate the efficient and optimal routing of traffic towards the basin or base station. They have been using GIS, which has revolutionized response scenarios with its ability to collect, analyze and manipulate spatial points. The objective of the study: The aim of this research is to differentiate the significant routing protocol issues that are relevant to underwater sensor networks. These networks serve as key transceivers that have established mechanisms for seamless and efficient data transmission. The mechanisms: The article presented a performance evaluation simulation based on a comparison of five different routing protocols that perform to promote GIS execution. A rigorous comparison of the outcomes varied by five routing protocols, where it evaluated with random mobility UnderWater sensor model based on the varied network parameters, was performed to validate this work. The continued to improve results: The suggested study in this manuscript contains spatial-information services universal to routing protocols to aid a group of navigators in harsh circumstances. According to the findings of the study, the CTP-ABS-SEEC routing protocol demonstrated superior performance compared to the other four routing protocols (CTP-SEEC, SEEC, EEDBR, and DBR) in the specified network configuration.

Machine Learning Supported Nano-Router Localization in WNSNs

Sensing data from the environment is a basic process for the nano-sensors on the network. This sensitive data need to be transmitted to the base station for data processing. In Wireless Nano-Sensor Networks (WNSNs), nano-routers undertake the task of gathering data from the nano-sensors and transmitting it to the nano-gateways. When the number of nano-routers is not enough on the network, the data need to be transmitted by multi-hop routing. Therefore, there should be more nano-routers placed on the network for efficient direct data transmission to avoid multi-hop routing problems such as high energy consumption and network traffic. In this paper, a machine learning-supported nano-router localization algorithm for WNSNs is proposed. The algorithm aims to predict the number of required nano-routers depending on the network size for the maximum node coverage in order to ensure direct data transmission by estimating the best virtual coordinates of these nano-routers. According to the results, the proposed algorithm successfully places required nano-routers to the best virtual coordinates on the network which increases the node coverage by up to 98.03% on average and provides high accuracy for efficient direct data transmission.

Non-Uniform Clustering Algorithm for UWSNs Based on Energy Equalization

Underwater sensor nodes are usually deployed by ships, aircraft, etc., in random drops, and there is current movement in the underwater environment, which results in an uneven distribution of sensor nodes and thus, different energy consumption in each area of the network. In addition, the underwater sensor network also has a “hot zone” problem. To address the uneven energy consumption of the network caused by the above problem, the non-uniform clustering algorithm for energy equalization is put forward. Considering the residual energy, density and coverage redundancy of nodes, this algorithm selects the cluster heads and makes them more reasonably distributed. Additionally, according to the selected cluster heads, the size of each cluster is designed to equalize the energy consumption of the network during multi-hop routing. In this process, the residual energy of cluster heads and the mobility of nodes are considered, and real-time maintenance is performed for each cluster. The simulation results demonstrate that the proposed algorithm is effective in prolonging the network lifetime and balancing the network energy consumption; moreover, the network coverage maintenance is better than that of other algorithms.

Design of improved deer hunting optimization enabled multihop routing protocol for wireless sensor networks

A wireless sensor network (WSN) encompasses a huge set of sensor nodes employed to collect data and transmit it to a base station (BS). Due to its compact, inexpensive, and scalable nature of sensors, WSN finds its applicability in diverse real-time applications. The battery-operated sensor nodes necessitate the design of a multi-hop routing protocol for the effective utilization of available energy in the network. Routing can be considered an optimization problem and can be solved by the design of bioinspired algorithms. This study introduces an improved deer hunting optimization-enabled multihop routing (IDHO-MHR) protocol for WSN. The major intention of the IDHO-MHR approach is to optimally find the routes to the destination in WSN. The IDHO algorithm is initially derived by the incorporation of the Nelder Mead (NM) concept into the traditional DHO algorithm. In addition, the IDHO-MHR technique primarily derives a fitness function with the inclusion of two major variables, namely residual energy (RE) and distance. The nodes with higher RE and minimum distance have the probability of becoming optimal routes from the networks. The performance validation of the IDHO-MHR approach is performed, and the outcomes are inspected in various aspects. The experimental outcomes reported the supremacy of the IDHO-MHR protocol over the other recent approaches.

Accurate time synchronization of power reference station based on BD3 system

A Beidou 3 (BD3) system-based power reference station can provide high-precision time synchronization for power distribution systems by sending synchronization data packets to devices in a multi-hop routing fashion. However, optimizing route selection to reduce both time synchronization error and delay is a challenging problem. In this paper, we establish a software-defined network-enabled power reference station time synchronization framework based on BD3. Then, we formulate the joint problem to minimize cumulative synchronization error and delay through multi-hop route selection optimization. A back propagation (BP) neural network-improved intelligent time synchronization route selection algorithm named BP-RS is proposed to learn the optimal route selection, which uses a BP neural network to dynamically adjust the exploration factor to achieve rapid convergence. Simulation results show the superior performance of BP-RS in synchronization delay, synchronization error, and adaptability with changing routing topologies.

A cluster-based routing in WSN for smart city applications using neural networks

A smart city is a phenomenon that combines information technology with physical and social infrastructure to regulate a city’s cooperative intelligence. Wireless sensor networks (WSN) are the fundamental technology that smart cities use to administer and sustain their service offerings. To decrease the network’s energy consumption, clustering and multihop routing algorithms have been suggested, verified, and put into practice in the literature. This inspiration led to the development of the “energy-aware clustered route approach” in the current study, which is suggested for WSNs in smart cities. The presented method focuses on choosing the right cluster heads (CHs) and the best pathways in a WSN. The presented model includes a fitness value-based clustering scheme for efficient CH selection to achieve this. The Deep Neural Network (DNN) algorithm is then used to carry out the routing operation. The suggested approach technique calculates a fitness function (FF) that consists of three variables, including node degree, base station distance, and residual energy. This fitness function aids in the WSN’s best route selection. Simulations were run to verify the presented model’s superiority in terms of network lifespan and energy efficiency, and the results demonstrated the model’s outstanding performance.

A multi-hop routing protocol for an energy-efficient in wireless sensor network

The low-energy adaptive clustering hierarchy (LEACH) protocol has been developed to be implemented in wireless sensor networks (WSNs) systems such as healthcare and military systems. LEACH protocol depends on clustering the employed sensors and electing one cluster head (CH) for each cluster. The CH nodes are changed periodically to evenly distribute the energy load among sensors. Updating the CH node requires electing different CH and re-clustering sensors. This process consumes sensors’ energy due to sending and receiving many broadcast and unicast messages thus reduces the network lifetime, which is regarded as a significant issue in LEACH. This research develops a new approach based on modifying the LEACH protocol to minimize the need of updating the cluster head. The proposal aims to extend the WSN’s lifetime by maintaining the sensor nodes’ energy. The suggested approach has been evaluated and shown remarkable efficiency in comparison with basic LEACH protocol and not-clustered protocol in terms of extending network lifetime and reducing the required sent messages in the network reflected by 15%, and, in addition, reducing the need to reformatting the clusters frequently and saving network resources.

Avoiding Detection by Hostile Nodes in Airborne Tactical Networks

Contemporary airborne radio networks are usually implemented using omnidirectional antennas. Unfortunately, such networks suffer from disadvantages such as easy detection by hostile aircraft and potential information leakage. In this paper, we present a novel mobile ad hoc network (MANET) routing protocol based on directional antennas and situation awareness data that utilizes adaptive multihop routing to avoid sending information in directions where hostile nodes are present. Our protocol is implemented in the OMNEST simulator and evaluated using two realistic flight scenarios involving 8 and 24 aircraft, respectively. The results show that our protocol has significantly fewer leaked packets than comparative protocols, but at a slightly higher cost in terms of longer packet lifetime.

Network intelligence vs. jamming in underwater networks: how learning can cope with misbehavior

In this paper, we present a machine-learning technique to counteract jamming attacks in underwater networks. Indeed, this is relevant in security applications where sensor devices are located in critical regions, for example, in the case of national border surveillance or for identifying any unauthorized intrusion. To this aim, a multi-hop routing protocol that relies on the exploitation of a Q-learning methodology is presented with a focus on increasing reliability in data communication and network lifetime. Performance results assess the effectiveness of the proposed solution as compared to other efficient state-of-the-art approaches.

Energy-aware multipath routing in WSN using improved invasive weed elephant herd optimization

PurposeIn a wireless sensor network (WSN), the sensor nodes are distributed in the network, and in general, they are linked through wireless intermediate to assemble physical data. The nodes drop their energy after a specific duration because they are battery-powered, which also reduces network lifetime. In addition, the routing process and cluster head (CH) selection process is the most significant one in WSN. Enhancing network lifetime through balancing path reliability is more challenging in WSN. This paper aims to devise a multihop routing technique with developed IIWEHO technique.Design/methodology/approachIn this method, WSN nodes are simulated originally, and it is fed to the clustering process. Meanwhile, the CH is selected with low energy-based adaptive clustering model with hierarchy (LEACH) model. After CH selection, multipath routing is performed by developed improved invasive weed-based elephant herd optimization (IIWEHO) algorithm. In addition, the multipath routing is selected based on certain fitness functions like delay, energy, link quality and distance. However, the developed IIWEHO technique is the combination of IIWO method and EHO algorithm.FindingsThe performance of developed optimization method is estimated with different metrics, like distance, energy, delay and throughput and achieved improved performance for the proposed method.Originality/valueThis paper presents an effectual multihop routing method, named IIWEHO technique in WSN. The developed IIWEHO algorithm is newly devised by incorporating EHO and IIWO approaches. The fitness measures, which include intra- and inter-distance, delay, link quality, delay and consumption of energy, are considered in this model. The proposed model simulates the WSN nodes, and CH selection is done by the LEACH protocol. The suitable CH is chosen for transmitting data through base station from the source to destination. Here, the routing system is devised by a developed optimization technique. The selection of multipath routing is carried out using the developed IIWEHO technique. The developed optimization approach selects the multipath depending on various multi-objective functions.

Hybrid Muddy Soil Fish Optimization-Based Energy Aware Routing in IoT-Assisted Wireless Sensor Networks

The seamless operation of interconnected smart devices in wireless sensor networks (WSN) and the Internet of Things (IoT) needs continuously accessible end-to-end routes. However, the sensor node (SN) relies on a limited power source and tends to cause disconnection in multi-hop routes because of a power shortage in the WSN, eventually leading to the inefficiency of the total IoT network. Furthermore, the density of available SNs affects the existence of feasible routes and the level of path multiplicity in the WSN. Thus, an effective routing model is predictable to extend the lifetime of WSN by adaptively choosing the better route for the data transfers between interconnected IoT devices. This study develops a Hybrid Muddy Soil Fish Optimization-based Energy Aware Routing Scheme (HMSFO-EARS) for IoT-assisted WSN. The presented HMSFO-EARS technique majorly focuses on the identification of optimal routes for data transmission in the IoT-assisted WSN. To accomplish this, the presented HMSFO-EARS technique involves the integration of the MSFO algorithm with the Adaptive β-Hill Climbing (ABHC) concept. Moreover, the presented HMSFO-EARS technique derives a fitness function for maximizing the lifespan and minimizing energy consumption. To demonstrate the enhanced performance of the HMSFO-EARS technique, a series of experiments was performed. The simulation results indicate the better performance of the HMSFO-EARS algorithm over other recent approaches with reduced energy consumption, less delay, high throughput, and extended network lifetime.

Wireless Mesh Networking Tests and Evaluation in the Karst Natural Caves of Southwest China

Currently, the exploration and development of the Karst natural caves (KNCs) have become hot research topics, and flexible and reliable communication in the KNCs is very important. However, because of the inherent concavity and irregular limestone formations in the KNC, wireless signal propagation is sparse and unpredictable. In this paper, we explore the application of wireless mesh networking (WMN) in the KNC. First, by measuring the relative permittivity of the KNC using the transmission line method at 530 MHz, 670 MHz and 1.4 GHz, we segment the channel characteristics using classical free space propagation modeling, lossy waveguide modeling and bend modeling based on the geographical features of the KNC for reducing the complexity of channel modeling. The measured results are in good agreement with the segment model calculation. Second, we test and evaluate the network performance at 530 MHz, including multihop routings and multidata flows in static scenarios and mobile scenarios. The test results show that audio and video can be transmitted clearly below three hops, it is feasible to deploy WMN in an irregular KNC.

Innovating Multi-Objective Optimal Message Routing for Unified High Mobility Networks

Futuristic applications of intelligent transportation systems (ITS) highly rely on ad-hoc connectivity between the stochastic vehicular networks (ground and airborne). Message routing in ITS faces several challenges in the dynamic environment of highly mobile networks in the form of obstacles, propagation, and stability of the connection. Unlike vehicular ad-hoc networks (VANETs), flying ad-hoc networks (FANETs) have a flexible and robust configuration with line-of-sight links, and can provide message relaying services to VANETs. However, constant FANET usage depletes residual energy, leading to a shorter network lifetime. In this study, we propose UniFaVa, a routing scheme that considers a combined and unified paradigm of FANETs and VANETs, where a routing decision prefers a higher transmission rate of unmanned aerial vehicles (UAVs) with ample residual energy as a relay. The proposed scheme guarantees the reliability of a complete transmission by analytically predicting the connectivity time. Moreover, an analytical approach is formulated for the proposed multi-objective optimal routing using hypervolume. Our extensive simulation results using real traffic traces of Seoul and New York City from OpenStreetMap and simulation of urban mobility (SUMO) indicate significant achievements over the three existing contemporary routing methods. The proposed UniFaVa multi-objective optimal routing achieves a packet delivery ratio of 90% and a connectivity time of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$3\sim 6$</tex-math></inline-formula> sec for established multi-hop routes, and short hop distances for a reliable propagation with only one extra hop on average.

English

The ubiquitous nature of wireless sensor networks (WSNs) means that their underlying network architecture may be used to serve a broad range of use cases, from "smart cities" to "smart homes" and beyond. Other serious problems, such as energy use and security, have persisted. When it comes to WSN security, the blockchain might be the answer. Traditional blockchains have limitations, such as inefficient transaction processing and limited scalability. When Wireless Sensor Networks (WSNs) are deployed, most of the time, the nodes are left unmanaged and vulnerable to various security threats. Reliable data distribution in WSNs is nontrivial because of the limited resources and dynamic behavior of sensor nodes. Traditional cryptography and authentication-based methods have been shown to be unsuitable for countering node misbehavior attacks due to their high cost and incapability. The lightweight authentication encryption system was developed to solve the problems of sensor resource scarcity and data security (data integrity and secrecy). Current trust-based solutions, on the other hand, increase traffic congestion and decrease the network's lifespan due to the high costs associated with trust estimates and network-wide dissemination. As a result, the objective of this study is to present an intrusion prevention architecture for mobile Internet of Things devices, along with its integration into WSN, to ensure data security while simultaneously improving the network delivery ratio. The architecture that has been suggested is made up of two different discrete components. To begin, the ambiguity principle is used to construct non-overlapping and independently structured clusters, which are then used to preserve the clusters' stability. Second, based on the architecture of the blockchain, encrypted multi-hop routing pathways with end-to-end coverage are being established. By reducing end-to-end latency, time consumption, packet loss rate, and energy usage while increasing throughput, our recommended model's simulation results reveal good results and security gains.

Impact of Jellyfish attack on routing protocols in TCP-based MANETs

Mobile ad-hoc networks (MANETs) are self-organized infrastructure-less network of mobile wireless devices that could be deployed for communication. Due to the insecure wireless communication medium, multi-hop routing communication process, and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as Jellyfish attacks. A Jellyfish node targets TCP-based MANET and exploits its working mechanism to degrade the communication performance. This attack is hard to detect since it is a TCP protocol compliant methodology.In this paper, we evaluate the performance of the Ad hoc on-demand vector (AODV), Dynamic source routing (DSR), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols under the Jellyfish delay variance attacks for TCP-based MANETs. Further, the TAHOE, RENO, and SACK variants of TCP protocol are considered for comparison. These routing protocols are simulated using the OPNET simulator to compare their performance, using specific performance metrics on the network. The experimental results show that the AODV protocol performs better than the DSR, TORA, OLSR, and GRP protocols under the jellyfish delay variance attack. Further, the SACK TCP variant performs better than the other TCP variants under the Jellyfish delay variance attack.

Dynamic multi-hop multipath RMSA and traffic grooming in OFDM-based sliceable elastic optical networks

In elastic optical networks (EON), routing, modulation selection, and spectrum assignment (RMSA) is crucial in provisioning connection requests. Multipath RMSA offers a number of benefits including provisioning of ultra-high bandwidth demands and better utilization of fragmented spectrum resource. By Combining with traffic grooming, multipath RMSA and traffic grooming is able to provide better utilization of network resource in provisioning connection requests. Adding multi-hop routing mechanism to multipath RMSA and traffic grooming increases the flexibility for selecting paths resulting in higher probability of successfully finding routing paths for connection requests. Dynamic multipath RMSA problem in EON has been investigated extensively in the literature. Dynamic multi-hop multipath RMSA and traffic grooming problem in EON is far from been well studied. This paper proposes an algorithm for the dynamic multi-hop multipath RMSA and traffic grooming problem in OFDM-based elastic optical networks with sliceable bandwidth-variable transponders. Performance of the proposed algorithm is studied via simulation. Our simulation results show that the proposed algorithm yields lower bandwidth blocking ratio than an existing algorithm.

Cross Layer based Energy Aware and Packet Scheduling Algorithm for Wireless Multimedia Sensor Network

Video transmission using sensor networks plays a most significant role in industrial and surveillance applications. Multimedia transmission is also a challenging task in case of guaranteeing quality of service in conditions like limited bandwidth, high congestion, multi-hop routing, etc. Cross layer approach is carried out to handle multimedia transmission over sensor networks for improving network adaptivity. Cross layer based energy aware and packet scheduling algorithm is proposed here to reduce congestion ratio and to improve link quality between the routing nodes. Link quality estimation among nodes is done using Semi-Markov process. Node congestion rate is determined for identifying node’s data channel rate. Packet scheduling process determines the highly prioritized packets by using queue scheduler component thereby the active nodes are selected through link quality process and the packets are transmitted to sink based on prioritize level. Simulation analysis is carried out and the efficiency of the proposed mechanism is proved to be better while comparing with the conventional schemes.

Energy efficient and multi-hop routing for constrained wireless sensor networks

Wireless sensor network (WSN) technique has advanced in several applications, however, the environment has significant energy and security challenges. Therefore, this research proposes a Multi-Hop, Trivial, as well as Protected Routing Solution for Constrained Wireless Sensor Networks. The Chaotic Particle-swarm Krill Herd (CPKH) method, which includes chaotic theory with accelerated PSO (APSO) as a mutation operator into the krill herd method, is used to first choose the energy-efficient cluster heads. Then, to select the optimal path this research proposed a novel Self-Adaptive Step Glow Worm Swarm Optimization (SASGWS) Algorithm. Following that, the Hamming Residue Technique (HRT) is utilized to counteract the malicious attacks in the WSN. The proposed technology, which could result in increased power efficiency as well as high bandwidth, analyses system status on demand as well as dynamically identifies system hazards.

An Efficient Mobile Gateway Selection and Discovery Based-Routing Protocol in Heterogeneous LTE-VANET Networks

Coupling cellular communication networks with vehicular ad hoc networks (VANET) can be a very interesting way out for providing Internet access to vehicles in the road. However, due to the several specific characteristics of VANETs, making an efficient multi-hop routing from vehicular sources to the Internet gateways through Long Term Evolution (LTE) technology is still challenging. In this paper, an Internet mobile gateway selection scheme is proposed to elect more potential vehicles to behave as gateways to Internet in VANETs. Therefore, the discovery and the selection of route to those mobiles gateways is carried out via an efficient multiple metrics-based relay selection mechanism. The objective is to select the more reliable route to the mobile gateways, by reducing the communication overhead and performing seamless handover. The proposed protocol is compared with one recent protocol based on packet delivery ratio, average end-to-end delay and overhead. The results show that the proposed protocol ameliorates significantly the network performance in the contrast of the other protocol.

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system's lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively.