ZBZhihua Bao

Zhihua Bao

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhihua Bao has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Landscape of Near-Field Communications: Pathways, Opportunities, and Challenges

    by Jiachen Qian, Jue Wang, Zhihua Bao

    With the rapid development of sixth generation (6G) mobile communication, the demands for terabit per second data rates and high-density connections have sharply increased, driving the adoption of innovative technologies such as extremely large-scale antenna arrays (ELAA) and terahertz (THz) spectrum. Built on this, near-field communication (NFC) has been introduced with spherical wave, which differs to the traditional channel modeling of far-field communication and renders existing methods such as plane wave assumption ineffective. Fortunately, near-field beamfocusing can concentrate energy at a specific point in space by controlling the spherical wave, significantly improving the transmission performance. Therefore, to fully clarify the superior energy positioning and high spatial resolution characteristics of NFC, we firstly elaborate the boundary between near-field and far-field region, the features of beamfocusing, novel structure and design of antenna array, and cross-field transmission schemes. Following that, the integrations of emerging technologies and NFC are explored, including of reconfigurable intelligent surface (RIS), integrated sensing and communication (ISAC), multiple access, and physical layer security (PLS). In addition, the antenna array design is studied by a simple case, where the optimal shape of array is obtained. Moreover, the challenges of NFC are provided to support the future ultra dense networks and secure Internet of Things (IoT), such as accurate near-field channel modeling, effective channel estimation, challenges of practical deployment, and artificial intelligence (AI) utilization of NFC.

  • Payload symbol-based nonlinear RF fingerprint for wireless QPSK-OFDM devices

    by Honglin Yuan, Yan Yan, Guoan Zhang, Zhihua Bao

    Radio Frequency (RF) fingerprinting is one physical-layer authentication method for wireless communication, which uses the unique hardware characteristic of the transmitter to identify its true identity. To improve the performance of RF Fingerprint (RFF) based on preamble with fixed duration, a nonlinear RF fingerprinting method based on payload symbols is proposed for the wireless OFDM communication with the bit mapping scheme of QPSK. The wireless communication system is modeled as a Hammerstein system containing the nonlinear transmitter and multipath fading channel. A parameter separation technique based on orthogonal polynomial is presented for the estimation of the parameters of the Hammerstein system. The Hammerstein system parameter separation technique is firstly used to estimate the linear parameter with the training signal, which is used to compensate the adverse effect of the linear channel for the demodulation of the successive payload symbols. The demodulated payload symbols are further used to estimate the nonlinear coefficients of the transmitter with the Hammerstein system parameter separation technique again, which is used as the novel RFF for the authentication of the QPSK-OFDM device. Numerical simulations have verified the proposed method, which can also be extended to the OFDM signals with other bit mapping schemes.


  • Multipath Canceled RF Fingerprinting for Wireless OFDM Devices Based on Hammerstein System Parameter Separation

    by Honglin Yuan, Yan Yan, Zhihua Bao, Chen Xu, Juping Gu, Jiangzhou Wang

    Radio frequency fingerprint (RFF) based authentication of wireless devices can be used in the fields of the access security at the physical-layer of wireless networks and radio spectrum management. However, the stability of RFF is easily damaged by the wireless multipath fading channel in mobile communications. An RFF fingerprinting method with the nonlinearity and in-phase and quadrature (IQ) imbalance of the transmitter is proposed for chunk-based wireless orthogonal frequency division multiplexing (OFDM) devices based on a Hammerstein system parameter separation technique, which cancels the adverse influence of the time-varying multipath channel. First, the parameters of the nonlinear model of the transmitter and finite impulse response (FIR) of the wireless multipath channel are estimated with the Hammerstein system parameter separation technique. Second, the best IQ imbalance parameter combination is obtained with the FIR estimation of the channel. Finally, the estimated parameters of the nonlinear model and IQ imbalance are used as RFFs to classify the transmitters. Theoretical analyses and numerical experiments demonstrate that the obtained RFFs are stable and the fusion authentication of transmitters with subtle differences from the same model and same series is feasible using the novel method.


  • Open Access

    Nonlinear RF Fingerprints Authentication for OFDM Wireless Devices based on Demodulated Symbols

    by Yan Yan, Hong-Lin Yuan, Zhi-Hua Bao, Guo-An Zhang

    Radio Frequency fingerprints (RFF) authentication is one of the methods for the physical-layer information security, which uses the hardware characteristics of the transmitter to identify its real identity. In order to improve the performance of RFF based on preamble with fixed duration, a nonlinear RFF authentication method based on payload symbols is proposed for the wireless OFDM devices with the bit mapping scheme of QPSK. The communication system is modeled as a Hammerstein system containing the nonlinear transmitter and wireless multipath fading channel. A parameter separation technique based on orthogonal polynomial is presented for the estimation of the parameters of the Hammerstein system. The Hammerstein system parameter separation technique is firstly used to estimate the linear parameter with the training signal, which is used to compensate the adverse effect of the linear channel for the demodulation of the successive payload symbols. The demodulated payload symbols are further used to estimate the nonlinear coefficients of the transmitter with the Hammerstein system parameter separation technique again, which is used as the novel RFF for the authentication of the QPSK-OFDM devices. Numerical experiments demonstrate that the proposed method is feasible. The novel method can also be extended to the OFDM signals with other bit mapping schemes.

  • On Multi-Hop Short-Packet Communications: Recoding or End-to-End Fountain Coding?

    by Ye Li, Bin Tang, Jue Wang, Zhihua Bao

    This paper compares the end-to-end (E2E) fountain codes and random linear network coding (RLNC) for lossy multi-hop short-packet communications, under the constraint that the coding coefficient overhead imposed by RLNC recoding is non-negligible. The decoding failure probability (DFP) of RLNC is analyzed and computed as a function of the most relevant parameters. A DFP minimization problem is formulated and numerically solved from a cross-layer perspective. By comparing the codes using optimized parameters, the DFP of RLNC is shown to be higher than that of the E2E codes, which is due to the coefficient overhead. The results suggest that E2E fountain codes might be preferred for multi-hop short-packet communications.


  • On Data Dissemination Enhanced by Network Coded Device-to-Device Communications

    by Ye Li, Jin Zhou, Jue Wang, Zhihua Bao, Tony Q. S. Quek, Jiangzhou Wang

    Data dissemination to multiple users within a predetermined deadline is a commonly required function in many emerging wireless scenarios. In this paper, we propose a data dissemination scheme enhanced by device-to-device (D2D) communications and random linear network coding (RLNC), where the broadcast and the D2D links are used simultaneously with on-the-fly RLNC to accelerate the dissemination. The probability distribution of the completion time of using either pure or systematic RLNC is analyzed assuming a finite field size, under a general model where the cooperation may occur probabilistically and multiple packets may be exchanged between the D2D users in each time slot. An optimization problem is formulated to design the cooperation parameters to minimize the expected energy consumption of the system. Numerical and simulation results show that the analysis is accurate, and that to minimize the energy consumption a tradeoff exists between allowing for longer broadcast and for more intensive cooperation. The cooperation parameters designed for multiple D2D pairs are shown to be effective for meeting the reliability requirements.


  • Distributed Energy Efficient Resource Allocation for OFDMA Smallcell Networks

    by Guodong Zhang, Shibing Zhang, Zhihua Bao

    Japan's largest platform for academic e-journals: J-STAGE is a full text database for reviewed academic papers published by Japanese societies

  • A Low-Complexity Coded Transmission Scheme Over Finite-Buffer Relay Links

    by Ye Li, Shibing Zhang, Jue Wang, Xiaodong Ji, Huangnan Wu, Zhihua Bao

    Relay transmissions play an important role in many types of communication systems. In this paper, we consider packet-level coded transmissions over lossy relay links with the finite-buffer and coding coefficients delivery cost constraints. We propose a low-complexity coding scheme where packets are encoded from sequentially formed random subsets of source packets called batches. The relay recodes only from the buffered packets belonging to the same batch to maintain the code sparsity, lowering the packet header overhead and the decoding complexity compared to the random linear network coding (RLNC). To analyze the performance, we first propose an absorbing Markov chain model to analyze the RLNC transmission over finite-buffer relay links. The finite-length analysis not only provides a lower bound on the completion time using any sparser random codes but also characterizes each individual batch's transmission of the proposed code. Based on the analysis, another Markov chain is proposed to determine the decoding failure probability and the expected completion time of the batch coding scheme. As shown through analysis and simulations, the proposed scheme achieves higher effective end-to-end rates than RLNC when the coding coefficients delivery cost is considered and is also with much lowered decoding complexity thanks to its sparseness.