SearcharxivSearch

arXiv subjects

Zhanwei Wang

Publications and source records attributed to Zhanwei Wang.

15 recordsLinked to original sources

Space Generative AI with Solar Energy Harvesting

Satellites are emerging as promising platforms to extend generative \emph{artificial intelligence} (AI) services to remote areas lacking terrestrial infrastructure. However, deploying space generative AI is fundamentally constrained by the limited, time-varying onboard energy supplied by solar \emph{energy harvesting} (EH). This paper presents a framework for solar-powered space generative AI in which a satellite receives a user prompt, executes a diffusion-based image-generation model, and downlinks the compressed result within a strict time window. We identify the fundamental \emph{computation--communication} (C$^2$) trade-offs governed by the shared harvested-energy budgets. Specifically, increasing the number of generation steps improves intrinsic image quality but depletes energy and time available for downlink transmission, whereas prioritizing communication guarantees reliable delivery but sacrifices semantic quality. To balance these trade-offs and maximize \emph{end-to-end} (E2E) generative performance, we exploit the predictable solar-EH dynamics induced by deterministic orbital motion and develop a joint C$^2$ resource-optimization framework using a tractable two-step approach. First, we characterize the maximum downlink throughput for a fixed generation depth under continuous solar EH. This establishes a separation principle that decouples waiting-time selection from optimal transmit-power control. Next, we formulate a joint C$^2$ utility-maximization problem and derive a closed-form, low-complexity step-selection policy in the dominant constant-power regime. Extensive experiments under realistic orbital dynamics demonstrate that the proposed policy dynamically balances generation quality and transmission reliability. This yields significant E2E performance gains over static computation- and communication-centric baselines across diverse solar-EH states.

cs.AI

AirMoE: Realizing Over-the-Air Distributed Mixture-of-Experts Inference at the Wireless Edge

Mixture-of-experts (MoE) architectures enable efficient large language model (LLM) inference at the wireless edge through sparse activation. The wireless distributed MoE (WIDE) architecture addresses edge-resource constraints by distributing experts across devices coordinated by an edge server. However, WIDE suffers from repeated uplink transmissions of high-dimensional expert outputs via orthogonal multiple access. To overcome this bottleneck, we propose AirMoE, an over-the-air computing (AirComp)-enabled framework for simultaneous expert-output aggregation via wireless waveform superposition. Integrating AirComp into MoE inference introduces three challenges: fast-varying aggregation weights, layer-dependent error sensitivity, and channel-aware expert placement. To address these challenges, we construct an inference-aware AirMoE error metric to quantify aggregation distortion effects on end-to-end (E2E) inference accuracy via perturbation-based layer-sensitivity calibration. We then formulate a joint optimization problem to minimize this error and decompose it, without loss of optimality, into a two-timescale framework. At the fast timescale, we derive a globally optimal threshold-based power-control policy that separates devices into coefficient-aligned and full-power groups. At the slow timescale, we develop an activation- and channel-aware expert placement strategy that assigns more important experts to devices with lower channel-power cost. Extensive experiments demonstrate that AirMoE outperforms representative baselines in E2E inference accuracy, especially under strong device heterogeneity.

eess.SP

Multi-SPIN: Multi-Access Speculative Inference for Cooperative Token Generation at the Edge

Speculative inference (SPIN) was originally developed as an efficient architecture to accelerate Large Language Models (LLMs). In this work, we propose its distributed deployment to enable cooperative token generation in a multiuser edge system; its advantage is to effectively balance computational loads between resource-constrained devices and servers. The resulting architecture, termed Multi-access SPIN (Multi-SPIN), utilizes on-device small language models to generate and upload candidate token drafts, while an edge server operates the LLM to verify them in parallel batches. Given the severe heterogeneity in users' computation and communication capabilities, the draft length emerges as a critical control variable that influences node-level computation loads and multi-access latency, thereby governing the sum token goodput. Consequently, considering frequency-division multiple access, we investigate the problem of multi-access draft control, a joint optimization of draft-length control and bandwidth allocation to maximize sum token goodput. We examine two cases: (1) homogeneous draft lengths across users to facilitate server-side batching, and (2) heterogeneous draft lengths to introduce a new dimension for goodput enhancement. By developing decomposition methods, we reduce these complex optimizations into tractable sub-problems, which allow efficient draft control algorithms to be derived in closed form. Our analysis shows that the optimal bandwidth allocation compensates users with weaker computation-and-communication capabilities in the homogeneous case due to the batching synchronization requirements, whereas its heterogeneous-case counterpart rewards users with higher acceptance rates by relaxing such requirements. Experiments using Llama-2 and Qwen3.5 model pairs across diverse tasks demonstrate that Multi-SPIN improves goodput by up to 88% over heterogeneity-agnostic baselines.

cs.DC

SpaceMoE: Realizing Distributed Mixture-of-Experts Inference over Space Networks

Leveraging continuous solar energy harvesting at high efficiency, space data centers are envisioned as a promising platform for executing energy-intensive large language models (LLMs). Recognizing this advantage, space and AI conglomerates (e.g., SpaceX, Google) are actively investing in this vision. One key challenge, however, is the efficient distributed deployment of a large-scale LLM in a satellite network due to the limited onboard computing and communication resources. This gives rise to a placement problem that involves partitioning and mapping model components to satellites such that the fundamentally different model architecture and network topology can be reconciled to ensure low-latency token generation. To address this problem, we present the Space Network of Mixture-of-Experts (SpaceMoE) framework targeting the distributed execution of a popular mixture-of-experts (MoE) model in space. The proposed placement strategies are two-level: (1) layer placement, which assigns MoE layers to satellite subnets; and (2) intra-layer expert placement, which assigns individual experts to satellites associated with the same layer/subnet. For layer placement, we exploit the ring-like communication pattern of autoregressive inference to partition the satellite constellation along the orbiting direction into subnets arranged on a ring, each hosting one MoE layer. Based on this architecture, we formulate and solve an optimization problem for intra-layer expert placement to map experts with heterogeneous activation probabilities onto satellites. The derived strategy reveals an intuitive principle: a frequently activated expert should be mapped to a satellite on a routing path with low expected latency. Experiments over a thousand-satellite constellation show that SpaceMoE achieves at least a threefold latency reduction compared with conventional random and ablation-based placement strategies.

cs.DC

Rydberg Atomic Receivers for Multi-Band Communications and Sensing

Harnessing multi-level electron transitions, Rydberg Atomic REceivers (RAREs) can detect wireless signals across a wide range of frequency bands, from Megahertz to Terahertz. This capability enables multi-band wireless communications and sensing (CommunSense). Existing research on multi-band RAREs primarily focuses on experimental demonstrations, lacking a tractable model to mathematically characterize their mechanisms. This issue leaves the multi-band RARE as a black box and poses challenges in its practical applications. To fill in this gap, this paper investigates the underlying mechanism of multiband RAREs and explores their optimal performance. For the first time, an analytical transfer function with a closed-form expression for multi-band RAREs is derived by solving the quantum response of Rydberg atoms. It shows that a multiband RARE simultaneously serves as a multi-band atomic mixer for down-converting multi-band signals and a multi-band atomic amplifier that reflects its sensitivity to each band. Further analysis of the atomic amplifier unveils that the intrinsic gain at each frequency band can be decoupled into a global gain term and a Rabi attention term. The former determines the overall sensitivity of a RARE to all frequency bands of wireless signals. The latter influences the allocation of the overall sensitivity to each frequency band, representing a unique attention mechanism of multi-band RAREs. The optimal design of the global gain is provided to maximize the overall sensitivity of multi-band RAREs. Subsequently, the optimal Rabi attentions are also derived to maximize the practical multi-band CommunSense performance. An experiment platform is built to validate the effectiveness of the derived transfer function, and numerical results confirm the superiority of multi-band RAREs.

cs.IT

Realizing Quantum Wireless Sensing Without Extra Reference Sources: Architecture, Algorithm, and Sensitivity Maximization

Rydberg Atomic REceivers (RAREs) have demonstrated remarkable capabilities for radio-frequency signal measurement, enabling advanced quantum wireless sensing. Existing RARE-based sensing systems popularly adopt the heterodyne detection methodology, which requires an additional reference source to serve as an atomic mixer. However, this approach entails a bulky transceiver architecture and is limited in the supportable sensing bandwidth. To address these limitations, we propose a self-heterodyne sensing paradigm where the transmitter's self-interference naturally provides the reference signal. We demonstrate that a self-heterodyne RARE functions as an atomic autocorrelator, eliminating the need for external reference sources while supporting substantially wider bandwidth than conventional heterodyne methods. Next, a two-stage algorithm is devised to perform target ranging in self-heterodyne RARE systems. This algorithm is shown to closely approach the Cramer-Rao lower bound. Furthermore, we introduce the power-trajectory ($P$-trajectory) design for RAREs, which maximizes the sensing sensitivity through time-varying transmission power control. An internal noise (ITN)-limited $P$-trajectory is developed to capture the profile of the asymptotically optimal time-varying power in the presence of ITN only. This design is then extended to the practical $P$-trajectory by incorporating both the ITN and external noise. Numerical results validate that the proposed self-heterodyne sensing can achieve a $\sim$100 MHz-level bandwidth with high sensitivity, substantially surpassing existing heterodyne counterparts and paving the way for high-resolution quantum wireless sensing.

cs.IT

AirBreath Sensing: Protecting Over-the-Air Distributed Sensing Against Interference

A distinctive function of sixth-generation (6G) networks is the integration of distributed sensing and edge artificial intelligence (AI) to enable intelligent perception of the physical world. This resultant platform, termed integrated sensing and edge AI (ISEA), is envisioned to enable a broad spectrum of Internet-of-Things (IoT) applications, including remote surgery, autonomous driving, and holographic telepresence. Recently, the communication bottleneck confronting the implementation of an ISEA system is overcome by the development of over-the-air computing (AirComp) techniques, which facilitate simultaneous access through over-the-air data feature fusion. Despite its advantages, AirComp with uncoded transmission remains vulnerable to interference. To tackle this challenge, we propose AirBreath sensing, a spectrum-efficient framework that cascades feature compression and spread spectrum to mitigate interference without bandwidth expansion. This work reveals a fundamental tradeoff between these two operations under a fixed bandwidth constraint: increasing the compression ratio may reduce sensing accuracy but allows for more aggressive interference suppression via spread spectrum, and vice versa. This tradeoff is regulated by a key variable called breathing depth, defined as the feature subspace dimension that matches the processing gain in spread spectrum. To optimally control the breathing depth, we mathematically characterize and optimize this aforementioned tradeoff by designing a tractable surrogate for sensing accuracy, measured by classification discriminant gain (DG). Experimental results on real datasets demonstrate that AirBreath sensing effectively mitigates interference in ISEA systems, and the proposed control algorithm achieves near-optimal performance as benchmarked with a brute-force search.

math.NA

Optimal Batch-Size Control for Low-Latency Federated Learning with Device Heterogeneity

Federated learning (FL) has emerged as a popular approach for collaborative machine learning in sixth-generation (6G) networks, primarily due to its privacy-preserving capabilities. The deployment of FL algorithms is expected to empower a wide range of Internet-of-Things (IoT) applications, e.g., autonomous driving, augmented reality, and healthcare. The mission-critical and time-sensitive nature of these applications necessitates the design of low-latency FL frameworks that guarantee high learning performance. In practice, achieving low-latency FL faces two challenges: the overhead of computing and transmitting high-dimensional model updates, and the heterogeneity in communication-and-computation (C$^2$) capabilities across devices. To address these challenges, we propose a novel C$^2$-aware framework for optimal batch-size control that minimizes end-to-end (E2E) learning latency while ensuring convergence. The framework is designed to balance a fundamental C$^2$ tradeoff as revealed through convergence analysis. Specifically, increasing batch sizes improves the accuracy of gradient estimation in FL and thus reduces the number of communication rounds required for convergence, but results in higher per-round latency, and vice versa. The associated problem of latency minimization is intractable; however, we solve it by designing an accurate and tractable surrogate for convergence speed, with parameters fitted to real data. This approach yields two batch-size control strategies tailored to scenarios with slow and fast fading, while also accommodating device heterogeneity. Extensive experiments using real datasets demonstrate that the proposed strategies outperform conventional batch-size adaptation schemes that do not consider the C$^2$ tradeoff or device heterogeneity.

cs.LG

Ultra-Low-Latency Edge Inference for Distributed Sensing

There is a broad consensus that artificial intelligence (AI) will be a defining component of the sixth-generation (6G) networks. As a specific instance, AI-empowered sensing will gather and process environmental perception data at the network edge, giving rise to integrated sensing and edge AI (ISEA). Many applications, such as autonomous driving and industrial manufacturing, are latency-sensitive and require end-to-end (E2E) performance guarantees under stringent deadlines. However, the 5G-style ultra-reliable and low-latency communication (URLLC) techniques designed with communication reliability and agnostic to the data may fall short in achieving the optimal E2E performance of perceptive wireless systems. In this work, we introduce an ultra-low-latency (ultra-LoLa) inference framework for perceptive networks that facilitates the analysis of the E2E sensing accuracy in distributed sensing by jointly considering communication reliability and inference accuracy. By characterizing the tradeoff between packet length and the number of sensing observations, we derive an efficient optimization procedure that closely approximates the optimal tradeoff. We validate the accuracy of the proposed method through experimental results, and show that the proposed ultra-Lola inference framework outperforms conventional reliability-oriented protocols with respect to sensing performance under a latency constraint.

math.NA

Integrated Sensing and Edge AI: Realizing Intelligent Perception in 6G

Sensing and edge artificial intelligence (AI) are envisioned as two essential and interconnected functions in sixth-generation (6G) mobile networks. On the one hand, sensing-empowered applications rely on powerful AI models to extract features and understand semantics from ubiquitous wireless sensors. On the other hand, the massive amount of sensory data serves as the fuel to continuously refine edge AI models. This deep integration of sensing and edge AI has given rise to a new task-oriented paradigm known as integrated sensing and edge AI (ISEA), which features a holistic design approach to communication, AI computation, and sensing for optimal sensing-task performance. In this article, we present a comprehensive survey for ISEA. We first provide technical preliminaries for sensing, edge AI, and new communication paradigms in ISEA. Then, we study several use cases of ISEA to demonstrate its practical relevance and introduce current standardization and industrial progress. Next, the design principles, metrics, tradeoffs, and architectures of ISEA are established, followed by a thorough overview of ISEA techniques, including digital air interface, over-the-air computation, and advanced signal processing. Its interplay with various 6G advancements, e.g., new physical-layer and networking techniques, are presented. Finally, we present future research opportunities in ISEA, including the integration of foundation models, convergence of ISEA and integrated sensing and communications (ISAC), ultra-low-latency ISEA, and practicality issues.

cs.IT

Space-ground Fluid AI for 6G Edge Intelligence

Edge artificial intelligence (AI) and space-ground integrated networks (SGINs) are two main usage scenarios of the sixth-generation (6G) mobile networks. Edge AI supports pervasive low-latency AI services to users, whereas SGINs provide digital services to spatial, aerial, maritime, and ground users. This article advocates the integration of the two technologies by extending edge AI to space, thereby delivering AI services to every corner of the planet. Beyond a simple combination, our novel framework, called space-ground fluid AI, leverages the predictive mobility of satellites to facilitate fluid horizontal and vertical task/model migration in the networks. This ensures non-disruptive AI service provisioning in spite of the high mobility of satellite servers. The aim of the article is to introduce the (space-ground) fluid AI technology. First, we outline the network architecture and unique characteristics of fluid AI. Then, we delve into three key components of fluid AI, i.e., fluid learning, fluid inference, and fluid model downloading. They share the common feature of coping with satellite mobility via inter-satellite and space-ground cooperation to support AI services. Finally, we discuss the considerations for the real-world deployment of fluid AI and identify further research opportunities.

cs.NI

Revisiting Outage for Edge Inference Systems

One of the key missions of sixth-generation (6G) mobile networks is to deploy large-scale artificial intelligence (AI) models at the network edge to provide remote-inference services for edge devices. The resultant platform, known as edge inference, will support a wide range of Internet-of-Things applications, such as autonomous driving, industrial automation, and augmented reality. Given the mission-critical and time-sensitive nature of these tasks, it is essential to design edge inference systems that are both reliable and capable of meeting stringent end-to-end (E2E) latency constraints. Existing studies, which primarily focus on communication reliability as characterized by channel outage probability, may fail to guarantee E2E performance, specifically in terms of E2E inference accuracy and latency. To address this limitation, we propose a theoretical framework that introduces and mathematically characterizes the inference outage (InfOut) probability, which quantifies the likelihood that the E2E inference accuracy falls below a target threshold. Under an E2E latency constraint, this framework establishes a fundamental tradeoff between communication overhead (i.e., uploading more sensor observations) and inference reliability as quantified by the InfOut probability. To find a tractable way to optimize this tradeoff, we derive accurate surrogate functions for InfOut probability by applying a Gaussian approximation to the distribution of the received discriminant gain. Experimental results demonstrate the superiority of the proposed design over conventional communication-centric approaches in terms of E2E inference reliability.

cs.NI

Ultra-Low-Latency Edge Intelligent Sensing: A Source-Channel Tradeoff and Its Application to Coding Rate Adaptation

The forthcoming sixth-generation (6G) mobile network is set to merge edge artificial intelligence (AI) and integrated sensing and communication (ISAC) extensively, giving rise to the new paradigm of edge intelligent sensing (EI-Sense). This paradigm leverages ubiquitous edge devices for environmental sensing and deploys AI algorithms at edge servers to interpret the observations via remote inference on wirelessly uploaded features. A significant challenge arises in designing EI-Sense systems for 6G mission-critical applications, which demand high performance under stringent latency constraints. To tackle this challenge, we focus on the end-to-end (E2E) performance of EI-Sense and characterize a source-channel tradeoff that balances source distortion and channel reliability. In this work, we establish a theoretical foundation for the source-channel tradeoff by quantifying the effects of source coding on feature discriminant gains and channel reliability on packet loss. Building on this foundation, we design the coding rate control by optimizing the tradeoff to minimize the E2E sensing error probability, leading to a low-complexity algorithm for ultra-low-latency EI-Sense. Finally, we validate our theoretical analysis and proposed coding rate control algorithm through extensive experiments on both synthetic and real datasets, demonstrating the sensing performance gain of our approach with respect to traditional reliability-centric methods.

cs.IT

Spectrum Breathing: Protecting Over-the-Air Federated Learning Against Interference

Federated Learning (FL) is a widely embraced paradigm for distilling artificial intelligence from distributed mobile data. However, the deployment of FL in mobile networks can be compromised by exposure to interference from neighboring cells or jammers. Existing interference mitigation techniques require multi-cell cooperation or at least interference channel state information, which is expensive in practice. On the other hand, power control that treats interference as noise may not be effective due to limited power budgets, and also that this mechanism can trigger countermeasures by interference sources. As a practical approach for protecting FL against interference, we propose Spectrum Breathing, which cascades stochastic-gradient pruning and spread spectrum to suppress interference without bandwidth expansion. The cost is higher learning latency by exploiting the graceful degradation of learning speed due to pruning. We synchronize the two operations such that their levels are controlled by the same parameter, Breathing Depth. To optimally control the parameter, we develop a martingale-based approach to convergence analysis of Over-the-Air FL with spectrum breathing, termed AirBreathing FL. We show a performance tradeoff between gradient-pruning and interference-induced error as regulated by the breathing depth. Given receive SIR and model size, the optimization of the tradeoff yields two schemes for controlling the breathing depth that can be either fixed or adaptive to channels and the learning process. As shown by experiments, in scenarios where traditional Over-the-Air FL fails to converge in the presence of strong interference, AirBreahing FL with either fixed or adaptive breathing depth can ensure convergence where the adaptive scheme achieves close-to-ideal performance.

cs.LG

Knowledge-Based Ultra-Low-Latency Semantic Communications for Robotic Edge Intelligence

The 6G mobile networks will feature the widespread deployment of AI algorithms at the network edge, which provides a platform for supporting robotic edge intelligence systems. In such a system, a large-scale knowledge graph (KG) is operated at an edge server as a "remote brain" to guide remote robots on environmental exploration or task execution. In this paper, we present a new air-interface framework targeting the said systems, called knowledge-based robotic semantic communications (SemCom), which consists of a protocol and relevant transmission techniques. First, the proposed robotic SemCom protocol defines a sequence of system operations for executing a given robotic task. They include identification of all task-relevant knowledge paths (KPs) on the KG, semantic matching between KG and object classifier, and uploading of robot's observations for objects recognition and feasible KP identification. Next, to support ultra-low-latency feature transmission (ULL-FT), we propose a novel transmission approach that exploits classifier's robustness, which is measured by classification margin, to compensate for a high bit error probability (BEP) resulting from ultra-low-latency transmission (e.g., short packet and/or no coding). By utilizing the tractable Gaussian mixture model, we derive the relation between BEP and classification margin, which sheds light on system requirements to support ULL-FT. Furthermore, for the case where the classification margin is insufficient for coping with channel distortion, we enhance the ULL-FT approach by studying retransmission and multi-view classification for enlarging the margin and further quantifying corresponding requirements. Finally, experiments using DNNs as classifier models and real datasets are conducted to demonstrate the effectiveness of ULL-FT in communication latency reduction while providing a guarantee on accurate feasible KP identification.

cs.IT