arXiv subjects

Kaibin Huang

Publications and source records attributed to Kaibin Huang.

At least 73 records · Page 4Linked to original sources

arXiv2025

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↗

arXiv2025

BeamCKM: A Framework of Channel Knowledge Map Construction for Multi-Antenna Systems

The channel knowledge map (CKM) enables efficient construction of high-fidelity mapping between spatial environments and channel parameters via electromagnetic information analysis. Nevertheless, existing studies are largely confined to single-antenna systems, failing to offer dedicated guidance for multi-antenna communication scenarios. To address the inherent conflict between traditional real-value pathloss map and multi-degree-of-freedom (DoF) coherent beamforming in B5G/6G systems, this paper proposes a novel concept of BeamCKM and CKMTransUNet architecture. The CKMTransUNet approach combines a UNet backbone for multi-scale feature extraction with a vision transformer (ViT) module to capture global dependencies among encoded linear vectors, utilizing a composite loss function to characterize the beam propagation characteristics. Furthermore, based on the CKMTransUNet backbone, this paper presents a methodology named M3ChanNet. It leverages the multi-modal learning technique and cross-attention mechanisms to extract intrinsic side information from environmental profiles and real-time multi-beam observations, thereby further improving the map construction accuracy. Simulation results demonstrate that the proposed method consistently outperforms state-of-the-art (SOTA) interpolation methods and deep learning (DL) approaches, delivering superior performance even when environmental contours are inaccurate. For reproducibility, the code is publicly accessible at https://github.com/github-whh/BeamCKM.

eess.SP↗

arXiv2025

Towards Edge General Intelligence: Knowledge Distillation for Mobile Agentic AI

Edge General Intelligence (EGI) represents a paradigm shift in mobile edge computing, where intelligent agents operate autonomously in dynamic, resource-constrained environments. However, the deployment of advanced agentic AI models on mobile and edge devices faces significant challenges due to limited computation, energy, and storage resources. To address these constraints, this survey investigates the integration of Knowledge Distillation (KD) into EGI, positioning KD as a key enabler for efficient, communication-aware, and scalable intelligence at the wireless edge. In particular, we emphasize KD techniques specifically designed for wireless communication and mobile networking, such as channel-aware self-distillation, cross-model Channel State Information (CSI) feedback distillation, and robust modulation/classification distillation. Furthermore, we review novel architectures natively suited for KD and edge deployment, such as Mamba, RWKV (Receptance, Weight, Key, Value) and Cross-Architecture distillation, which enhance generalization capabilities. Subsequently, we examine diverse applications in which KD-driven architectures enable EGI across vision, speech, and multimodal tasks. Finally, we highlight the key challenges and future directions for KD in EGI. This survey aims to provide a comprehensive reference for researchers exploring KD-driven frameworks for mobile agentic AI in the era of EGI.

cs.IT↗

arXiv2025

LoLaFL: Low-Latency Federated Learning via Forward-only Propagation

Federated learning (FL) has emerged as a widely adopted paradigm for enabling edge learning with distributed data while ensuring data privacy. However, the traditional FL with deep neural networks trained via backpropagation can hardly meet the low-latency learning requirements in the sixth generation (6G) mobile networks. This challenge mainly arises from the high-dimensional model parameters to be transmitted and the numerous rounds of communication required for convergence due to the inherent randomness of the training process. To address this issue, we adopt the state-of-the-art principle of maximal coding rate reduction to learn linear discriminative features and extend the resultant white-box neural network into FL, yielding the novel framework of Low-Latency Federated Learning (LoLaFL) via forward-only propagation. LoLaFL enables layer-wise transmissions and aggregation with significantly fewer communication rounds, thereby considerably reducing latency. Additionally, we propose two \emph{nonlinear} aggregation schemes for LoLaFL. The first scheme is based on the proof that the optimal NN parameter aggregation in LoLaFL should be harmonic-mean-like. The second scheme further exploits the low-rank structures of the features and transmits the low-rank-approximated covariance matrices of features to achieve additional latency reduction. Theoretic analysis and experiments are conducted to evaluate the performance of LoLaFL. In comparison with traditional FL, the two nonlinear aggregation schemes for LoLaFL can achieve reductions in latency of over 87\% and 97\%, respectively, while maintaining comparable accuracies.

cs.LG↗

arXiv2025

Waveforms for Computing Over the Air

Over-the-air computation (AirComp) leverages the signal-superposition characteristic of wireless multiple access channels to perform mathematical computations. Initially introduced to enhance communication reliability in interference channels and wireless sensor networks, AirComp has more recently found applications in task-oriented communications, like wireless distributed learning and in wireless control systems. Its adoption aims to address latency challenges arising from an increased number of edge devices or Internet of Things (IoT) devices accessing the constrained wireless spectrum. This paper is the first one to focus on the physical layer of these systems. We present a unified framework, specifically on the waveform and the signal processing aspects at the transmitter and receiver to meet the challenges that AirComp presents within the different contexts and use cases.

eess.SP↗

arXiv2025

Calibration-free Rydberg Atomic Receiver for Sub-MHz Wireless Communications and Sensing

The exploitation of sub-MHz (\textless 1 MHz) can be beneficial for a plethora of applications like underwater vehicular communication, subsurface exploration, low-frequency navigation etc. The traditional electrical receivers in this band are either hundreds of meters long or, when miniaturized, inefficient and bandwidth-limited, making them inapplicable for practical underwater implementations. Such obstacles can be circumvented by the emerging Rydberg atomic receiving technology, which is capable of detecting fields from DC up to the terahertz regime with compact structure. Against this background, we propose a method to detect sub-MHz electric fields without further calibration. Specifically, a physics-based model of the combined DC and AC-Stark response is established. Based on the model, we modulate the DC-Stark spectrum with the received signal and extract its amplitude by fitting the cycle-averaged, symmetric Stark-split peaks. Then we map this swing directly to the intrinsic atomic polarizability. By such operations, the proposed method can remove the dependence on electrode spacing or field-amplitude references. For performance evaluation, six-level Lindblad simulations and experiments are conducted at a low-frequency field of 30 kHz demonstrate a minimum detectable field of 5.3 \text{mV}/\text{cm}, with stable readout across practical optical-power variations. The approach manages to expand operating range of Rydberg atomic receivers below 1 MHz, and enables compact, calibration-free quantum front ends for underwater and subsurface receivers.

physics.ins-det↗

arXiv2025

NetMCP: Network-Aware Model Context Protocol Platform for LLM Capability Extension

Large Language Models (LLMs) remain static in functionality after training, and extending their capabilities requires integration with external data, computation, and services. The Model Context Protocol (MCP) has emerged as a standard interface for such extensions, but current implementations rely solely on semantic matching between users' requests and server function descriptions, which makes current deployments and simulation testbeds fragile under latency fluctuations or server failures. We address this gap by enhancing MCP tool routing algorithms with real-time awareness of network and server status. To provide a controlled test environment for development and evaluation, we construct a heterogeneous experimental platform, namely Network-aware MCP (NetMCP), which offers five representative network states and build a benchmark for latency sequence generation and MCP server datasets. On top of NetMCP platform, we analyze latency sequences and propose a Semantic-Oriented and Network-Aware Routing (SONAR) algorithm, which jointly optimizes semantic similarity and network Quality of Service (QoS) metrics for adaptive tool routing. Results show that SONAR consistently improves task success rate and reduces completion time and failure number compared with semantic-only, LLM-based baselines, demonstrating the value of network-aware design for production-scale LLM systems. The code for NetMCP is available at https://github.com/NICE-HKU/NetMCP.

cs.NI↗

arXiv2025

Channel-Aware Deep Learning for Superimposed Pilot Power Allocation and Receiver Design

Superimposed pilot (SIP) schemes face significant challenges in effectively superimposing and separating pilot and data signals, especially in multiuser mobility scenarios with rapidly varying channels. To address these challenges, we propose a novel channel-aware learning framework for SIP schemes, termed CaSIP, that jointly optimizes pilot-data power (PDP) allocation and a receiver network for pilot-data interference (PDI) elimination, by leveraging channel path gain information, a form of large-scale channel state information (CSI). The proposed framework identifies user-specific, resource element-wise PDP factors and develops a deep neural network-based SIP receiver comprising explicit channel estimation and data detection components. To properly leverage path gain data, we devise an embedding generator that projects it into embeddings, which are then fused with intermediate feature maps of the channel estimation network. Simulation results demonstrate that CaSIP efficiently outperforms traditional pilot schemes and state-of-the-art SIP schemes in terms of sum throughput and channel estimation accuracy, particularly under high-mobility and low signal-to-noise ratio (SNR) conditions.

eess.SP↗

arXiv2025

PartialLoading: User Scheduling and Bandwidth Allocation for Parameter-sharing Edge Inference

By provisioning inference offloading services, edge inference drives the rapid growth of AI applications at network edge. However, how to reduce the inference latency remains a significant challenge. To address this issue, we develop a parameter-sharing AI model loading (PartialLoading) framework for multi-user edge inference, which exploits two key insights: 1) the majority of latency arises from loading AI models into server GPU memory, and 2) different AI models can share a significant number of parameters, for which redundant loading should be avoided. Towards this end, we formulate a joint multi-user scheduling and spectrum bandwidth allocation problem to maximize task throughput by exploiting shared parameter blocks across models. The intuition is to judiciously schedule user requests to reuse the shared parameter blocks between consecutively loaded models, thereby reducing model loading time substantially. To facilitate solution finding, we decouple the problem into two sub-problems, i.e., user scheduling and bandwidth allocation, showing that solving them sequentially leads to the solution to the original problem. Due to the NP-hardness of the problem, we first study an important special case called the "backbone-sharing" case, and design a dynamic programming-based algorithm to obtain the optimal solution in polynomial time. For the general case, we propose a greedy heuristic to obtain the sub-optimal solution efficiently. Simulation results demonstrate that the proposed framework significantly improves task throughput under deadline constraints compared with user scheduling without exploiting parameter sharing.

cs.NI↗

arXiv2025

Detection Capability Comparison Between Intensity Detection and Splitting Detection for Rydberg-Atomic Sensors

Rydberg atomic quantum receivers have been seen as novel radio frequency measurements and the high sensitivity to a large range of frequencies makes it attractive for communications reception. However, their unique physical characteristics enable two fundamental signal readout schemes: intensity-based detection and splitting-based detection. The former measures the electric fields through laser intensity, while the latter utilizes Autler-Townes splitting. In this work, we systematically categorize and model existing signal readout methods, classifying them into these two paradigms. Then, we derive the maximum likelihood estimation procedures and corresponding Cramér-Rao lower bounds (CRLB) for each detection modality. Through the analysis of the CRLB, we propose strategy for both readout schemes to enhance sensitivity and minimize estimation variance: acquiring data in regions with maximal slope magnitudes. While this approach has been implemented in intensity-based detection (e.g., superheterodyne schemes), its application to splitting-based detection remains unexplored. Implementation of non-uniform frequency scanning, with preferential sampling at regions exhibiting maximum peak slopes combined with our proposed maximum likelihood splitting estimation method, achieves significantly reduced estimation variance compared to conventional polynomial fitting. The comparative analysis reveals the optimal detection performance of the two detection schemes. This work also contributes to enhancing the accuracy of microwave calibration. Numerical results reveal that both fundamental signal readout methods achieve lower estimation variance based on our proposed maximum likelihood estimation approach.

eess.SP↗

arXiv2025

Experience Scaling: Post-Deployment Evolution For Large Language Models

Scaling model size, training data, and compute power have driven advances in large language models (LLMs), but these approaches are reaching saturation as human-generated text is exhausted and further gains diminish. We propose experience scaling, a framework for continuous post-deployment evolution for LLMs through autonomous interaction with the environment and collaborative sharing of accumulated experience. The framework captures raw interactions, distills them into compact, reusable knowledge, and periodically refines stored content to preserve relevance and efficiency. We validate the framework in simulated real-world scenarios involving generalization to previously unseen but related tasks, repetitive queries, and over-saturated knowledge stores. Across all settings, experience scaling improves accuracy, sustains performance over time, and maintains gains when applied to novel situations. These results demonstrate that structured post-deployment learning can extend LLM capabilities beyond the limits of static human-generated data, offering a scalable path for continued intelligence progress.

cs.AI↗

arXiv2025

Commit-Reveal$^2$: Securing Randomness Beacons with Randomized Reveal Order in Smart Contracts

Simple commit-reveal beacons are vulnerable to last-revealer strategies, and existing descriptions often leave accountability and recovery mechanisms unspecified for practical deployments. We present Commit-Reveal$^2$, a layered design for blockchain deployments that cryptographically randomizes the final reveal order, together with a concrete accountability and fallback mechanism that we implement as smart-contract logic. The protocol is architected as a hybrid system, where routine coordination runs off chain for efficiency and the blockchain acts as the trust anchor for commitments and the final arbiter for disputes. Our implementation covers leader coordination, on-chain verification, slashing for non-cooperation, and an explicit on-chain recovery path that maintains progress when off-chain coordination fails. We formally define two security goals for distributed randomness beacons, unpredictability and bit-wise bias resistance, and we show that Commit-Reveal$^2$ meets these notions under standard hash assumptions in the random-oracle model. In measurements with small to moderate operator sets, the hybrid design reduces on-chain gas by more than 80% compared to a fully on-chain baseline. We release a publicly verifiable prototype and evaluation artifacts to support replication and adoption in blockchain applications.

cs.CR↗

arXiv2025

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↗

arXiv2025

Data Sourcing Random Access using Semantic Queries for Massive IoT Scenarios

Efficiently retrieving relevant data from massive Internet of Things (IoT) networks is essential for downstream tasks such as machine learning. This paper addresses this challenge by proposing a novel data sourcing protocol that combines semantic queries and random access. The key idea is that the destination node broadcasts a semantic query describing the desired information, and the sensors that have data matching the query then respond by transmitting their observations over a shared random access channel, for example to perform joint inference at the destination. However, this approach introduces a tradeoff between maximizing the retrieval of relevant data and minimizing data loss due to collisions on the shared channel. We analyze this tradeoff under a tractable Gaussian mixture model and optimize the semantic matching threshold to maximize the number of relevant retrieved observations. The protocol and the analysis are then extended to handle a more realistic neural network-based model for complex sensing. Under both models, experimental results in classification scenarios demonstrate that the proposed protocol is superior to traditional random access, and achieves a near-optimal balance between inference accuracy and the probability of missed detection, highlighting its effectiveness for semantic query-based data sourcing in massive IoT networks.

cs.IT↗

arXiv2025

Ubiquitous Intelligence Via Wireless Network-Driven LLMs Evolution

We introduce ubiquitous intelligence as a paradigm where Large Language Models (LLMs) evolve within wireless network-driven ecosystems. Unlike static model deployments, this approach enables scalable and continuous intelligence ascension through coordination between networks and LLMs. Wireless networks support system-orchestrated lifelong learning, while LLMs drive the next-generation network development that is more adaptive and responsive. This co-evolution highlights a shift toward self-improving systems, sustaining capability growth across diverse and resource-constrained environments.

cs.NI↗

arXiv2025

TREE:Token-Responsive Energy Efficiency Framework For Green AI-Integrated 6G Networks

As wireless networks evolve toward AI-integrated intelligence, conventional energy-efficiency metrics fail to capture the value of AI tasks. In this paper, we propose a novel EE metric called Token-Responsive Energy Efficiency (TREE), which incorporates the token throughput of large models as network utility carriers into the system utility. Based on this metric, we analyze the design principles of AI-integrated 6G networks from the perspective of three critical AI elements, namely computing power, model and data. Case studies validate TREE's unique capability to expose energy-service asymmetries in hybrid traffic scenarios where conventional metrics prove inadequate. Although it is impossible to determine every design detail of AI-integrated 6G network at current time, we believe that the proposed TREE based framework will help the network operators to quantify the operating energy cost of AI services and continue to evolve towards sustainable 6G networks.

eess.SY↗

arXiv2025

Generative Feature Imputing -- A Technique for Error-resilient Semantic Communication

Semantic communication (SemCom) has emerged as a promising paradigm for achieving unprecedented communication efficiency in sixth-generation (6G) networks by leveraging artificial intelligence (AI) to extract and transmit the underlying meanings of source data. However, deploying SemCom over digital systems presents new challenges, particularly in ensuring robustness against transmission errors that may distort semantically critical content. To address this issue, this paper proposes a novel framework, termed generative feature imputing, which comprises three key techniques. First, we introduce a spatial error concentration packetization strategy that spatially concentrates feature distortions by encoding feature elements based on their channel mappings, a property crucial for both the effectiveness and reduced complexity of the subsequent techniques. Second, building on this strategy, we propose a generative feature imputing method that utilizes a diffusion model to efficiently reconstruct missing features caused by packet losses. Finally, we develop a semantic-aware power allocation scheme that enables unequal error protection by allocating transmission power according to the semantic importance of each packet. Experimental results demonstrate that the proposed framework outperforms conventional approaches, such as Deep Joint Source-Channel Coding (DJSCC) and JPEG2000, under block fading conditions, achieving higher semantic accuracy and lower Learned Perceptual Image Patch Similarity (LPIPS) scores.

cs.LG↗

arXiv2025

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↗