Zheng Zhang 0037

dblp:181/2621-37 · DBLP profile ↗
← Back
14ranked-venue papers
10as first author
11since 2021 · last 2025
0000-0001-8613-3012ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 13 · 10 first-author · 11 since 2021
YearPublicationVenuePosition
2025 Dual-Functional Artificial Noise (DFAN) Aided Robust Covert Communications in Integrated Sensing and Communications
abstract
This paper investigates covert communications in an integrated sensing and communications system, where a dual-functional base station (called Alice) covertly transmits signals to a covert user (called Bob) while sensing multiple targets, with one of them acting as a potential watcher (called Willie) and maliciously eavesdropping on legitimate communications. To shelter the covert communications, Alice transmits additional dual-functional artificial noise (DFAN) with a varying power not only to create uncertainty at Willie’s signal reception to confuse Willie but also to sense the targets simultaneously. Based on this framework, the weighted sum of the sensing beampattern means square error (MSE) and cross correlation is minimized by jointly optimizing the covert communications and DFAN signals subject to the minimum covert rate requirement. The robust design considers both cases of imperfect Willie’s CSI (WCSI) and statistical WCSI. Under the worst-case assumption that Willie can adaptively adjust the detection threshold to achieve the best detection performance, the minimum detection error probability (DEP) at Willie is analytically derived in the closed-form expression. The formulated covertness constrained optimization problems are tackled by a feasibility-checking based difference-of-convex relaxation (DC) algorithm utilizing the S-procedure, Bernstein-type inequality, and the DC method. Simulation results validate the feasibility of the proposed scheme and demonstrate the covertness performance gains achieved by our proposed design over various benchmarks.
Runzhe Tang, Long Yang 0002, Lu Lv 0001, Zheng Zhang 0037, Yuanwei Liu, Jian Chen 0002
IEEE Trans. Commun.4
2025 ASTARS Aided Satellite Communications: An Adaptive User Pairing Approach
abstract
Satellite communication is a crucial component for achieving global communications in sixth generation (6G). Due to the large distance between the satellite and the terrestrial users, the multiplicative fading effects of traditional passive simultaneous transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) are more severe in satellite communication. Recently, active simultaneous transmitting and reflecting surfaces (ASTARSs) have been proposed to mitigate multiplicative fading by amplifying the incident signal. Motivated by the above, a novel ASTARS-aided non-orthogonal multiple access (NOMA) satellite communication network is proposed in this paper, which includes one low earth orbit (LEO) satellite, one ASTARS and several far-field users (FFUs) and near-field users (NFUs). We propose an adaptive NOMA pairing strategy that allows the satellite to flexibly select pairing schemes. Depending on the users’ quality of service requirements, either the NFU-FFU (NF) pairing scheme or the NFU-NFU (NN) pairing scheme can be used. Then, we formulate an optimization problem to maximize the channel capacity. A two-layer optimization algorithm is proposed, where the outer layer selects the NOMA user pairing schemes, while the inner layer alternately optimizes the NOMA power allocation factors, the satellite precoding matrix and the ASTARS phase shift matrices. To solve the non-convex optimization problem, successive convex approximation and a penalty-based method are employed. The numerical results reveal: 1) The channel capacity of the NF pairing scheme is always higher than that of the NN pairing scheme; 2) Compared to the “Without RIS" and “Passive STARS" schemes, ASTARS can significantly improve the channel capacity of satellite communication.
Zhengyu Song, Tianwei Hou, Anna Li, Zheng Zhang 0037, Yuanwei Liu, Arumugam Nallanathan
IEEE Trans. Commun.5
2024 Dynamic Metasurface Antenna-Enabled Near-Field NOMA Communications
abstract
A novel near-field transmission framework is proposed for dynamic metasurface antenna (DMA)-enabled non-orthogonal multiple access (NOMA) networks. The base station (BS) exploits the hybrid beamforming to communicate with multiple near users (NUs) and far users (FUs) using the NOMA principle. Based on this framework, a beam-steering scheme is proposed. The metric of beam pattern error (BPE) is introduced for the characterization of the gap between the hybrid beamformers and the desired ideal beamformers, where a two-layer algorithm is proposed to minimize BPE by optimizing hybrid beamformers. Then, the optimal power allocation strategy is obtained to maximize the sum achievable rate of the network. Numerical results validate that the proposed beamforming schemes exhibit superior performance compared with the existing imperfect-resolution-based beamforming scheme.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Jian Chen 0002
GLOBECOM1
2024 Hybrid Beamforming Design for Near-Field SWIPT Networks
abstract
A near-field simultaneous wireless information and power transfer (SWIPT) network is investigated, where the hybrid beamforming architecture is employed at the base station to send the information beams for information transmission while charging energy harvesting users. A transmit power minimization problem is formulated by jointly optimizing the analog beamformer and the baseband digital beamformers. To tackle the non-convex optimization problem, a penalty-based two-layer (PTL) algorithm is proposed to optimize the analog beamformer and baseband digital information beamformers. By employing the block coordinate descent method, the optimal analog beamformer, and baseband digital information beamformers are obtained in the closed-form expressions. Moreover, a low-complexity two-stage algorithm to reduce the high computational complexity caused by the large number of antennas is proposed. Numerical results illustrate that: 1) the proposed PTL algorithm can achieve near-optimal performance; and 2) in contrast to the far-field SWIPT, a single near-field beamformer can focus the energy on multiple locations.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Xidong Mu, Jian Chen 0008
ICC1
2024 Near-Field Communications for DMA-NOMA Networks
abstract
A novel near-field transmission framework is proposed for dynamic metasurface antenna (DMA)-enabled nonorthogonal multiple access (NOMA) networks. The base station (BS) exploits the hybrid beamforming to communicate with multiple near users (NUs) and far users (FUs) using the NOMA principle. Based on this framework, two novel beamforming schemes are proposed. 1) For the case of the grouped users distributed in the same direction, a beam-steering scheme is developed. The metric of beam pattern error (BPE) is introduced for the characterization of the gap between the hybrid beamformers and the desired ideal beamformers, where a two-layer algorithm is proposed to minimize BPE by optimizing hybrid beamformers. Then, the optimal power allocation strategy is obtained to maximize the sum achievable rate of the network. 2) For the case of users randomly distributed, a beam-splitting scheme is proposed, where two subbeamformers are extracted from the single beamformer to serve different users in the same group. An alternating optimization (AO) algorithm is proposed for hybrid beamformer optimization, and the optimal power allocation is also derived. Numerical results validate that: 1) the proposed beamforming schemes exhibit superior performance compared with the existing imperfect-resolution-based beamforming scheme and 2) the communication rate of the proposed transmission framework is sensitive to the imperfect distance knowledge of NUs but not to that of FUs.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Jian Chen 0002, Dong In Kim 0001
IEEE Internet Things J.1
2024 Simultaneous Wireless Information and Power Transfer in Near-Field Communications
abstract
A near-field simultaneous wireless information and power transfer (SWIPT) network is investigated, where the hybrid beamforming architecture is employed at the base station (BS) for information transmission while charging the energy harvesting users. A transmit power minimization problem is formulated by jointly optimizing the analog beamformer, the baseband digital information/energy beamformers, and the number of dedicated energy beams. To tackle the uncertain number of dedicated energy beams, a semidefinite relaxation-based rank-one solution construction method is proposed to obtain the optimal baseband digital beamformers under the fixed analog precoder. Based on the structure of the optimal baseband digital beamformers, it is proved that no dedicated energy beam is required in the near-field SWIPT. To further exploit this insight, a penalty-based two-layer (PTL) algorithm is proposed to optimize the analog beamformer and baseband digital information beamformers. By employing the block coordinate descent method, the optimal analog beamformer, and baseband digital information beamformers are obtained in the closed-form expressions. Moreover, to reduce the high computational complexity caused by the large number of antennas, a low-complexity two-stage algorithm is proposed. Numerical results illustrate that: 1) the proposed PTL algorithm can achieve near-optimal performance and 2) in contrast to the far-field SWIPT, a single near-field beamformer can focus the energy on multiple locations.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Xidong Mu, Jian Chen 0002
IEEE Internet Things J.1
2024 STARS-ISAC: How Many Sensors Do We Need?
abstract
A simultaneously transmitting and reflecting surface (STARS) enabled two-phase integrated sensing and communications (ISAC) framework is proposed, where a novel bi-directional sensing-STARS architecture is devised to facilitate the full-space communication and sensing in a time-switching manner. Based on the proposed framework, a joint optimization problem is formulated, where the Cram$\acute {\text {e}}\text{r}$-Rao bound (CRB) for estimating the 2-dimension direction-of-arrival of the sensing target is minimized. Two cases are considered for sensing performance enhancement. 1) For the two-user case with the fixed number of sensors, an alternating optimization algorithm is proposed. In particular, the maximum number of deployable sensors is obtained in the closed-form expressions, where the maximum number of sensors is revealed to be only relevant to the QoS requirements of communications. 2) For the multi-user case with the variable number of sensors, an extended CRB (ECRB) metric is proposed to characterize the impact of the number of sensors on the sensing performance. A generic decoupling approach is proposed to convexify the non-convex ECRB expression. Based on this, a novel penalty-based double-loop (PDL) algorithm is proposed. Simulation results reveal that 1) the proposed PDL algorithm achieves a near-optimal performance with consideration of sensor deployment; 2) it is preferable to deploy more passive elements than sensors in terms of achieving optimal sensing performance.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Jian Chen 0002
IEEE Trans. Wirel. Commun.1
2024 Dynamic MIMO Architecture Design for Near-Field Communications
abstract
A novel dynamic hybrid beamforming architecture is proposed to achieve the spatial multiplexing-power consumption tradeoff for near-field multiple-input multiple-output (MIMO) networks, where a switch module is integrated between the baseband digital and analog phase-shift module to control the number of activated RF chains. Based on this architecture, an optimization problem is formulated that maximizes the sum of achievable rates while minimizing the hardware power consumption. Both continuous and discrete phase shifters are considered. 1) For continuous phase shifters, a wavenumber-domain weighted minimum mean-square error (WD-WMMSE) algorithm is proposed, which exploits the sparsity of WD near-field channels to achieve the low-dimensional beamformer design. 2) For discrete phase shifters, a penalty-based layered iterative (PLI) algorithm is proposed. The closed-form analog and baseband digital beamformers are derived in each iteration. Simulation results demonstrate that: 1) the proposed dynamic beamforming architecture outperforms the conventional fixed hybrid beamforming architecture in terms of spatial multiplexing-power consumption tradeoff, and 2) the proposed algorithms achieve better performance than the other baseline schemes.
Zheng Zhang 0037, Yuanwei Liu, Zhaolin Wang 0001, Jian Chen 0002, Tony Q. S. Quek
IEEE Trans. Wirel. Commun.1
2022 Securing NOMA Networks by Exploiting Intelligent Reflecting Surface
abstract
This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a base station (BS) serves users securely with the assistance of distributed IRSs. Considering that eavesdropper’s instantaneous channel state information (CSI) is challenging to acquire in practice, we utilize secrecy outage probability (SOP) as the security metric. A problem of maximizing the minimum secrecy rate among users, by jointly optimizing transmit beamforming at the BS and phase shifts of the IRSs, is formulated. For a special case with a single-antenna BS, we derive the closed-form SOP expressions and propose a novelring-penaltybased successive convex approximation (SCA) algorithm to design transmit power and phase shifts jointly. For a general multi-antenna BS case, we develop a Bernstein-type inequality based alternating optimization (AO) algorithm to solve the challenging problem. Numerical results demonstrate the advantages of the proposed algorithms over the baseline schemes. The results also show that: 1) the maximum secrecy rate is achieved when distributed IRSs share the reflecting elements equally; and 2) the distributed IRS deployment does not always outperform the centralized IRS deployment, due to the tradeoff between the number of IRSs and the reflecting elements equipped at each IRS.
Zheng Zhang 0037, Jian Chen 0002, Qingqing Wu 0001, Yuanwei Liu, Lu Lv 0001, Xunqi Su
IEEE Trans. Commun.1
2022 On the Secrecy Design of STAR-RIS Assisted Uplink NOMA Networks
abstract
This paper investigates the secure transmission in a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted uplink non-orthogonal multiple access system, where the legitimate users send confidential signals to the base station by exploiting STAR-RIS to reconfigure the electromagnetic propagation environment proactively. Depending on the availability of the eavesdropping channel state information (CSI), both the full CSI and statistical CSI of the eavesdropper are considered. For the full eavesdropping CSI scenario, we adopt the adaptive-rate wiretap code scheme with the aim of maximizing minimum secrecy capacity subject to the successive interference cancellation decoding order constraints. To proceed, we propose an alternating hybrid beamforming (AHB) algorithm to jointly optimize the receive beamforming, transmit power, and reflection/transmission coefficients. While for the statistical eavesdropping CSI scenario, the constant-rate wiretap code scheme is employed to minimize the maximum secrecy outage probability (SOP) subject to the quality-of-service requirements of legitimate users. Then, we derive the exact SOP expression under the constant-rate coding strategy and develop an extended AHB algorithm for the joint secrecy beamforming design. Simulation results demonstrate the effectiveness of the proposed scheme. Moreover, some useful guidance about the quantification of phase shift/amplitude and the deployment of STAR-RIS is provided.
Zheng Zhang 0037, Jian Chen 0002, Yuanwei Liu, Qingqing Wu 0001, Bingtao He, Long Yang 0002
IEEE Trans. Wirel. Commun.1
2021 Enhancing Security of NOMA Networks via Distributed Intelligent Reflecting Surfaces
abstract
This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a distributed IRS enabled NOMA transmission framework is proposed to serve users securely in the presence of a passive eavesdropper. Considering that the instantaneous channel state information (CSI) of the eavesdropper is challenging to acquire in practice, we utilize the secrecy outage probability (SOP) as the security metric. A problem by jointly optimizing the transmit power at the base station (BS) and reflection phase shifts at IRSs, subject to the successive interference cancellation (SIC) decoding constraints and SOP constraints, is formulated to maximize the minimum secrecy rate among legitimate users. To tackle the non-convex problem, we first derive the exact SOP in closed-form expressions and then propose a novel ring-penalty based successive convex approximation (SCA) algorithm to design power allocation and phase shifts jointly. Numerical results validate the convergence and the secrecy superiority of proposed scheme over the baseline schemes.
Zheng Zhang 0037, Jian Chen 0002, Qingqing Wu 0001, Yuanwei Liu, Lu Lv 0001, Xunqi Su
GLOBECOM1
2020 Utilizing Cooperative Jamming to Secure Cognitive Radio NOMA Networks
abstract
In this paper, we propose an innovative framework to improve the physical layer security of cognitive radio nonorthogonal multiple access (CR-NOMA) networks. Specifically, we consider a cooperative spectrum-sharing mechanism, where a cognitive transmitter serves as a relay and assists primary/cognitive transmissions using the NOMA principle in the presence of a passive eavesdropper. Technically, we propose a new cooperative jamming scheme, where the primary/cognitive receivers and the primary transmitter are recruited as jammers to transmit artificial noise in order to intentionally confuse eavesdropper. Under a practical assumption that only the statistical channel state information of eavesdropper is available, the secrecy outage probability (SOP) is used as the performance metric. An optimization problem of maximizing the minimum confidential information rate among the primary and cognitive receivers is formulated. We devise a successive convex approximation based power allocation algorithm to efficiently solve the non-convex optimization problem. Our simulation results indicate that the proposed scheme outperforms the orthogonal multiple access based schemes in terms of minimum confidential information rate.
Zheng Zhang 0037, Jian Chen 0002, Lu Lv 0001, Qiang Ye 0001
GLOBECOM1
2017 A Big Data Deep Reinforcement Learning Approach to Next Generation Green Wireless Networks
abstract
Recent advances in networking, caching and computing technologies can have great impacts on the developments of green heterogeneous wireless networks, where different sizes of cells co-exist. Nevertheless, these important enabling technologies have traditionally been studied separately in the existing works on wireless networks. In this paper, we propose an integrated framework that can enable dynamic orchestration of networking, caching and computing resources to improve the performance of green heterogeneous wireless networks. We use an energy-efficient caching strategy based on storing maximum-distance separable (MDS) encoded packets. The resource allocation strategy in this framework is formulated as a joint optimization problem. The decision on how to allocate the dynamic resources is very complicated when considering networking, caching and computing. Therefore, we propose a novel deep reinforcement learning approach, which can effectively handle systems with large complexity. In addition, we use Google TensorFlow to implement deep reinforcement learning. Simulation results with different system parameters are presented to show the effectiveness of the proposed scheme.
Ying He 0006, Zheng Zhang 0037, Yanhua Zhang
GLOBECOM2
2017 Resource Allocation in Software-Defined and Information-Centric Vehicular Networks with Mobile Edge Computing
abstract
Recent advances in networking, caching and computing have significant impacts on the developments of vehicular networks. Nevertheless, these important enabling technologies have traditionally been studied separately in the existing works on vehicular networks. In this paper, we propose an integrated framework that can enable dynamic orchestration of networking, caching and computing resources to improve the performance of next generation vehicular networks. We formulate the resource allocation strategy in this framework as a joint optimization problem. The complexity of the system is very high when we jointly consider these three technologies. Therefore, we propose a novel deep reinforcement learning approach in this paper. Simulation results are presented to show the effectiveness of the proposed scheme.
Ying He 0006, Chengchao Liang, Zheng Zhang 0037, F. Richard Yu, Nan Zhao 0001, Hongxi Yin, Yanhua Zhang
VTC Fall3