Query：
学者姓名：程红举
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
In Internet of Vehicles (IoV), unmanned aerial vehicles (UAVs) assisted mobile edge computing (MEC) can improve the system performance and communication range of intelligent transportation systems (ITSs). However, the resource allocation and computation offloading in UAVs-assisted IoV systems still face huge challenges due to the growing number of vehicle terminals (VTs), potential privacy leakage, and inefficient problem-solving. Existing solutions cannot adapt to such dynamic multi-UAV scenarios and meet the real-time requirements of VTs. To address these challenges, we propose RACOMU, a novel resource allocation and collaborative offloading framework for multi-UAV-assisted IoV. First, we introduce the convex optimization theory to decouple the original problem and then obtain the near-optimal allocation of transmission power and computing resources by solving the Karush-Kuhn-Tucker (KKT) condition. Next, we design a new collaborative offloading strategy with federated deep reinforcement learning (FDRL), where the offloading requests from VTs are processed in a distributed manner to approach the global optimum while preserving data privacy. Extensive experiments verify the effectiveness of the proposed RACOMU. Compared to benchmark methods, RACOMU achieves better performance in terms of task processing latency, decision-making time, and load balancing degree under various scenarios.
Keyword ：
Autonomous aerial vehicles Autonomous aerial vehicles Collaboration Collaboration Computational modeling Computational modeling Computation offloading Computation offloading convex optimization convex optimization Delays Delays Energy consumption Energy consumption federated deep reinforcement learning (FDRL) federated deep reinforcement learning (FDRL) Internet of Vehicles (IoV) Internet of Vehicles (IoV) Real-time systems Real-time systems resource allocation resource allocation Resource management Resource management Servers Servers System performance System performance Training Training
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Zheyi , Huang, Zhiqin , Zhang, Junjie et al. Resource Allocation and Collaborative Offloading in Multi-UAV-Assisted IoV With Federated Deep Reinforcement Learning [J]. | IEEE INTERNET OF THINGS JOURNAL , 2025 , 12 (5) : 4629-4640 . |
| MLA | Chen, Zheyi et al. "Resource Allocation and Collaborative Offloading in Multi-UAV-Assisted IoV With Federated Deep Reinforcement Learning" . | IEEE INTERNET OF THINGS JOURNAL 12 . 5 (2025) : 4629-4640 . |
| APA | Chen, Zheyi , Huang, Zhiqin , Zhang, Junjie , Cheng, Hongju , Li, Jie . Resource Allocation and Collaborative Offloading in Multi-UAV-Assisted IoV With Federated Deep Reinforcement Learning . | IEEE INTERNET OF THINGS JOURNAL , 2025 , 12 (5) , 4629-4640 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
More vehicles are connecting to the Internet of Things (IoT), transforming Vehicle Ad hoc Networks (VANETs) into the Internet of Vehicles (IoV), providing a more environmentally friendly and safer driving experience. Vehicular announcement networks show promise in vehicular communication applications. However, two major issues arise when establishing such a system. Firstly, user privacy cannot be guaranteed when messages are forwarded anonymously, thus the reliability of these messages is in question. Secondly, users often lack interest in responding to announcements. To address these problems, we introduce a Blockchain-based incentive announcement system called PIAS. This system enables anonymous message commitment in a semi-trusted environment and encourages witnesses to respond to requests for traffic information. Additionally, PIAS uses blockchain accounts as identities to participate in the system with incentives, ensuring privacy in anonymous announcements. PIAS successfully protects the privacy of participants and motivates witnesses to respond to requests. Furthermore, our assessment of security and compatibility shows that PIAS can maintain privacy and incentivization while being compatible with both the Bitcoin and Ethereum blockchains. Further evaluation has confirmed the system's efficiency in terms of performance. IEEE
Keyword ：
Authentication Authentication Bitcoin Bitcoin Blockchain Blockchain Blockchains Blockchains Fair Payment Fair Payment Incentive Mechanism Incentive Mechanism Internet of Vehicles Internet of Vehicles Privacy Privacy Privacy Preservation Privacy Preservation Protocols Protocols Reliability Reliability
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhan, Y. , Yang, Y. , Cheng, H. et al. PIAS: Privacy-Preserving Incentive Announcement System based on Blockchain for Internet of Vehicles [J]. | IEEE Transactions on Services Computing , 2024 , 17 (5) : 1-14 . |
| MLA | Zhan, Y. et al. "PIAS: Privacy-Preserving Incentive Announcement System based on Blockchain for Internet of Vehicles" . | IEEE Transactions on Services Computing 17 . 5 (2024) : 1-14 . |
| APA | Zhan, Y. , Yang, Y. , Cheng, H. , Luo, X. , Guan, Z. , Deng, R.H. . PIAS: Privacy-Preserving Incentive Announcement System based on Blockchain for Internet of Vehicles . | IEEE Transactions on Services Computing , 2024 , 17 (5) , 1-14 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With flexible mobility and broad communication coverage, unmanned aerial vehicles (UAVs) have become an important extension of multiaccess edge computing (MEC) systems, exhibiting great potential for improving the performance of federated graph learning (FGL). However, due to the limited computing and storage resources of UAVs, they may not well handle the redundant data and complex models, causing the inference inefficiency of FGL in UAV-assisted MEC systems. To address this critical challenge, we propose a novel LightWeight FGL framework, named LW-FGL, to accelerate the inference speed of classification models in UAV-assisted MEC systems. Specifically, we first design an adaptive information bottleneck (IB) principle, which enables UAVs to obtain well-compressed worthy subgraphs by filtering out the information that is irrelevant to downstream classification tasks. Next, we develop improved tiny graph neural networks (GNNs), which are used as the inference models on UAVs, thus reducing the computational complexity and redundancy. Using real-world graph data sets, extensive experiments are conducted to validate the effectiveness of the proposed LW-FGL. The results show that the LW-FGL achieves higher classification accuracy and faster inference speed than state-of-the-art methods.
Keyword ：
Autonomous aerial vehicles Autonomous aerial vehicles Biological system modeling Biological system modeling Classification inference Classification inference Computational modeling Computational modeling Data models Data models federated graph learning (FGL) federated graph learning (FGL) Graph neural networks Graph neural networks lightweight model lightweight model multiaccess edge computing (MEC) multiaccess edge computing (MEC) Task analysis Task analysis Training Training unmanned aerial vehicle (UAV) unmanned aerial vehicle (UAV)
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhong, Luying , Chen, Zheyi , Cheng, Hongju et al. Lightweight Federated Graph Learning for Accelerating Classification Inference in UAV-Assisted MEC Systems [J]. | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (12) : 21180-21190 . |
| MLA | Zhong, Luying et al. "Lightweight Federated Graph Learning for Accelerating Classification Inference in UAV-Assisted MEC Systems" . | IEEE INTERNET OF THINGS JOURNAL 11 . 12 (2024) : 21180-21190 . |
| APA | Zhong, Luying , Chen, Zheyi , Cheng, Hongju , Li, Jie . Lightweight Federated Graph Learning for Accelerating Classification Inference in UAV-Assisted MEC Systems . | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (12) , 21180-21190 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Sentiment analysis plays an indispensable part in human-computer interaction. Multimodal sentiment analysis can overcome the shortcomings of unimodal sentiment analysis by fusing multimodal data. However, how to extracte improved feature representations and how to execute effective modality fusion are two crucial problems in multimodal sentiment analysis. Traditional work uses simple sub-models for feature extraction, and they ignore features of different scales and fuse different modalities of data equally, making it easier to incorporate extraneous information and affect analysis accuracy. In this paper, we propose a Multimodal Sentiment Analysis model based on Multi-scale feature extraction and Multi-task learning (M(3)SA). First, we propose a multi-scale feature extraction method that models the outputs of different hidden layers with the method of channel attention. Second, a multimodal fusion strategy based on the key modality is proposed, which utilizes the attention mechanism to raise the proportion of the key modality and mines the relationship between the key modality and other modalities. Finally, we use the multi-task learning approach to train the proposed model, ensuring that the model can learn better feature representations. Experimental results on two publicly available multimodal sentiment analysis datasets demonstrate that the proposed method is effective and that the proposed model outperforms baselines.
Keyword ：
multimodal data fusion multimodal data fusion Multimodal sentiment analysis Multimodal sentiment analysis multi-scale feature extraction multi-scale feature extraction Multitasking Multitasking multi-task learning multi-task learning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Changkai , Cheng, Hongju , Rao, Qiang et al. M3SA: Multimodal Sentiment Analysis Basedon Multi-Scale Feature Extraction andMulti-Task Learning [J]. | IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING , 2024 , 32 : 1416-1429 . |
| MLA | Lin, Changkai et al. "M3SA: Multimodal Sentiment Analysis Basedon Multi-Scale Feature Extraction andMulti-Task Learning" . | IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 32 (2024) : 1416-1429 . |
| APA | Lin, Changkai , Cheng, Hongju , Rao, Qiang , Yang, Yang . M3SA: Multimodal Sentiment Analysis Basedon Multi-Scale Feature Extraction andMulti-Task Learning . | IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING , 2024 , 32 , 1416-1429 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
As a key technique for future networks, the performance of emerging multi-edge caching is often limited by inefficient collaboration among edge nodes and improper resource configuration. Meanwhile, achieving optimal cache hit rates poses substantive challenges without effectively capturing the potential relations between discrete user features and diverse content libraries. These challenges become further sophisticated when caching schemes are exposed to adversarial attacks that seriously impair cache performance. To address these challenges, we introduce RoCoCache, a resilient collaborative caching framework that uniquely integrates robust federated deep learning with proactive caching strategies, enhancing performance under adversarial conditions. First, we design a novel partitioning mechanism for multi-dimensional cache space, enabling precise content recommendations in user classification intervals. Next, we develop a new Discrete-Categorical Variational Auto-Encoder (DC-VAE) to accurately predict content popularity by overcoming posterior collapse. Finally, we create an original training mode and proactive cache replacement strategy based on robust federated deep learning. Notably, the residual-based detection for adversarial model updates and similarity-based federated aggregation are integrated to avoid the model destruction caused by adversarial updates, which enables the proactive cache replacement adapting to optimized cache resources and thus enhances cache performance. Using the real-world testbed and datasets, extensive experiments verify that the RoCoCache achieves higher cache hit rates and efficiency than state-of-the-art methods while ensuring better robustness. Moreover, we validate the effectiveness of the components designed in RoCoCache for improving cache performance via ablation studies.
Keyword ：
cache space partitioning cache space partitioning content popularity prediction content popularity prediction Multi-edge collaborative caching Multi-edge collaborative caching proactive cache replacement proactive cache replacement robust federated deep learning robust federated deep learning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Zheyi , Liang, Jie , Yu, Zhengxin et al. Resilient Collaborative Caching for Multi-Edge Systems With Robust Federated Deep Learning [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| MLA | Chen, Zheyi et al. "Resilient Collaborative Caching for Multi-Edge Systems With Robust Federated Deep Learning" . | IEEE-ACM TRANSACTIONS ON NETWORKING (2024) . |
| APA | Chen, Zheyi , Liang, Jie , Yu, Zhengxin , Cheng, Hongju , Min, Geyong , Li, Jie . Resilient Collaborative Caching for Multi-Edge Systems With Robust Federated Deep Learning . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
More vehicles are connecting to the Internet of Things (IoT), transforming Vehicle Ad hoc Networks (VANETs) into the Internet of Vehicles (IoV), providing a more environmentally friendly and safer driving experience. Vehicular announcement networks show promise in vehicular communication applications. However, two major issues arise when establishing such a system. First, user privacy cannot be guaranteed when messages are forwarded anonymously, thus the reliability of these messages is in question. Second, users often lack interest in responding to announcements. To address these problems, we introduce a Blockchain-based incentive announcement system called PIAS. This system enables anonymous message commitment in a semi-trusted environment and encourages witnesses to respond to requests for traffic information. Additionally, PIAS uses blockchain accounts as identities to participate in the system with incentives, ensuring privacy in anonymous announcements. PIAS successfully protects the privacy of participants and motivates witnesses to respond to requests. Furthermore, our assessment of security and compatibility shows that PIAS can maintain privacy and incentivization while being compatible with both the Bitcoin and Ethereum blockchains. Further evaluation has confirmed the system's efficiency in terms of performance.
Keyword ：
Authentication Authentication Bitcoin Bitcoin blockchain blockchain Blockchains Blockchains fair payment fair payment incentive mechanism incentive mechanism Internet of Vehicles Internet of Vehicles Internet of Vehicles (IoV) Internet of Vehicles (IoV) Privacy Privacy privacy preservation privacy preservation Protocols Protocols Reliability Reliability
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhan, Yonghua , Yang, Yang , Cheng, Hongju et al. PIAS: Privacy-Preserving Incentive Announcement System Based on Blockchain for Internet of Vehicles [J]. | IEEE TRANSACTIONS ON SERVICES COMPUTING , 2024 , 17 (5) : 2762-2775 . |
| MLA | Zhan, Yonghua et al. "PIAS: Privacy-Preserving Incentive Announcement System Based on Blockchain for Internet of Vehicles" . | IEEE TRANSACTIONS ON SERVICES COMPUTING 17 . 5 (2024) : 2762-2775 . |
| APA | Zhan, Yonghua , Yang, Yang , Cheng, Hongju , Luo, Xiangyang , Guan, Zhangshuang , Deng, Robert H. . PIAS: Privacy-Preserving Incentive Announcement System Based on Blockchain for Internet of Vehicles . | IEEE TRANSACTIONS ON SERVICES COMPUTING , 2024 , 17 (5) , 2762-2775 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Edge computing is an emerging promising computing paradigm, which can significantly reduce the service latency by moving computing and storage demands to the edge of the network. Resource -constrained edge servers may fail to process multiple tasks simultaneously when several time -delay -sensitive and computationally demanding tasks are offloaded to only one edge server, and results in some issues such as high task processing costs. In this paper, we introduce a novel idea by dividing one task into several sub -tasks via the dependencies within the task and then offloading the sub -tasks to other edge servers in light of high concurrency for synchronization to minimize the total cost of task processing. To address the challenge of task dependencies and adaptation to dynamic scenes, we propose a Multi -Task Dependency Offloading Algorithm (MTDOA) based on deep reinforcement learning. The task offloading decision is modeled as a Markov decision process, and then a graph attention network is applied to extract the dependency information of different tasks, while LSTM and DQN are combined to deal with sequential problems. The simulation results show that the proposed MTDOA has better convergence ability compared with the baseline algorithms.
Keyword ：
Deep reinforcement learning Deep reinforcement learning Edge computing Edge computing Graph attention network Graph attention network Multi-task dependency Multi-task dependency Task offloading Task offloading
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Xiaoqi , Lin, Tengxiang , Lin, Cheng-Kuan et al. Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency [J]. | THEORETICAL COMPUTER SCIENCE , 2024 , 993 . |
| MLA | Zhang, Xiaoqi et al. "Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency" . | THEORETICAL COMPUTER SCIENCE 993 (2024) . |
| APA | Zhang, Xiaoqi , Lin, Tengxiang , Lin, Cheng-Kuan , Chen, Zhen , Cheng, Hongju . Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency . | THEORETICAL COMPUTER SCIENCE , 2024 , 993 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Natural disasters often have an unpredictable impact on human society and can even cause significant problems, such as damage to communication equipment in disaster areas. In such post-disaster emergency rescue situations, unmanned aerial vehicles (UAVs) are considered an effective tool by virtue of high mobility, easy deployment, and flexible communication. However, the limited size of UAVs leads to bottlenecks in battery capacity and computational power, making it challenging to perform overly complex computational tasks. In this paper, we propose a UAV cluster-assisted task-offloading model for disaster areas, by adopting UAV clusters as aerial mobile edge servers to provide task-offloading services for ground users. In addition, we also propose a deep reinforcement learning-based UAV cluster-assisted task-offloading algorithm (DRL-UCTO). By modeling the energy efficiency optimization problem of the system model as a Markov decision process and jointly optimizing the UAV flight trajectory and task-offloading policy to maximize the reward value, DRL-UCTO can effectively improve the energy use efficiency of UAVs under limited-resource conditions. The simulation results show that the DRL-UCTO algorithm improves the UAV energy efficiency by about 79.6% and 301.1% compared with the DQN and Greedy algorithms, respectively.
Keyword ：
deep reinforcement learning deep reinforcement learning emergent disaster scenarios emergent disaster scenarios task offloading task offloading trajectory optimization trajectory optimization UAV cluster UAV cluster
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Shi, Minglin , Zhang, Xiaoqi , Chen, Jia et al. UAV Cluster-Assisted Task Offloading for Emergent Disaster Scenarios [J]. | APPLIED SCIENCES-BASEL , 2023 , 13 (8) . |
| MLA | Shi, Minglin et al. "UAV Cluster-Assisted Task Offloading for Emergent Disaster Scenarios" . | APPLIED SCIENCES-BASEL 13 . 8 (2023) . |
| APA | Shi, Minglin , Zhang, Xiaoqi , Chen, Jia , Cheng, Hongju . UAV Cluster-Assisted Task Offloading for Emergent Disaster Scenarios . | APPLIED SCIENCES-BASEL , 2023 , 13 (8) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Many existing searchable encryption schemes are inflexible in retrieval patterns. The data usage authorization is almost permanent valid as long as the user is not revoked. This "all-or-nothing" authorization mode is not compatible with the "pay-as-you-use" commercial billing model. In this article, we propose a new notion called time controlled expressive predicate query with accountable anonymity. It realizes time controlled data query, where a time server issues time token to authorize search privilege in designated time period. The data users can anonymously query on encrypted data and the anonymity is accountable in a way that the trusted authority is able to deanonymize data users if they misbehave in the system. The underlying techniques are anonymous credential, Pederson commitment and non-interactive zero-knowledge proof. We firstly design an efficient expressive predicate query (EPQ) scheme, which is proved secure to protect the privacy of expressive search predicate. Based on EPQ, we present a concrete system instantiation, which realizes key-escrow free and time token nontransferability. The formal definition and security models are given out. The system is formally proved indistinguishable against chosen keyword-set attacks, unforgeable of time tokens and accountable of anonymous users. The comparison and experiment results demonstrate its scalability and efficiency.
Keyword ：
accountable accountable anonymity anonymity Authorization Authorization Cloud computing Cloud computing Encryption Encryption expressive keyword search expressive keyword search Keyword search Keyword search Protocols Protocols Public key Public key Searchable encryption Searchable encryption Servers Servers time control time control zero-knowledge proof zero-knowledge proof
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Yang , Rong, Chunming , Zheng, Xianghan et al. Time Controlled Expressive Predicate Query With Accountable Anonymity [J]. | IEEE TRANSACTIONS ON SERVICES COMPUTING , 2023 , 16 (2) : 1444-1457 . |
| MLA | Yang, Yang et al. "Time Controlled Expressive Predicate Query With Accountable Anonymity" . | IEEE TRANSACTIONS ON SERVICES COMPUTING 16 . 2 (2023) : 1444-1457 . |
| APA | Yang, Yang , Rong, Chunming , Zheng, Xianghan , Cheng, Hongju , Chang, Victor , Luo, Xiangyang et al. Time Controlled Expressive Predicate Query With Accountable Anonymity . | IEEE TRANSACTIONS ON SERVICES COMPUTING , 2023 , 16 (2) , 1444-1457 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this article, we propose dual traceable distributed attribute based encryption with subset keyword search system (DTDABE-SKS, abbreviated as DT) to simultaneously realize data source trace (secure provenance) and user trace (traitor trace) and flexible subset keyword search from polynomial interpolation. Leveraging non-interactive zero-knowledge proof technology, DT preserves privacy for both data providers and users in normal circumstances, but a trusted authority can disclose their real identities if necessary, such as the providers deceitfully uploading false data or users maliciously leaking secret attribute key. Next, we introduce the new conception of updatable and transferable message-lock encryption (UT-MLE) for block-level dynamic encrypted file update, where the owner does not have to download the whole ciphertext, decrypt, re-encrypt and upload for minor document modifications. In addition, the owner is permitted to transfer file ownership to other system customers with efficient computation in an authenticated manner. A nontrivial integration of DT and UT-MLE lead to the distributed ABSE with ownership transfer system (DTOT) to enjoy the above merits. We formally define DT, UT-MLE, and their security model. Then, the instantiations of DT and UT-MLE, and the formal security proof are presented. Comprehensive comparison and experimental analysis based on real dataset affirm their feasibility.
Keyword ：
ABE ABE Cloud computing Cloud computing Data privacy Data privacy Distributed databases Distributed databases Dual traceability Dual traceability Encryption Encryption Hospitals Hospitals Keyword search Keyword search Maximum likelihood estimation Maximum likelihood estimation ownership transferable ownership transferable searchable encryption searchable encryption updatable MLE updatable MLE
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Yang , Deng, Robert H. , Guo, Wenzhong et al. Dual Traceable Distributed Attribute-Based Searchable Encryption and Ownership Transfer [J]. | IEEE TRANSACTIONS ON CLOUD COMPUTING , 2023 , 11 (1) : 247-262 . |
| MLA | Yang, Yang et al. "Dual Traceable Distributed Attribute-Based Searchable Encryption and Ownership Transfer" . | IEEE TRANSACTIONS ON CLOUD COMPUTING 11 . 1 (2023) : 247-262 . |
| APA | Yang, Yang , Deng, Robert H. , Guo, Wenzhong , Cheng, Hongju , Luo, Xiangyang , Zheng, Xianghan et al. Dual Traceable Distributed Attribute-Based Searchable Encryption and Ownership Transfer . | IEEE TRANSACTIONS ON CLOUD COMPUTING , 2023 , 11 (1) , 247-262 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
