Dai Hou
Dai Hou has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Kai Peng
Huazhong University of Science and Technology
4 shared publications - Bo Jin
State Grid Hubei Information & Telecommunication Company, Wuhan 430048, China
3 shared publications - Lei Zheng
State Grid Hubei Information & Telecommunication Company, Wuhan 430048, China
3 shared publications - Geng Wu
State Grid Hubei Information & Telecommunication Company, Wuhan 430048, China
2 shared publications - Huan Xu
State Grid Hubei Information & Telecommunication Company, Wuhan 430048, China
2 shared publications - Xingwei Cai
Hubei Key Laboratory of Smart Internet Technology, School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan 430074, China
2 shared publications
Latest Publications
- Open Access
- 23 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (9) , 4671
Dynamic UAV Inspection Boosted by Vehicle Collaboration Under Harsh Conditions in the IoT Realm
With the widespread adoption of the Internet of Things (IoT), UAV–vehicle collaborative inspection systems are crucial for large-scale, IoT-enabled monitoring. Empowered by the IoT, these systems optimize resource allocation and boost the efficiency of IoT-based applications. Nevertheless, variable vehicle and UAV speeds due to wind and precipitation complicate path planning and task scheduling in the IoT-integrated setup. To solve this, this study offers an adaptive solution for dynamic, complex-weather scenarios within the IoT framework. A dynamic task-processing model was developed first, using real-time IoT sensor data for better decisions. Then, the KGTSA optimization algorithm was designed. It combines K-means clustering, HGA, and TS, considering UAV and vehicle speed variations in complex weather and making full use of IoT-device data. K-means generates an initial solution, HGA refines it, and TS fine-tunes UAV routes and task assignments. The simulation results show that KGTSA significantly cuts data collection time while maintaining flexibility. It efficiently manages speed and path uncertainties in complex weather, optimizing task efficiency without weather forecasts. Compared to traditional algorithms, KGTSA shortens data collection time and adapts better to dynamic IoT environments for real-world efficiency.
- 23 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (9) , 4671
Open AccessDynamic UAV Inspection Boosted by Vehicle Collaboration Under Harsh Conditions in the IoT Realm
With the widespread adoption of the Internet of Things (IoT), UAV–vehicle collaborative inspection systems are crucial for large-scale, IoT-enabled monitoring. Empowered by the IoT, these systems optimize resource allocation and boost the efficiency of IoT-based applications. Nevertheless, variable vehicle and UAV speeds due to wind and precipitation complicate path planning and task scheduling in the IoT-integrated setup. To solve this, this study offers an adaptive solution for dynamic, complex-weather scenarios within the IoT framework. A dynamic task-processing model was developed first, using real-time IoT sensor data for better decisions. Then, the KGTSA optimization algorithm was designed. It combines K-means clustering, HGA, and TS, considering UAV and vehicle speed variations in complex weather and making full use of IoT-device data. K-means generates an initial solution, HGA refines it, and TS fine-tunes UAV routes and task assignments. The simulation results show that KGTSA significantly cuts data collection time while maintaining flexibility. It efficiently manages speed and path uncertainties in complex weather, optimizing task efficiency without weather forecasts. Compared to traditional algorithms, KGTSA shortens data collection time and adapts better to dynamic IoT environments for real-world efficiency.
- Open Access
- 21 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4573
A Blockchain-Based Collaborative Storage Scheme for Roadside Unit Clusters in Social Internet of Vehicles
With the gradual application of blockchain technology in the domain of Social Internet of Vehicles (SIoV), the increasing volume of blockchain data has imposed significant storage pressure on roadside units (RSUs). Collaborative storage schemes, which organize RSUs into clusters to jointly store content for vehicles, have been explored. However, existing collaborative storage solutions in IoV primarily focus on caching content and are not well-suited to the deployment constraints of blockchain networks. Building on blockchain’s decentralized characteristics and data integrity mechanisms, this paper proposes a collaborative storage scheme that reduces RSU storage loads while sustaining distributed ledger operations in SIoV. Specifically, the RSU Access Preference-based Spectral Clustering Algorithm (RAPSCA) is proposed to address RSU clustering by analyzing both the RSUs’ access preferences for blockchain data and their resource availability. Subsequently, the Vehicle Service Priority-based Greedy Block Allocation Algorithm (VSPGBAA) is devised for intra-cluster storage allocation, which considers vehicles’ dwell times and block access probabilities to reduce overall access costs. Experimental results indicate that, compared to baseline algorithms, the proposed method achieves a 27.7% reduction in cost and a 3.5-fold decrease in execution time, thereby demonstrating the feasibility of collaborative storage optimization in blockchain-enabled SIoV.
- 21 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4573
Open AccessA Blockchain-Based Collaborative Storage Scheme for Roadside Unit Clusters in Social Internet of Vehicles
With the gradual application of blockchain technology in the domain of Social Internet of Vehicles (SIoV), the increasing volume of blockchain data has imposed significant storage pressure on roadside units (RSUs). Collaborative storage schemes, which organize RSUs into clusters to jointly store content for vehicles, have been explored. However, existing collaborative storage solutions in IoV primarily focus on caching content and are not well-suited to the deployment constraints of blockchain networks. Building on blockchain’s decentralized characteristics and data integrity mechanisms, this paper proposes a collaborative storage scheme that reduces RSU storage loads while sustaining distributed ledger operations in SIoV. Specifically, the RSU Access Preference-based Spectral Clustering Algorithm (RAPSCA) is proposed to address RSU clustering by analyzing both the RSUs’ access preferences for blockchain data and their resource availability. Subsequently, the Vehicle Service Priority-based Greedy Block Allocation Algorithm (VSPGBAA) is devised for intra-cluster storage allocation, which considers vehicles’ dwell times and block access probabilities to reduce overall access costs. Experimental results indicate that, compared to baseline algorithms, the proposed method achieves a 27.7% reduction in cost and a 3.5-fold decrease in execution time, thereby demonstrating the feasibility of collaborative storage optimization in blockchain-enabled SIoV.
- Open Access
- 10 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4177
Neighborhood Deviation Attack Against In-Context Learning
In-context learning (ICL) enables large language models (LLMs) to adapt to new tasks using only a few examples, without requiring fine-tuning. However, the new privacy and security risks brought about by this increasing capability have not received enough attention, and there is a lack of research on this issue. In this work, we propose a novel membership inference attack (MIA) method, termed Neighborhood Deviation Attack, specifically designed to evaluate the privacy risks of LLMs in ICL. Unlike traditional MIA methods, our approach does not require access to model parameters and instead relies solely on analyzing the model’s output behavior. We first generate neighborhood prefixes for target samples and use the LLM, conditioned on ICL examples, to complete the text. We then compute the deviation between the original and completed texts and infer membership based on these deviations. We conduct experiments on three datasets and three LLMs and further explore the influence of key hyperparameters on the method’s performance and their underlying reasons. Experimental results show that our method is significantly better than the comparative methods in terms of stability and achieves better accuracy in most cases. Furthermore, we discuss four potential defense strategies, including increasing the diversity of ICL examples and introducing controlled randomness in the inference process to reduce the risk of privacy leakage.
- 10 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (8) , 4177
Open AccessNeighborhood Deviation Attack Against In-Context Learning
In-context learning (ICL) enables large language models (LLMs) to adapt to new tasks using only a few examples, without requiring fine-tuning. However, the new privacy and security risks brought about by this increasing capability have not received enough attention, and there is a lack of research on this issue. In this work, we propose a novel membership inference attack (MIA) method, termed Neighborhood Deviation Attack, specifically designed to evaluate the privacy risks of LLMs in ICL. Unlike traditional MIA methods, our approach does not require access to model parameters and instead relies solely on analyzing the model’s output behavior. We first generate neighborhood prefixes for target samples and use the LLM, conditioned on ICL examples, to complete the text. We then compute the deviation between the original and completed texts and infer membership based on these deviations. We conduct experiments on three datasets and three LLMs and further explore the influence of key hyperparameters on the method’s performance and their underlying reasons. Experimental results show that our method is significantly better than the comparative methods in terms of stability and achieves better accuracy in most cases. Furthermore, we discuss four potential defense strategies, including increasing the diversity of ICL examples and introducing controlled randomness in the inference process to reduce the risk of privacy leakage.
- Open Access
Dynamic Task Allocation for Collaborative Data Collection: A Vehicle–Drone Approach
In recent years, unmanned aerial vehicles (UAVs, also known as drones) have gained widespread application in fields such as data collection and inspection, owing to their lightweight design and high mobility. However, due to limitations in battery life, UAVs are often unable to independently complete large-scale data collection tasks. To address this limitation, vehicle–drone collaborative data collection has emerged as an effective solution. Existing research, however, primarily focuses on collaborative work in static task scenarios, overlooking the complexities of dynamic environments. In dynamic scenarios, tasks may arrive during the execution of both the vehicle and UAV, and each drone has different positions and remaining endurance, creating an asymmetric state. This introduces new challenges for path planning. To tackle this challenge, we propose a 0–1 integer programming model aimed at minimizing the total task completion time. Additionally, we introduce an efficient dynamic solving algorithm, referred to as Greedy and Adaptive Memory Process-based Dynamic Algorithm (GAMPDA). This algorithm first generates an initial global data collection plan based on the initial task nodes and dynamically adjusts the current data collection scheme using a greedy approach as new task nodes arrive during execution. Through comparative experiments, it was demonstrated that GAMPDA outperforms SCAN and LKH in terms of time cost, vehicle travel distance, and drone flight distance and approaches the ideal results. GAMPDA significantly enhances task completion efficiency in dynamic scenarios, providing an effective solution for collaborative data collection tasks in such environments.
Open AccessDynamic Task Allocation for Collaborative Data Collection: A Vehicle–Drone Approach
In recent years, unmanned aerial vehicles (UAVs, also known as drones) have gained widespread application in fields such as data collection and inspection, owing to their lightweight design and high mobility. However, due to limitations in battery life, UAVs are often unable to independently complete large-scale data collection tasks. To address this limitation, vehicle–drone collaborative data collection has emerged as an effective solution. Existing research, however, primarily focuses on collaborative work in static task scenarios, overlooking the complexities of dynamic environments. In dynamic scenarios, tasks may arrive during the execution of both the vehicle and UAV, and each drone has different positions and remaining endurance, creating an asymmetric state. This introduces new challenges for path planning. To tackle this challenge, we propose a 0–1 integer programming model aimed at minimizing the total task completion time. Additionally, we introduce an efficient dynamic solving algorithm, referred to as Greedy and Adaptive Memory Process-based Dynamic Algorithm (GAMPDA). This algorithm first generates an initial global data collection plan based on the initial task nodes and dynamically adjusts the current data collection scheme using a greedy approach as new task nodes arrive during execution. Through comparative experiments, it was demonstrated that GAMPDA outperforms SCAN and LKH in terms of time cost, vehicle travel distance, and drone flight distance and approaches the ideal results. GAMPDA significantly enhances task completion efficiency in dynamic scenarios, providing an effective solution for collaborative data collection tasks in such environments.
- Open Access
Leveraging Multiple Adversarial Perturbation Distances for Enhanced Membership Inference Attack in Federated Learning
In recent years, federated learning (FL) has gained significant attention for its ability to protect data privacy during distributed training. However, it also introduces new privacy leakage risks. Membership inference attacks (MIAs), which aim to determine whether a specific sample is part of the training dataset, pose a significant threat to federated learning. Existing research on membership inference attacks in federated learning has primarily focused on leveraging intrinsic model parameters or manipulating the training process. However, the widespread adoption of privacy-preserving frameworks in federated learning has significantly diminished the effectiveness of traditional attack methods. To overcome this limitation, this paper aims to explore an efficient Membership Inference Attack algorithm tailored for encrypted federated learning scenarios, providing new perspectives for optimizing privacy-preserving technologies. Specifically, this paper proposes a novel Membership Inference Attack algorithm based on multiple adversarial perturbation distances (MAPD_MIA) by leveraging the asymmetry in adversarial perturbation distributions near decision boundaries between member and non-member samples. By analyzing these asymmetric perturbation characteristics, the algorithm achieves accurate membership identification. Experimental results demonstrate that the proposed algorithm achieves accuracy rates of 63.0%, 68.7%, and 59.5%, and precision rates of 59.0%, 65.9%, and 55.8% on CIFAR10, CIFAR100, and MNIST datasets, respectively, outperforming three mainstream Membership Inference Attack methods. Furthermore, the algorithm exhibits robust attack performance against two common defense mechanisms, MemGuard and DP-SGD. This study provides new benchmarks and methodologies for evaluating membership privacy leakage risks in federated learning scenarios.
Open AccessLeveraging Multiple Adversarial Perturbation Distances for Enhanced Membership Inference Attack in Federated Learning
In recent years, federated learning (FL) has gained significant attention for its ability to protect data privacy during distributed training. However, it also introduces new privacy leakage risks. Membership inference attacks (MIAs), which aim to determine whether a specific sample is part of the training dataset, pose a significant threat to federated learning. Existing research on membership inference attacks in federated learning has primarily focused on leveraging intrinsic model parameters or manipulating the training process. However, the widespread adoption of privacy-preserving frameworks in federated learning has significantly diminished the effectiveness of traditional attack methods. To overcome this limitation, this paper aims to explore an efficient Membership Inference Attack algorithm tailored for encrypted federated learning scenarios, providing new perspectives for optimizing privacy-preserving technologies. Specifically, this paper proposes a novel Membership Inference Attack algorithm based on multiple adversarial perturbation distances (MAPD_MIA) by leveraging the asymmetry in adversarial perturbation distributions near decision boundaries between member and non-member samples. By analyzing these asymmetric perturbation characteristics, the algorithm achieves accurate membership identification. Experimental results demonstrate that the proposed algorithm achieves accuracy rates of 63.0%, 68.7%, and 59.5%, and precision rates of 59.0%, 65.9%, and 55.8% on CIFAR10, CIFAR100, and MNIST datasets, respectively, outperforming three mainstream Membership Inference Attack methods. Furthermore, the algorithm exhibits robust attack performance against two common defense mechanisms, MemGuard and DP-SGD. This study provides new benchmarks and methodologies for evaluating membership privacy leakage risks in federated learning scenarios.