The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery remaining is high enough, nodes then send the notification which was logged before to the sink. Compared with past solutions, our results indicate that the performance of the TBSR scheme has been improved comprehensively; it can effectively increase the quantity of notification received by the sink by 20%, increase energy efficiency by 11%, reduce the maximum storage capacity needed by nodes by 33.3% and improve the success rate of routing by approximately 16.30%.
Exploring the characterization laws of image data and improving the efficiency of image data characterization knowledge is essential to promote the development of the Internet of Things technology. Considering that images in the real world usually contain multiple objects, and the objects are closely dependent. For these reasons, it brings great challenges to the robust representation learning of multilabel images. In general, researchers model the relationship between objects based on a class activation map and use graph convolution to mine the dependencies between objects. However, graph structure data often contain noise, which means that the edges between nodes are sometimes not so reliable, and the relative importance of neighbors is also different. Based on this, our goal is to reduce noisy connections and false connections between objects, eliminate multilabel image representation bias, and learn robust representations. Therefore, we propose a robust representation learning method for multilabel images driven by graph attention network (RRL-GAT). Specifically, to reduce the accidental false connection of objects in the image, we propose the class attention graph convolution module (C-GAT) to mine the strong association structure between categories. Besides, for the dynamic correlation between objects in the image, we propose an adaptive graph attention convolution module (A-GAT) to capture the subtle dynamic dependencies in the image. The results on two authoritative data sets show that our method is significantly better than all current state-of-the-art methods. Besides, the visualization results show that RRL-GAT can capture the semantic relationship of a specific input image and has sufficient recognizability.
How to use artificial intelligence technology to mine human abnormal behavior from considerable video data generated by the Internet of Things system has been intensively studied for a long time. Existing deep learning anomaly detection algorithms deployed in the cloud typically perform supervised learning based on constant kinds of abnormal behavior data. However, this supervised learning model with preset abnormal behavior categories ignores the diversity and unpredictability of abnormal occurrences in open scenarios. Thus, we propose an abnormal behavior detection algorithm as an edge network service by combining the advantages of cloud computing and the efficiency of edge networks. This method combines the double verification of global behavior detection and local fine-grained action cycle alignment to detect whether a behavior is abnormal. Moreover, to enable abnormal behavior detection models to predict test samples whose categories do not appear during the training stage, we propose an active label learning algorithm based on cycle clustering, which not only improves the efficiency of data transmission between the edge and the cloud but also makes model updates in the cloud more efficient. Extensive and quantitative experimental results show that our method can not only accurately detect abnormal human behavior at the edge of limited resources but also has strong robustness under the interference of test samples of unknown categories.
A railway track gradually deviates from the originally designed vertical alignment in the operation. To ensure the safety and comfort, railway maintenance department must periodically recreate vertical alignment and calibrate existing track to it. The recreated alignment should be as close as possible to the measured points along the existing railway track, while satisfying multiple constraints. A vertical alignment consists of tangents and curves. Identifying the geometric element attribution of the measured points accurately and recreating the vertical alignment efficiently and accurately with all the constraints satisfied are the key problems. Existing methods need manual assistance and few constraints are considered. This paper proposes an automatic global iterations method considering multiple constraints. Firstly, geometric elements are identified based on the change rate of gradient and are set as initial values for the iterations. Then, the geometric elements are fitted iteratively. In each iteration, all the tangents are fitted simultaneously followed by the fitting of all vertical curves and the constraints are handled while the geometric elements are fitted. The attributions of all points are adjusted after each iteration. If the attributions of all the points are consistent with the ranges of fitted geometric elements, the iteration terminates. A software is developed based on this method, and applications demonstrate this method can identify all geometric elements automatically and recreate an optimized vertical alignment while satisfying all the constraints.
In recent years, distributed denial of service (DDoS) attacks have increasingly shown the trend of multiattack vector composites, which has significantly improved the concealment and success rate of DDoS attacks. Therefore, improving the ubiquitous detection capability of DDoS attacks and accurately and quickly identifying DDoS attack traffic play an important role in later attack mitigation. This paper proposes a method to efficiently detect and identify multivector DDoS attacks. The detection algorithm is applicable to known and unknown DDoS attacks.
The design of railway alignment and station locations involves two intertwined problems, which makes it a complex and time-consuming task. Especially in mountainous regions, the large 3-dimensional (3D) search spaces, complex terrain conditions, coupling constraints and infinite numbers of potential alternatives of this problem pose many challenges. However, most current optimization methods emphasize either alignment optimization or station locations optimization independently. Only a few methods consider coordinated optimization of alignment and stations, but optimize them sequentially. This paper proposes a concurrent optimization method based on a 3-dimensional distance transform algorithm (3D-DT) to solve this problem. It includes the following components: (1) To optimize the location of stations within specified spacing intervals, a novel perceptual search strategy is proposed and incorporated into the basic 3D-DT optimization process. (2) A combined-alignment-station 3D search neighboring mask is developed and employed to search for both the alignment and stations. In order to implement the perceptual process, two additional kinds of 3D reverse perceptual neighboring masks are also developed and employed in the algorithm. (3) Multiple coupling constraints between alignment and stations are also formulated and addressed during the search process. In this study, the effectiveness of the method is verified through a real-world case study in a complex mountainous region. The optimization results show that the proposed method can find high-quality alternatives satisfying multiple coupling constraints.