BCBin Cao

Bin Cao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Bin Cao has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Joint Communication and Computation Scheduling for MEC-enabled AIGC Services: A Game-Theoretic Stochastic Learning Approach

    by Huaizhe Liu, Xinyi Zhuang, Jiaqi Wu, Yuan Luo, Bin Cao, Lin Gao

    Artificial Intelligence Generated Content (AIGC) powered by Generative Diffusion Models (GDMs) has emerged as a transformative paradigm for automated content creation. To satisfy the stringent latency requirements of AIGC services in many edge intelligence scenarios (e.g., smart cities), Mobile Edge Computing (MEC) provides critical computational support by deploying GDMs at edge servers (ES) close to end users. This paper investigates an MEC-enabled AIGC network comprising multiple ES, wireless access points (APs), and mobile users (UEs) with heterogeneous latency and accuracy demands. We formulate a Joint Communication Association and Computation Offloading (JCACO) game, where each UE strategically selects its serving AP, ES, and inference steps to minimize the overall service completion time while meeting accuracy constraints. The problem is challenging due to the network dynamics and the incomplete information. We prove that the JCACO game is a potential game under both complete and stochastic information settings, ensuring the existence of Nash Equilibrium (NE) in both cases. To derive the NE efficiently, we develop a distributed Multi-Agent Stochastic Learning (MASL) algorithm that provably converges to the NE with strict performance guarantees. Unlike conventional best-response schemes, MASL requires neither the knowledge of other players’ strategies nor global network information, making it fully distributed and adaptive to dynamic environments. We further provide a strict theoretical convergence analysis for MASL by using Ordinary Differential Equations (ODEs). Simulation results demonstrate that MASL significantly reduces service completion time compared with benchmark methods while satisfying accuracy constraints, confirming its effectiveness and practicality for real-world MEC-enabled AIGC networks.

  • Task-Adaptive Semantic Communication With Feedback: A Conditional Rate-Distortion Approach

    by Jinghang He, Yajing Deng, Shaohua Wu, Bin Cao, Siqi Meng, Weihan Zhang, Qinyu Zhang

    Task-oriented semantic communications represent a novel paradigm designed to optimize performance for specific semantic tasks. Traditional approaches often extract common semantic features to balance transmission rate and performance distortion across multiple tasks. However, these methods tend to underperform on individual tasks and struggle to adapt to dynamically changing task requirements. To address these short-comings, we propose a task-adaptive semantic communication system with feedback (TASC-f), which leverages a unified, end-to-end adaptable codec model capable of handling diverse tasks. Specifically, we formulate the task-adaptive semantic communication problem as a conditional rate-distortion optimization, incorporating task-specific semantic prompts as side information. We derive an analytical solution to minimize this optimization problem and introduce a classical iterative algorithm to compute the rate-distortion function. Building on this solution, we design a trainable semantic prompt module (SPM) that dynamically generates side information reflecting task-specific features. To further enhance adaptability, the system integrates a feedback mechanism that enables real-time adjustments to the encoding strategy in response to changing task demands. This unified network architecture supports variable transmission rates and seamlessly adapts to different channel conditions within a single model. Experimental evaluations across two distinct scenarios involving three semantic tasks demonstrate the superior performance of TASC-f. Not only does the proposed system outperform competing data-driven communication methods, but it also matches the performance of dedicated single-task systems for fixed tasks and surpasses multi-task communication systems when adapting to new tasks.


  • Joint Edge Server Deployment and Computation Offloading: A Multi-Timescale Stochastic Programming Framework

    by Huaizhe Liu, Jiaqi Wu, Zhizongkai Wang, Bin Cao, Lin Gao

    Mobile Edge Computing (MEC) is a promising approach for enhancing the quality-of-service (QoS) of AI-enabled applications in the B5G/6G era, by bringing computation capability closer to end-users at the network edge. In this work, we investigate the joint optimization of edge server (ES) deployment, service placement, and computation task offloading under the stochastic information scenario. Traditional approaches often treat these decisions as equal, disregarding the differences in information realization. However, in practice, the ES deployment decision must be made in advance and remain unchanged, prior to the complete realization of information, whereas the decisions regarding service placement and computation task offloading can be made and adjusted in real-time after information is fully realized. To address such temporal coupling between decisions and information realization, we introduce the stochastic programming (SP) framework, which involves a strategic-layer for deciding ES deployment based on (incomplete) stochastic information and a tactical-layer for deciding service placement and task offloading based on complete information realization. The problem is challenging due to the different timescales of two layers’ decisions. To overcome this challenge, we propose a multi-timescale SP framework, which includes a large timescale (called period) for strategic-layer decision-making and a small timescale (called slot) for tactical-layer decision making. Moreover, we design a Lyapunov-based algorithm to solve the tactical-layer problem at each time slot, and a Markov approximation algorithm to solve the strategic-layer problem in every time period. Simulation results demonstrate that our proposed solution significantly outperforms existing benchmarks that overlook the coupling between decisions and information realization, achieving up to 56% reduction in total system cost.


  • Robust Deep Joint Source-Channel Coding Enabled Distributed Image Transmission With Imperfect Channel State Information

    by Biao Dong, Bin Cao, Guan Gui, Qinyu Zhang

    This work is concerned with robust distributed multi-view image transmission over a severe fading channel with imperfect channel state information (CSI), wherein the sources are slightly correlated. In contrast to point-to-point deep joint source-channel coding (DJSCC), the distributed setting introduces the key challenge of exploiting inter-source correlations without direct communication, especially under imperfect CSI. To tackle this problem, we leverage the complementarity and consistency characteristics among the distributed, yet correlated sources, and propose an robust distributed DJSCC, namely RDJSCC. In RDJSCC, we design a novel cross-view information extraction (CVIE) mechanism to capture more nuanced cross-view patterns and dependencies. In addition, a complementarity-consistency fusion (CCF) mechanism is utilized to fuse the complementarity and consistency from multi-view information in a symmetric and compact manner. Theoretical analysis and simulation results show that our proposed RDJSCC can effectively leverage the advantages of correlated sources even under severe fading conditions, leading to an improved reconstruction performance.


  • Fundamental Limits of Pulse-Based UWB ISAC Systems: A Parameter Estimation Perspective

    by Fan Liu, Tingting Zhang, Zenan Zhang, Bin Cao, Yuan Shen, Qinyu Zhang

    This article investigates a bi-static integration of sensing and communication (ISAC) system for multitarget scenarios using impulse radio ultrawide bandwidth (IR-UWB) signals, which offer fine temporal resolution, low power consumption, and strong resistance to multipath interference. Two typical modulation schemes, namely, pulse position modulation (PPM) and binary phase-shift keying (BPSK), are considered for communication over the delay and phase domains, respectively. An innovative differential decoupling strategy is proposed, which eliminates the need for pilot symbols by leveraging the known starting symbol position. The sensing performance under various modulation and demodulation schemes is analyzed and compared with the conventional pilot-based (time-delay) decoupling strategy under current UWB standards. A key contribution of this work is the development of a unified analytical framework based on the Fisher information matrix (FIM), which characterizes the fundamental coupling between communication and sensing in both delay and Doppler domains. This coupling is examined through the singularity structure of the FIM, providing new insights into the joint performance limits of UWB-ISAC systems. Performance evaluation is conducted using the Cramer–Rao lower bound (CRLB) for sensing and the data transmission rate for communication, offering theoretical insights into choosing suitable data signal processing methods in real-world applications.


  • Integrated Sensing, Communication, and Computation Over-the-Air in OFDM Systems

    by Biao Dong, Bin Cao, Qinyu Zhang

    This work is concerned with integrated sensing, communication, and computation (ISCC) in uplink orthogonal frequency division multiplexing (OFDM) systems, wherein multiple devices perform target sensing and over-the-air computation (AirComp) simultaneously. We aim to minimize the computational mean squared error (MSE) by jointly optimizing the transmitting vector and the aggregation vector. To tackle the non-convexity of the formualted problem, we develop a two-phase iterative algorithm. Simulations demonstrate that the proposed algorithm can achieve a better sensing-computation trade-off.


  • Lightweight Semantic-Aware Communication With Packet Transmission

    by Biao Dong, Bin Cao, Qinyu Zhang

    This work is concerned with a lightweight semanticaware communication framework named DeepJSCC-L, aiming at maximizing rate-distortion (RD) performance under the resource-constrained scenario. Firstly, a lightweight coding is designed, which employs parameter-efficient operators including a lightweight convolution and an efficient self-attention mechanism. Next, a novel packet transmission strategy is proposed, which aims to further improve RD performance under varying channel environments by allocating crucial packets with a optimal channel. Experimental results prove that DeepJSCC-L is competitive compared with benchmark in terms of RD performance and model complexity.


  • Tradeoff Between SE and PEB: An Asynchronous ICAL Case

    by Ying Zhang, Tingting Zhang, Bin Cao, Xuanli Wu, Qinyu Zhang

    The integrated communication and localization (I-CAL) has become as a pivotal technology in the evolution towards B5G and 6G networks, particularly for a variety of emerging wireless applications. In ICAL networks, resource allocation and beamforming design are critical components that significantly influence both the precision of localization and the efficiency of communication. Moreover, high accuracy synchronization is extremely challenging in wireless networks. In this paper, we investigate the trade-off between spectral efficiency (SE) and position error bound (PEB) by formulating a robust power and time-slot allocation and beamforming design problem for asynchronous ICAL networks with the imperfect initial position. We first illustrate the coupling between SE and position error through channel estimation error. Then, we derive a lower bound on the position error in terms of the Fisher information matrix (FIM). The alternating optimization, convex approximate and Bernstein-type inequality algorithms are proposed to solve the non-convex problems. Finally, the simulation results reveal the trade-off between SE and PEB, and validate the robustness and effectiveness of the proposed algorithms.


  • Open Access

    Trust but Verify: The xz-utils Backdoor (CVE-2024-3094) and the Foundations of Open-Source Software Supply-Chain Trust

    by Bin Cao, Yishuai Chen

    Background: In March 2024, a multi-year social-engineering operation culminated in the injection of a sophisticated backdoor into xz/utils versions 5.6.0 and 5.6.1 (CVE-2024-3094, CVSS 10.0), reaching OpenSSH on rolling-release GNU/Linux distributions before a fortuitous performance anomaly led to its discovery and containment. Objective: This paper treats the xz-utils incident not as an anomaly to be patched but as a diagnostic event that exposes the load-bearing assumptions of trust in open-source software supply chains — and evaluates, stage by stage, whether the security instruments now in circulation would have prevented, detected, or contained it. Methods: We conduct a qualitative single-case study built exclusively from primary sources (the disclosure thread, the CVE record, distribution advisories, and the CISA alert), reconstruct the attack chain as a sequence of six trust transitions, and perform a counterfactual control analysis mapping six classes of supply-chain controls (maintainer-support programs, provenance attestation, reproducible builds, SBOM and binary analysis, runtime isolation, and coordinated response) against each stage. Results: No single instrument spans the full chain. Provenance attestation and reproducible builds would have raised the cost of the build-time activation stage dramatically; maintainer-support and criticality programs address the social-engineering stage that every technical control leaves untouched; runtime isolation (SELinux) actually prevented exploitation on some systems; and the coordinated response within hours demonstrated that recovery-side trust mechanisms are the field's most mature layer. We further show that SBOMs — the most-cited 2024 remedy — would not have detected this attack, and argue that trust in supply chains must be built on verifiable process evidence rather than identity or reputation. Conclusions: The xz-utils incident defines the research and policy agenda for supply-chain trust: fund maintainers of critical-but-invisible infrastructure, instrument trust transitions with verifiable process guarantees, and design for the adversary who behaves like an ideal contributor.