Search

The routing protocol for Vehicular Ad Hoc Networks (VANETs) uses hop-count as a routing metric to determine the shortest route from source to destination. The presence of unstable links in the selected route may cause packet failures, resulting in an increase in packet retransmissions, causing network congestion, increasing total end-to-end delay, and reducing throughput. Thus, route selection based on hop count may not always be optimal in terms of route link quality. In Software-Defined Vehicular Networks (SDVN), the global view of link-state information for the vehicular networks is created at the controller; thus, a better route can be computed. Our study proposes an SDVN routing technique that considers link quality while determining the route. Our proposed framework examines the link quality using two metrics: Expected Transmission Count (ETX) and Expected Transmission Time (ETT), and this information is used by the controller to compute the flow rule. The routing performance of the proposed scheme is compared to traditional VANETs and other existing works with the help of network simulations using the NS-3 simulator. The obtained simulation results for our proposed scheme outperform in terms of performance metrics such as packet delivery ratio, average throughput, and end-to-end delay. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) has been exploited in numerous regions which can be hardly accessed by humans. However, it is essential to convey the information accumulated by the sensing devices or nodes to the Base Station (BS) for further processing. Multipath routing protocols are found to address these challenges and provide reliable communication. This paper aims to find an optimal path to the gateway with minimum energy consumption and reduced error rate while meeting the end-to-end delay requirements. In this research, an effective multipath routing based on energy prediction and hybrid optimization is developed. Here, a Deep Q-Network (DQN) is applied to predict the energy, and the process is augmented by the usage of a proposed Tangent Search Remora Optimization (TSRO) algorithm. Further, the multipath routing is executed using the TSRO algorithm, considering a fitness function formulated using various factors, like residual energy, distance, throughput, reliability, trust factors, predicted energy, Link Life Time (LLT), delay, and traffic intensity. The devised TSRO-routing is scrutinized for its competence based on trust, throughput, energy, distance, and delay and has achieved superior values of energy of 0.402 J, throughput at 25.056Mbps, trust at 84.975, and minimal distance of 29.964 m, and delay of 0.750 ms. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has gained popularity and is widely used in modern society. The growth in the sizes of IoT networks with more internet-connected devices has led to concerns regarding privacy and security. In particular, related to the routing protocol for low-power and lossy networks (RPL), which lacks robust security functions, many IoT devices in RPL networks are resource-constrained, with limited computing power, bandwidth, memory, and battery life. This causes them to face various vulnerabilities and potential attacks, such as DIO neighbor suppression attacks. This type of attack specifically targets neighboring nodes through DIO messages and poses a significant security threat to RPL-based IoT networks. Recent studies have proposed methods for detecting and mitigating this attack; however, they produce high false-positive and false-negative rates in detection tasks and cannot fully protect RPL networks against this attack type. In this paper, we propose a novel fuzzy logic-based intrusion detection scheme to secure the RPL protocol (FLSec-RPL) to protect against this attack. Our method is built of three key phases consecutively: (1) it tracks attack activity variables to determine potential malicious behaviors; (2) it performs fuzzy logic-based intrusion detection to identify malicious neighbor nodes; and (3) it provides a detection validation and blocking mechanism to ensure that both malicious and suspected malicious nodes are accurately detected and blocked. To evaluate the effectiveness of our method, we conduct comprehensive experiments across diverse scenarios, including Static-RPL and Mobile-RPL networks. We compare the performance of our proposed method with that of the state-of-the-art methods. The results demonstrate that our method outperforms existing methods in terms of the detection accuracy, F1 score, power consumption, end-to-end delay, and packet delivery ratio metrics. [ABSTRACT FROM AUTHOR]

With technological advancements in networking and wireless communication, the flying ad hoc network has emerged as a cost-effective relay network. Networks of unmanned aerial vehicles (UAVs) can be cooperatively organized as an ad hoc network for effectively accomplishing complex tasks. Such a UAV network is deployed as a relay network that forwards and exchanges accurate and reliable end-to-end in-formation. However, the design of routing protocols is rendered difficult by flying constraints and extreme topology changes over a short time period. The performance of the routing protocols in such networks is considerably affected by high-speed nodes and extreme topology changes. Evaluating the routing protocol in a UAV network gives insight regarding the performance of the entire network. This paper evaluates, analyzes, and compares the performances of three routing protocols: Ad hoc On-demand Distance Vector (AODV), Optimized Link State Routing (OLSR), and Destination-Sequenced Distance-Vector (DSDV). In most of the simulated cases, the AODV outperformed the OLSR and DSDV. The number of nodes, i.e., the network size, largely affected the throughput, packet delivery ratio (PDR), and end-to-end delay (E2E) of the network. However, the OLSR improved the performance of the average E2E; therefore, it is suitable for delay-sensitive applications. However, AODV outperformed the other protocols in terms of throughput and PDR because it reacts to topology changes. DSDV delivered the poorest PDR and throughput. [ABSTRACT FROM AUTHOR]

Machine failures during the manufacturing process can have severe consequences, causing extensive downtime and financial losses. Hence, predictive maintenance (PdM) plays a crucial role within the Industrial Internet of Things (IIoT) by estimating the remaining useful life (RUL) of machines so that proactive maintenance measures can be taken to mitigate potential failures and minimize disruptions. RUL estimation is enabled by gathering and processing the data sensed by sensors mounted on and around the machines at the central server (base station or cloud) after analyzing the failure patterns. However, this approach imposes a significant load on network bandwidth and leads to poor response time for the monitoring system because a large volume of sensed data has to be transmitted to the central server for processing. Moreover, due to the singularity of the computing resource, many problems, such as inefficient resource utilization, frequent offloading, single-point failure, etc., have become major challenges. To address these issues, this article proposes an edge computing-enabled predictive maintenance framework called "Collaborative Predictive Maintenance Framework" (CollabRULe), which first identifies the optimal locations for edge server placement in the deployment region by considering the QoS parameters, such as energy, delay and connectivity. Then, it uses federated learning for predictive maintenance by estimating the RUL of the machines. Simulation results show that the proposed mechanism effectively minimizes the overall network energy consumption and end-to-end delay by ≈ 60 % and ≈ 35 % , respectively, as compared to state-of-the-art approaches. Furthermore, it shows significant improvement in the accuracy of RUL prediction as compared to its counterparts. [ABSTRACT FROM AUTHOR]

Wireless communication offers significant advantages in terms of flexibility, coverage and maintenance compared to wired solutions and is being actively deployed in the industry. IEEE 802.15.4 standardizes the Physical and the Medium Access Control (MAC) layer for Low Power and Lossy Networks (LLNs) and features Timeslotted Channel Hopping (TSCH) for reliable, low-latency communication with scheduling capabilities. Multiple scheduling schemes were proposed to address Quality of Service (QoS) in challenging scenarios. However, most of them are evaluated through simulations and experiments, which are often time-consuming and may be difficult to reproduce. Analytical modeling of TSCH performance is lacking, as only one-hop communication with simplified traffic patterns is considered in state-of-the-art. This work proposes a new framework based on queuing theory and combinatorics to evaluate end-to-end delays in multihop TSCH networks of arbitrary topology, traffic and link conditions. The framework is validated in simulations using OMNeT++ and shows below 6% root-mean-square error (RMSE), providing quick and reliable latency estimation tool to support decision-making and enable formalized comparison of existing scheduling solutions. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSN), the multifunctional low-power sensor nodes are linked to base stations and are highly responsible for sensing various information. However, maintaining the network's lifespan is a major issue because of limited battery capacity and node failures. Thus, the proposed study introduced a new Scalable Trust-based Energy Efficient Routing Algorithm (STEERA) with Adaptive Grasshopper Algorithm (AGA) to enhance the network lifespan. At first, the trust values (Tv) are generated for each node to eliminate the malicious node with the help of penalty factor and volatilization. To make efficient routing process, the nodes are formed into cluster groups. A suitable cluster head is selected for each cluster to mitigate the energy consumption problem through the AGA approach by optimizing the parameters like Tv, distance and residual energy. Finally, the data packets are effectively transmitted through a multi-hop routing process by selecting an appropriate path and satisfying certain parameters through Fire Hawks Optimization (FHO). To simulate the proposed techniques, NS2 software is employed, and the performance is measured over various metrics like energy consumption, residual energy, the lifespan of a network, packet loss ratio and average end-to-end delay. The performance analysis shows that the proposed protocol design has obtained higher results than conventional routing protocols. [ABSTRACT FROM AUTHOR]

Vehicular fog computing (VFC) is an advanced standard that utilizes one or more cooperative end-users or neighboring edge devices for communication, storage, configuration, control, management, and measurement operations. This paper studies the reliability of VFC which is explored as a function of its reliable hardware. The architecture of VFC is a multi-layered architecture, therefore composite modeling technique is adopted for the reliability study. Different models are constructed for each layer using reliability block diagrams, and then the models are integrated to obtain the reliability of the entire VFC network. Further, this paper analyses the performance of VFC and evaluates various measures such as end-to-end delay, throughput and utilization. A queueing network model depicting the message dissemination scheme in the network is proposed to evaluate the performance measures. Numerical results are also obtained to show the efficacy of the proposed models. [ABSTRACT FROM AUTHOR]

In Vehicular Ad Hoc Networks, reliable information transmission relies on an effective routing strategy. Most existing reinforcement learning-based routing methods are ineffective in dynamic network environments and cannot prevent inefficient network routing. Efficient network routing can be controlled by network traffic management, so this paper proposes an intelligent routing strategy based on Deep Reinforcement Learning to enhance routing performance. By integrating intersection forwarding and traffic awareness capabilities, this paper addresses the problem of local optimality and utilizes the Deep Q Network to make intersection forwarding decisions. The state space of this strategy consists of intersection nodes, road information between intersections, and forwarding packet information. When a vehicle node carrying a packet approaches an intersection based on the state space, the intersection node uses a neural network to select the optimal next-hop relay intersection from past learning experiences. It generates appropriate vehicle routing decisions based on information from the current and candidate relay intersections. Finally, we use the real taxi trajectory data of Beijing City to conduct extensive simulation experiments. Simulation results and analysis demonstrate that the proposed strategy outperforms related research regarding higher average packet delivery ratio, shorter average end-to-end delay, and lower average overhead ratio in dense and sparse traffic periods under real road environments. Consequently, this strategy provides efficient and reliable message transmission services for Vehicular Ad Hoc Networks. [ABSTRACT FROM AUTHOR]

Target tracking is a crucial application in wireless sensor networks. Current algorithms for target tracking primarily involve node scheduling based on trajectory prediction. However, when the target is lost due to prediction errors, a target recovery mechanism initiates a search operation, potentially activating numerous nodes and leading to increased energy consumption. Furthermore, the recovery process may result in data loss. To address these challenges, we propose a fault-tolerant clustering approach using the Cat Optimization Algorithm to minimize the probability of target loss. To assess the effectiveness of our approach, simulations were conducted in OPNET using the NODIC, DCRRP, BFOABMS, and AFSRP protocols. The results illustrate that our method excels over existing approaches across various metrics. Specifically, compared to the well-known NODIC method, our approach reduces end-to-end delay by 84.93%, media access delay by 15.08%, increases throughput rate by 3.84%, lowers energy consumption by 4.49%, improves signal-to-noise ratio by 9.99%, and enhances delivery rate of data to the sink by 1.02%. Additionally, compared to the widely recognized DCRRP method, our method improves media access delay by 2.90%, throughput rate by 2.02%, reduces energy consumption by 0.30%, enhances signal-to-noise ratio by 7.36%, and improves the delivery rate of data to the sink by 0.41%. Moreover, our proposed method decreases the end-to-end delay by 10.28% compared to DCRRP. Also, the superior performance of the proposed method in terms of end-to-end delay is 1.52%, media access delay by 8.73%, throughput rate by 1.97%, energy consumption by 0.33%, signal-to-noise ratio by 9.25%, and delivery rate of successfully sending data to the sink is 0.76% higher than the well-known AFSRP method.Additionally, compared to the widely recognized BFOABMS method, our method improves media access delay by 9.56% and enhances the delivery rate of data to the sink by 0.70%. However, in our proposed method, the energy consumption criterion has increased by 13.63%, the end-to-end delay criterion by 50.78%, the signal-to-noise ratio decreased by 15.66%, and the throughput ratio decreased by 26.88% compared to BFOABMS. [ABSTRACT FROM AUTHOR]

Vehicular fog computing (VFC) is an innovative computing paradigm with an exceptional ability to improve the vehicles' capacity to manage computation-intensive applications with both low latency and energy consumption. Moreover, more and more Artificial Intelligence (AI) technologies are applied in task offloading on the Internet of Vehicles (IoV). Focusing on the problems of computing latency and energy consumption, in this paper, we propose an AI-based Vehicle-to-Everything (V2X) model for tasks and resource offloading model for an IoV network, which ensures reliable low-latency communication, efficient task offloading in the IoV network by using a Software-Defined Vehicular-based FC (SDV-F) architecture. To fit to time-critical data transmission task distribution, the proposed model reduces unnecessary task allocation at the fog computing layer by proposing an AI-based task-allocation algorithm in the IoV layer to implement the task allocation of each vehicle. By applying AI technologies such as reinforcement learning (RL), Markov decision process, and deep learning (DL), the proposed model intelligently makes decision on maximizing resource utilization at the fog layer and minimizing the average end-to-end delay of time-critical IoV applications. The experiment demonstrates the proposed model can efficiently distribute the fog layer tasks while minimizing the delay. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) offer a decentralized communication solution ideal for infrastructure-less environments like disaster relief zones. However, their inherent lack of central control and dynamic topology make them vulnerable to attacks. This paper examines the impact of various attacks on mobile nodes within two network types: randomly and uniformly distributed stationary networks. Four types of attacks are investigated: delay, dropping, sinkhole (alone), and a combined black hole attack (dropping + sinkhole). The effects of these attacks are compared using the packet delivery ratio, throughput, and end-to-end delay. The evaluation results show that all single attacks negatively impacted network performance, with the random network experiencing the most significant degradation. Interestingly, the combined black hole attack, while more disruptive than any single attack, affected the uniformly distributed network more severely than the random network. [ABSTRACT FROM AUTHOR]

Efficient and reliable data routing is critical in Advanced Metering Infrastructure (AMI) within Smart Grids, dictating the overall network performance and resilience. This paper introduces Q-RPL, a novel Q-learning-based Routing Protocol designed to enhance routing decisions in AMI deployments based on wireless mesh technologies. Q-RPL leverages the principles of Reinforcement Learning (RL) to dynamically select optimal next-hop forwarding candidates, adapting to changing network conditions. The protocol operates on top of the standard IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), integrating it with intelligent decision-making capabilities. Through extensive simulations carried out in real map scenarios, Q-RPL demonstrates a significant improvement in key performance metrics such as packet delivery ratio, end-to-end delay, and compliant factor compared to the standard RPL implementation and other benchmark algorithms found in the literature. The adaptability and robustness of Q-RPL mark a significant advancement in the evolution of routing protocols for Smart Grid AMI, promising enhanced efficiency and reliability for future intelligent energy systems. The findings of this study also underscore the potential of Reinforcement Learning to improve networking protocols. [ABSTRACT FROM AUTHOR]

In the framework of the space-air-ground-ocean integrated network, the underwater acoustic sensor network (UASN) plays a pivotal role. The design of media access control (MAC) protocols is essential for the UASN to ensure efficient and reliable data transmission. From the perspective of differentiated services in the UASN, a service-aware and scheduling-based hybrid MAC protocol, named the SSH-MAC protocol, is proposed in this paper. In the SSH-MAC protocol, the centralized scheduling strategy is adopted by sensor nodes with environmental monitoring service, and the distributed scheduling strategy is adopted by sensor nodes with target detection service. Considering the time-varying data generation rate of sensor nodes, the sink node will switch the scheduling mode of sensor nodes based on the specific control packet and adjust the resource allocation ratio between centralized scheduling and distributed scheduling. Simulation results show that the performance of the SSH-MAC protocol, in terms of utilization, end-to-end delay, packet delivery ratio, energy consumption, and payload efficiency, is good. [ABSTRACT FROM AUTHOR]

As a result of recent advancements in electronics technology, wireless sensor networks (WSNs) may now make use of a vast array of tiny sensors (WSN). WSN are viewed as problematic networks because of the environments in which they may operate and the technology they rely on. For instance, routing protocols need to be prepared for and capable of recovering from unexpected events like node failures and packet losses. The dynamic nature of these routing environments necessitates that every WSN routing protocol have mechanisms for adapting to new conditions. In many applications, security affects performance and energy efficiency. To provide such security services, we require resilient key management techniques. Security Power Aware Routing-Salp Swarm Optimization (SPAR-SSO) protocol uses a unique cryptosystem. SPAR-SSO uses connection quality estimation and power aware routing to reduce power consumption and delay while increasing packet delivery ratio. WSNs must conserve energy because the nodes are battery-powered. If the route with the greatest energy savings is constantly chosen for delivery, the nodes along this route will be overused and drained quickly, leading to network partitioning. In SPAR-SSO, an optimal path to the sink node is chosen. This technology is interesting because to its ease in enterprise and tractability in network transportation administration to deliver integrated services. It delivers a collision-free medium and minimizes entire energy expended in attainment the terminus, dropping energy each unit or packet. Moreover, Salp Swarm Optimization (SSO) is applied to optimize the results. The Packet Delivery Ratio (PDR) and End to End Delay is used as parameters to compare the performance of SPAR-SSO protocol. The results are compared with existing results and presented the success of the proposed method. Results show the proposed algorithm is suitable and compatibility with cyber-physical systems. [ABSTRACT FROM AUTHOR]

The emergence of the intelligent city, in the late 2000s, was a worldwide success that has invited itself to the national political agendas of several countries in world association of the major metropolises as well as in the multinational strategy. The success of this global phenomenon is indisputable; however, the smart city remains enigmatic, without precise definition and vague terms. The smart cities projects are characterized by the ability to interconnect urban systems between themselves, including transport system, electricity system, waste system, water system, gas system, etc. and to make each system develop itself; For instance, the field of urban and interurban transport has experienced a spectacular boom over the last few decades mainly with the appearance of vehicular ad hoc networks (VANETs) having promoted the concept of smarts cities mentioned by the birth of intelligent transport systems (ITS). The notion of routing is important and necessary for ITS in order to establish an efficient transmission process in VANETs. A large number of routing protocols exist in VANETs that are classified by different methods and according to determined criteria. This paper proposes a new geographic routing solution based on an intersection entitled A Geographic Routing Based on Local Traffic Density and Multi-hop Intersections in VANETs (GRBLTD-MI) that is more adapted in the context of smart cities. This new approach will discuss the selection of the next intersection when taking into consideration the connectivity of the multi-hop intersection with the use of vehicle's local traffic density, speed, distance and direction. Simulation comparison of GRBLTD-MI against some strong routing protocols has shown the superiority of our approach in terms of packet delivery ratio, end-to-end delay and packet overhead. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) can bolster road safety through the proactive dissemination of emergency messages (EMs) among vehicles, effectively reducing the occurrence of traffic-related accidents. It is difficult to transmit EMs quickly and reliably due to the high-speed mobility of VANET and the attenuation of the wireless signal. However, poor network design and high vehicle mobility are the two most difficult problems that affect VANET's network performance. The real-time traffic situation and network dependability will also be significantly impacted by route selection and message delivery. Many of the current works have undergone studies focused on forwarder selection and message transmission to address these problems. However, these earlier approaches, while effective in forwarder selection and routing, have overlooked the critical aspects of communication overhead and excessive energy consumption, resulting in transmission delays. To address the prevailing challenges, the proposed solutions use edge computing to process and analyze data locally from surrounding cars and infrastructure. EDGE-RSUs are positioned by the side of the road. In intelligent transportation systems, this lowers latency and enhances real-time decision-making by employing proficient forwarder selection techniques and optimizing the dissemination of EMs. In the context of 5G-enabled VANET, this paper introduces a novel routing protocol, namely, the supercluster-based urban multi-hop broadcast and best forwarder selection protocol (UMB-BFS). The improved twin delay deep deterministic policy gradient (IT3DPG) method is used to select the target region for emergency message distribution after route selection. Clustering is conducted using modified density peak clustering (MDPC). Improved firefly optimization (IFO) is used for optimal path selection. In this way, all emergency messages are quickly disseminated to multiple directions and also manage the traffic in VANET. Finally, we plotted graphs for the following metrics: throughput (3.9 kbps), end-to-end delay (70), coverage (90%), packet delivery ratio (98%), packet received (12.75 k), and transmission delay (57 ms). Our approach's performance is examined using numerical analysis, demonstrating that it performs better than the current methodologies across all measures. [ABSTRACT FROM AUTHOR]

Load balancing to alleviate network congestion remains a critical challenge in Vehicular Ad Hoc Networks (VANETs). During route and response scheduling, road side units (RSUs) risk being overloaded beyond their calculated capacity. Despite recent advancements like RSU-based load transfer, NP-Hard hierarchical geography routing, RSU-based medium access control (MAC) schemes, simplified clustering, and network activity control, a significant gap persists in employing a load-balancing server for effective traffic management. We propose a server-based network congestion handling mechanism (SBNC) in VANETs to bridge this gap. Our approach clusters RSUs within specified ranges and incorporates dedicated load balancing and network scheduler RSUs to manage route selection and request–response scheduling, thereby balancing RSU loads. We introduce three key algorithms: optimal placement of dedicated RSUs, a scheduling policy for packets/data/requests/responses, and a congestion control algorithm for load balancing. Using the VanetMobiSim library of Network Simulator-2 (NS-2), we evaluate our approach based on residual energy consumption, end-to-end delay, packet delivery ratio (PDR), and control packet overhead. Results indicate substantial improvements in load balancing through our proposed server-based approach. [ABSTRACT FROM AUTHOR]

The seamless integration of intelligent Internet of Things devices with conventional wireless sensor networks has revolutionized data communication for different applications, such as remote health monitoring, industrial monitoring, transportation, and smart agriculture. Efficient and reliable data routing is one of the major challenges in the Internet of Things network due to the heterogeneity of nodes. This paper presents a traffic-aware, cluster-based, and energy-efficient routing protocol that employs traffic-aware and cluster-based techniques to improve the data delivery in such networks. The proposed protocol divides the network into clusters where optimal cluster heads are selected among super and normal nodes based on their residual energies. The protocol considers multi-criteria attributes, i.e. energy, traffic load, and distance parameters to select the next hop for data delivery towards the base station. The performance of the proposed protocol is evaluated through the network simulator NS3.40. For different traffic rates, number of nodes, and different packet sizes, the proposed protocol outperformed LoRaWAN in terms of end-to-end packet delivery ratio, energy consumption, end-to-end delay, and network lifetime. For 100 nodes, the proposed protocol achieved a 13% improvement in packet delivery ratio, 10 ms improvement in delay, and 10 mJ improvement in average energy consumption over LoRaWAN. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is revolutionizing diverse sectors like business, healthcare, and the military, but its widespread adoption has also led to significant security challenges. IoT networks, in particular, face increasing vulnerabilities due to the rapid proliferation of connected devices within smart infrastructures. Wireless sensor networks (WSNs) comprise software, gateways, and small sensors that wirelessly transmit and receive data. WSNs consist of two types of nodes: generic nodes with sensing capabilities and gateway nodes that manage data routing. These sensor nodes operate under constraints of limited battery power, storage capacity, and processing capabilities, exposing them to various threats, including wormhole attacks. This study focuses on detecting wormhole attacks by analyzing the connectivity details of network nodes. Machine learning (ML) techniques are proposed as effective solutions to address these modern challenges in wormhole attack detection within sensor networks. The base station employs two ML models, a support vector machine (SVM) and a deep neural network (DNN), to classify traffic data and identify malicious nodes in the network. The effectiveness of these algorithms is validated using traffic generated by the NS3.37 simulator and tested against real-world scenarios. Evaluation metrics such as average recall, false positive rates, latency, end-to-end delay, response time, throughput, energy consumption, and CPU utilization are used to assess the performance of the proposed models. Results indicate that the proposed model outperforms existing methods in terms of efficacy and efficiency. [ABSTRACT FROM AUTHOR]

The immense growth of mobile networks leads to versatile applications and new demands. The improved concert, transferability, flexibility, and performance of innovative network services are applied in diversified fields. More unique networking concepts are incorporated into state-of-the-art mobile technologies to expand these dynamic features further. This paper presents a novel system architecture of slicing and pairing networks with intra-layer and inter-layer functionalities in 5th generation (5G) mobile networks. The radio access network layer slices and the core network layer slices are paired up using the network slicing pairing functionalities. The physical network elements of such network slices will be logically assigned entities called softwarization of the network. Such a novel system architecture called network sliced softwarization of 5G mobile networks (NSS-5G) has shown better performances in terms of end-to-end delay, total throughput, and resource utilization when compared to traditional mobile networks. Thus, effective resource management is achieved using NSS-5G. This study will pave the way for future softwarization of heterogeneous mobile applications. [ABSTRACT FROM AUTHOR]

Summary This paper proposes a new approach for optimizing traffic management in multiple access networks (MANETs) by utilizing the stream‐enabled routing (SER) algorithm. The SER algorithm is used to determine which routing path is the most time‐ and resource‐efficient. The proposed approach makes use of multipath routing in a manner that is consistent with the SER method. By combining the states of flows, queues, and links, a graph neural network (GNN)‐based model attempts to break the circular dependencies that are described by these functions. The simulation is setup with joint parameters consisting of residual energy, packet delivery rate (PDR), and end‐to‐end delay. The results of the experiments show that the proposed protocol provides a significant improvement in terms of network efficiency when compared to using some baseline protocols designed for MANETs. [ABSTRACT FROM AUTHOR]

Summary: Privacy and security present significant challenges in wireless sensor networks (WSNs). In order to enhance security, the sensor network is equipped with high throughput. While the importance of both source node (SN) and base station (BS) location privacy and security is acknowledged, recent research has predominantly focused on location privacy. Addressing this gap, the geometric zigzag bidirectional tree effectively tackles privacy and security threats at both the SN and BS locations. Future iterations of WSN are anticipated to integrate additional functionalities to meet diverse requirements in real‐world applications. The absence of robust security constraints leads to an unpredictable sensor network setup. This article aims to reduce energy consumption (EC) while simultaneously enhancing network security and connectivity. To address security challenges in WSN, we propose an optimized meta‐heuristic clustering‐based privacy key‐agreement routing technique. In the suggested system, a gateway‐based network is constructed to devise a key arrangement protocol that promotes privacy during communication. The proposed routing strategy involves forming clusters of sensor nodes (Sn), facilitating the efficient selection of cluster heads (CHs) that prioritize nodes with the least modification. This effectively addresses the EC problem. A comprehensive performance evaluation is conducted, considering improvements in energy efficiency, packet delivery ratio (PDR), throughput, end‐to‐end delay (E2 delay), and EC. [ABSTRACT FROM AUTHOR]

Cognitive Radio Networks (CRNs) block new arriving services and remove existing services to increase the spectrum efficiency. Particularly, Secondary Users (SUs) experience a decline in service deprivation in the arrival of Primary Users (PUs). To overcome this, a Spectrum and energy Efficiency in Cognitive Radio Networks using Dynamic Channel Reservation and Komodo Mlipir Optimization (SE-KMOA-CRN) is proposed. The proposed method splits reserved and non-reserved bands from the accessible spectrum. Numerous channels from the non-reserved band are dynamically assigned to the reserved band to support services that experience disruptions when functioning on non-reserved band. From the non-reserved band, a count of channels dynamically assigned to the reserved band to support services that experience disruptions when functioning on the non-reserved band. It enables priority-based channel assignment and termination while providing dynamic access to the obtainable spectrum. Here, Allocation of channels to Reserved Band CRN using Dynamic Channel Reservation Algorithm (DCRA). Komodo Mlipir Optimization Algorithm (KMOA) is employed for Service selection and Channel restoration. The proposed SE-KMOA-CRN method is modelled utilizing Continuous Time Markov Chain (CTMC) with mathematical equations for some quality of service (QoS) factors is obtained. The SE-KMOA-CRN approach attains higher Throughput, lower End-to-End Delay, higher Energy Efficiency, greater spectral efficiency and higher Packet Delivery Ratio compared with existing methods, like Multiple objective optimization for spectrum along energy efficacy trade-off in IRS-assisted CRNs using NOMA (SE-MOO-CRN), Energy efficacy in CRN utilizing cooperative spectrum sensing under hybrid spectrum handoff (SE-TOA-CRN) and Energy-effectual cross-layer spectrum sharing on CR green IoT (SE-CRG-CRN) respectively. [ABSTRACT FROM AUTHOR]

The communication security of unmanned aerial vehicles (UAVs) or drones based on flying ad hoc networks (FANETs) can be enhanced and maintained by assessing vulnerabilities, threats, and attacks. Thus, trust, high mobility, and complex communication interfaces are crucial for effective coordination and segregation of malicious drones from the genuine. A new efficient honesty-based detection scheme for malicious drones has been proposed to distinguish between intentional and unintentional misbehavior of the UAVs. The proposed scheme configures a drone system for packet transmission within the FANET, specifying buffer size and packet size variables to control data flow and prevent congestion. It then computes energy used for packet reception and transmission, optimizes energy consumption, and evaluates the drone's mobility through the link stability index (LSI) and honesty UAV. The honesty UAV parameter categorizes UAVs into unintentional malicious and intentional malicious categories. Fuzzy logic helps identify intentional and unintentional misbehaving drones and improves performance in the network. It continuously generates the malicious UAV detection mechanism by assessing the parameters i.e., energy, pattern of movements, and the honesty score about the UAVs as a whole. Thereby a dynamic rating system to adeptly identify and differentiate the cooperative and non-cooperative nature of drones from the network is assimilated in the paper. Simulation results show the proposed scheme approximately aligns with the actual cases for varying numbers of malicious drones. Finally, the observation of the simulation result reflects substantial enhancement in performance metrics, with a significant cutback in end to end delay and packet delivery ratio by 10–30% and 20–50% respectively, contrasting with the existing techniques. [ABSTRACT FROM AUTHOR]

This study investigates the optimization of traffic scheduling in autonomous vehicle networks using time-sensitive networking (TSN), a type of deterministic Ethernet. Ethernet has high bandwidth and compatibility to support various protocols, and its application range is expanding from office environments to smart factories, aerospace, and automobiles. TSN is a representative technology of deterministic Ethernet and is composed of various standards such as time synchronization, stream reservation, seamless redundancy, frame preemption, and scheduled traffic, which are sub-standards of IEEE 802.1 Ethernet established by the IEEE TSN task group. In order to ensure real-time transmission by minimizing end-to-end delay in a TSN network environment, it is necessary to schedule transmission timing in all links transmitting ST (Scheduled Traffic). This paper proposes network performance metrics and methods for applying machine learning (ML) techniques to optimize traffic scheduling. This study demonstrates that the traffic scheduling problem, which has NP-hard complexity, can be optimized using ML algorithms. The performance of each algorithm is compared and analyzed to identify the scheduling algorithm that best meets the network requirements. Reinforcement learning algorithms, specifically DQN (Deep Q Network) and A2C (Advantage Actor-Critic) were used, and normalized performance metrics (E2E delay, jitter, and guard band bandwidth usage) along with an evaluation function based on their weighted sum were proposed. The performance of each algorithm was evaluated using the topology of a real autonomous vehicle network, and their strengths and weaknesses were compared. The results confirm that artificial intelligence-based algorithms are effective for optimizing TSN traffic scheduling. This study suggests that further theoretical and practical research is needed to enhance the feasibility of applying deterministic Ethernet to autonomous vehicle networks, focusing on time synchronization and schedule optimization. [ABSTRACT FROM AUTHOR]

MANETs (Mobile AdHoc Networks) have major problems due to the resource-constrained nature of mobile nodes. MANET topology is highly uncertain due to the mobility of MANET nodes that affect the stability of interconnected links. This scenario results in an increased traffic overhead which affects the routing protocol performance and results in increased energy consumption. A routing scheme designed for MANET should be able to handle energy depletion issues and nodes’ mobility. This paper designs two novel schemes to enhance energy efficiency and network lifetime by performing clustering and routing in MANET. The Hybrid Tasmanian devil and Elephant herding optimization (HTDEHO) is used for clustering the MANET nodes to minimize the overhead, enhance the stability of the network topology, and reduce collision. The HTDEHO selects the optimal cluster head (CH) from a set of nodes based on their fitness value calculated by various parameters such as mobility-based node ranking, residual energy, distance, node degree, and optimal next hop CH selection. Dwarf mongoose optimization algorithm with Fuzzy variable (FDMO) algorithm selects optimal routing cost from CH to the base station based on various parameters such as throughput, delay, and distance. The efficiency of the proposed model is evaluated with different performance metrics such as energy consumption, throughput, end-to-end delay, and packet-dropping analysis. The performance of the proposed HTDEHO-FDMO classifier is compared with different techniques such as RDOAICRP, BFOA, MARP-HO, and FEKHO-QBA. Even after 170 iterations, the HTDEHO model retains a total of 10 alive nodes. [ABSTRACT FROM AUTHOR]

A wireless body area network (WBAN) is a type of wireless sensor network that plays a crucial role in monitoring patient healthcare. In this network, sensor nodes are typically placed inside or outside the patient's body. These nodes are capable of transmitting data to the sink node when any functional changes in the patient are detected. The routing and energy efficiency of the network nodes are challenging tasks in WBAN, as each sensor node operates on a battery. Therefore, in multi-hop routing designing a robust routing protocol has a significant impact on reducing energy consumption during the selection of the next hop. In this paper, a simple novel routing protocol named simple energy-aware and reliable (SEAR) routing protocol is proposed to transmit reliable data packets in a WBAN. The proposed routing scheme considers the remaining energy of sensor nodes, priority data, and hop count to the sink node as significant metrics for dynamically selecting the best forwarder node. Furthermore, the proposed protocol utilizes the route reliability factor (RRF) to select the optimal route among all possible routes between the source sensor node and the sink node. RRF selects the route with the maximum route residual energy and minimum hop count. As a result, SEAR has the ability to provide effective single-hop and multi-hop routing data transmission to improve the reliability of data transmission, decrease the energy consumption of the sensor nodes, and prolong the lifetime of the network. The simulation results show that the performance of the SEAR routing protocol outperforms the existing routing protocols for the metrics: packet loss ratio, throughput, end-to-end delay, normalized routing load, energy consumption, and network lifetime. The results indicate that the proposed protocol improves total energy consumption by 18.76% and 10.89% when compared to EERR-RLFL and AMCRP respectively. Meanwhile, SEAR reduces the average end-to-end delay by 17% and 9%, packet loss ratio by 29.48% and 17.69%, and normalized routing load by 31.17% and 20.91%. Additionally, SEAR achieves up to 16% and 9.71% higher throughput compared to EERR-RLFL and AMCRP routing protocols respectively. Overall, the results obtained indicate that the proposed SEAR routing scheme significantly enhances the overall performance of the network. [ABSTRACT FROM AUTHOR]

Current research on apron conflict detection is often limited to the interaction between the aircraft as a whole and other objects, making it difficult to accomplish targeted identification of vulnerable and high‐cost aircraft components. However, the implementation of detailed aircraft identification is of great significance to enhance the safety of airport surface operations. Based on the excellent performance of High‐Resolution Network (HRNet) in keypoint detection, a lightweight end‐to‐end keypoint detection network, namely Squeeze and Excitation High‐Resolution Network (SEHRNet), is proposed in this paper to solve the problems of HRNet's slower computation and more redundancy. First, the errors arising from coordinate transformations in the coding and decoding process are solved by an improved feature map coding and decoding process. Second, replace the BasicBlock in HRNet with the Depthwise separable convolutions based on the Squeeze‐and‐Excitation Networks, which drastically cuts the computational cost of the network. Third, the improved Bottleneck module is used to further enhance the capability of feature extraction. Experimental results prove that, based on the aircraft keypoint detection dataset, the SEHRNet proposed in this paper shows stronger applicability compared to the current mainstream networks. Compared with the original HRNet, the improved network has higher accuracy, faster speed, and lighter model for aircraft keypoint detection. [ABSTRACT FROM AUTHOR]

Energy resource limitations, data packet traffic congestion, mobility, and communication link failure of relay nodes are vital challenges in establishing a reliable and efficient path between end-to-end users in IoT Communication toward 6G. These factors can severely affect routing and network performance. Hence, it is imperative to design a routing approach to adapt to such heterogeneity to improve the quality of service (QoS) performance toward 6G networks. This paper proposes a multi-criteria-aware integrated decision-making (MCAIDeM) routing protocol in which relay nodes' residual energy, queue length, mobility, and link quality are integrated into a single routing approach for efficient and reliable route selection. In particular, the MCAIDeM routing protocol utilizes an analytic hierarchy process (AHP) approach for multi-criteria decision-making, which determines appropriate weights according to the parameter values of the nodes to select suitable relay nodes during the route selection process. Extensive simulations are performed to evaluate the performance, and the obtained simulation results showed that the proposed MCAIDeM routing protocol outperforms conventional routing protocols in terms of network throughput, latency, and energy consumption with various network parameters. The end-to-end delay obtained by MCAIDeM was 9.03% and 11.26% lower than that of MBMQA, 11.21%, and 13.67% lower than that of MEQSA-OLSRv2, and 19.15% and 16.61% lower than that of the MP-OLSRv2 routing protocols when the node speed increased from 5 m/s to 30 m/s, respectively. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) devices are an essential part of several aspects of daily life for people. They are utilized in a variety of contexts, including industrial monitoring, environmental sensing, and so on. But, secure communication is the major challenge in the IoT environment. Therefore, a decentralized Blockchain-based Key Management protocol using Levy Flight-Equilibrium Optimization and Self-Attention-based Improved Faster Region-based Convolutional Neural Network (BlkKM) method is proposed to determine stable security in tamper-resistant hardware machine that can protect sensitive secret data in the healthcare field i.e., stored cryptographic keys. The keys are categorized as Key Encryption Keys (KEKs) and Data Encryption Keys (DEKs). The number of the keys is decreased by using Levy Flight- Equilibrium Optimization (LF-EO) as organizing nodes with logical sets. Also, Self-Attention-based Improved Faster Region-based Convolutional Neural Network (SA-based IFRCNN) is used for reordering a set of logical nodes to minimize the number of sets after a node exits the network. Additionally, the system makes use of smart contracts for access control as well as proxy encryption to data encryption. The proposed method is compared with existing techniques to validate the security enhancement performance. The evaluation is performed based on throughput, end-to-end delay, storage overheads, and energy consumption. The experimentation results revealed that the proposed method improved the throughput to 220.52bps and diminished the utilization of energy. A greater degree of memory usage is also decreased by using this technique. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) consists of non-standardized computer devices that can create wireless network connections to send data. These devices have limited storage, bandwidth, and computing capacities, which may cause network congestion when nodes move or leave their allotted area. IoT networks need congestion control to enhance the efficiency of data transfer. The study examines IoT congestion and proposes using alternate nodes to maintain dataflow and quality of service (QoS). The study presents RAoNC, a novel algorithm designed to improve routing algorithms in network clusters for the purposes of congestion monitoring, avoidance, and mitigation. Congestion management techniques efficiently process network information update query packets and reduce large-header handshaking packets. Improve network performance by reducing congestion, packet loss, and throughput. The proposed method speeds up packet transfer to reduce network node packet transmission delays. The optimization approach minimizes power usage across all network nodes. We assessed the efficacy of our approach by comparative analysis utilizing NS2 simulations and contrasted the suggested algorithm with prior studies. The simulation shows that RAoNC significantly improves congestion performance. We will assess the novel RAoNC algorithm in relation to DCCC6, LEACH, and QU-RPL. The throughput increased by 28.36%, weighted fairness index by 28.2%, end-to-end delay by 48.7%, energy consumption by 31.97%, and the number of missed packets in the buffer decreased by 90.35%. [ABSTRACT FROM AUTHOR]

The deployment of a swarm of cooperative Unmanned Aerial Vehicles (UAVs) to pursue a mission is knowing an increasing success nowadays. This is mainly because deploying a group of cooperating UAVs instead of one single UAV offers numerous advantages, including the extension of the mission coverage, fault tolerance in case of losing a UAV during a mission, and improving the data gathering accuracy. Multicast routing, on the other hand, is a critical operation for UAV swarm networks, as it facilitates critical tasks including information transmission and swarm coordination. Moreover, designing efficient multicast protocols with Quality of Service (QoS) can be challenging due to various factors such as limited energy constraints and the dynamically changing topology with 3D movement which causes frequent changes in the network topology. Therefore, in this paper, we investigate the multicast routing problem in a swarm of UAVs. We first provide a detailed classification of existing efforts in swarm routing protocols in terms of transmission strategies. And second, we propose a new Energy Efficient Inter-UAV Multicast Routing Protocol for surveillance and monitoring applications called "COCOMA". We illustrate through extensive simulations that COCOMA achieves the desired efficient communication backbone and Quality-of-Service. We also discuss and implement an improvement of COCOMA called COCOMA+ and show that both versions are efficient and effective in term of reducing the total emission energy by at least 10 dBm compared to the state-of-art work SP-GMRF. In addition, our proposal optimizes also the End-to-End Delay, the number of hops in the routing process, and the network throughput which consequently leads to increasing the packet delivery ratio by more than to 22% compared to SP-GMRF protocol. [ABSTRACT FROM AUTHOR]

Reliable communication is always one of the requirements of vehicular ad-hoc networks (VANETs). However the high speed mobile nodes and dynamic topology structure of VANETs means it is difficult to get a stable link between vehicles. Toward this end, we propose an optimized mobile similarity and link transmission quality routing (OMSLTQR) to select routing nodes and maintain the quality of communication link. Mobile similarity and link transmission quality are two basis for routing selection. To get the speed information for mobile similarity calculation, we modify the frame structure. The local information frame is redesigned to save and transmit link selection information. We also propose an algorithm based on OMSLTQR to find the routing neighbor set. Simulation results shows that our OMSLTQR achieves better system performance than optimized link state routing in terms of end-to-end delay and successful transmission rate. [ABSTRACT FROM AUTHOR]

Wireless body area networks (WBANs) are an emerging field in the domain of healthcare which are typically composed of biomedical sensors. These sensors are implanted inside or attached to the human body for monitoring a patient's condition and providing accurate treatment to patients. In WBANs, energy efficiency is a critical concern due to the restricted battery capacity of the sensors. Extending the network lifetime and reducing the energy consumption of these sensor nodes can significantly impact the reliability and effectiveness of WBANs in monitoring patients' health. An efficient routing protocol based on energy-related parameters is crucial in designing these networks. Although many routing protocols have been proposed for routing in WBANs, sufficient features have not been properly handled in these methods. To overcome these issues, a novel routing protocol named Simple Energy Efficient and Bandwidth Aware (SEBA) routing protocol is proposed for routing in WBANs. The proposed scheme considers multiple metrics of the network node, such as remaining energy, energy harvesting, draining rate energy, available bandwidth, and number of hops in a route selection to minimize energy consumption, increase network lifetimes, and enhance the reliability of data transmission in WBANs. Additionally, the SEBA uses a novel mechanism to change the route dynamically based on energy consumption. This mechanism plays a significant role in reducing the number of route errors, route discoveries, and distributing energy consumption among sensor nodes. The experimental results reveal that the proposed scheme performs well in terms of average network throughput, packet delivery ratio, normalized routing load, average end-to-end delay, energy consumption, and network lifetime compared with the existing AMCRP, EEMP, and EAR protocols. [ABSTRACT FROM AUTHOR]

Many devices are connected to each other using Internet of Things (IoT) technology today. The capabilities of this technology have highlighted its importance, but significant challenges can affect the quality of these capabilities. One of the most important challenges is routing. A good and appropriate routing for data transfer makes the network service quality very satisfactory and the network life time increases. In this research, using multi-criteria decision making techniques in the fuzzy environment, a method called F-EVM is proposed, which is specifically a combination of the fuzzy eigenvector method and the fuzzy Multi-attribute Ideal-Real Comparative Analysis method. Ad-hoc On-demand Distance Vector protocol is also used for route discovery. The results of the proposed approach have been compared from two viewpoints of network stability and network clustering with ALOC, DECR and MT-MAC approaches. The obtained results show improvement in routing according to criteria such as average energy consumption, packet delivery ratio, and end-to-end delay. For example, the experimental results show the average energy consumption improvements of F-EVM compared to ALOC, DECR and MT-MAC are 30.26%, 18.52% and 58.20%, respectively. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT IoT ) is built on a foundation of wireless sensor devices that connect humans and physical objects to the Internet and enable them to interact with one another to improve the living conditions of citizens. Wireless Sensor Networks ( WSNs ) are widely utilized in systems based on I o T to collect the data required by intelligent environments. However, I o T - enabled W S N s encounter a variety of difficulties such as poor network lifespan, limited throughput, and long communication delays, due to the massive non-homogenous data streaming from numerous sensor devices. Therefore, a multi-objective intelligent clustering routing schema for I o T - enabled W S N s utilizing deep reinforcement learning is proposed in this paper to overcome these shortcomings. The proposed schema partitions the entire network into various unequal clusters based on the present data load existing in sensor nodes, effectively preventing the network from dying prematurely. In addition, an unequal clustering mechanism is utilized to balance inter-cluster and intra-cluster energy consumption among cluster heads. The simulation findings demonstrate the effectiveness of the proposed schema in terms of energy efficiency, delivered packets, end-to-end delay, alive nodes, energy balancing, and network lifespan compared with the other two state-of-the-art existing schemes. [ABSTRACT FROM AUTHOR]

This paper represents the Reliable Mobility Management of RPL (RM-RPL) protocol, specifically developed to overcome the limitations of the Routing Protocol for Low-Power and Lossy Networks (RPL) in mobile IoT environments. RM-RPL incorporates a sophisticated mechanism to prevent the formation of loops, enabling mobile nodes to operate as both routers and parents within the network. It introduces a novel objective function that optimizes the selection of parent nodes and includes a mechanism to adjust the protocol's behavior when nodes are stationary. Furthermore, an algorithm is devised to acknowledge critical packets properly. The proposed model provides superior support for mobility, efficient routing, and dependable data transmission, rendering it highly suitable for diverse IoT applications. Through comprehensive evaluations, RM-RPL demonstrates exceptional performance in challenging scenarios characterized by large-scale networks, high density, and dynamic conditions. Comparative analysis reveals that RM-RPL significantly enhances the packet delivery ratio and exhibits commendable power consumption, end-to-end delay, and handover delay. [ABSTRACT FROM AUTHOR]

Immersive technologies like eXtended Reality (XR) are the next step in videoconferencing. In this context, understanding the effect of delay on communication is crucial. This article presents the first study on the impact of delay on collaborative tasks using a realistic Social XR system. Specifically, we design an experiment and evaluate the impact of end-to-end delays of 300, 600, 900, 1,200, and 1,500 ms on the execution of a standardized task involving the collaboration of two remote users that meet in a virtual space and construct block-based shapes. To measure the impact of the delay in this communication scenario, objective and subjective data were collected. As objective data, we measured the time required to execute the tasks and computed conversational characteristics by analyzing the recorded audio signals. As subjective data, a questionnaire was prepared and completed by every user to evaluate different factors such as overall quality, perception of delay, annoyance using the system, level of presence, cybersickness, and other subjective factors associated with social interaction. The results show a clear influence of the delay on the perceived quality and a significant negative effect as the delay increases. Specifically, the results indicate that the acceptable threshold for end-to-end delay should not exceed 900 ms. This article additionally provides guidelines for developing standardized XR tasks for assessing interaction in Social XR environments. [ABSTRACT FROM AUTHOR]

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network (MANET) routing protocols: Destination Sequenced Distance Vector (DSDV), Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zone Routing Protocol (ZRP). In this paper, the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis, Mann-Whitney, and Friedman. It articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility patterns. The study is premised upon the Quality of Service (QoS) metrics of throughput, packet delivery ratio, and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network scenarios. The findings explained significant differences in the performance of different routing protocols; as a result, decisions for the selection and optimization of routing protocols can be taken effectively according to different network requirements. This paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures. [ABSTRACT FROM AUTHOR]

Copyright of Automotive Digest is the property of Automotive Digest Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the fast growth of the Industrial Internet of Everything (IIoE), computing and telecommunication industries all over the world are moving rapidly towards the IPv6 address architecture, which supports virtualization architectures such as Network Function Virtualization (NFV). NFV provides networking services like routing, security, storage, etc., through software-based virtual machines. As a result, NFV reduces equipment costs. Due to the increase in applications on Industrial Internet of Things (IoT)-based networks, security threats have also increased. The communication links between people and people or from one machine to another machine are insecure. Usually, critical data are exchanged over the IoE, so authentication and confidentiality are significant concerns. Asymmetric key cryptosystems increase computation and communication overheads. This paper proposes a lightweight and certificateless end-to-end secure communication scheme to provide security services against replay attacks, man-in-the-middle (MITM) attacks, and impersonation attacks with low computation and communication overheads. The system is implemented on Linux-based Lubuntu 20.04 virtual machines using Java programming connected to NFV-based large-scale hybrid IPv4-IPv6 virtual networks. Finally, we compare the performance of our proposed security scheme with existing schemes based on the computation and communication costs. In addition, we measure and analyze the performance of our proposed secure communication scheme over NFV-based virtualized networks with regard to several parameters like end-to-end delay and packet loss. The results of our comparison with existing security schemes show that our proposed security scheme reduces the computation cost by 38.87% and the communication cost by 26.08%. [ABSTRACT FROM AUTHOR]

The fog computing model is a new computing model that has been proposed in recent years by increasing the number of requests sent to the cloud to reduce the delay and workload of the cloud computing model. In addition to its advantages, the fog computing model also has challenges, among which we can mention the issue of service placement in this computing model, which is very effective in the performance of the computing model. So far, many works have been presented to solve the problem of service deployment by considering different goals such as energy consumption, end-to-end delay, load balancing, resource efficiency, etc. Considering the importance of all the mentioned parameters, it is very important to provide a multi-objective method. In multi-objective problems, the method of evaluating the generated solutions is a separate challenge. Therefore, in this paper, a service placement method is presented by considering end-to-end delay criteria and energy consumption based on the modified Harris hawks algorithm to solve multi-objective problems. To increase accuracy, in the proposed method called multi-objective Harris hawks optimization, a multi-objective problem is modeled as several single-objective problems. The simulation results in CloudSim show that the proposed method has achieved better results than other algorithms in terms of reducing energy consumption, end-to-end delay, and network utilization. [ABSTRACT FROM AUTHOR]