Search

It is essential to accurately diagnose bearing faults to avoid property losses or casualties in the industry caused by motor failures. Recently, the methods of fault diagnosis for bearings using deep learning methods have improved the safety of motor operations in a reliable and intelligent way. However, most of the work is mainly suitable for situations where there is sufficient monitoring data of the bearings. In industrial systems, only a small amount of monitoring data can be collected by the bearing sensors due to the harsh monitoring conditions and the short time of the signals of some special motor bearings. To solve the issue above, this paper introduces a transfer learning strategy by focusing on the multi-local model bearing fault based on small sample fusion. The algorithm mainly includes the following steps: (1) constructing a parallel Bi-LSTM sub-network to extract features from bearing vibration and current signals of industrial motor bearings, serially fusing the extracted vibration and current signal features for fault classification, and using them as a source domain fault diagnosis model; (2) measuring the distribution difference between the source domain bearing data and the target bearing data using the maximum mean difference algorithm; (3) based on the distribution differences between the source domain and the target domain, transferring the network parameters of the source domain fault diagnosis model, fine-tuning the network structure of the source domain fault diagnosis model, and obtaining the target domain fault diagnosis model. A performance evaluation reveals that a higher fault diagnosis accuracy under small sample fusion can be maintained by the proposed method compared to other methods. In addition, the early training time of the fault diagnosis model can be reduced, and its generalization ability can be improved to a great extent. Specifically, the fault diagnosis accuracy can be improved to higher than 80% while the training time can be reduced to 15.3% by using the proposed method.

Underwater vehicles are key carriers for underwater inspection and operation tasks, and the successful implementation of these tasks depends on the positioning and navigation equipment with corresponding accuracy. In practice, multiple positioning and navigation devices are often combined to integrate the advantages of each equipment. Currently, the most common method for integrated navigation is combination of the Strapdown Inertial Navigation System (SINS) and Doppler Velocity Log (DVL). Various errors will occur when SINS and DVL are combined together, such as installation declination. In addition, DVL itself also has errors in the measurement of speed. These errors will affect the final accuracy of the combined positioning and navigation system. Therefore, error correction technology has great significance for underwater inspection and operation tasks. This paper takes the SINS/DVL integrated positioning and navigation system as the research object and deeply studies the DVL error correction technology in the integrated system.

Autonomous underwater vehicles (AUVs)-assisted mobile data collection in underwater wireless sensor networks (UWSNs) has received significant attention because of their mobility and flexibility. To satisfy the increasing demand of diverse application requirements for underwater data collection, such as time-sensitive data freshness, emergency event security as well as energy efficiency, in this paper, we propose a novel multi-modal AUV-assisted data collection scheme which integrates both acoustic and optical technologies and takes advantage of their complementary strengths in terms of communication distance and data rate. In this scheme, we consider the age of information (AoI) of the data packet, node transmission energy as well as energy consumption of the AUV movement, and we make a trade-off between them to retrieve data in a timely and reliable manner. To optimize these, we leverage a deep reinforcement learning (DRL) approach to find the optimal motion trajectory of AUV by selecting the suitable communication options. In addition to that, we also design an optimal angle steering algorithm for AUV navigation under different communication scenarios to reduce energy consumption further. We conduct extensive simulations to verify the effectiveness of the proposed scheme, and the results show that the proposed scheme can significantly reduce the weighted sum of AoI as well as energy consumption.

It is critical to detect malicious code for the security of the Internet of Things (IoT). Therefore, this work proposes a malicious code detection algorithm based on the novel feature fusion–malware image convolutional neural network (FF-MICNN). This method combines a feature fusion algorithm with deep learning. First, the malicious code is transformed into grayscale image features by image technology, after which the opcode sequence features of the malicious code are extracted by the n-gram technique, and the global and local features are fused by feature fusion technology. The fused features are input into FF-MICNN for training, and an appropriate classifier is selected for detection. The results of experiments show that the proposed algorithm exhibits improvements in its detection speed, the comprehensiveness of features, and accuracy as compared with other algorithms. The accuracy rate of the proposed algorithm is also 0.2% better than that of a detection algorithm based on a single feature.

In this paper, we study data transmission in the Terrestrial–Satellite Integrated Network (TSIN), where terrestrial networks and satellites are combined together to provide seamless global network services for ground users. However, efficiency of the data transmission is limited by the time-varying inter-satellite link connection and intermittent terrestrial–satellite link connection. Therefore, we propose a link-state aware hybrid routing algorithm, which selects the integrated data transmission path adaptively in this paper. First of all, a space–time topology model is constructed to represent the dynamic link connections in TSIN. Thus, the transmission delay can be analyzed accordingly, and the data transmission problem can then be formulated. To balance the effectiveness and accuracy of searching a hybrid path, we carefully discuss the optimization of space–time topology updating, and propose an inter-satellite link selection algorithm. For the terrestrial–satellite link in hybrid routing, the data transmission problem is transformed into a weighted bipartite graph matching problem and solved with a Kuhn–Munkres-based link selection algorithm. To verify the effectiveness of our proposed routing algorithm, extensive simulations are conducted based on a realistic Hongyun constellation project. Results show that the network performance is improved with respect to data transmission delay, packet loss rate, and throughput.

Over recent years, traditional manufacturing factories have been accelerating their transformation and upgrade toward smart factories, which are an important concept within Industry 4.0. As a key communication technology in the industrial internet architecture, time-sensitive networks (TSNs) can break through communication barriers between subsystems within smart factories and form a common network for various network flows. Traditional routing algorithms are not applicable for this novel type of network, as they cause unnecessary congestion and latency. Therefore, this study examined the classification of TSN flows in smart factories, converted the routing problem into two graphical problems, and proposed two heuristic optimization algorithms, namely GATTRP and AACO, to find the optimal solution. The experiments showed that the algorithms proposed in this paper could provide a more reasonable routing arrangement for various TSN flows with different time sensitivities. The algorithms could effectively reduce the overall delay by up to 74% and 41%, respectively, with promising operating performances.

With the widespread use of industrial Internet technology in intelligent production lines, the number of task requests generated by smart terminals is growing exponentially. Achieving rapid response to these massive tasks becomes crucial. In this paper we focus on the multi-objective task scheduling problem of intelligent production lines and propose a task scheduling strategy based on task priority. First, we set up a cloud-fog computing architecture for intelligent production lines and built the multi-objective function for task scheduling, which minimizes the service delay and energy consumption of the tasks. In addition, the improved hybrid monarch butterfly optimization and improved ant colony optimization algorithm (HMA) are used to search for the optimal task scheduling scheme. Finally, HMA is evaluated by rigorous simulation experiments, showing that HMA outperformed other algorithms in terms of task completion rate. When the number of nodes exceeds 10, the completion rate of all tasks is greater than 90%, which well meets the real-time requirements of the corresponding tasks in the intelligent production lines. In addition, the algorithm outperforms other algorithms in terms of maximum completion rate and power consumption.

Non-orthogonal multiple access (NOMA) has been extensively studied to improve the performance of the Terrestrial-Satellite Integrated Network (TSIN) on account of the shortage of frequency band resources. In this paper, the terrestrial network and satellite network synergistically provide complete coverage for ground users, and based on the architecture, we first formulate a constrained optimization problem to maximize the sum rate of the TSIN under the limited spectrum resources. As the terrestrial networks and the satellite network will cause interference to each other, we first investigate the capacity performance of the terrestrial networks and the satellite networks separately, in which the optimal power control factor expression is derived. Then, by constructing the relationship model between user elevation angle, beam angle and distance, we develop a dynamic group pairing schemes to ensure the effective pairing of NOMA users. Based on the user pairing, to obtain the optimal resource allocation, a joint optimization algorithm of power allocation, beam channel and base station channel resource is proposed. Finally, simulation results are provided to evaluate the user paring scheme as well as the total system performance, in comparison with the existing works.

Deployment of surface-level gateways holds potential as an effective method to alleviate high-propagation delays and high-error probability in an underwater wireless sensor network (UWSN). This promise comes from reducing distances to underwater nodes and using radio waves to forward information to a control station. In an UWSN, a dynamic energy efficient surface-level gateway deployment is required to cope with the mobility of underwater nodes while considering the remote and three-dimensional nature of marine space. In general, deployment problems are usually modeled as an optimization problem to satisfy multiple constraints given a set of parameters. One previously published static deployment optimization framework makes assumptions about network workload, routing, medium access control performance, and node mobility. However, in real underwater environments, all these parameters are dynamic. Therefore, the accuracy of performance estimates calculated through static UWSN deployment optimization framework tends to be limited by nature. This paper presents the Prediction-Assisted Dynamic Surface Gateway Placement (PADP) algorithm to maximize the coverage and minimize the average end-to-end delay of a mobile underwater sensor network over a specified period. PADP implements the Interacting Multiple Model (IMM) tracking scheme to predict the positions of sensor nodes. The deployment is determined based on both current and predicted positions of sensor nodes, which enables better coverage and shorter end-to-end delay. PADP uses a branch-and-cut approach to solve the optimization problem efficiently, and employs a disjoint-set data structure to ensure connectivity. Simulation results illustrate that PADP significantly outperforms a static gateway deployment scheme.

In Underwater Wireless Sensor Networks (UWSNs), localization is one of most important technologies since it plays a critical role in many applications. Motivated by widespread adoption of localization, in this paper, we present a comprehensive survey of localization algorithms. First, we classify localization algorithms into three categories based on sensor nodes’ mobility: stationary localization algorithms, mobile localization algorithms and hybrid localization algorithms. Moreover, we compare the localization algorithms in detail and analyze future research directions of localization algorithms in UWSNs.

Changes in ocean temperature over time have important implications for marine ecosystems and global climate change. Marine temperature changes with time and has the features of closeness, period, and trend. This paper analyzes the temporal dependence of marine temperature variation at multiple depths and proposes a new ocean-temperature time-series prediction method based on the temporal dependence parameter matrix fusion of historical observation data. The Temporal Dependence-Based Long Short-Term Memory (LSTM) Networks for Marine Temperature Prediction (TD-LSTM) proves better than other methods while predicting sea-surface temperature (SST) by using Argo data. The performances were good at various depths and different regions.

This study investigates the superiority of cooperative broadcast transmission over traditional orthogonal schemes when applied in a downlink relaying broadcast channel (RBC). Two proposed cooperative broadcast transmission protocols, one with an amplify-and-forward (AF) relay, and the other with a repetition-based decode-and-forward (DF) relay, are investigated. By utilizing superposition coding (SupC), the source and the relay transmit the private user messages simultaneously instead of sequentially as in traditional orthogonal schemes, which means the channel resources are reused and an increased channel degree of freedom is available to each user, hence the half-duplex penalty of relaying is alleviated. To facilitate a performance evaluation, theoretical outage probability expressions of the two broadcast transmission schemes are developed, based on which, we investigate the minimum total power consumption of each scheme for a given traffic requirement by numerical simulation. The results provide details on the overall system performance and fruitful insights on the essential characteristics of cooperative broadcast transmission in RBCs. It is observed that better overall outage performances and considerable power gains can be obtained by utilizing cooperative broadcast transmissions compared to traditional orthogonal schemes.

In a cloud computing environment, the number of virtual machines (VMs) on a single physical server and the number of applications running on each VM are continuously growing. This has led to an enormous increase in the demand of memory capacity and subsequent increase in the energy consumption in the cloud. Lack of enough memory has become a major bottleneck for scalability and performance of virtualization interfaces in cloud computing. To address this problem, memory deduplication techniques which reduce memory demand through page sharing are being adopted. However, such techniques suffer from overheads in terms of number of online comparisons required for the memory deduplication. In this paper, we propose a static memory deduplication (SMD) technique which can reduce memory capacity requirement and provide performance optimization in cloud computing. The main innovation of SMD is that the process of page detection is performed offline, thus potentially reducing the performance cost, especially in terms of response time. In SMD, page comparisons are restricted to the code segment, which has the highest shared content. Our experimental results show that SMD efficiently reduces memory capacity requirement and improves performance. We demonstrate that, compared to other approaches, the cost in terms of the response time is negligible.

Marine environmental monitoring provides crucial information and support for the exploitation, utilization, and protection of marine resources. With the rapid development of information technology, the development of three-dimensional underwater acoustic sensor networks (3D UASNs) provides a novel strategy to acquire marine environment information conveniently, efficiently and accurately. However, the specific propagation effects of acoustic communication channel lead to decreased successful information delivery probability with increased distance. Therefore, we investigate two probabilistic neighborhood-based data collection algorithms for 3D UASNs which are based on a probabilistic acoustic communication model instead of the traditional deterministic acoustic communication model. An autonomous underwater vehicle (AUV) is employed to traverse along the designed path to collect data from neighborhoods. For 3D UASNs without prior deployment knowledge, partitioning the network into grids can allow the AUV to visit the central location of each grid for data collection. For 3D UASNs in which the deployment knowledge is known in advance, the AUV only needs to visit several selected locations by constructing a minimum probabilistic neighborhood covering set to reduce data latency. Otherwise, by increasing the transmission rounds, our proposed algorithms can provide a tradeoff between data collection latency and information gain. These algorithms are compared with basic Nearest-neighbor Heuristic algorithm via simulations. Simulation analyses show that our proposed algorithms can efficiently reduce the average data collection completion time, corresponding to a decrease of data latency.

Mobile sink is widely used for data collection in wireless sensor networks. It can avoid ‘hot spot’ problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios.

Increased co-channel interference (CCI) in wireless local area networks (WLANs) is bringing serious resource constraints to today’s high-density wireless environments. CCI in IEEE 802.11-based networks is inevitable due to the nature of the carrier sensing mechanism however can be reduced by resource optimization approaches. That means the CCI analysis is basic, but also crucial for an efficient resource management. In this article, we present a novel CCI analysis approach based on the queuing theory, which considers the randomness of end users’ behavior and the irregularity and complexity of network traffic in high-density WLANs that adopts the M/M/c queuing model for CCI analysis. Most of the CCIs occur when multiple networks overlap and trigger channel contentions; therefore, we use the ratio of signal-overlapped areas to signal coverage as a probabilistic factor to the queuing model to analyze the CCI impacts in highly overlapped WLANs. With the queuing model, we perform simulations to see how the CCI influences the quality of service (QoS) in high-density WLANs.

In health monitoring systems, the base station (BS) and the wearable sensors communicate with each other to construct a virtual multiple input and multiple output (VMIMO) system. In real applications, the signal that the BS received is a distributed source because of the scattering, reflection, diffraction and refraction in the propagation path. In this paper, a 2D direction-of-arrival (DOA) estimation algorithm for incoherently-distributed (ID) and coherently-distributed (CD) sources is proposed based on multiple VMIMO systems. ID and CD sources are separated through the second-order blind identification (SOBI) algorithm. The traditional estimating signal parameters via the rotational invariance technique (ESPRIT)-based algorithm is valid only for one-dimensional (1D) DOA estimation for the ID source. By constructing the signal subspace, two rotational invariant relationships are constructed. Then, we extend the ESPRIT to estimate 2D DOAs for ID sources. For DOA estimation of CD sources, two rational invariance relationships are constructed based on the application of generalized steering vectors (GSVs). Then, the ESPRIT-based algorithm is used for estimating the eigenvalues of two rational invariance matrices, which contain the angular parameters. The expressions of azimuth and elevation for ID and CD sources have closed forms, which means that the spectrum peak searching is avoided. Therefore, compared to the traditional 2D DOA estimation algorithms, the proposed algorithm imposes significantly low computational complexity. The intersecting point of two rays, which come from two different directions measured by two uniform rectangle arrays (URA), can be regarded as the location of the biosensor (wearable sensor). Three BSs adopting the smart antenna (SA) technique cooperate with each other to locate the wearable sensors using the angulation positioning method. Simulation results demonstrate the effectiveness of the proposed algorithm.

Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN) is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs). To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS) was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability.

Localization is one of the hottest research topics in Underwater Wireless Sensor Networks (UWSNs), since many important applications of UWSNs, e.g., event sensing, target tracking and monitoring, require location information of sensor nodes. Nowadays, a large number of localization algorithms have been proposed for UWSNs. How to improve location accuracy are well studied. However, few of them take location reliability or security into consideration. In this paper, we propose a Collaborative Secure Localization algorithm based on Trust model (CSLT) for UWSNs to ensure location security. Based on the trust model, the secure localization process can be divided into the following five sub-processes: trust evaluation of anchor nodes, initial localization of unknown nodes, trust evaluation of reference nodes, selection of reference node, and secondary localization of unknown node. Simulation results demonstrate that the proposed CSLT algorithm performs better than the compared related works in terms of location security, average localization accuracy and localization ratio.

Cloud computing has innovated the IT industry in recent years, as it can delivery subscription-based services to users in the pay-as-you-go model. Meanwhile, multimedia cloud computing is emerging based on cloud computing to provide a variety of media services on the Internet. However, with the growing popularity of multimedia cloud computing, its large energy consumption cannot only contribute to greenhouse gas emissions, but also result in the rising of cloud users’ costs. Therefore, the multimedia cloud providers should try to minimize its energy consumption as much as possible while satisfying the consumers’ resource requirements and guaranteeing quality of service (QoS). In this paper, we have proposed a remaining utilization-aware (RUA) algorithm for virtual machine (VM) placement, and a power-aware algorithm (PA) is proposed to find proper hosts to shut down for energy saving. These two algorithms have been combined and applied to cloud data centers for completing the process of VM consolidation. Simulation results have shown that there exists a trade-off between the cloud data center’s energy consumption and service-level agreement (SLA) violations. Besides, the RUA algorithm is able to deal with variable workload to prevent hosts from overloading after VM placement and to reduce the SLA violations dramatically.

Air quality information such as the concentration of PM2.5 is of great significance for human health and city management. It affects the way of traveling, urban planning, government policies and so on. However, in major cities there is typically only a limited number of air quality monitoring stations. In the meantime, air quality varies in the urban areas and there can be large differences, even between closely neighboring regions. In this paper, a random forest approach for predicting air quality (RAQ) is proposed for urban sensing systems. The data generated by urban sensing includes meteorology data, road information, real-time traffic status and point of interest (POI) distribution. The random forest algorithm is exploited for data training and prediction. The performance of RAQ is evaluated with real city data. Compared with three other algorithms, this approach achieves better prediction precision. Exciting results are observed from the experiments that the air quality can be inferred with amazingly high accuracy from the data which are obtained from urban sensing.