Searcharxiv⌕ Search

arXiv subjects

Shidong Zhou

Publications and source records attributed to Shidong Zhou.

At least 19 recordsLinked to original sources
arXiv2026

Beyond Spherical Wavefront: Near-Field Channel Estimation Under Wavefront Anisotropy

Extremely large aperture arrays (ELAAs) and millimeter-wave (mmWave) technologies are essential for achieving high data rates in future wireless communication systems. To perform precise beamforming, these systems require accurate channel estimation, in which the near-field wavefront curvature effect must be taken into account. Existing channel estimation methods rely on the spherical wavefront channel (SWC) model, which is suitable for near-field propagation with point sources, scatterers, and reflection planes. However, when a near-field curved reflecting surface exists, the wavefront of the reflected wave becomes anisotropic rather than spherical, causing the SWC model to become inaccurate. To address this problem, in this paper, we formulate a parameterized model for the anisotropic wavefront channel (AWC). Using this model, we propose a channel estimation algorithm based on physical parameter recovery for the AWC. Simulation results reveal that the AWC no longer retains sparsity in the angle-distance domain. Furthermore, the results demonstrate how different physical characteristics of the propagation scenario affect the degree of wavefront anisotropy, and confirm the effectiveness of our proposed algorithm in AWC scenarios.

eess.SP↗
arXiv2026

Matching-free Acquisition of Channels with Anisotropic Wavefronts

The escalating data rate demands of future wireless communications necessitate the deployment of extremely large aperture arrays (ELAAs) in communication systems. Acquiring accurate channel state information is crucial to execute effective precoding for such systems, in which the near-field curvature effects on the channel must be considered. Current channel estimation algorithms are generally restricted to the spherical wavefront channel (SWC), which is appropriate for isotropic scatterers, point sources, and planar reflecting surfaces. However, in practical scenarios involving curved reflecting surfaces, the reflected waves exhibit anisotropic rather than spherical wavefronts, significantly degrading the accuracy of conventional SWC-based algorithms. To tackle this challenge, we first derive a parameterized model for the anisotropic wavefront channel (AWC). Based on this model, we then propose the matching-free acquisition of channels with anisotropic wavefronts (MACAW) algorithm. Unlike conventional dictionary-based matching pursuit techniques, MACAW recovers channel parameters through fast-Fourier-transform-based frequency analysis. This approach enables precise channel estimation in AWC scenarios while maintaining a significantly lower computational complexity than existing methods. Simulation results illustrate how physical characteristics of the propagation environment influence the degree of wavefront anisotropy, and demonstrate the effectiveness of the proposed algorithm.

eess.SP↗
arXiv2026

Constructing Knowledge Map for MIMO-OFDM Clustered Channel Estimation

Channel knowledge map (CKM) exploits environ-ment information to assist channel estimation during communi-cation. For clustered channels, which represent a typical type ofwireless propagation environment, there has been no researchdevoted to designing an appropriate CKM to enhance theirestimation. To exploit environment information for clusteredchannel, improve channel estimation accuracy and reduce pilotoverhead, we propose ClusterCKM, a CKM providing the rangeof clustered multipath parameters for any pair of transmitter-receiver links in the region of interest. Firstly, we construct Clus-terCKM through estimating the spatial range of scatterer clustersfrom historical channel information. From these spatial range ofscatterer clusters, ClusterCKM infers the range of multipathparameters for the target link. Furthermore, a ClusterCKM-based channel estimation algorithm is developed to utilize theparameter range provided by ClusterCKM. Simulation resultsshow that, more accurate channel estimation can be achievedand pilot overhead can also be reduced by ClusterCKM and theClusterCKM-based estimation algorithm.

eess.SP↗
arXiv2026

Time-Scale-Adaptable Spectrum Sharing for Hybrid Satellite-Terrestrial Networks

Cooperation between satellite and terrestrial wireless networks promises great potential in meeting fast-growing demands for ubiquitous communications coverage. To tackle spectrum scarcity, spectrum sharing is studied for a hybrid satellite-terrestrial network where satellite links share the same group of time-slotted sub-carriers with terrestrial links opportunistically. In particular, with coarse network-wide time synchronization, a time-scale-adaptable spectrum sharing framework is proposed based on a satellite-terrestrial cooperation time scale that can be flexibly adjusted according to practical requirements. For generality, it is assumed that both full and partial frequency reuse could be adopted among the base stations (BSs) and satellite selection is supported when multiple satellites are available. Relying on only statistical channel state information (CSI), joint link scheduling and power control are explored to maximize the average sum rate of the network while ensuring quality of service (QoS) for users. To solve the complicated mixed integer programming (MIP) problem, a low-complexity spectrum sharing scheme is presented based on link-feature-sketching-aided hierarchical link clustering and Monte-Carlo-and-successive-approximation-aided transmit power optimization. Simulation results demonstrate that by link feature sketching, diversity of the links brought by the spatial distribution of the users could be well utilized. The proposed scheme promises a significant performance gain even under strict inter-link interference constraints.

cs.IT↗
arXiv2025

Path Evolution Model for Endogenous Channel Digital Twin towards 6G Wireless Networks

Massive Multiple Input Multiple Output (MIMO) is critical for boosting 6G wireless network capacity. Nevertheless, high dimensional Channel State Information (CSI) acquisition becomes the bottleneck of 6G massive MIMO system. Recently, Channel Digital Twin (CDT), which replicates physical entities in wireless channels, has been proposed, providing site-specific prior knowledge for CSI acquisition. However, external devices (e.g., cameras and GPS devices) cannot always be integrated into existing communication systems, nor are they universally available across all scenarios. Moreover, the trained CDT model cannot be directly applied in new environments, which lacks environmental generalizability. To this end, Path Evolution Model (PEM) is proposed as an alternative CDT to reflect physical path evolutions from consecutive channel measurements. Compared to existing CDTs, PEM demonstrates virtues of full endogeneity, self-sustainability and environmental generalizability. Firstly, PEM only requires existing channel measurements, which is free of other hardware devices and can be readily deployed. Secondly, self-sustaining maintenance of PEM can be achieved in dynamic channel by progressive updates. Thirdly, environmental generalizability can greatly reduce deployment costs in dynamic environments. To facilitate the implementation of PEM, an intelligent and light-weighted operation framework is firstly designed. Then, the environmental generalizability of PEM is rigorously analyzed. Next, efficient learning approaches are proposed to reduce the amount of training data practically. Extensive simulation results reveal that PEM can simultaneously achieve high-precision and low-overhead CSI acquisition, which can serve as a fundamental CDT for 6G wireless networks.

eess.SP↗
arXiv2024

Age of Information-Oriented Probabilistic Link Scheduling for Device-to-Device Networks

This paper focuses on optimizing the long-term average age of information (AoI) in device-to-device (D2D) networks through age-aware link scheduling. The problem is naturally formulated as a Markov decision process (MDP). However, finding the optimal policy for the formulated MDP in its original form is challenging due to the intertwined AoI dynamics of all D2D links. To address this, we propose an age-aware stationary randomized policy that determines the probability of scheduling each link in each time slot based on the AoI of all links and the statistical channel state information among all transceivers. By employing the Lyapunov optimization framework, our policy aims to minimize the Lyapunov drift in every time slot. Nonetheless, this per-slot minimization problem is nonconvex due to cross-link interference in D2D networks, posing significant challenges for real-time decision-making. After analyzing the permutation equivariance property of the optimal solutions to the per-slot problem, we apply a message passing neural network (MPNN), a type of graph neural network that also exhibits permutation equivariance, to optimize the per-slot problem in an unsupervised learning manner. Simulation results demonstrate the superior performance of the proposed age-aware stationary randomized policy over baselines and validate the scalability of our method.

eess.SP↗
arXiv2024

Channel Correlation Matrix Extrapolation Based on Roughness Calibration of Scatterers

To estimate the channel correlation matrix (CCM) in areas where channel information cannot be collected in advance, this paper proposes a way to spatially extrapolate CCM based on the calibration of the surface roughness parameters of scatterers in the propagation scene. We calibrate the roughness parameters of scene scatters based on CCM data in some specific areas. From these calibrated roughness parameters, we are able to generate a good prediction of the CCM for any other area in the scene by performing ray tracing. Simulation results show that the channel extrapolation method proposed in this paper can effectively realize the extrapolation of the CCM between different areas in frequency domain, or even from one domain to another.

eess.SP↗
arXiv2024

A Dynamic Resource Scheduling Algorithm Based on Traffic Prediction for Coexistence of eMBB and Random Arrival URLLC

In this paper, we propose a joint design for the coexistence of enhanced mobile broadband (eMBB) and ultra-reliable and random low-latency communication (URLLC) with different transmission time intervals (TTI): an eMBB scheduler operating at the beginning of each eMBB TTI to decide the coding redundancy of eMBB code blocks, and a URLLC scheduler at the beginning of each mini-slot to perform immediate preemption to ensure that the randomly arriving URLLC traffic is allocated with enough radio resource and the eMBB traffic keeps acceptable one-shot transmission successful probability and throughput. The framework for schedulers under hybrid-TTI is developed and a method to configure eMBB code block based on URLLC traffic arrival prediction is implemented. Simulations show that our work improves the throughput of eMBB traffic without sacrificing the reliablity while supporting randomly arriving URLLC traffic.

cs.NI↗
arXiv2024

High-Efficiency Urban 3D Radio Map Estimation Based on Sparse Measurements

Recent widespread applications for unmanned aerial vehicles (UAVs) -- from infrastructure inspection to urban logistics -- have prompted an urgent need for high-accuracy three-dimensional (3D) radio maps. However, existing methods designed for two-dimensional radio maps face challenges of high measurement costs and limited data availability when extended to 3D scenarios. To tackle these challenges, we first build a real-world large-scale 3D radio map dataset, covering over 4.2 million m^3 and over 4 thousand data points in complex urban environments. We propose a Gaussian Process Regression-based scheme for 3D radio map estimation, allowing us to realize more accurate map recovery with a lower RMSE than state-of-the-art schemes by over 2.5 dB. To further enhance data efficiency, we propose two methods for training point selection, including an offline clustering-based method and an online maximum a posterior (MAP)-based method. Extensive experiments demonstrate that the proposed scheme not only achieves full-map recovery with only 2% of UAV measurements, but also sheds light on future studies on 3D radio maps.

cs.IT↗
arXiv2023

Joint Analog Encoder Design for Multi-Task Oriented Wireless Communication

In this paper we study multi-task oriented communication system via studying analog encoding method for multiple estimation tasks. The basic idea is to utilize the correlation among interested information required by different tasks and the feature of broadcast channel. For linear estimation tasks, we provide a low complexity design for multi-user multi-task system based on orthogonal decomposition of subspaces. It is proved to be optimal in some special cases, and for general cases, numerical results also show it can achieve near-optimal performance. Further, we make a trial to migrate above method to neural networks based non-linear estimation tasks, and it also shows improvement in energy efficiency.

cs.IT↗
arXiv2022

Near-Field Rainbow: Wideband Beam Training for XL-MIMO

Wideband extremely large-scale multiple-input-multiple-output (XL-MIMO) is a promising technique to achieve Tbps data rates in future 6G systems through beamforming and spatial multiplexing. Due to the extensive bandwidth and the huge number of antennas for wideband XL-MIMO, a significant near-field beam split effect will be induced, where beams at different frequencies are focused on different locations. The near-field beam split effect results in a severe array gain loss, so existing works mainly focus on compensating for this loss by utilizing the time delay (TD) beamformer. By contrast, this paper demonstrates that although the near-field beam split effect degrades the array gain, it also provides a new possibility to realize fast near-field beam training. Specifically, we first reveal the mechanism of the near-field controllable beam split effect. This effect indicates that, by dedicatedly designing the delay parameters, a TD beamformer is able to control the degree of the near-field beam split effect, i.e., beams at different frequencies can flexibly occupy the desired location range. Due to the similarity with the dispersion of natural light caused by a prism, this effect is also termed as the near-field rainbow in this paper. Then, taking advantage of the near-field rainbow effect, a fast wideband beam training scheme is proposed. In our scheme, the close form of the beamforming vector is elaborately derived to enable beams at different frequencies to be focused on different desired locations. By this means, the optimal beamforming vector with the largest array gain can be rapidly searched out by generating multiple beams focused on multiple locations simultaneously through only one radio-frequency (RF) chain. Finally, simulation results demonstrate the proposed scheme is able to realize near-optimal nearfield beam training with a very low training overhead.

cs.IT↗
arXiv2022

Noisy Sensor Scheduling in Wireless Networked Control Systems: Freshness or Precision

In linear wireless networked control systems whose control is based on the system state's noisy and delayed observations, an accurate functional relationship is derived between the estimation error and the observations' freshness and precision. The proposed functional relationship is then applied to formulate and solve the problem of scheduling among different wireless links from multiple noisy sensors, where a sliding window algorithm is further proposed. The algorithm's simulation results show significant performance gain over existing policies, even in scenarios that require high freshness or precision of observations.

cs.IT↗
arXiv2022

Optimal Update for Energy Harvesting Sensor with Reliable Backup Energy

In this paper, we consider an information update system where a wireless sensor sends timely updates to the destination over an erasure channel with the supply of harvested energy and reliable backup energy. The metric Age of Information(AoI) is adopted to measure the timeliness of the received updates at the destination. We aim to find the optimal information updating policy that minimizes the time-average weighted sum of the AoI and the reliable backup energy cost by formulating an infinite state Markov decision process(MDP). The optimal information updating policy is proved to have a threshold structure. Based on this special structure, an algorithm for efficiently computing the optimal policy is proposed. Numerical results show that the optimal updating policy proposed outperforms baseline policies.

cs.IT↗
arXiv2021

Optimal Update in Energy Harvesting Aided Terahertz Communications with Random Blocking

In this paper, we consider an information update system where wireless sensor sends timely updates to the destination over a random blocking terahertz channel with the supply of harvested energy and reliable energy backup. The paper aims to find the optimal information updating policy that minimize the time-average weighted sum of the Age of information(AoI) and the reliable energy costs by formulating an infinite state Markov decision process(MDP). With the derivation of the monotonicity of value function on each component, the optimal information updating policy is proved to have a threshold structure. Based on this special structure, an algorithm for efficiently computing the optimal policy is proposed. Numerical results show that the optimal updating policy proposed outperforms baseline policies.

cs.IT↗
arXiv2020

Fast Accurate Beam and Channel Tracking for Two-dimensional Phased Antenna Arrays

The sparsity and the severe attenuation of millimeter-wave (mmWave) channel imply that highly directional communication is needed. The narrow beam produced by large array requires accurate alignment, which is difficult to achieve when serving fast-moving users. In this paper, we focus on accurate two-dimensional (2D) beam and channel tracking problem aiming at minimizing exploration overhead and tracking error. Using a typical frame structure with periodic exploration and communication, a proven minimum overhead of exploration is provided first. Then tracking algorithms are designed for three types of channels with different dynamic properties. It is proved that the algorithms for quasi-static channels and channels in Dynamic Case I are optimal in approaching the minimum Cramer-Rao lower bound (CRLB). The computational complexity of our algorithms is analyzed showing their efficiency, and simulation results verify their advantages in both tracking error and tracking speed.

cs.IT↗
arXiv2020

Transmission Scheduling for Multi-loop Wireless Networked Control Based on LQ Cost Offset

In this paper, transmission scheduling for multiloop wireless networked control systems sharing the wireless channel is considered. A linear quadratic cost offset has been proposed to evaluate the performance gap induced by the nonideal communication. A functional relationship between linear quadratic offset metric and Age of Information has been built up. Based on the offset metric, we come up with an age-based scheduling policy and numerical simulations show that there is a significant improvement compared to the former work.

cs.IT↗
arXiv2020

Massive Access for Future Wireless Communication Systems

Multiple access technology played an important role in wireless communication in the last decades: it increases the capacity of the channel and allows different users to access the system simultaneously. However, the conventional multiple access technology, as originally designed for current human-centric wireless networks, is not scalable for future machine-centric wireless networks. Massive access (studied in the literature under such names as massive-device multiple access, unsourced massive random access, massive connectivity, massive machine-type communication, and many-access channels) exhibits a clean break with current networks by potentially supporting millions of devices in each cellular network. The tremendous growth in the number of connected devices requires a fundamental rethinking of the conventional multiple access technologies in favor of new schemes suited for massive random access. Among the many new challenges arising in this setting, the most relevant are: the fundamental limits of communication from a massive number of bursty devices transmitting simultaneously with short packets, the design of low complexity and energy-efficient massive access coding and communication schemes, efficient methods for the detection of a relatively small number of active users among a large number of potential user devices with sporadic transmission pattern, and the integration of massive access with massive MIMO and other important wireless communication technologies. This paper presents an overview of the concept of massive access wireless communication and of the contemporary research on this important topic.

cs.IT↗