Improve Network Performance Research Articles

A survey on reconfigurable intelligent surfaces: Wireless communication perspective

AbstractUsing reconfigurable intelligent surfaces (RISs) to improve the coverage and the data rate of future wireless networks is a viable option. These surfaces are constituted of a significant number of passive and nearly passive components that interact with incident signals in a smart way, such as by reflecting them, to increase the wireless system's performance as a result of which the notion of a smart radio environment comes to fruition. In this survey, a study review of RIS‐assisted wireless communication is supplied starting with the principles of RIS which include the hardware architecture, the control mechanisms, and the discussions of previously held views about the channel model and pathloss; then the performance analysis considering different performance parameters, analytical approaches and metrics are presented to describe the RIS‐assisted wireless network performance improvements. Despite its enormous promise, RIS confronts new hurdles in integrating into wireless networks efficiently due to its passive nature. Consequently, the channel estimation for, both full and nearly passive RIS and the RIS deployments are compared under various wireless communication models and for single and multi‐users. Lastly, the challenges and potential future study areas for the RIS aided wireless communication systems are proposed.

Service Function Chains multi-resource orchestration in Virtual Mobile Edge Computing

Next-Generation Networks (NGNs) provide efficient services to improve the overall network performance, especially in Internet of Things (IoT) networks. However, service placement requires a significant cost in terms of multi-resource chaining guarantees. Therefore, the balance between improving network performance and optimizing resources orchestration is still a fundamental issue to assure the benefits of NGNs with optimal resources’ utilization. In this paper, we present new approaches for Service Function Chain (SFC) orchestration in Virtual Mobile Edge Computing (VMEC) environments, where IoT devices are used as on-demand virtual edge servers. We propose Optimal SFC Placement in VMEC over AI-IoT (OSPV) algorithm to select the optimal virtual mobile edge (VME) according to heterogeneous computing resources constraints. Moreover, to deal with OSPV complexity issues in dense IoT networks, we propose an Efficient SFC Placement in VMEC over AI-IoT (ESPV) algorithm that selects sufficient VME nodes for services operations and deployments. Furthermore, recent Deep Learning (DL) techniques such LSTM and GRU are implied to predict mobility and energy consumption sequences of IoT devices. These instances introduce feasible sets of IoT nodes, where the optimization algorithms should operate. Results show the efficiency of the DL instances and prove that the prediction awareness prevents the selected VME from failure and disconnection during the communication. Moreover, the proposed optimization algorithms are implemented and evaluated under different computing scenarios. Then, they are compared according to total allocated servers and SFC placement time. Optimization results show that both algorithms are efficient in terms of predetermined key performance indicators compared to the state of the art.

Efficient and Secured Mechanisms for Data Link in IoT WSNs: A Literature Review

The Internet of things (IoT) and wireless sensor networks (WSNs) have been rapidly and tremendously developing recently as computing technologies have brought about a significant revolution. Their applications and implementations can be found all around us, either individually or collaboratively. WSN plays a leading role in developing the general flexibility of industrial resources in terms of increasing productivity in the IoT. The critical principle of the IoT is to make existing businesses sufficiently intelligent to recognize the need for significant fault mitigation and short-cycle adaptation to improve effectiveness and financial profits. This article presents efficiently applied security protocols at the data link layer for WSN and IoT-based frameworks. It outlines the importance of WSN–IoT applications as well as the architecture of WSN in the IoT. Our primary aim is to highlight the research issues and limitations of WSNs related to the IoT. The fundamental goal of this work is to emphasize a suggested architecture linked to WSN–IoT to enhance energy and power consumption, mobility, information transmission, QoS, and security, as well as to present practical solutions to data link layer difficulties for the future using machine learning. Moreover, we present data link layer protocol issues, attacks, limitations, and research gaps for WSN frameworks based on the recent work conducted on the data link layer concerning WSN applications. Current significant issues and challenges pertain to flow control, quality of service (QoS), security, and performance. In the context of the literature, less work has been undertaken concerning the data link layer in WSN and its relation to improved network performance.

Cooperative Content Caching Framework Using Cuckoo Search Optimization in Vehicular Edge Networks

Vehicular edge networks (VENs) connect vehicles to share data and infotainment content collaboratively to improve network performance. Due to technological advancements, data growth is accelerating, making it difficult to always connect mobile devices and locations. For vehicle-to-vehicle (V2V) communication, vehicles are equipped with onboard units (OBU) and roadside units (RSU). Through back-haul, all user-uploaded data is cached in the cloud server’s main database. Caching stores and delivers database data on demand. Pre-caching the data on the upcoming predicted server, closest to the user, before receiving the request will improve the system’s performance. OBUs, RSUs, and base stations (BS) cache data in VENs to fulfill user requests rapidly. Pre-caching reduces data retrieval costs and times. Due to storage and computing expenses, complete data cannot be stored on a single device for vehicle caching. We reduce content delivery delays by using the cuckoo search optimization algorithm with cooperative content caching. Cooperation among end users in terms of data sharing with neighbors will positively affect delivery delays. The proposed model considers cooperative content caching based on popularity and accurate vehicle position prediction using K-means clustering. Performance is measured by caching cost, delivery cost, response time, and cache hit ratio. Regarding parameters, the new algorithm outperforms the alternative.

3D SAACNet with GBM for the classification of benign and malignant lung nodules

In view of the low diagnostic accuracy of the current classification methods of benign and malignant pulmonary nodules, this paper proposes a 3D segmentation attention network integrating asymmetric convolution (SAACNet) classification model combined with a gradient boosting machine (GBM). This can make full use of the spatial information of pulmonary nodules. First, the asymmetric convolution (AC) designed in SAACNet can not only strengthen feature extraction but also improve the network's robustness to object flip and rotation detection and improve network performance. Second, the segmentation attention network integrating AC (SAAC) block can effectively extract more fine-grained multiscale spatial information while adaptively recalibrating multidimensional channel attention weights. The SAACNet also uses a dual-path connection for feature reuse, where the model makes full use of features. In addition, this article makes the loss function pay more attention to difficult and misclassified samples by adding adjustment factors. Third, the GBM is used to splice the nodule size, originally cropped nodule pixels, and the depth features learned by SAACNet to improve the prediction accuracy of the overall model. A comprehensive ablation experiment is carried out on the public dataset LUNA16 and compared with other lung nodule classification models. The classification accuracy (ACC) is 95.18%, and the area under the curve (AUC) is 0.977. The results show that this method effectively improves the classification performance of pulmonary nodules. The proposed method has advantages in the classification of benign and malignant pulmonary nodules, and it can effectively assist radiologists in pulmonary nodule classification.

Comparative analysis of services from soft open points using cost–benefit analysis

Soft Open Points (SOPs) are power electronic-based devices which can replace Normally Open Points (NOPs) in distribution networks. They can improve network performance by enabling controllable power transfer between adjacent feeders. This flexible meshing can provide a wide range of services, including loss reduction, reduced renewables curtailment, improved reliability, reinforcement deferral, or enabling flexibility services. This paper proposes a novel framework, based on the Cost–Benefit Analysis methodology, to quantify and compare the cost-effectiveness of SOPs for providing each of these five value streams. The framework includes the development of mathematical models that encapsulate the key variables that drive competitive SOP use cases, as well as providing detailed analysis to determine quantitative estimates for each of the parameters. Results suggest that, whilst all services could be cost-effective, that reinforcement deferral and reduced DG curtailment are most likely to find wide usage. It is also suggested that the fast response time of SOPs as compared to conventional NOPs is unlikely to be a viable value proposition for improving reliability via conventional loss of load metrics such as energy not supplied. A detailed case study demonstrates that in marginal cases, where a SOP has a similar system net benefit compared to Business-as-Usual, that all services need to be considered rather than just single value streams in isolation. It is concluded from the research that there are multiple potential competitive applications for SOPs in future distribution networks.

3D self-deployment of jumping robot sensor nodes for improving network performance in obstacle dense environment

Wireless sensor node deployment in unconstructed environments affects the network’s connectivity. This paper presents the 3D self-deployment of jumping robot sensor nodes (JRSNs), which can jump over and onto obstacles to enhance network performance. The effects of JRSNs’ 3D deployment on network connectivity and energy consumption are simulated first. Then, we propose a localization method by the fusion of ultra-wideband (UWB) technology, inertial navigation system (INS), and jumping error model for JRSNs’ precise locomotion during deployment. Moreover, we propose path planning and deployment algorithms considering the JRSNs’ locomotion pattern and obstacles. Finally, we conducted experiments on the localization and deployment of JRSNs in an outdoor environment. The results verified the feasibility of the proposed method and algorithms. The JRSNs’ deployment error was smaller than 25 cm. The network connectivity was improved significantly by 57.70% with the 3D deployment. The JRSNs can deploy autonomously for various applications in obstacle-rich environments.

RESEARCH ON THE PRINCIPLES OF ARTIFICIAL NEURAL NETWORK CONSTRUCTION AND PARAMETER MODELING

Studies show that neural networks with multilayer direct propagation have be-come more widespread, which is due to the simplicity of their implementation, the availability of advanced learning methods, and the parallel execution of calculations. In these networks, the computational complexity increases proportionally to the square of the data size, which leads to a decrease in performance and an increase in hardware costs. The main problems of synthesis of artificial neural networks, criteria for evaluating the effectiveness of artificial neural networks, issues of choosing layers and the number of neurons in each layer are investigated. In the work, the mean square error, mean absolute error and mean absolute percentage error criteria are considered for evaluating the efficiency of neural networks. In general, one hidden layer of a neu-ral network is sufficient for most problems, two hidden layers can represent a function of any shape, and adding a third and more layers results in very little improvement in network performance. Expressions are given for the total number of parameters de-pending on the number, and the number of inputs from the binary sequence, as well as the minimum and maximum values of the training examples depending on the total number of parameters and the number of outputs. The studies have shown that the se-lection of the statistical model efficiency evaluation criteria depends on the problem to be solved. The results of the simulations performed using the MATLAB package are presented.

WG-ICRN: Protein 8-state secondary structure prediction based on Wasserstein generative adversarial networks and residual networks with Inception modules.

Protein secondary structure is the basis of studying the tertiary structure of proteins, drug design and development, and the 8-state protein secondary structure can provide more adequate protein information than the 3-state structure. Therefore, this paper proposes a novel method WG-ICRN for predicting protein 8-state secondary structures. First, we use the Wasserstein generative adversarial network (WGAN) to extract protein features in the position-specific scoring matrix (PSSM). The extracted features are combined with PSSM into a new feature set of WG-data, which contains richer feature information. Then, we use the residual network (ICRN) with Inception to further extract the features in WG-data and complete the prediction. Compared with the residual network, ICRN can reduce parameter calculations and increase the width of feature extraction to obtain more feature information. We evaluated the prediction performance of the model using six datasets. The experimental results show that the WGAN has excellent feature extraction capabilities, and ICRN can further improve network performance and improve prediction accuracy. Compared with four popular models, WG-ICRN achieves better prediction performance.

Improved Multi-Path Routing for QoS on MANET

A Mobile Ad hoc NETwork (MANET) is a self-configuring network that is not reliant on infrastructure. This paper introduces a new multipath routing method based on the Multi-Hop Routing (MHR) technique. MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other. Failing to ensure good MHR leads to several negative consequences, ultimately causing unsuccessful data transmission in a MANET. This research work consists of three portions. The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing (PBDR) to adapt to the dynamic MANET environment by reducing Node Link Failures (NLF) in the network. This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration, which enable the next-hop selection. This method works more efficiently than the traditional protocols. Then the second stage is the Improved Multi-Path Dynamic Routing (IMPDR). The enhancement is mainly focused on further improving the Quality of Service (QoS) in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs. Since QoS is the most vital metric that assesses a protocol, its dynamic estimation has improved network performance considerably. This method uses distance, linkability, trust, and QoS as the four parameters for the next-hop selection. IMPDR is compared against traditional routing protocols. The Network Simulator-2 (NS2) is used to conduct a simulation analysis of the protocols under consideration. The proposed tests are assessed for the Packet Delivery Ratio (PDR), Packet Loss Rate (PLR), End-to-End Delay (EED), and Network Throughput (NT).

Improved network performance in CPS communication with distributed IPC mechanisms of recursive internetworking architecture (RINA)

Improved network performance in CPS communication with distributed IPC mechanisms of recursive internetworking architecture (RINA)

Improved network performance in CPS communication with distributed IPC mechanisms of recursive internetworking architecture (RINA)

Improved network performance in CPS communication with distributed IPC mechanisms of recursive internetworking architecture (RINA)

EEG-Over-BLE: A Low-Latency, Reliable, and Low-Power Architecture for Multichannel EEG Monitoring Systems

Recent enhancements in the field of wireless communication protocols have led to the development of several wearable devices and sensor networks suitable for health monitoring and diagnostic purposes. Nevertheless, new low-power solutions are still needed for enabling long-term, comfortable and lightweight monitoring systems. This paper deals with EEG-over-BLE, a novel architecture for multi-channel electroencephalography (EEG), characterized by low power consumption. The proposed architecture relies on a low-power analog front-end for EEG signals and a system-on-chip that supports the Bluetooth 5.0 protocol. Moreover, a near-lossless EEG compression algorithm and a simple channel encoding scheme are introduced in the proposed architecture in order to reduce energy consumption and improve network performance. Detailed investigations were carried out in order to evaluate the performance of the proposed architecture. In particular, simulation results and an analytical model on power consumption reported in this paper show that, when commercial small-form-factor batteries are used for power supply, the lifetime of a 64 channels EEG-over-BLE monitoring system is over 86 days. Moreover, the proposed architecture is highly reliable, achieving a packet loss rate lower than 0.1% and a latency below 35 ms, which is compliant with ISO/IEEE 11073 standard for medical device communications.

An Adaptive Energy Efficient MAC Protocol for RF Energy Harvesting WBANs

Continuous and remote health monitoring medical applications with heterogeneous requirements can be realized through wireless body area networks (WBANs). Energy harvesting is adopted to enable low-power health applications and long-term monitoring without battery replacement, which have drawn significant interest recently. Because energy harvesting WBANs are obviously different from battery-powered ones, network protocols should be designed accordingly to improve network performance. In this article, an efficient cross-layer media access control protocol is proposed for radio frequency powered energy harvesting WBANs. We redesigned the superframe structure, which can be rescheduled by the coordinator dynamically. A time switching (TS) strategy is used when sensors harvest energy from radio frequency signals broadcast by the coordinator, and a transmission power adjustment scheme is proposed for sensors based on the energy harvesting efficiency and the network environment. Energy efficiency can be effectively improved that more packets can be uploaded using limited energy. The length of the energy harvesting period is determined by the coordinator to balance the channel resources and energy requirements of sensors and further improve the network performance. Numerical simulation results show that our protocol can provide superior system performance for long-term periodic health monitoring applications.

Using Layer-Wise Training for Road Semantic Segmentation in Autonomous Cars

A recently developed application of computer vision is pathfinding in self-driving cars. Semantic scene understanding and semantic segmentation, as subfields of computer vision, are widely used in autonomous driving. Semantic segmentation for pathfinding uses deep learning methods and various large sample datasets to train a proper model. Due to the importance of this task, accurate and robust models should be trained to perform properly in different lighting and weather conditions and in the presence of noisy input data. In this paper, we propose a novel learning method for semantic segmentation called layer-wise training and evaluate it on a light efficient structure called an efficient neural network (ENet). The results of the proposed learning method are compared with the classic learning approaches, including mIoU performance, network robustness to noise, and the possibility of reducing the size of the structure on two RGB image datasets on the road (CamVid) and off-road (Freiburg Forest) paths. Using this method partially eliminates the need for Transfer Learning. It also improves network performance when input is noisy.

Improvement of Distribution Network Performance by Optimally Allocating EV Charging Station

With zero emissions to the environment, electric vehicles (EVs) are the most environmentally friendly mode of transportation. The placement of EV charging stations (EVCS) in the Radial Distribution Network (RDN) is necessary to satisfy the demand of charging in various places while minimizing power loss on the power system networks. In the distribution system, distributed generation (DG) not only reduces power loss but also enhances power quality. To fully utilize the benefits of DG, it is necessary to find the optimal location and size in the distribution system. In this work, the ideal installation of EVCS has been consistently demonstrated in the IEEE 33 bus distribution network. In order to provide widespread charging facilities, the RDN has been split into three regions, and it has been established that each area has one charging station placed. The main purpose is to minimize the Active Power Loss and Voltage Deviation Index (VDI) to maintain a healthy power system network. Adding DG to the appropriate EV Station is obtained through optimization. This problem has been formulated as a problem of optimization for finding the best location to install EVCS in the IEEE 33 bus RDN by using the Symbiotic Organisms Search (SOS) algorithm. The obtained results have been validated and compared using the Grey Wolf Optimizer (GWO) and Whale Optimization Algorithm (WOA).

A Feature-Map-Based Method for Explaining the Performance Degradation of Ship Detection Networks

The unknowability of the inner workings limits the magnitude of performance improvement of ship target detection networks in synthetic aperture radar (SAR) images under Gaussian noise. However, none of the existing interpretation methods explain the phenomenon of network changes under noise. The feature map can visually reflect the changes in image delivery in the network, and some metrics can quantitatively characterize the degree of network performance degradation in a noise environment. So in this paper, we propose a comprehensive analysis method that integrates texture and brightness features of the internal feature map of the network to clarify the change process of target features under Gaussian noise. First, we analyzed the degradation of three target detection networks under different levels of Gaussian noise; then, the feature maps of four convolution layers were sampled and visualized for qualitative analysis; finally, the texture and brightness features were extracted for quantitative characterization of the feature amount changes. We experimentally validated the method on publicly available SSDD radar datasets. The networks were extremely sensitive to Gaussian noise, and the mean Average Precision decreased by up to 96.3%. The angular second moment and entropy texture feature values of the feature map could drop and rise 59.10% and 97.81%, respectively, while the brightness value could increase up to 100.92%. This indicates that noise changes the structure of feature maps and reduces the amount of effective information.

Modelling a Learning-Based Dynamic Tree Routing Model for Wireless Mesh Access Networks

Link asymmetry in wireless mesh access networks (WMAN) of Mobile ad-hoc Networks (MANETs) is due mesh routers’ transmission range. It is depicted as significant research challenges that pose during the design of network protocol in wireless networks. Based on the extensive review, it is noted that the substantial link percentage is symmetric, i.e., many links are unidirectional. It is identified that the synchronous acknowledgement reliability is higher than the asynchronous message. Therefore, the process of establishing bidirectional link quality through asynchronous beacons underrates the link reliability of asymmetric links. It paves the way to exploit an investigation on asymmetric links to enhance network functions through link estimation. Here, a novel Learning-based Dynamic Tree routing (LDTR) model is proposed to improve network performance and delay. For the evaluation of delay measures, asymmetric link, interference, probability of transmission failure is evaluated. The proportion of energy consumed is used for monitoring energy conditions based on the total energy capacity. This learning model is a productive way for resolving the routing issues over the network model during uncertainty. The asymmetric path is chosen to achieve exploitation and exploration iteratively. The learning-based Dynamic Tree routing model is utilized to resolve the multi-objective routing problem. Here, the simulation is done with MATLAB 2020a simulation environment and path with energy-efficiency and lesser E2E delay is evaluated and compared with existing approaches like the Dyna-Q-network model (DQN), asymmetric MAC model (AMAC), and cooperative asymmetric MAC model (CAMAC) model. The simulation outcomes demonstrate that the anticipated LDTR model attains superior network performance compared to others. The average energy consumption is 250 J, packet energy consumption is 6.5 J, PRR is 50 bits/sec, 95% PDR, average delay percentage is 20%.

A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETs

One of the essential processes in Mobile Ad hoc Networks (MANETs) is blind flooding to discover routes between source and destination mobile nodes. As the density of nodes in the network increases, the number of broadcast packets increases exponentially. This can lead to broadcast storms, a drain on the device’s battery, and reduced network efficiency. We propose a Cross-layer Adaptive Fuzzy-based Ad hoc On-Demand Distance Vector routing protocol (CLAF-AODV) to minimize the routing broadcast traffic by considering the quality of service (QoS) (e.g. delay, throughput, packet loss), stability, and adaptability of the network. The suggested method employs two-level fuzzy logic and a cross-layer design approach to select the appropriate nodes with a higher probability of participating in broadcasting by considering parameters from the three first layers of the Open Systems Interconnection (OSI) model to achieve a quality of service, stability, and adaptability. It not only investigates the quality of the node and the network density around the node to make a decision but also investigates the path that the broadcast packet traveled to reach this node. Simulation results reveal that our proposed protocol reduces the number of broadcast packets and significantly improves network performance with respect to throughput, packet loss, normalized routing load, collision rate, and average energy consumption compared to the standard AODV and the Fixed Probability AODV (FP-AODV) algorithms.

An Optimal Cluster Head and Gateway Node Selection with Fault Tolerance

In Mobile Ad Hoc Networks (MANET), Quality of Service (QoS) is an important factor that must be analysed for the showing the better performance. The Node Quality-based Clustering Algorithm using Fuzzy-Fruit Fly Optimization for Cluster Head and Gateway Selection (NQCAFFFOCHGS) has the best network performance because it uses the Improved Weighted Clustering Algorithm (IWCA) to cluster the network and the FFO algorithm, which uses fuzzy-based network metrics to select the best CH and entryway. However, the major drawback of the fuzzy system was to appropriately select the membership functions. Also, the network metrics related to the path or link connectivity were not considered to effectively choose the CH and gateway. When learning fuzzy sets, this algorithm employs a new Continuous Action-set Learning Automata (CALA) approach that correctly modifies and chooses the fuzzy membership functions. Despite the fact that it extends the network’s lifespan, it does not assist in the detection of defective nodes in the routing route. Because of this, a new Fault Tolerance (NQCAEFFFOCHGS-FT) mechanism based on the Distributed Connectivity Restoration (DCR) mechanism is proposed, which allows the network to self-heal as a consequence of the algorithm’s self-healing capacity. Because of the way this method is designed, node failures may be utilised to rebuild the network topology via the use of cascaded node moves. Founded on the fractional network information and topologic overhead related with each node, the DCR is suggested as an alternative to the DCR. When compared to the NQCAFFFOCHGS algorithm, the recreation results display that the proposed NQCAEFFFOCHGS-FT algorithm improves network performance in terms of end-to-end delay, energy consumption, Packet Loss Ratio (PLR), Normalized Routing Overhead (NRO), and Balanced Load Index (BLI).