Houling Ji

To address the issues of low accuracy in transmission line anomaly detection and recognition caused by challenges such as multi-scale targets and partial occlusion, this paper proposes an optimized transmission line anomaly detection algorithm based on improved YOLOv11n. Firstly, an improved Cross Stage Partial with kernel size 2 (C3k2_DFF) module takes the place of the original C3k2 module in the backbone network. It adaptively fuses multi-scale local features and dynamically selects salient channel-wise and spatial features according to its global information during fusion to enhance the model’s feature representation. Secondly, a Separated and Enhancement Attention Module (SEAM) attention mechanism is introduced to enhance the unoccluded area feature response to compensate for the occluded area response deficit, suppressing the background features that interfere with the model and improving the model’s occluded target perception capability. Experimental results on our self-constructed dataset indicate that the proposed improved YOLOv11n model achieves precision, recall, mAP50, and mAP50-95 of 94.2%, 90.8%, 94.3%, and 68.0%, respectively. Compared with the baseline model, it represents improvements of 2.0%, 1.3%, 1.6%, and 2.9%, while the parameters and GFLOPs increase by only 6.6% and 4.8%, demonstrating superior detection performance.

Transmission lines are widely distributed in complex environments, making them susceptible to foreign object intrusion, which could lead to serious consequences, i.e., power outages. Currently, foreign object detection on transmission lines is primarily conducted through UAV-based field inspections. However, the captured data must be transmitted back to a central facility for analysis, resulting in low efficiency and the inability to perform real-time, industrial-grade detection. Although recent YOLO series models can be deployed on UAVs for object detection, these models’ substantial computational requirements often exceed the processing capabilities of UAV platforms, limiting their ability to perform real-time inference tasks. In this study, we propose a novel lightweight detection algorithm, SCL-YOLOv8, which is based on the original YOLO model. We introduce StarNet to replace the CSPDarknet53 backbone as the feature extraction network, thereby reducing computational complexity while maintaining high feature extraction efficiency. We design a lightweight module, CGLU-ConvFormer, which enhances multi-scale feature representation and local feature extraction by integrating convolutional operations with gating mechanisms. Furthermore, the detection head of the original YOLO model is improved by introducing shared convolutional layers and group normalization, which helps reduce redundant computations and enhances multi-scale feature fusion. Experimental results demonstrate that the proposed model not only improves the detection accuracy but also significantly reduces the number of model parameters. Specifically, SCL-YOLOv8 achieves a mAP@0.5 of 94.2% while reducing the number of parameters by 56.8%, FLOPS by 45.7%, and model size by 50% compared with YOLOv8n.

In recent years, the unmanned aerial vehicle-assisted internet of vehicles has been extensively studied to enhance communication and computation services in vehicular environments where ground infrastructures are limited or absent. However, due to the limited-service range and battery life of unmanned aerial vehicles, along with the high mobility of vehicles, an unmanned aerial vehicle cannot continuously cover and serve the same vehicle, leading to interruptions in vehicular application services. Therefore, this paper proposes a joint optimization strategy for task migration and power allocation based on soft actor-critic (JOTMAP-SAC). First, communication models, computational resource allocation models, and computation models are established sequentially based on the computational resource and dynamic coordinate of each node. The joint optimization problem of task migration and power allocation is then formulated. Considering the dynamic nature of the unmanned aerial vehicle-assisted internet of vehicles environment and the continuity of the action space, a soft actor-critic based algorithm for task migration and power allocation is designed. This algorithm iteratively finds the optimal solution to the joint optimization problem, thereby reducing the processing delay in unmanned aerial vehicle-assisted internet of vehicles and ensuring the continuity of internet of vehicles task processing.

In the mobile edge computing (MEC) environment, the edge caching can provide the timely data response service for the intelligent scenarios. However, due to the limited storage capacity of edge nodes and the malicious node behavior, the question of how to select the cached contents and realize the decentralized security data caching faces challenges. In this paper, a blockchain-based decentralized and proactive caching strategy is proposed in an MEC environment to address this problem. The novelty is that the blockchain was adopted in an MEC environment with a proactive caching strategy based on node utility, and the corresponding optimization problem was built. The blockchain was adopted to build a secure and reliable service environment. The employed methodology is that the optimal caching strategy was achieved based on the linear relaxation technology and the interior point method. Additionally, in a content caching system, there is a trade-off between cache space and node utility, and the caching strategy was proposed to solve this problem. There was also a trade-off between the consensus process delay of blockchain and the caching latency of content. An offline consensus authentication method was adopted to reduce the influence of the consensus process delay on the content caching. The key finding was that the proposed algorithm can reduce latency and can ensure the security data caching in an IoT environment. Finally, the simulation experiment showed that the proposed algorithm can achieve up to 49.32%, 43.11%, and 34.85% improvements on the cache hit rate, the average content response latency, and the average system utility, respectively, compared to the random content caching algorithm, and it achieved up to 9.67%, 8.11%, and 5.95% increases, successively, compared to the greedy content caching algorithm.