arXiv subjects

Dongsheng Zheng

Publications and source records attributed to Dongsheng Zheng.

7 recordsLinked to original sources

arXiv2025

Exploring Device-Oriented Video Encryption for Hierarchical Privacy Protection in AR Content Sharing

Content sharing across multiple Augmented Reality (AR) displays is becoming commonplace, enhancing team communication and collaboration through devices like smartphones and AR glasses. However, this practice raises significant privacy concerns, especially concerning the physical environment visible in AR, which may include sensitive personal details like facial features and identifiable information. Our research focuses on protecting privacy within AR environments, particularly the physical backgrounds visible during content sharing across three common AR display methods: projection, smartphone, and AR glasses. We analyze the potential privacy risks associated with each method and employ a Region Of Interest (ROI) video encryption system to hierarchically encrypt the physical backdrop based on its safety rating. This study pioneers the integration of ROI video encryption at the bitstream level within AR contexts, providing a more efficient solution than traditional pixel-level encryption by enhancing encryption speed and reducing the required space. Our adaptive system dynamically adjusts the encryption intensity based on the AR display method, ensuring tailored privacy protection.

cs.HC↗

arXiv2023

High-Precision Channel Estimation for Sub-Noise Self-Interference Cancellation

Self-interference cancellation plays a crucial role in achieving reliable full-duplex communications. In general, it is essential to cancel the self-interference signal below the thermal noise level, which necessitates accurate reconstruction of the self-interference signal. In this paper, we propose a high-precision channel estimation method specifically designed for sub-noise self-interference cancellation. Exploiting the fact that all transmitted symbols are known to their respective receivers, our method utilizes all transmitted symbols for self-interference channel estimation. Through analytical derivations and numerical simulations, we validate the effectiveness of the proposed method. The results demonstrate the superior performance of our approach in achieving sub-noise self-interference cancellation.

eess.SP↗

arXiv2023

Dynamic NOMA-Based Computation Offloading in Vehicular Platoons

Both the Mobile edge computing (MEC)-based and fog computing (FC)-aided Internet of Vehicles (IoV) constitute promising paradigms of meeting the demands of low-latency pervasive computing. To this end, we construct a dynamic NOMA-based computation offloading scheme for vehicular platoons on highways, where the vehicles can offload their computing tasks to other platoon members. To cope with the rapidly fluctuating channel quality, we divide the timeline into successive time slots according to the channel's coherence time. Robust computing and offloading decisions are made for each time slot after taking the channel estimation errors into account. Considering a certain time slot, we first analytically characterize both the locally computed source data and the offloaded source data as well as the energy consumption of every vehicle in the platoons. We then formulate the problem of minimizing the long-term maximum task queue by optimizing the allocation of both the communication and computing resources. To solve the problem formulated, we design an online algorithm based on the classic Lyapunov optimization method and successive convex approximation (SCA) method. Finally, the numerical simulation results characterize the performance of our algorithm and demonstrate its advantages both over the local computing scheme and the orthogonal multiple access (OMA)-based offloading scheme.

cs.IT↗

arXiv2021

A Practical Consideration on Convex Mutual Information

In this paper, we focus on the convex mutual information, which was found at the lowest level split in multilevel coding schemes with communications over the additive white Gaussian noise (AWGN) channel. Theoretical analysis shows that communication achievable rates (ARs) do not necessarily below mutual information in the convex region. In addition, simulation results are provided as an evidence.

cs.IT↗

arXiv2020

Secure Performance Analysis and Optimization for FD-NOMA Vehicular Communications

Vehicle-to-vehicle (V2V) communication appeals to increasing research interest as a result of its applications to provide safety information as well as infotainment services. The increasing demand of transmit rates and various requirements of quality of services (QoS) in vehicular communication scenarios call for the integration of V2V communication systems and potential techniques in the future wireless communications, such as full duplex (FD) and non-orthogonal multiple access (NOMA) which enhance spectral efficiency and provide massive connectivity. However, the large amount of data transmission and user connectivity give rise to the concern of security issues and personal privacy. In order to analyze the security performance of V2V communications, we introduce a cooperative NOMA V2V system model with an FD relay. This paper focuses on the security performance of the FD-NOMA based V2V system on the physical layer perspective. We first derive several analytical results of the ergodic secrecy capacity. Then, we propose a secrecy sum rate optimization scheme utilizing the instantaneous channel state information (CSI), which is formulated as a non-convex optimization problem. Based on the differential structure of the non-convex constraints, the original problem is approximated and solved by a series of convex optimization problems. Simulation results validate the analytical results and the effectiveness of the secrecy sum rate optimization algorithm.

cs.IT↗

arXiv2019

A Signal Separation Method for Exceeding the Channel Capacity of BPSK Input

The field of the coded modulations witnessed its golden era as the simulated achievable bit rates (ABRs) were getting close to the channel capacities of the finite alphabet inputs. However, when working at a single channel, the previous researches are mostly restricted in scope of single input and single output. In contrast, for achieving higher spectral efficiency, the present authors propose a method that builds upon the parallel transmission of two signals that are separated at the receiver. The signal separation is enabled by, so called, the double mapping modulation working through Hamming- to Euclidean space. Consequently, the ABR summation of the two signals is found higher the channel capacity of BPSK input. Both the theoretical- and simulation result confirm this approach.

cs.IT↗

arXiv2019

Beyond the Channel Capacity of BPSK Input

The paper proposed a method that organizes a parallel transmission of two signals to be separated from each other at receiver through Hamming- to Euclidean space, where the conventional problem of achievable bit rate (ABR) is converted to that of the ABR's summation with respect to the two separated signals. Actually, the mutual information is separated accordingly into two. Since the mutual information is non-linear function of signal power in general, the separation brings a chance for achieving higher ABR. The proposed work proceeds along the above thinking and achieves higher bit-error-rate (BER) performance in comparison with BPSK as shown in the simulations. Moreover, one can find theoretically beyond of channel capacity of BPSK input.

cs.IT↗