SearcharxivSearch

arXiv subjects

Minghua Xia

Publications and source records attributed to Minghua Xia.

At least 19 recordsLinked to original sources

Exact Scale--Shape Factorization of the Typical Poisson--Voronoi Cell Volume in Arbitrary Dimension

Despite more than six decades of research, a tractable closed-form distribution for the typical Poisson--Voronoi cell volume remains unknown beyond one dimension. Building on the classical complementary-theorem structure for the Poisson--Voronoi fundamental region, we develop an explicit configuration-space factorization of the Palm-typical cell volume for a tessellation generated by a stationary Poisson point process of intensity \(λ>0\) in \(\mathbb R^d\), \(d\geq1\). Conditional on the number \(k\) of effective facets, the Voronoi flower volume is a \(\operatorname{Gamma}(k,\operatorname{rate}=λ)\) scale variable independent of the effective-neighbour configuration normalized to have unit flower volume. Mapping this normalized configuration to its cell-to-flower volume ratio \(A_k\) gives the conditional cell-volume representation as the product of the classical Gamma scale and a bounded geometric shape factor. From this representation, we derive exact mixture formulae, transform and moment identities, and criteria characterizing when the conditional cell-volume laws are Gamma. We also distinguish shape-factor variability within facet-number strata from mixing across strata as two sources of departure from a single Gamma law and recover the universal bound \(0<A_k\leq2^{-d}\). For the lower tail, we reduce critical negative moments of the shape factor to inverse-volume integrals over normalized configuration spaces. Under explicit critical-integrability and higher-facet summability assumptions, the density of the intensity-normalized cell volume has leading order \(y^d\) as \(y\downarrow0\). The framework recovers the one-dimensional distribution, admits explicit planar coordinates, and supports numerical evaluation of the mixture representation in dimensions two through four.

math.PR

A Survey of Typical-Cell Volume Distributions in Poisson--Voronoi and Poisson--Delaunay Tessellations: Analytical Theory, High-Dimensional Limits, and Wireless Applications

Random spatial tessellations generated by point processes provide fundamental models for proximity, space partitioning, and local geometry in stochastic systems. Poisson--Voronoi and Poisson--Delaunay tessellations induced by homogeneous Poisson point processes form a canonical dual pair used in stochastic geometry, computational geometry, spatial statistics, and wireless-network analysis. Their typical-cell volume distributions provide important geometric inputs for modeling coverage, traffic load, clustering, connectivity, and other system characteristics. Despite extensive study, the literature remains analytically asymmetric. For Poisson--Voronoi cell volumes, exact integral representations exist in certain planar settings, while a recent scale--shape factorization provides an exact general-dimensional representation with conditional Gamma structure. However, the normalized shape laws and unbounded facet-count mixture remain implicit, and tractable unconditional closed-form distributions are unavailable. Practical modeling therefore relies largely on simulation, moment characterizations, and empirical approximations. By contrast, Poisson--Delaunay simplex volumes admit dimension-explicit PDFs, CDFs, and moment formulas derived through Mellin-transform analysis and Meijer's \(G\)-function representations. Motivated by this contrast, this paper surveys typical-cell volume distributions in Poisson--Voronoi and Poisson--Delaunay tessellations. We review the main analytical methods, synthesize exact and approximate results, summarize emerging high-dimensional limits, and discuss wireless-network applications, including load modeling, cooperative transmission, and three-dimensional architectures. We also identify open problems concerning unconditional Poisson--Voronoi distributions, non-Poisson spatial models, data-driven geometric inference, and dimension-aware network modeling.

cs.IT

Generalized Two-Dimensional Index Modulation in the Code-Spatial Domain for LPWAN

Low-power wide-area networks (LPWANs) are crucial for large-scale Internet of Things (IoT) applications, yet they face increasing demands for higher data rates, improved reliability, and enhanced energy efficiency under stringent hardware constraints. To address these challenges, this paper introduces a generalized code-index modulation (CIM) transceiver that employs multiple-antenna index modulation (IM). The transmitter integrates spatial modulation (SM), space-time block coding (STBC), and CIM into a unified two-dimensional (2D) coding structure, where the spreading sequences -- realized via continuous phase modulation with spread spectrum (CPM-SS), chirp spread spectrum, or Zadoff-Chu sequences -- serve as spreading codes. Three specific schemes are proposed: SM-CIM, STBC-SM-CIM, and an enhanced STBC-SM-CIM (ESTBC-SM-CIM), designed to jointly improve data rate and energy efficiency. Closed-form expressions for the average bit error probability are derived, and system performance is analyzed in terms of data rate, energy efficiency, and computational complexity. Simulation results show that the proposed designs consistently outperform benchmark schemes, demonstrating their potential for enabling high-data-rate, energy-efficient LPWAN and IoT communications.

cs.IT

Energy-Efficient Federated Edge Learning For Small-Scale Datasets in Large IoT Networks

Large-scale Internet of Things (IoT) networks enable intelligent services such as smart cities and autonomous driving, but often face resource constraints. Collecting heterogeneous sensory data, especially in small-scale datasets, is challenging, and independent edge nodes can lead to inefficient resource utilization and reduced learning performance. To address these issues, this paper proposes a collaborative optimization framework for energy-efficient federated edge learning with small-scale datasets. We first derive an expected learning loss to quantify the relationship between the number of training samples and learning objectives. A stochastic online learning algorithm is then designed to adapt to data variations, and a resource optimization problem with a convergence bound is formulated. Finally, an online distributed algorithm efficiently solves large-scale optimization problems with high scalability. Extensive simulations and autonomous navigation case studies with collision avoidance demonstrate that the proposed approach significantly improves learning performance and resource efficiency compared to state-of-the-art benchmarks.

cs.LG

Air-to-Ground Communications for Internet of Things: UAV-based Coverage Hole Detection and Recovery

Uncrewed aerial vehicles (UAVs) play a pivotal role in ensuring seamless connectivity for Internet of Things (IoT) devices, particularly in scenarios where conventional terrestrial networks are constrained or temporarily unavailable. However, traditional coverage-hole detection approaches, such as minimizing drive tests, are costly, time-consuming, and reliant on outdated radio-environment data, making them unsuitable for real-time applications. To address these limitations, this paper proposes a UAV-assisted framework for real-time detection and recovery of coverage holes in IoT networks. In the proposed scheme, a patrol UAV is first dispatched to identify coverage holes in regions where the operational status of terrestrial base stations (BSs) is uncertain. Once a coverage hole is detected, one or more UAVs acting as aerial BSs are deployed by a satellite or nearby operational BSs to restore connectivity. The UAV swarm is organized based on Delaunay triangulation, enabling scalable deployment and tractable analytical characterization using stochastic geometry. Moreover, a collision-avoidance mechanism grounded in multi-agent system theory ensures safe and coordinated motion among multiple UAVs. Simulation results demonstrate that the proposed framework achieves high efficiency in both coverage-hole detection and on-demand connectivity restoration while significantly reducing operational cost and time.

cs.IT

Vertical Heterogeneous Networks Beyond 5G: CoMP Coverage Enhancement and Optimization

Low-altitude wireless networks are increasingly vital for the low-altitude economy, enabling wireless coverage in high-mobility and hard-to-reach environments. However, providing reliable connectivity to sparsely distributed aerial users in dynamic three-dimensional (3D) spaces remains a significant challenge. This paper investigates downlink coverage enhancement in vertical heterogeneous networks (VHetNets) beyond 5G, where uncrewed aerial vehicles (UAVs) operate as emerging aerial base stations (ABSs) alongside legacy terrestrial base stations (TBSs). To improve coverage performance, we propose a coordinated multi-point (CoMP) transmission framework that enables joint transmission from ABSs and TBSs. This approach mitigates the limitations of non-uniform user distributions and enhances reliability for sparse aerial users. Two UAV deployment strategies are considered: \textit{i)} random UAV placement, analyzed using stochastic geometry to derive closed-form coverage expressions, and \textit{ii)} optimized UAV placement using a coverage-aware weighted $K$-means clustering algorithm to maximize cooperative coverage in underserved areas. Theoretical analyses and Monte Carlo simulations demonstrate that the proposed CoMP-enabled VHetNet significantly improves downlink coverage probability, particularly in scenarios with sparse aerial users. These findings highlight the potential of intelligent UAV coordination and geometry-aware deployment to enable robust, adaptive connectivity in low-altitude wireless networks.

cs.IT

Unified Block Signal Processing Framework for LPWANs: Sequence Index Modulation Spreading

Low-power wide-area networks (LPWANs) demand high receiver sensitivity and efficient physical-layer signal processing. This paper introduces a unified framework for generalized block signal transmission in LPWANs, addressing the limitations of conventional symbol-by-symbol approaches. The framework comprises three key components: the signal block vector, the intra-block structure generator, and the signal basis matrix, and leverages quasi-orthogonal codewords formed through cyclically shifted spreading sequences. The resulting quasi-orthogonality enables reliable multi-user separation, particularly under asynchronous access. The framework establishes a conceptual foundation for block synchronization and provides a unified demodulation structure based on block correlation matching. It further supports flexible and systematic implementation, as demonstrated through applications to frequency-shift keying and chirp spread spectrum. This work advances scalable and efficient physical-layer design for next-generation LPWANs.

cs.IT

Hybrid CNN-Transformer Based Sparse Channel Prediction for High-Mobility OTFS Systems

High-mobility scenarios in next-generation wireless networks, such as those involving vehicular communications, require ultra-reliable and low-latency communications (URLLC). However, rapidly time-varying channels pose significant challenges to traditional OFDM-based systems due to the Doppler effect and channel aging. Orthogonal time frequency space (OTFS) modulation offers resilience by representing channels in the quasi-static delay-Doppler (DD) domain. This letter proposes a novel channel prediction framework for OTFS systems using a hybrid convolutional neural network and transformer (CNN-Transformer) architecture. The CNN extracts compact features that exploit the DD-domain sparsity of the channel matrices, while the transformer models temporal dependencies with causal masking for consistency. Simulation experiments under extreme $500$ \si{km/h} mobility conditions demonstrate that the proposed method outperforms state-of-the-art baselines, reducing the root mean square error and mean absolute error by $12.2\%$ and $9.4\%$, respectively. These results demonstrate the effectiveness of DD-domain representations and the proposed model in accurately predicting channels in high-mobility scenarios, thereby supporting the stringent URLLC requirements in future wireless systems.

cs.IT

Energy-Efficient Index and Code Index Modulations for Spread CPM Signals in Internet of Things

The evolution of Internet of Things technologies is driven by four key demands: ultra-low power consumption, high spectral efficiency, reduced implementation cost, and support for massive connectivity. To address these challenges, this paper proposes two novel modulation schemes that integrate continuous phase modulation (CPM) with spread spectrum (SS) techniques. We begin by establishing the quasi-orthogonality properties of CPM-SS sequences. The first scheme, termed IM-CPM-SS, employs index modulation (IM) to select spreading sequences from the CPM-SS set, thereby improving spectral efficiency while maintaining the constant-envelope property. The second scheme, referred to as CIM-CPM-SS, introduces code index modulation (CIM), which partitions the input bits such that one subset is mapped to phase-shift keying symbols and the other to CPM-SS sequence indices. Both schemes are applied to downlink non-orthogonal multiple access (NOMA) systems. We analyze their performance in terms of bit error rate (BER), spectral and energy efficiency, computational complexity, and peak-to-average power ratio characteristics under nonlinear amplifier conditions. Simulation results demonstrate that both schemes outperform conventional approaches in BER while preserving the benefits of constant-envelope, continuous-phase signaling. Furthermore, they achieve higher spectral and energy efficiency and exhibit strong resilience to nonlinear distortions in downlink NOMA scenarios.

cs.IT

A CPFSK Transceiver with Hybrid CSS-DSSS Spreading for LPWAN PHY Communication

Traditional low-power wide-area network (LPWAN) transceivers typically compromise data rates to achieve deep coverage. This paper presents a novel transceiver that achieves high receiver sensitivity and low computational complexity. At the transmitter, we replace the conventional direct sequence spread spectrum (DSSS) preamble with a chirp spread spectrum (CSS) preamble, consisting of a pair of down-chirp and up-chirp signals that are conjugate to each other, simplifying packet synchronization. For enhanced coverage, the payload incorporates continuous phase frequency shift keying (CPFSK) to maintain a constant envelope and phase continuity, in conjunction with DSSS to achieve a high spreading gain. At the receiver, we develop a double-peak detection method to improve synchronization and a non-coherent joint despreading and demodulation scheme that increases receiver sensitivity while maintaining simplicity in implementation. Furthermore, we optimize the preamble detection threshold and spreading sequences for maximum non-coherent receiver performance. The software-defined radio (SDR) prototype, developed using GNU Radio and USRP, along with operational snapshots, showcases its practical engineering applications. Extensive Monte Carlo simulations and field-test trials demonstrate that our transceiver outperforms traditional ones in terms of receiver sensitivity, while also being low in complexity and cost-effective for LPWAN requirements.

cs.IT

Low-Complexity Hybrid Beamforming for Multi-Cell mmWave Massive MIMO: A Primitive Kronecker Decomposition Approach

To circumvent the high path loss of mmWave propagation and reduce the hardware cost of massive multiple-input multiple-output antenna systems, full-dimensional hybrid beamforming is critical in 5G and beyond wireless communications. Concerning an uplink multi-cell system with a large-scale uniform planar antenna array, this paper designs an efficient hybrid beamformer using primitive Kronecker decomposition and dynamic factor allocation, where the analog beamformer applies to null the inter-cell interference and simultaneously enhances the desired signals. In contrast, the digital beamformer mitigates the intra-cell interference using the minimum mean square error (MMSE) criterion. Then, due to the low accuracy of phase shifters inherent in the analog beamformer, a low-complexity hybrid beamformer is developed to slow its adjustment speed. Next, an optimality analysis from a subspace perspective is performed, and a sufficient condition for optimal antenna configuration is established. Finally, simulation results demonstrate that the achievable sum rate of the proposed beamformer approaches that of the optimal pure digital MMSE scheme, yet with much lower computational complexity and hardware cost.

cs.IT

Secrecy Sum-Rate Maximization for Active IRS-Assisted MIMO-OFDM SWIPT System

The propagation loss of RF signals is a significant issue in simultaneous wireless information and power transfer (SWIPT) systems. Additionally, ensuring information security is crucial due to the broadcasting nature of wireless channels. To address these challenges, we exploit the potential of active intelligent reflecting surface (IRS) in a multiple-input and multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) SWIPT system. The active IRS provides better beamforming gain than the passive IRS, reducing the "double-fading" effect. Moreover, the noise introduced at the active IRS can be used as artificial noise (AN) to jam eavesdroppers. This paper formulates a secrecy sum-rate maximization problem related to precoding matrices, power splitting (PS) ratios, and the IRS matrix. Since the problem is highly non-convex, we propose a block coordinate descent (BCD)-based algorithm to find a sub-optimal solution. Moreover, we develop a heuristic algorithm based on the zero-forcing precoding scheme to reduce computational complexity. Simulation results show that the active IRS achieves a higher secrecy sum rate than the passive and non-IRS systems, especially when the transmit power is low or the direct link is blocked. Moreover, increasing the power budget at the active IRS can significantly improve the secrecy sum rate.

cs.IT

Air-to-Ground Communications Beyond 5G: CoMP Handoff Management in UAV Network

Air-to-ground (A2G) networks, using unmanned aerial vehicles (UAVs) as base stations to serve terrestrial user equipments (UEs), are promising for extending the spatial coverage capability in future communication systems. Coordinated transmission among multiple UAVs significantly improves network coverage and throughput compared to a single UAV transmission. However, implementing coordinated multi-point (CoMP) transmission for UAV mobility requires complex cooperation procedures, regardless of the handoff mechanism involved. This paper designs a novel CoMP transmission strategy that enables terrestrial UEs to achieve reliable and seamless connections with mobile UAVs. Specifically, a computationally efficient CoMP transmission method based on the theory of Poisson-Delaunay triangulation is developed, where an efficient subdivision search strategy for a CoMP UAV set is designed to minimize search overhead by a divide-and-conquer approach. For concrete performance evaluation, the cooperative handoff probability of the typical UE is analyzed, and the coverage probability with handoffs is derived. Simulation results demonstrate that the proposed scheme outperforms the conventional Voronoi scheme with the nearest serving UAV regarding coverage probabilities with handoffs. Moreover, each UE has a fixed and unique serving UAV set to avoid real-time dynamic UAV searching and achieve effective load balancing, significantly reducing system resource costs and enhancing network coverage performance.

cs.IT

System-Level Simulation Framework for NB-IoT: Key Features and Performance Evaluation

Narrowband Internet of Things (NB-IoT) is a technology specifically designated by the 3rd Generation Partnership Project (3GPP) to meet the explosive demand for massive machine-type communications (mMTC), and it is evolving to RedCap. Industrial companies have increasingly adopted NB-IoT as the solution for mMTC due to its lightweight design and comprehensive technical specifications released by 3GPP. This paper presents a system-level simulation framework for NB-IoT networks to evaluate their performance. The system-level simulator is structured into four parts: initialization, pre-generation, main simulation loop, and post-processing. Additionally, three essential features are investigated to enhance coverage, support massive connections, and ensure low power consumption, respectively. Simulation results demonstrate that the cumulative distribution function curves of the signal-to-interference-and-noise ratio fully comply with industrial standards. Furthermore, the throughput performance explains how NB-IoT networks realize massive connections at the cost of data rate. This work highlights its practical utility and paves the way for developing NB-IoT networks.

cs.NI

Decentralized Federated Learning with Asynchronous Parameter Sharing for Large-scale IoT Networks

Federated learning (FL) enables wireless terminals to collaboratively learn a shared parameter model while keeping all the training data on devices per se. Parameter sharing consists of synchronous and asynchronous ways: the former transmits parameters as blocks or frames and waits until all transmissions finish, whereas the latter provides messages about the status of pending and failed parameter transmission requests. Whatever synchronous or asynchronous parameter sharing is applied, the learning model shall adapt to distinct network architectures as an improper learning model will deteriorate learning performance and, even worse, lead to model divergence for the asynchronous transmission in resource-limited large-scale Internet-of-Things (IoT) networks. This paper proposes a decentralized learning model and develops an asynchronous parameter-sharing algorithm for resource-limited distributed IoT networks. This decentralized learning model approaches a convex function as the number of nodes increases, and its learning process converges to a global stationary point with a higher probability than the centralized FL model. Moreover, by jointly accounting for the convergence bound of federated learning and the transmission delay of wireless communications, we develop a node scheduling and bandwidth allocation algorithm to minimize the transmission delay. Extensive simulation results corroborate the effectiveness of the distributed algorithm in terms of fast learning model convergence and low transmission delay.

cs.IT

Air-to-Ground Communications Beyond 5G: UAV Swarm Formation Control and Tracking

Unmanned aerial vehicle (UAV) communications have been widely accepted as promising technologies to support air-to-ground communications in the forthcoming sixth-generation (6G) wireless networks. This paper proposes a novel air-to-ground communication model consisting of aerial base stations served by UAVs and terrestrial user equipments (UEs) by integrating the technique of coordinated multi-point (CoMP) transmission with the theory of stochastic geometry. In particular, a CoMP set consisting of multiple UAVs is developed based on the theory of Poisson-Delaunay tetrahedralization. Effective UAV formation control and UAV swarm tracking schemes for two typical scenarios, including static and mobile UEs, are also developed using the multi-agent system theory to ensure that collaborative UAVs can efficiently reach target spatial positions for mission execution. Thanks to the ease of mathematical tractability, this model provides explicit performance expressions for a typical UE's coverage probability and achievable ergodic rate. Extensive simulation and numerical results corroborate that the proposed scheme outperforms UAV communications without CoMP transmission and obtains similar performance to the conventional CoMP scheme while avoiding search overhead.

cs.IT

Edge Learning for Large-Scale Internet of Things With Task-Oriented Efficient Communication

In the Internet of Things (IoT) networks, edge learning for data-driven tasks provides intelligent applications and services. As the network size becomes large, different users may generate distinct datasets. Thus, to suit multiple edge learning tasks for large-scale IoT networks, this paper performs efficient communication under the task-oriented principle by using the collaborative design of wireless resource allocation and edge learning error prediction. In particular, we start with multi-user scheduling to alleviate co-channel interference in dense networks. Then, we perform optimal power allocation in parallel for different learning tasks. Thanks to the high parallelization of the designed algorithm, extensive experimental results corroborate that the multi-user scheduling and task-oriented power allocation improve the performance of distinct edge learning tasks efficiently compared with the state-of-the-art benchmark algorithms.

cs.IT

Ground-to-Air Communications Beyond 5G: Coordinated Multi-Point Transmission Based on Poisson-Delaunay Triangulation

This paper designs a novel ground-to-air communication scheme to serve unmanned aerial vehicles (UAVs) through legacy terrestrial base stations (BSs). In particular, a tractable coordinated multi-point (CoMP) transmission based on the geometry of Poisson-Delaunay triangulation is developed, which provides reliable and seamless connectivity for UAVs. An effective dynamic frequency allocation scheme is designed to eliminate inter-cell interference by using the theory of circle packing. For exact performance evaluation, the handoff probability of a typical UAV is characterized, and then the coverage probability with handoffs is attained. Simulation and numerical results corroborate that the proposed scheme outperforms the conventional CoMP scheme with three nearest cooperating BSs in terms of handoff and coverage probabilities. Moreover, as each UAV has a fixed and unique CoMP BS set, it avoids the real-time dynamic BS searching process, thus reducing the feedback overhead.

cs.IT