VLDB 2026 Research / reviewers in the wild / expert
Jinbo Wen
dblp:343/4311
· DBLP profile ↗
15ranked-venue papers
5as first author
15since 2021 · last 2026
0009-0002-6567-7277ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 10 · 3 first-author · 10 since 2021Security and privacy · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MedAlign: A Synergistic Framework of Multimodal Preference Optimization and Federated Metacognitive ReasoningabstractRecently, large models have shown significant potential for smart healthcare. However, the deployment of Large Vision-Language Models (LVLMs) for clinical services is currently hindered by three critical challenges: a tendency to hallucinate answers not grounded in visual evidence, the inefficiency of fixed-depth reasoning, and the difficulty of multi-institutional collaboration. To address these challenges, in this paper, we develop MedAlign, a novel framework to ensure visually accurate LVLM responses for Medical Visual Question Answering (Med-VQA). Specifically, we first propose a multimodal Direct Preference Optimization (mDPO) objective to explicitly align preference learning with visual context. We then design a Retrieval-Aware Mixture-of-Experts (RA-MoE) architecture that utilizes image and text similarity to route queries to a specialized and context-augmented LVLM (i.e., an expert), thereby mitigating hallucinations in LVLMs. To achieve adaptive reasoning and facilitate multi-institutional collaboration, we propose a federated governance mechanism, where the selected expert, fine-tuned on clinical datasets based on mDPO, locally performs iterative Chain-of-Thought (CoT) reasoning via the local meta-cognitive uncertainty estimator. Extensive experiments on three representative Med-VQA datasets demonstrate that MedAlign achieves state-of-the-art performance, outperforming strong retrieval-augmented baselines by up to 11.85% in F1-score, and simultaneously reducing the average reasoning length by 51.60% compared with fixed-depth CoT approaches. Siyong Chen, Jinbo Wen, Jiawen Kang 0001, Tenghui Huang, Xumin Huang, Yuanjia Su, Hudan Pan, Zishao Zhong, Shengli Xie 0001, Dong In Kim 0001 |
IEEE Internet Things J. | 2 |
| 2026 | Defending Against Network Attacks for Secure AI Agent Migration in Vehicular MetaversesabstractVehicular metaverses, blending traditional vehicular networks with metaverse technology, are expected to revolutionize fields such as autonomous driving. As virtual intelligent assistants in vehicular metaverses, Artificial Intelligence (AI) agents empowered by large language models can create immersive 3D virtual spaces for passengers to enjoy on-board vehicular applications and services. To provide users with seamless and engaging virtual interactions, resource-limited vehicles offload AI agents to RoadSide Units (RSUs) with adequate communication and computational capabilities. Due to the mobility of vehicles and the limited coverage of RSUs, AI agents need to migrate from one RSU to another. However, potential network attacks pose significant challenges to ensuring reliable and efficient AI agent migration. In this paper, we first explore specific network attacks, including traffic-based attacks (i.e., DDoS attacks) and infrastructure-based attacks (i.e., malicious RSU attacks). Then, we model the AI agent migration process as a Partially Observable Markov Decision Process (POMDP) and apply multi-agent proximal policy optimization algorithms to mitigate DDoS attacks. In addition, we propose a trust assessment mechanism to counter malicious RSU attacks. Numerical results demonstrate that the proposed solutions effectively defend against these network attacks and reduce the total latency of AI agent migration by approximately 12.8%. Xinru Wen, Jinbo Wen, Ming Xiao 0001, Jiawen Kang 0001, Tao Zhang 0063, Xiaohuan Li 0001, Chuanxi Chen, Dusit Niyato |
IEEE Internet Things J. | 2 |
| 2026 | ParaVul: A Parallel Large Language Model and Retrieval-Augmented Framework for Smart Contract Vulnerability DetectionabstractSmart contracts play a significant role in automating blockchain services. Nevertheless, vulnerabilities in smart contracts pose serious threats to blockchain security. Currently, traditional detection methods primarily rely on static analysis and formal verification, which can result in high false-positive rates and poor scalability. Large Language Models (LLMs) have recently made significant progress in smart contract vulnerability detection. However, they still face challenges such as high inference costs and substantial computational overhead. In this paper, we propose ParaVul, a parallel LLM and retrievalaugmented framework to improve the reliability and accuracy of smart contract vulnerability detection. Specifically, we first develop Sparse Low-Rank Adaptation (SLoRA), a technique for efficient LLM fine-tuning tailored to smart contract vulnerability detection. Distinct from existing LoRA methods, SLoRA inserts parallel sparse and low-rank branches after the attention projection and the feed-forward block, enabling LLMs to capture both global code semantics and localized vulnerability patterns while maintaining low training overhead. We then construct a vulnerability contract knowledge base and develop a hybrid Retrieval-Augmented Generation (RAG) system that integrates Okapi BM25 with dense retrieval to provide complementary lexical and semantic evidence for smart contract vulnerability verification. Furthermore, we propose a meta-learner-based gated verification module to fuse the outputs of the SLoRA detector and the two RAG-based detectors, thereby generating the final detection results. After completing vulnerability detection, we design chain-of-thought prompts to guide LLMs to generate comprehensive vulnerability detection reports. Simulation results demonstrate the superiority of ParaVul, especially in terms of F1 scores, achieving 0.9398 for single-label detection and 0.9930 for multi-label detection. Tenghui Huang, Jinbo Wen, Jiawen Kang 0001, Siyong Chen, Zhengtao Li, Tao Zhang 0063, Dongning Liu, Jiacheng Wang 0001, Chengjun Cai, Yinqiu Liu |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2026 | HybridRAG-Based LLM Agents for Low-Carbon Optimization in Low-Altitude Economy NetworksabstractLow-Altitude Economy Networks (LAENets) are emerging as a promising paradigm to support various low-altitude services through integrated air-ground infrastructure. To satisfy low-latency and high-computation demands, the integration of Unmanned Aerial Vehicles (UAVs) with Mobile Edge Computing (MEC) systems plays a vital role, which offloads computing tasks from terminal devices to nearby UAVs, enabling flexible and resilient service provisions for ground users. To promote the development of LAENets, it is significant to achieve low-carbon multi-UAV-assisted MEC networks. However, several challenges hinder this implementation, including the complexity of multi-dimensional UAV modeling and the difficulty of multi-objective coupled optimization. To this end, this paper proposes a novel Retrieval Augmented Generation (RAG)-based Large Language Model (LLM) agent framework for model formulation. Specifically, we develop HybridRAG by combining KeywordRAG, VectorRAG, and GraphRAG, empowering LLM agents to efficiently retrieve structural information from expert databases and generate more accurate optimization problems compared with traditional RAG-based LLM agents. After customizing carbon emission optimization problems for multi-UAV-assisted MEC networks, we propose a Double Regularization Diffusion-enhanced Soft Actor-Critic (R2DSAC) algorithm to solve the formulated multi-objective optimization problem. The R2DSAC algorithm incorporates diffusion entropy regularization and action entropy regularization to improve the performance of the diffusion policy. Furthermore, we dynamically mask unimportant neurons in the actor network to reduce the carbon emissions associated with model training. Simulation results demonstrate the reliability of the proposed HybridRAG-based LLM agent framework, which achieves a$6.6\%$improvement in F1 scores over traditional RAG, and validate the effectiveness of the R2DSAC algorithm, which outperforms the SAC algorithm by up to$64.17\%$. Jinbo Wen, Jiawen Kang 0001, Jiangtian Nie, Yang Zhang 0025, Jianhang Tang, Dusit Niyato, Chau Yuen |
IEEE Trans. Mob. Comput. | 1 |
| 2026 | Multi-Agent DRL for Multi-Objective Twin Migration Routing With Workload Prediction in 6G-Enabled IoVabstractSixth Generation (6G)-enabled Internet of Vehicles (IoV) facilitates efficient data synchronization through ultra-fast bandwidth and high-density connectivity, enabling the emergence of Vehicle Twins (VTs). As highly accurate replicas of vehicles, VTs can support intelligent vehicular applications for occupants in 6G-enabled IoV. Thanks to the full coverage capability of 6G, resource-constrained vehicles can offload VTs to edge servers, such as roadside units, unmanned aerial vehicles, and satellites, utilizing their computing and storage resources for VT construction and updates. However, communication between vehicles and edge servers with limited coverage is prone to interruptions due to the dynamic mobility of vehicles. Consequently, VTs must be migrated among edge servers to maintain uninterrupted and high-quality services for users. In this paper, we introduce a VT migration framework in 6G-enabled IoV. Specifically, we first propose a Long Short-Term Memory (LSTM)-based Transformer model to accurately predict long-term workloads of edge servers for migration decision-making. Then, we propose a Dynamic Mask Multi-Agent Proximal Policy Optimization (DM-MAPPO) algorithm to identify optimal migration routes in the highly complex environment of 6G-enabled IoV. Finally, we develop a practical platform to validate the effectiveness of the proposed scheme using real datasets. Simulation results demonstrate that the proposed DM-MAPPO algorithm significantly reduces migration latency by$20.82\%$and packet loss by$75.07\%$compared with traditional deep reinforcement learning algorithms. Wentao Liang, Jinbo Wen, Jiawen Kang 0001, Dusit Niyato |
IEEE Trans. Mob. Comput. | 3 |
| 2026 | Diffusion-Based Dynamic Contract for Federated AI Agent Construction in Mobile MetaversesabstractMobile metaverses are envisioned as a transformative digital ecosystem that delivers immersive, intelligent, and ubiquitous services through mobile devices. Driven by Large Language Models (LLMs) and Vision-Language Models (VLMs), Artificial Intelligence (AI) agents hold the potential to empower the creation, maintenance, and evolution of mobile metaverses, enabling seamless human-machine interaction and dynamic service adaptation. Currently, AI agents are primarily built upon cloud-based LLMs and VLMs. However, several challenges hinder their efficient deployment, including high service latency and a risk of sensitive data leakage during perception and processing. In this paper, we develop an edge-cloud collaboration-based federated AI agent construction framework in mobile metaverses. Specifically, Edge Servers (ESs), as agent infrastructures, first create agent modules in a distributed manner. The cloud server then integrates these modules into AI agents and deploys them at the edge, thereby enabling low-latency AI agent services for users. Considering that ESs may exhibit dynamic levels of willingness to participate in federated AI agent construction, we design a two-period dynamic contract model to continuously incentivize ESs to participate in agent module creation, effectively addressing the dynamic information asymmetry between the cloud server and ESs. Furthermore, we propose an Enhanced Diffusion Model-based Soft Actor-Critic (EDMSAC) algorithm to effectively generate optimal dynamic contracts. In the algorithm, we apply dynamic structured pruning to DM-based actor networks to enhance denoising efficiency and policy learning performance. Simulation results demonstrate that the EDMSAC algorithm outperforms the DMSAC algorithm by up to 23% in optimal dynamic contract generation. Jinbo Wen, Jiawen Kang 0001, Yang Zhang 0025, Dusit Niyato, Jie Xu 0002, Jianhang Tang, Chau Yuen |
IEEE Trans. Serv. Comput. | 1 |
| 2025 | Learning-based Power Control for Secure Covert Semantic CommunicationabstractSemantic Communication (SemCom), as a next-generation communication technology, promises to enhance message delivery efficiency while reducing network resource consumption. Despite progress in SemCom, research on SemCom security is still in its infancy. To bridge this gap, we propose a general covert SemCom framework for wireless networks, which introduces the application of covert communications aided by a friendly jammer, thereby reducing the risk of eavesdropping. Our approach transmits semantic information covertly, making it difficult for wardens to detect. Given the aim of maximizing covert SemCom performance, we formulate a power control problem in covert SemCom under energy constraints. Furthermore, we propose a learning-based approach based on the soft actor-critic algorithm, optimizing the power of the transmitter and the friendly jammer. Our numerical findings substantiate the efficacy of our proposed approach in bolstering covert SemCom performance. Yansheng Liu, Jinbo Wen, Zongyao Zhang, Kun Zhu 0001, Yang Zhang 0025, Jiangtian Nie, Jiawen Kang 0001 |
IWCMC | 2 |
| 2025 | Hybrid RAG-Empowered Multimodal LLM for Secure Data Management in Internet of Medical Things: A Diffusion-Based Contract ApproachabstractSecure data management and effective data sharing have become paramount in the rapidly evolving healthcare landscape, especially with the growing demand for the Internet of Medical Things (IoMT) integration. The advent of generative artificial intelligence (GenAI) has further elevated multimodal large language models (MLLMs) as essential tools for managing and optimizing healthcare data in IoMT. MLLMs can handle multimodal inputs and generate different kinds of data by utilizing large-scale training on massive multimodal datasets. Nevertheless, significant challenges remain in developing medical MLLMs, especially security and data freshness concerns, which impact the quality of MLLM outputs. To this end, this article proposes a hybrid Retrieval-Augmented Generation (RAG)-empowered medical MLLM framework for healthcare data management. The proposed framework enables secure data training by utilizing a hierarchical cross-chain design. Furthermore, it improves the output quality of MLLMs by using hybrid RAG that filters different unimodal RAG results using multimodal metrics and integrates these retrieval results as additional inputs for MLLMs. Furthermore, we utilize the age of information (AoI) to indirectly assess the influence of data freshness on MLLMs and apply contract theory to motivate healthcare data stakeholders to disseminate their current data, thereby alleviating information asymmetry in the data-sharing process. Finally, we employ a generative diffusion model-based deep reinforcement learning (DRL) technique to find the optimal contract for efficient data sharing. Numerical results show the effectiveness of the proposed approach in achieving secure and efficient healthcare data management. Jinbo Wen, Jiawen Kang 0001, Yonghua Wang 0001, Yuanjia Su, Hudan Pan, Zishao Zhong, M. Shamim Hossain |
IEEE Internet Things J. | 2 |
| 2025 | Efficient and Trustworthy Block Propagation for Blockchain-Enabled Mobile Embodied AI Networks: A Graph Resfusion ApproachabstractBy synergistically integrating mobile networks and embodied artificial intelligence (AI),mobileembodiedAInetworks (MEANETs) represent an advanced paradigm that facilitates autonomous, context-aware, and interactive behaviors within dynamic environments. Nevertheless, the rapid development of MEANETs is accompanied by challenges in trustworthiness and operational efficiency. Fortunately, blockchain technology, with its decentralized and immutable characteristics, offers promising solutions for MEANETs. However, existing block propagation mechanisms suffer from challenges such as low propagation efficiency and weak security for block propagation, which results in delayed transmission of messages or vulnerability to malicious tampering, potentially causing severe accidents in blockchain-enabled MEANETs. Moreover, current block propagation strategies cannot effectively adapt to real-time changes of dynamic topology in MEANETs. Therefore, in this paper, we propose a graph Resfusion model-based trustworthy block propagation optimization framework for consortium blockchain-enabled MEANETs. Specifically, we propose an innovative trust calculation mechanism based on the trust cloud model, which comprehensively accounts for randomness and fuzziness in the validator trust evaluation. Furthermore, by leveraging the strengths of graph neural networks and diffusion models, we develop a graph Resfusion model to effectively and adaptively generate the optimal block propagation trajectory. Simulation results demonstrate that the proposed model outperforms other routing mechanisms in terms of block propagation efficiency and trustworthiness. Additionally, the results highlight its strong adaptability to dynamic environments, making it particularly suitable for rapidly changing MEANETs. Jiawen Kang 0001, Jiana Liao, Runquan Gao, Jinbo Wen, Huawei Huang, Maomao Zhang 0001, Changyan Yi, Tao Zhang 0063, Dusit Niyato, Zibin Zheng |
IEEE Trans. Mob. Comput. | 4 |
| 2025 | Generative Diffusion-Based Contract Design for Efficient AI Twin Migration in Vehicular Embodied AI NetworksabstractEmbodied Artificial Intelligence (AI) bridges the cyberspace and the physical space, driving advancements in autonomous systems like theVehicularEmbodiedAINETwork (VEANET). VEANET integrates advanced AI capabilities into vehicular systems to enhance autonomous operations and decision-making. Embodied agents, such as Autonomous Vehicles (AVs), are autonomous entities that can perceive their environment and take actions to achieve specific goals, actively interacting with the physical world. Embodied Agent Twins (EATs) are digital models of these embodied agents, with various Embodied Agent AI Twins (EAATs) for intelligent applications in cyberspace. In VEANETs, EAATs act as in-vehicle AI assistants to perform diverse tasks supporting autonomous driving using generative AI models. Due to limited onboard computational resources, AVs offload EAATs to nearby RoadSide Units (RSUs). However, the mobility of AVs and limited RSU coverage necessitates dynamic migrations of EAATs, posing challenges in selecting suitable RSUs under information asymmetry. To address this, we construct a multi-dimensional contract theoretical model between AVs and alternative RSUs. Considering that AVs may exhibit irrational behavior, we utilize prospect theory instead of expected utility theory to model the actual utilities of AVs. Finally, we employ a Generative Diffusion Model (GDM)-based algorithm to identify the optimal contract designs, thus enhancing the efficiency of EAAT migrations. Numerical results demonstrate the superior efficiency of the proposed GDM-based scheme in facilitating EAAT migrations compared with traditional deep reinforcement learning methods. Jiawen Kang 0001, Jinbo Wen, Dongdong Ye, Jiangtian Nie, Dusit Niyato, Xiaozheng Gao, Shengli Xie 0001 |
IEEE Trans. Mob. Comput. | 3 |
| 2024 | Learning-based Big Data Sharing Incentive in Mobile AIGC NetworksabstractRapid advancements in wireless communication have led to a dramatic upsurge in data volumes within mobile edge networks. These substantial data volumes offer opportunities for training Artificial Intelligence-Generated Content (AIGC) models to possess strong prediction and decision-making capabilities. AIGC represents an innovative approach that utilizes sophisticated generative AI algorithms to automatically generate diverse content based on user inputs. Leveraging mobile edge networks, mobile AIGC networks enable customized and real-time AIGC services for users by deploying AIGC models on edge devices. Nonetheless, several challenges hinder the provision of high-quality AIGC services, including issues related to the quality of sensing data for AIGC model training and the establishment of incentives for big data sharing from mobile devices to edge devices amidst information asymmetry. In this paper, we initially define a Quality of Data (QoD) metric based on the age of information to quantify the quality of sensing data. Subsequently, we propose a contract theoretic model aimed at motivating mobile devices for big data sharing. Furthermore, we employ a Proximal Policy Optimization (PPO) algorithm to determine the optimal contract. Numerical results demonstrate the efficacy and reliability of the proposed PPO-based contract model. Jinbo Wen, Yang Zhang 0025, Weifeng Zhong, Xumin Huang, Lei Liu 0031, Dusit Niyato |
GLOBECOM | 1 |
| 2024 | Optimizing Information Propagation for Blockchain-empowered Mobile AIGC: A Graph Attention Network ApproachabstractArtificial Intelligence-Generated Content (AIGC) is a rapidly evolving field that utilizes advanced AI algorithms to generate content. Through integration with mobile edge networks, mobile AIGC networks have gained significant attention, which can provide real-time customized and personalized AIGC services and products. Since blockchains can facilitate decentralized and transparent data management, AIGC products can be securely managed by blockchain to avoid tampering and plagiarization. However, the evolution of blockchain-empowered mobile AIGC is still in its nascent phase, grappling with challenges such as improving information propagation efficiency to enable blockchain-empowered mobile AIGC. In this paper, we design a Graph Attention Network (GAT)-based information propagation optimization framework for blockchain-empowered mobile AIGC. We first innovatively apply age of information as a data-freshness metric to measure information propagation efficiency in public blockchains. Considering that GATs possess the excellent ability to process graph-structured data, we utilize the GAT to obtain the optimal information propagation trajectory. Numerical results demonstrate that the proposed scheme exhibits the most outstanding information propagation efficiency compared with traditional routing mechanisms. Jiana Liao, Jinbo Wen, Jiawen Kang 0001, Yang Zhang 0025, Jianbo Du, Qihao Li, Weiting Zhang, Dong Yang 0001 |
IWCMC | 2 |
| 2024 | Tiny Multiagent DRL for Twins Migration in UAV Metaverses: A Multileader Multifollower Stackelberg Game ApproachabstractThe synergy between Unmanned Aerial Vehicles (UAVs) and metaverses is giving rise to an emerging paradigm named UAV metaverses, which create a unified ecosystem that blends physical and virtual spaces, transforming drone interaction and virtual exploration. UAV Twins (UTs), as the digital twins of UAVs that revolutionize UAV applications by making them more immersive, realistic, and informative, are deployed and updated on ground base stations, e.g., RoadSide Units (RSUs), to offer metaverse services for UAV Metaverse Users (UMUs). Due to the dynamic mobility of UAVs and limited communication coverages of RSUs, it is essential to perform real-time UT migration to ensure seamless immersive experiences for UMUs. However, selecting appropriate RSUs and optimizing the required bandwidth is challenging for achieving reliable and efficient UT migration. To address the challenges, we propose a tiny machine learning-based Stackelberg game framework based on pruning techniques for efficient UT migration in UAV metaverses. Specifically, we formulate a multi-leader multifollower Stackelberg model considering a new immersion metric of UMUs in the utilities of UAVs. Then, we design a Tiny Multi-Agent Deep Reinforcement Learning (Tiny MADRL) algorithm to obtain the tiny networks representing the optimal game solution. Specifically, the actor-critic network leverages the pruning techniques to reduce the number of network parameters and achieve model size and computation reduction, allowing for efficient implementation of Tiny MADRL. Numerical results demonstrate that our proposed schemes have better performance than traditional schemes. Jiawen Kang 0001, Minrui Xu, Jiangtian Nie, Jinbo Wen, Hongyang Du 0001, Dongdong Ye, Xumin Huang, Dusit Niyato, Shengli Xie 0001 |
IEEE Internet Things J. | 5 |
| 2024 | Diffusion-Model-Based Incentive Mechanism With Prospect Theory for Edge AIGC Services in 6G IoTabstractThe fusion of the Internet of Things (IoT) with sixth-generation (6G) technology has significant potential to revolutionize the IoT landscape. With the ultrareliable and low-latency communication capabilities of 6G, 6G-IoT networks can transmit high-quality and diverse data to enhance edge learning. Artificial intelligence-generated content (AIGC) harnesses advanced artificial intelligence (AI) algorithms to automatically generate various types of content. The emergence of edge AIGC integrates with edge networks, facilitating real-time provision of customized AIGC services by deploying AIGC models on edge devices. However, the current practice of edge devices as AIGC service providers (ASPs) lacks incentives, hindering the sustainable provision of high-quality edge AIGC services amidst information asymmetry. In this article, we develop a user-centric incentive mechanism framework for edge AIGC services in 6G-IoT networks. Specifically, we first propose a contract theory model for incentivizing ASPs to provide AIGC services to clients. Recognizing the irrationality of clients toward personalized AIGC services, we utilize prospect theory (PT) to capture their subjective utility better. Furthermore, we adopt the diffusion-based soft actor-critic algorithm to generate the optimal contract design under PT, outperforming traditional deep reinforcement learning algorithms. Our numerical results demonstrate the effectiveness of the proposed scheme. Jinbo Wen, Jiangtian Nie, Changyan Yi, Xiaohuan Li 0001, Jiangming Jin, Yang Zhang 0025, Dusit Niyato |
IEEE Internet Things J. | 1 |
| 2022 | Optimal Block Propagation and Incentive Mechanism for Blockchain Networks in 6GabstractDue to the prominent advantages of decentralization, transparency, security, and traceability, blockchain technologies have attracted ever-increasing attention from academia and industry, which can be applied to establish secure and reliable resource sharing platforms for future networks and applications. Especially, with the promising 6G technology which has large bandwidth and space-air-ground integrated coverage, blockchains have been evolved into 6G-enabled blockchain and envisioned to build various decentralized data and resource management systems. However, for 6G-enabled wireless blockchain networks, there still exist many challenges for their development and prosperity, e.g., large block propagation delay and propagation incentive. Therefore, this paper focuses on addressing the block propagation challenges. Firstly, inspired by epidemic models, we classify consensus nodes into five different states and establish a block propagation model for public blockchains that depicts block propagation laws. Then, considering consensus nodes are limited rational, we propose an Incentive Mechanism based on evolutionary game for Block Propagation (marked as BPIM) to minimize the block propagation delay. Numerical results demonstrate that compared with traditional routing algorithms, BPIM has better block propagation efficiency and greater incentive strength. Jinbo Wen, Zehui Xiong, Meng Shen 0001, Siming Wang, Yutao Jiao, Jiawen Kang 0001 |
TrustCom | 1 |