Network Selection Research Articles

Mobile network and computer software test path selection application in environmental data collection simulation

Mobile network and computer software test path selection application in environmental data collection simulation

Integrating machine learning with proof-of-authority-and-association for dynamic signer selection in blockchain networks

Integrating machine learning with proof-of-authority-and-association for dynamic signer selection in blockchain networks

Intelligent Influencer Selection in Social Networks for Product Promotions with Crowd Effect

Intelligent Influencer Selection in Social Networks for Product Promotions with Crowd Effect

Research on tool wear and breakage state recognition of heavy milling 508III steel based on ResNet-CBAM

Milling water chamber head material 508 III steel belongs to extreme manufacturing, and the tool failure is very serious in the process of machining. How to monitor and identify the tool wear damage state in time and effectively is a key problem to be solved urgently. Identifying chip morphology changes under machining conditions plays a very important role in characterizing tool wear and breakage. Tool wear has an important influence on the chip morphology during the process of milling 508III steel, and changes in chip morphology can also reflect the tool wear and breakage state. Therefore, this paper takes the chip morphology image as an important feature for tool wear and breakage recognition, and uses Gaussian fuzzy estimation morphology method to preprocess the chip morphology image. Build a ResNet network combined by convolutional block attention module (ResNet-CBAM) tool wear and breakage recognition model, and explore the selection of the model backbone network, determination of the ResNet backbone network depth, and fusion methods of different attention mechanisms. Through the ablation experiment and visual analysis of the attention mechanism module, it is verified that the ResNet-CBAM model proposed in this paper has an accuracy rate of 96.67% in tool wear and breakage state recognition, especially in the stage of severe tool wear and breakage. This study realizes the prediction and early warning of tool life, and provides effective guarantee for the efficient cutting of large parts of high-end equipment and the stable operation of manufacturing system.

Design and Site Selection of Reverse Logistics Network for Iron and Steel Enterprises from the Perspective of Green Supply Chain

The iron and steel industry is not only one of the most important components of China's national economy, but also a typical resource-and-energy-intensive industry. Under the background of "Carbon Peaking and Carbon Neutrality Goals", it is of great significance for the iron and steel industry to improve the green closed-loop supply chain and develop circular economy. From the perspective of green supply chain, this paper puts forward the three-level network structure of waste steel reverse logistics based on the present situation of waste steel recycling in China, and uses k-means clustering algorithm and accurate center of gravity method to select locations for the primary and secondary nodes. The purpose of this paper is to provide a basis for iron and steel enterprises to carry out network optimization of reverse logistics.

Optimizing relay node selection in cooperative wireless body area networks with modified POA

In the realm of Wireless Body Area Networks (WBANs), cooperative communications emerge as a crucial research focus, lauded for their capacity to mitigate fading and optimize spectral efficiency. Choosing the appropriate relay in cooperative communication is vital for ensuring spatial diversity, as incorrect relay selections can lower the network's overall performance. This study utilizes an optimization method referred to as M-POA(Modified Pelican Optimization Algorithm) to tackle the relay selection problem. This paper introduces a M-POA specifically designed for cooperative networks in Wireless Body Area Networks (WBAN). The core concept behind the M-POA is to mimic the hunting behavior of pelicans in nature. Here, the relay selection is determined using the M-POA, with channel gain as a fitness function. The proposed strategy integrates the Decode-and-Forward (DF) relay protocol to significantly enhance communication efficiency and reliability. The proposed method is assessed in comparison with other relay selection techniques through a Bit Error Rate (BER) analysis, evaluating the effectiveness of each approach across different Signal-to-Noise Ratio (SNR) scenarios. The simulation results analysis elucidates that M-POA provides well-balanced performance in both exploration and exploitation aspects. By calculating the Bit Error Rate (BER), we assessed the effectiveness of the optimized relay selection strategy, with the objective of minimizing BER to enhance overall communication reliability. By studying the convergence curve, we evaluated the relay selection technique's performance and gauged how effectively it improved with each iteration. The proposed scheme effectively addresses both key requirements of WBAN: improving communication system reliability and optimizing relay selection.

Development of an Automated Global Crash Prediction Model With Adaptive Feature Selection of Deep Neural Networks

Development of an Automated Global Crash Prediction Model With Adaptive Feature Selection of Deep Neural Networks

PPAT: An effective scheme ensuring privacy-preserving, accuracy, and trust for worker selection in mobile crowdsensing networks

The data content privacy protection and data accuracy are two important research issues in Mobile Crowdsensing (MCS). However, current researches have rarely been able to satisfy privacy protection as well as data accuracy at the same time, thus hindering the development of MCS. To solve the above issues, for the first time, we have proposed a Privacy Preserving, Accuracy, and Trust data collection scheme (PPAT) for MCS, which can protect the privacy of data content and maintain high accuracy at low-cost style. In PPAT scheme, First, we proposed a scrambled data privacy protection framework which can protect the data of each worker from being known to any third party, which can protect the data privacy of workers. The second, more importantly, we propose a truth value estimation method based on trust computing, which can obtain the truth value more accurately compared to the classic methods under privacy-preserving. In the proposed trust-based truth value calculation, the worker's trust is determined by comparing it with the weight of the trusted worker. Then, the truth value is calculated by the trust of the workers, so that the truth value obtained is more accurate. Through theoretical analysis, it is proved that the proposed PPAT scheme has good worker data content, worker trust, and truth value content privacy protection. Through a large number of simulation experiments, the strategy proposed in this paper has a good ability to protect data content privacy compared to the previous strategy, while improving data quality by 0.5%∼5.7%, and reducing data collection costs by 35.6%∼54.9%.

Dedicated Path Protection with Flexible Switching Selection in Passive Optical 5G Xhaul Access Networks

This work addresses the optimized planning of survivable optical 5G Xhaul access networks employing passive Wavelength Division Multiplexing (WDM) technologies. Specifically, it focuses on the reliability of optical transmission paths connecting remote radio sites to a central hub ensured by using a novel, cost-effective, flexible, and dedicated path protection (DPP-F) scheme, protecting against single-link failures. The proposed DPP-F network protection approach allows for switching of individual wavelengths or the complete multiplexed WDM signal, flexibly applying the best switching option according to given traffic demands. Concurrently, it enables traffic aggregation on the transmission paths from the end and intermediate nodes to minimize the overall network deployment cost. The problem of selecting primary (working) and backup (protection) paths, together with the selection of the best switching and traffic aggregation options, is modeled and solved as a mixed-integer linear programming (MILP) optimization problem. To evaluate the cost savings achieved with DPP-F, we compare it with two reference DPP schemes based on switching the entire multiplexed WDM signal (DPP-M) and individual wavelengths (DPP-W). Numerical experiments conducted across a wide range of network scenarios reveal, among other things, that DPP-F’s performance is at least as good as that of the reference methods, bringing significant cost savings (from several to tens of percent) in most of the analyzed network scenarios.

Parameter selection for long short-term memory networks with multi-criteria decision-making tools: an application for G7 countries stock market forecasting

Parameter selection for long short-term memory networks with multi-criteria decision-making tools: an application for G7 countries stock market forecasting

Pairwise Stability in Weighted Network Formation Games: Selection and Computation

This paper is concerned with the selection and computation of pairwise stable networks when agents have differentiable and concave utility functions. We show that a pairwise stable network can be obtained by finding a Nash equilibrium of a noncooperative game played by the nodes and links in the network. Based on this observation, we introduce a logarithmic tracing procedure and a path-following algorithm for network formation games. We apply the algorithm to several models in the literature and make comparisons with two existing algorithms: a path-following algorithm based on the linear tracing procedure (LinTP) and a decompose and exhaustive search method (DaE). Numerical results indicate that the proposed method is more than four times as efficient as LinTP. Although DaE demonstrates exceptional efficiency for small-scale problems, our method outperforms it significantly for large-scale problems, where DaE may fail to find a solution. We also show that the decomposition technique of DaE can be used to further accelerate our algorithm for a special class of problems. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms–Continuous. Funding: This work was supported in part by the National Natural Science Foundation of China [Grants 12201289, 12122107, and 72394363/72394360], the Natural Science Foundation of Jiangsu Province [Grant BK20220754], the Guangdong Basic and Applied Basic Research Foundation [Grant 2021A1515110207], the Young Elite Scientists Sponsorship Program by CAST [Grant 2023QNRC001], and the Open Research Fund from the Guangdong Provincial Key Laboratory of Big Data Computing [Grant B10120210117-OF05]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0546 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0546 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Similarity and economy of scale in urban transportation networks and optimal transport-based infrastructures

Designing and optimizing the structure of urban transportation networks is a challenging task. In this study, we propose a method inspired by optimal transport theory and the principle of economy of scale that uses little information in input to generate structures that are similar to those of public transportation networks. Contrarily to standard approaches, it does not assume any initial backbone network infrastructure but rather extracts this directly from a continuous space using only a few origin and destination points, generating networks from scratch. Analyzing a set of urban train, tram and subway networks, we find a noteworthy degree of similarity in several of the studied cases between simulated and real infrastructures. By tuning one parameter, our method can simulate a range of different subway, tram and train networks that can be further used to suggest possible improvements in terms of relevant transportation properties. Outputs of our algorithm provide naturally a principled quantitative measure of similarity between two networks that can be used to automatize the selection of similar simulated networks.

Selection functions of strong lens finding neural networks

ABSTRACT We show that convolution neural networks (CNNs) trained to find strong gravitational lens systems are biased towards systems with larger Einstein radii and large concentrated sources. This selection function is key to fully realizing the potential of the large samples of strong gravitational lens systems that will be found in upcoming wide-field surveys. In this paper, we use a CNN and three training data sets to quantify the network selection function and its implication for the many scientific applications of strong gravitational lensing. We use CNNs with similar architecture as is commonly found in the literature. The networks preferentially select systems with larger Einstein radii and larger sources with more concentrated source-light distributions. Increasing the detection significance threshold to 12$\sigma$ from 8$\sigma$ results in 50 per cent of the selected strong lens systems having Einstein radii $\theta _\mathrm{E}$$\ge$ 1.04 arcsec from $\theta _\mathrm{E}$$\ge$ 0.879 arcsec, source radii $R_S$$\ge$ 0.194 arcsec from $R_S$$\ge$ 0.178 arcsec, and source Sérsic indices $n_{\mathrm{Sc}}^{\mathrm{S}}$$\ge$ 2.62 from $n_{\mathrm{Sc}}^{\mathrm{S}}$$\ge$ 2.55. The model trained to find lensed quasars shows a stronger preference for higher lens ellipticities than those trained to find lensed galaxies. The selection function is independent of the slope of the power law of the mass profiles, hence measurements of this quantity will be unaffected. The lens finder selection function reinforces that of the lensing cross-section, and thus we expect our findings to be a general result for all galaxy–galaxy and galaxy–quasar lens finding neural networks.

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

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

A case study of multi-objective design optimization of a healthy building in Shanghai, China

Energy efficient healthy buildings design is important in achieving carbon neutrality and occupants’ health, yet not sufficiently explored. This paper aims to optimize a healthy building in Shanghai, China, based on energy consumption, indoor air quality and visual comfort. A four-step optimization method was proposed. Firstly, Latin Hypercube-Soubert sampling method was used to generate 375 design samples and performance data through computer simulation and calculation. Secondly, five different machine learning approaches were applied for prediction model development. Thirdly, the best prediction models were coupled with eleven optimization algorithms to find Pareto solutions. Finally, optimization on different combinations of design parameters were conducted. It was found that the back propagation neural network and Pareto Envelope-based Selection Algorithm II were the best prediction models and optimization algorithm. The average reduction of building energy consumption, visual discomfort, and improper indoor air quality hours were found to be 25.73 %, 46.24 %, and 38.34 %, respectively. The recommended windows to wall ratios of the east, south, west and north walls, absorptance of solar radiation and filter types are in the range of 20%–35 %, 10%–45 %, 10%–30 %, 10%–40 %, 0.7–0.9, and S7-S9, respectively. This study contributes to enrich the case study of healthy buildings, provide a quick design optimization approach and analysis on the importance of each design parameter. Its originality lies in the optimization methodology, comparative analysis of prediction models, optimization algorithms, and combination effects of design parameters. The outcomes can guide the building designers in performing energy efficient design while maximizing indoor air quality and visual comfort.

Machine-learning-aided method for optimizing beam selection and update period in 5G networks and beyond

Finding the optimal beam pair and update time in 5G systems operating at mmWave frequencies is time-intensive and resource-demanding. This intricate procedure calls for the proposal of more intelligent approaches. Therefore, this work proposes a machine learning-based method for optimizing beam pair selection and its update time. The method is structured around three main modules: spatial characterization of beam pair service areas, training of a machine learning model using collected beam pair data, and an algorithm that uses the decision function of the trained model to compute the optimal update time for beam pairs based on the spatial position and velocity of user equipment. When the machine learning model is deployed in a network with a single gNB equipped with a 8×8\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$8\ imes 8$$\\end{document} UPA and one UE equipped with a 1×2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$1\ imes 2$$\\end{document} UPA in an mmWave scenario simulated in NS3, improvements in SINR and throughput up to 407%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$407\\%$$\\end{document}, were observed. Improvements are gathered because of a reduction of 85.7%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$85.7\\%$$\\end{document} in beam pair selections because of an increase of approximately 1543%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$1543\\%$$\\end{document} in the effective time between successive beam pair searches. This method could offer real-time optimization of the beam pair procedures in 5G networks and beyond.

Road Network Intelligent Selection Method Based on Heterogeneous Graph Attention Neural Network

Selecting road networks in cartographic generalization has consistently posed formidable challenges, driving research toward the application of intelligent models. Despite previous efforts, the accuracy and connectivity preservation in these studies, particularly when dealing with road types of similar sample sizes, still warrant improvement. To address these shortcomings, we introduce a Heterogeneous Graph Attention Network (HAN) for road selection, where the feature masking method is initially utilized to assess the significance of road features. Concentrating on the most relevant features, two meta-paths are introduced within the HAN framework: one for aggregating features of the same road type within the first-order neighborhood, emphasizing local connectivity, and another for extending this aggregation to the second-order neighborhood, capturing a broader spatial context. For a comprehensive evaluation, we use a set of metrics considering both quantitative and qualitative aspects of the road network. On road types with similar sample sizes, the HAN model outperforms other models in both transductive and inductive tasks. Its accuracy (ACC) is higher by 1.62% and 0.67%, and its F1-score is higher by 1.43% and 0.81%, respectively. Additionally, it enhances the overall connectivity of the selected network. In summary, our HAN-based method provides an advanced solution for road network selection, surpassing previous approaches in terms of accuracy and connectivity preservation.

Deep Reinforcement Learning-Based Automated Network Selection in Heterogenous CRNs

The development of technology that enables network convergence and the rising acceptance of heterogeneous network architectures have made it possible for many of the most important cognitive radio networks to communicate with a broad variety of authorized networks. Traditional algorithms for network selection make use of selection approaches that are dependent on prior information about the network under consideration. We use the proposed algorithm to choose different networks and integrate them into computers. This paper offers a network selection technique that is based on deep reinforcement learning. This technique can be applied to cognitive radio networks that encompass a range of networks. We will utilize these findings to provide recommendations on how to remediate existing issues in the delivery of services to cognitive users. This paper aims to improve the service quality for cognitive users and find solutions to the identified problems.

On the Complexity of Target Set Selection in Simple Geometric Networks

We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbors are already infected. We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs. We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph classes, such as interval graphs and grid graphs.

Stack performance classification and fault diagnosis optimization of solid oxide fuel cell system based on bayesian artificial neural network and feature selection

Solid oxide fuel cell (SOFC) has attracted much attention because of its high efficiency and silent power generation, and can be applied to the field of fuel cell-powered unmanned boats. However, a fuel deficit failure in the system can lead to reduced stack performance, reducing the reliability of SOFC applications in the field of unmanned boats. Therefore, this paper proposes an efficient breakdown diagnosis model for SOFC system fault diagnosis. Firstly, Bayesian artificial neural network is constructed by using the best feature data subset after Relief-F combined with minimum Redundancy Maximum Relevance algorithm feature selecting. Secondly, the correct diagnosis rate under different number of optimal features is calculated, and the best feature combinations are combined to verify. Finally, the particle swarm algorithm selects the optimal hidden neuron count to optimization model. Experimental findings suggest that for correct diagnosis rate, the breakdown diagnosis model based on the optimal number of 3 features can reduce the training time and maintain high accuracy compared with the use of all 34 features. This research result provides a feasible way for the fault diagnosis application of SOFC system power generation in the field of unmanned boats.