High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages

Intrusion Detection Systems (IDS) is the main defense mechanism deployed by the current networks to prevent cyber threats. Recurrent Neural Network (RNN) are also a novel IDS structure that replaces the conventional training and testing mechanism. The strategy encodes network traffic data as biological sequences using amino acid codons in such a fashion that the RNN is capable of effectively analyzing temporal and sequence data patterns. RNN architecture design adopts embedding layers to handle codon representations and Long Short-Term Memory (LSTM) layers to perform sequential data learning, which is followed by a fully connected network to perform classification functions, which preserve high feature extraction and classification

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

This study proposes a new method for designing adaptive routing algorithms for three‐dimensional (3D) networks‐on‐chip (NoCs). This method is based on extending the existing 2D turn model adaptive routing to a 3D scenario. A 3D plane‐balanced approach with maximal degree of adaptiveness is achieved by applying a well‐defined set of rules for different strata of the 3D NoC. The proposed method is applicable to any of the turn models. In this study, the authors employ odd–even turn model as a basis for introducing the proposed strategy. Experimental results show that the new 3D odd–even turn model can achieve up to 28.5% improvement in performance over conventional 3D odd–even approach. The improvement is consistent fo