Routing In Networks Research Articles

Energy aware multiobjective levy flight artificial rabbits optimization based clustering and routing for mobile wireless sensor networks

Energy aware multiobjective levy flight artificial rabbits optimization based clustering and routing for mobile wireless sensor networks

Chaotic ant colony algorithm to control congestion and enhance opportunistic routing in multimedia network

Chaotic ant colony algorithm to control congestion and enhance opportunistic routing in multimedia network

Exploiting Queue Information for Scalable Delay-Constrained Routing in Deterministic Networks

Exploiting Queue Information for Scalable Delay-Constrained Routing in Deterministic Networks

An Adaptive Reinforcement Learning-Based Mobility-Aware Routing for Heterogeneous Wireless Body Area Networks

An Adaptive Reinforcement Learning-Based Mobility-Aware Routing for Heterogeneous Wireless Body Area Networks

Multi-Agent Reinforcement Learning-Based Joint Caching and Routing in Heterogeneous Networks

Multi-Agent Reinforcement Learning-Based Joint Caching and Routing in Heterogeneous Networks

Enhancing Black Hole Attack Detection in VANETs: A Hybrid Approach Integrating DBSCAN Clustering with Decision Trees

Ensuring the security of communication is crucial in Vehicular Ad Hoc Networks (VANETs) to protect the integrity of information sharing among cars. To implement VANET communication as an answer for the different uses, secure communication is necessary. The unreliability of VANET environments is caused by message delays or tampering in VANET applications. Finding the sweet spot between VANET security and performance and dependability is the primary goal. This project’s overarching goal is to fortify VANETs against Blackhole Routing Attacks and, by identifying and blocking harmful nodes, to mitigate the blackhole impact. This paper proposes a robust hybrid approach for the detection of black hole attacks in VANETs, leveraging the synergy between DBSCAN (Density-Based Spatial Clustering of Applications with Noise) clustering and Decision Trees. DBSCAN, a density-based clustering algorithm, is employed to identify spatial clusters of vehicles, while Decision Trees are utilized to discern normal communication patterns from malicious ones within these clusters. The integration of these two techniques enhances the accuracy and efficiency of black hole attack detection in the dynamic and resource-constrained VANET environment. Experimental results demonstrate the effectiveness of the proposed hybrid approach, providing a promising solution for bolstering the security of VANETs against emerging threats. Here in result 73.89% improvement is received in Packet Drop Rate using DBSCAN, also minor improvement over Throughput and Average end to end delay and major improvement in terms of Network Routing Load.

Energy Optimization Approach in Wireless Sensor Network

In recent years, the importance of routing protocols in wireless sensor networks and the Internet of Things has been demonstrated by the numerous studies that have been presented in this area. because it is crucial to the network's functionality and effectiveness. Among routing's main goals are lowering latency, enhancing reliability, and averting network collisions. Additionally, it can be claimed that the type of network routing affects service quality, network longevity, and network traffic load control. Thus, in order to lower routing error and boost network performance and efficiency, the firefly is employed in this study to identify the best information transmission path within the network. It is also employed to reduce energy consumption. Taking into account the ability of evolutionary algorithms to optimize specified objective functions, we attempted to lower the network's energy consumption. The network can enhance the number of sending packets with the beginning energy of 3 joules from 1480 rounds to 1798 rounds, based on the proposed algorithm's results. Additionally, by contrasting the approaches described in the same article, it was discovered that the suggested approach can send roughly 40.11% more packets than the RM-LB algorithm and 1.9573% more than the OMS-LB technique. Additionally, it was discovered that by raising the starting energy to 150 joules, the suggested technique outperformed the other two algorithms by 51.23% and 45.17%, respectively, and was able to lengthen the longevity. This was in comparison to the RM-LB method and the OMS-LB method.

IOS-based mobile application for network performance analysis

In today's world, when technology is developing faster and faster, many people face network malfunctions and threats. Ensuring the security and performance of your own network is a critical task for many IT professionals and ordinary users. There are many tools and ways to monitor, analyse and secure your network, but a mobile app is an extremely convenient option. A mobile application that combines several network functions at once saves time and is always at hand. Networking tools in a smartphone can replace many different desktop applications and websites (web APIs), provide command line tools, etc. The iOS operating system has high security standards and its ecosystem is quite closed. This protects users from a lot of malware and makes the device extremely resistant to hacking. However, it also imposes some restrictions on the network and system for the average user. That's why iOS apps that include a variety of networking tools are a really useful tool for users. To keep the network in an efficient and secure state, iOS has specific ways to monitor and detect network problems: Wi-Fi analysers, checking network routes and interfaces, checking Internet speed, ping, traceroute, etc. The use of these technologies in the application under consideration will enable efficient analysis of network productivity.

Bionic Conventional Deep Learning Model Based Optimal Routing In Opportunistic IOT Networks

Bionic Conventional Deep Learning Model Based Optimal Routing In Opportunistic IOT Networks

Hybrid optimization-based secured routing in mobile ad-hoc network

Mobile Ad hoc Networks (MANETs) pose significant routing challenges due to their decentralized and dynamic nature. Node mobility results in frequent changes in network topology, leading to unsFIG connectivity and link quality. Traditional RPs designed for static networks are inadequate for MANETs. To deal with these issues, a secure routing approach is proposed using the Red Panda-Lyrebrid Optimization (RePLO) algorithm, which combines the advantages of the Red Panda Optimization (RPO) and Lyrebird Optimization Algorithm (LOA) algorithms. The proposed approach consists of five steps: (i) configuring the system model, (ii) developing the energy model, (iii) creating the mobility model, (iv) selecting cluster heads using the RePLO algorithm, and (v) routing using the RePLO algorithm. The RePLO algorithm optimizes cluster head selection and routing while considering specific constraints such as delay, distance, energy, & security for Cluster Head (CH) selection, and link quality and enhanced trust for routing optimization. The effectiveness of the proposed approach is evaluated using various metrics to demonstrate its efficiency in MANET routing. By integrating multiple optimization techniques and considering critical constraints, the RePLO algorithm offers a systematic and secure solution for MANET routing. The evaluation results confirm the efficacy of the proposed approach in improving network performance, reliability, and security. Overall, the RePLO algorithm presents a promising approach to tackle the routing issues inherent in MANETs, paving the way for more robust and efficient communication in mobile ad hoc networks.

An efficient optimization approach with mobility management for enhanced QoS and secure communication in flying adhoc networks

In biomedical Applications, Network plays a vital role to transmit the health-related information from patient to doctors which helps to save the human lives. During the data transmission, there is the possibility of data loss, delayed delivery, malicious attack and that leads to huge loss in human lives. To overcome this issue, a new technique Smart & secure Flying Adhoc Networks (FANET) architecture was proposed for the Quality-of-Service (QoS) improvement in biomedical applications. This research work helps society to save human lives during any emergency. With the integration of optimization and clustering techniques, the design configuration of the proposed architecture includes mobility management and secure transmission. The first phase includes sensing the patient's information by using Arduino IDE hardware. The sensed data will be transmitted through different types of networks including mobile ad-hoc networks, vehicular ad-hoc networks and flying ad-hoc networks. The routing protocol concentrates on clustering formation, mobility management, secure transmission and optimization. When compared to other type of networks, the proposed Smart & secure Flying Adhoc Networks (FANET) improves the network performance. The quality-of-service was achieved using the parameters such as network throughput, latency, delivery rate, routing overhead and control overhead.

Implementation of optimal routing in heterogeneous wireless sensor network with multi‐channel Media Access Control protocol using Enhanced Henry Gas Solubility Optimizer

SummaryThe majority of wireless sensor network (WSN) systems include multiple data traffic with different service requirements. Small batteries are used to supply energy to the sensor nodes. This research work explores a new optimal hybrid MAC protocol for heterogeneous WSN to carry out efficient routing. The major intention of the designed protocol is the incorporation of features of both IEEE 802.15.4 and Low‐Energy Adaptive Clustering Hierarchy (LEACH) to solve the challenges. The energy‐saving circuit is adopted by predetermining the cluster heads (CHs), whereas the usual nodes are powered by a battery. Thus, it is suggested to extend the lifespan of network operation, where the designed hybrid protocol is intended to transfer the essential activities to the elected cluster heads when reducing the activity of the nodes. Here, a new optimizer known as the Enhanced Henry Gas Solubility Optimization (EHGSO) algorithm is suggested for selecting the cluster heads and also for promoting the IEEE 802.15.4 protocol. This protocol is assisted to ensure performance regarding self‐healing, scalability, self‐reconfigurability, and energy efficiency. Thus, the performance evaluation is conducted in terms of various performance measures like throughput and energy consumption over the Adaptive Leach Protocol and multi‐channel MAC protocol with IEEE 802.15.4.

Attentional Information Routing in The Human Brain.

Brain-wide communication supports behaviors that require coordination between sensory and associative regions. However, how large-scale brain networks route sensory information at fast timescales to guide upcoming actions remains unclear. Using spiking neural networks and human intracranial electrophysiology during spatial attention tasks, where participants detected a target at cued locations, we show that high-frequency activity bursts (HFAb) serve as information-carrying events, facilitating fast and long-range communications. HFAbs emerged as bouts of neural population spiking and were coordinated brain-wide through low-frequency rhythms. At the network-level, HFAb coordination identified distinct cue- and target-activated subnetworks. HFAbs following the cue onset in cue-subnetworks predicted successful target detection and preceded the information in target-subnetworks following target onset. Our findings suggest HFAbs as a neural mechanism for fast brain-wide information routing that supports attentional performance.

Energy and throughput aware adequate routing for wireless sensor networks using integrated game theory method

A Wireless Sensor Network (WSN) is usually made up of a large number of discrete sensor nodes, each of which requires restricted resources, including memory, computing power, and energy. To extend the network lifetime, these limited resources must be used effectively. In WSN, clustering constitutes one of the best methods for optimizing network longevity and energy conservation. In this work, we proposed a novel Energy and Throughput Aware Adaptive Routing (ETAAR) algorithm based on Cooperative Game Theory (CGT). To achieve the energy efficient and improved data rate routing in WSN, we are applied two game theories of CGT and coalition game. The main part of this routing mechanism is cluster head selection and clustering the nodes to perform energy efficient and throughput effective communication between the nodes. In first stage, CGT based utility function which adopts both energy and throughput is utilized to handpick the CH nodes. In the second stage, along with the energy and throughput, average end-to-end delay is considered for the adaptive time slot transmission to avoid collision in the coalition game approach. MATLAB tool is used for simulation. The simulation results shows that the proposed ETAAR protocol is outperforms than earlier works of routing in terms of residual energy, PDR, energy due ratio, average end-to-end delay, dead nodes. The network lifetime of 48% extension, energy saving of 60% and 52.5% of delay shortage attained in ETAAR.

Routing algorithm for sparse unstructured P2P networks using honey bee behavior

SummaryUnstructured peer‐to‐peer (P2P) networks pose unique challenges for efficient and scalable routing. In this study, we introduce a novel routing algorithm inspired by the foraging behavior of honey bees named Honey Bee Optimization in P2P Networks (HBO_P2P) to address the inherent limitations of routing in unstructured P2P networks, focusing on improving packet delivery, minimizing hop count, reducing message overhead, and optimizing overall throughput. To evaluate the performance of our proposed algorithm, we conducted comprehensive experiments comparing it with existing algorithms commonly used in P2P networks, namely, particle swarm optimization (PSO), genetic algorithm (GA), and ant colony optimization (ACO). After the simulation, we got the results as follows: Our algorithm outperforms ACO, GA, and PSO by exhibiting the highest number of data hops indicating potential efficiency in route optimization. Routing overhead is also minimal as compared to ACO, GA, and PSO. The average data packet delay is also low in our algorithm as compared to ACO, GA, and PSO. HBO_P2P achieves the highest throughput, nearly reaching 100 Mbps. While ACO and GA exhibit similar throughput of around 80 Mbps, and PSO has the lowest throughput, approximately 60 Mbps.

Energy-Efficient Algorithm for Data Path Selection in High-Density Wireless Sensor Networks

Relevance. Increasing the number of sensor devices per unit area consequently reduces the physical distance between the devices in the sensor network. Such networks are usually deployed over a large area and the sensor device that wants to transmit a data packet is located far away from the base station. In such a case, the source device is challenged to choose a transmission path that consumes the least amount of energy resources and satisfies the delivery time requirements. The objective of this study is to develop and validate the effectiveness of an empirical algorithm for selecting a transmission path that reduces the energy consumption of high-density wireless sensor networks. Methods of system analysis, analytical modeling, geometry and probability theories are used. Solution. It is assumed that the sensor network is deployed in a limited area and is a set of devices that are connected to each other informationally and energetically. When building data transmission routes, any sensor devices can be used as repeaters. At the same time, the increase in the number of repeaters leads to an increase in the time of data delivery. Novelty. It is assumed that the sensor network is deployed in a limited area and is a set of devices that are connected to each other informationally and energetically. Any sensor devices may be used as repeaters when constructing data transmission routes.Significance (theoretical). Dependences of power consumption level on various system parameters affecting the processes of functioning of high-density wireless sensor networks have been obtained. Significance (practical). The proposed empirical algorithm for selecting a rational data transmission route in a wireless sensor network allows us to determine, among all alternatives, the route to the coordinator that requires the least power. The effectiveness of the proposed empirical power-saving algorithm is confirmed by simulation modeling.

Model and Methods of Traffic Routing in a Communication Network Using UAVs

Relevance. The development of 5G networks and subsequent generations is accompanied by the development of new services, in particular, virtual, augmented reality services, as well as telepresence, as well as radio access networks. In particular, there is an increase in operating frequencies, which poses additional challenges for organizing a network that can meet the requirements for the quality of traffic service from new services and ensure the availability of communication to users. These problems can be solved by various methods of placing access points, including using UAVs. This approach ensures the efficiency of construction and flexibility of the access network structure, but also requires the use of methods for placing access points in relation to users and other elements of the communication network. Problem statement: development of methods for placing routers in a UAV swarm and selecting traffic routes when organizing an access network, in order to improve the efficiency of the communication network. Purpose of the work: improving the efficiency of building an access network using UAVs through the development of clustering methods and distributing routers in a UAV swarm. Methods. The studies were carried out using the provisions of information theory, mathematical optimization methods, graph theory methods and clustering methods. The numerical results were obtained using the numerical simulation method in Python. Result. The developed model and methods allow for the distribution of network routers (access points) located on UAVs taking into account the quality of service and ensuring the construction of a connected mesh network and its connection with the mobile network, which can be used in both modern and future communication networks. Novelty: a modeling and methodological apparatus has been developed that allows for increasing the efficiency of building wireless access networks using UAVs, in particular, allowing for selecting the placement positions of routers in a UAV swarm and the logical structure of the network. The developed modeling and methodological apparatus solves the problem of traffic routing taking into account the quality of its service. Practical significance: the proposed model and methods can be used to organize service in 5G networks and subsequent generations. In particular, they allow for ensuring the availability of communication and the efficiency of network organization in cases of insufficient coverage, as well as in cases of failure of individual network elements. The ability to unload traffic to a local network allows for improving the quality of traffic service in the operator's network.

An Analysis of Routing Protocol in Mobile Adhoc Networks and its Applications

Each hub in a mobile ad-hoc network (MANET) sends parcels bound for different hubs in the network by means of remote (radio transmission) transmission on a wilful premise, making it a self-beginning, powerful network made up of mobile hubs. Multi-bounce transferring is the essential inspiration for the advancement of ad hoc networking. Remote Ad hoc networks, otherwise called foundation less networks, can be set up rapidly and effectively using radio waves as the network's transmission channel. There is no principal server or referee in an ad hoc network. Every hub in a MANET is fit for playing out its own networking errands, for example, routing and bundle sending, in a decentralized and independent style. Uses of routing protocols like Ad hoc On-request Distance Routing Protocol (AODV), Dynamic Source Routing (DSR), Transiently Requested Routing Calculation (TORA), and Enhanced Connection State Routing (OLSR) are fascinating in light of the fact that routing is the focal issue in MANETs. These routing protocols are simulated using OPNET, and their effectiveness is investigated using various metrics. With the use of metrics, the most efficient channel for data transfer can be determined. The results demonstrate the viability of AODV and TORA for topology-changing in large-scale networks using a variety of criteria.

Collaborative last-hop scheduling strategy for large-scale LEO constellation routing

The transmission of data packets from satellites to Earth Stations (ESs) is the last hop of satellite network routing. As the final stage of packet transmission, the use of different scheduling strategies directly affects the throughput of the satellite network. Traditionally, researchers have attempted to enhance network performance by investigating inter-satellite routing protocols or inter-satellite data offloading strategies. However, these approaches have failed to address scheduling issues in the last hop of large-scale Low Earth Orbit (LEO) constellations. In this paper, we present the first Cooperative Last-Hop Scheduling (CLHS) strategy for routing in large-scale LEO constellations based on a bidirectional communication domain. In this strategy, we first utilize the bidirectional communication domain to determine the communication ranges of satellites and ESs. Subsequently, an information flow is established to interact with ESs and satellites. The ESs receive and reconstruct the Information Matrix (IM) from the information flow. Moreover, we propose the Maximum Decision Value Priority (MDVP) algorithm, which takes the reconstructed IM as input and computes the scheduling commands for satellites within the communication range of the ESs. To address the issue of multiple ESs simultaneously scheduling the same satellite, we introduce the Collision Avoidance Algorithm (CAA). Finally, to enhance the data packet transmission efficiency of the scheduled satellites, we propose the Weighted First-In-First-Out (WFIFO) algorithm, which is specifically designed for satellite packet dequeuing. We validate the CLHS through simulations on two satellite constellations: the first-generation Starlink constellation with 4409 satellites and the GW-2 constellation with 6912 satellites. The results show that CLHS can achieve better network throughput than traditional strategies. CLHS provides a novel method of scheduling the last hop in large-scale satellite constellations.

The macroscale routing mechanism of structural brain connectivity related to body mass index.

Understanding the brain's mechanisms in individuals with obesity is important for managing body weight. Prior neuroimaging studies extensively investigated alterations in brain structure and function related to body mass index (BMI). However, how the network communication among the large-scale brain networks differs across BMI is underinvestigated. This study used diffusion magnetic resonance imaging of 290 young adults to identify links between BMI and brain network mechanisms. Navigation efficiency, a measure of network routing, was calculated from the structural connectivity computed using diffusion tractography. The sensory and frontoparietal networks indicated positive associations between navigation efficiency and BMI. The neurotransmitter association analysis identified that serotonergic and dopaminergic receptors, as well as opioid and norepinephrine systems, were related to BMI-related alterations in navigation efficiency. The transcriptomic analysis found that genes associated with network routing across BMI overlapped with genes enriched in excitatory and inhibitory neurons, specifically, gene enrichments related to synaptic transmission and neuron projection. Our findings suggest a valuable insight into understanding BMI-related alterations in brain network routing mechanisms and the potential underlying cellular biology, which might be used as a foundation for BMI-based weight management.