Rongrong Zhang

Mrs. Rongrong Zhang

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 February 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JLJiahao Liu
Jiahao Liu
JYJihong Yu
Jihong Yu
DNDusit Niyato
Dusit Niyato
RZRongrong Zhang
Rongrong Zhang
Xiaozheng GaoXiaozheng Gao
Xiaozheng Gao
JAJianping An
Jianping An
This paper presents a unicast beamforming network for covert ambient backscatter communications (AmBC). Different from the prior covert backscatter works using artificial noise or a power-variable RF source, our work achieves covertness by arming the backscatter tag with multiple antennas. The tag uses a subset of its antennas to modulate covert information on backscattered RF signals while using the other antennas to modulate overt message as a cover to hide the covert transmission from the warden. We first derive the warden’s optimum detection threshold to minimize the detection error probability. To fight against the optimum warden, the tag changes impedance matching on each antenna to vary the reflected power and make the reflected overt and covert signals beamforming at space. We derive the optimum beamforming vectors by solving the problems of maximizing the covert rate at the receiver and the detection error probability at the warden, respectively. To address the non-convex constraints, we use semi-definite relaxation (SDR) and obtain near optimal parameters by designing binarySearch algorithms. Numerical results confirm the superiority of our work to the state-of-the-art one, and the existence of tradeoffs between the covert rate and the detection error probability.

21 December 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JYJihong Yu
Jihong Yu
wei gongwei gong
wei gong
JLJiangchuan Liu
Jiangchuan Liu
Lin ChenLin Chen
Lin Chen
Kehao WangKehao Wang
Kehao Wang
RZRongrong Zhang
Rongrong Zhang
With rapid development of RFID technology, ever-increasing research effort has been dedicated to devising RFID-enabled services. The missing tag identification, which is to identify all missing tags, is one of the most important services in Internet-of-Things applications such as inventory management. Prior work on missing tag detection rely on hash functions at tags. However, hash functions are not supported by COTS RFID tags. To bridge this gap between theory and practice, this paper is devoted to detecting missing tags with COTS Gen2 devices. We first introduce a point-to-multipoint protocol, named P2M that works in an analog frame slotted Aloha paradigm to interrogate tags and collect their EPCs. A missing tag will be found if its EPC is not present in the collected ones. To reduce time cost of P2M resulted from tag response collisions, we further present a collision-free point-to-point protocol, named P2P that selectively specifies a tag to reply with its EPC in each slot. If the EPC is not received, this tag is regarded to be missing. We develop bitmask selection methods to enable the selective query while reducing communication overhead. We implement P2M and P2P with COTS RFID devices and evaluate their performance under diverse settings.

18 January 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JLJiahao Liu
Jiahao Liu
JYJihong Yu
Jihong Yu
XCXiaoming Chen
Xiaoming Chen
RZRongrong Zhang
Rongrong Zhang
SWShuai Wang
Shuai Wang
JAJianping An
Jianping An
In this work, we study the covert communications in ambient backscatter systems (ABS) with uncontrollable RF source on AWGN channels. In contrast to the prior works impractically assuming the existence of a controllable RF excitation source, our work arms the receiver of covert information with the full-duplex ability. The covert receiver can emit artificial noise (AN) with variable power to cover up the modulation action of a tag on the excitation signals while receiving the backscattered information. Specifically, we first derive the warden’s optimum power-detection threshold that minimizes the detection error probability. To against the optimal warden, we design the covert backscatter communication policy that determines the feasible region of the AN power at the covert receiver depending on the transmission power of the RF source and the reflection coefficient of the tag and guarantees the covertness constraint. We analyze the performance of the policy and provide the closed-form maximum covert rate and maximum detection error probability at the warden, revealing their tradeoff. The numerical analysis shows the increasing transmission power of the RF source and tag’s reflection coefficient would degrade the covertness of ABS when the covert receiver has to increase the AN power.

14 August 2019 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JYJihong Yu
Jihong Yu
JLJiangchuan Liu
Jiangchuan Liu
RZRongrong Zhang
Rongrong Zhang
LCLin Chen
Lin Chen
WGWei Gong
Wei Gong
SZShurong Zhang
Shurong Zhang
Ever-increasing research efforts have been dedicated to radio frequency identification (RFID) systems, such as finding top-k, elephant groups, and missing-tag detection. While group labeling, which is how to tell tags their associated group data, is the common prerequisite in many RFID applications, its efficiency is not well optimized due to the transmission of useless data with only one seed used. In this paper, we introduce a unified protocol called GLMS which employs multiple seeds to construct a composite indicator vector (CIV), reducing the useless transmission. Technically, to address Seed Assignment Problem (SAP) arising during building CIV, we develop an approximation algorithm (AA) with a competitive ratio 0.632 by globally searching for the seed contributing to the most useful slot. We then further design two simplified algorithms through local searching, namely c-search-I and its enhanced version c-search-II, reducing the complexity by one order of magnitude while achieving comparable performance. We conduct extensive simulations to demonstrate the superiority of our approaches.

13 July 2020 in Microsystems & Nanoengineering
Verified
Journal Article
Open access
PDF file
Wei LvWei Lv
Wei Lv
ZSZhizhi Sheng
Zhizhi Sheng
YZYinglin Zhu
Yinglin Zhu
Jing LiuJing Liu
Jing Liu
YLYi Lei
Yi Lei
Xu HouXu Hou
Xu Hou
The ability of membrane technologies to dynamically tune the transport behavior for gases and liquids is critical for their applications. Although various methods have been developed to improve membrane success, tradeoffs still exist among their properties, such as permeability, selectivity, fouling resistance, and stability, which can greatly affect the performance of membranes. Existing elastomeric membrane designs can provide antifracture properties and flexibility; however, these designs still face certain challenges, such as low tensile strength and reliability. Additionally, researchers have not yet thoroughly developed membranes that can avoid fouling issues while realizing precise dynamic control over the transport substances. In this study, we show a versatile strategy for preparing graphene oxide-reinforced elastomeric liquid gating membranes that can finely modulate and dynamically tune the sorting of a wide range of gases and liquids under constant applied pressures. Moreover, the produced membranes exhibit antifouling properties and are adaptable to different length scales, pressures, and environments. The filling of graphene oxide in the thermoplastic polyurethane matrix enhances the composites through hydrogen bonds. Experiments and theoretical calculations are carried out to demonstrate the stability of our system. Our membrane exhibits good stretchability, recovery, and durability due to the elastic nature of the solid matrix and dynamic nature of the gating liquid. Dynamic control over the transport of gases and liquids is achieved through our optimized interfacial design and controllable pore deformation, which is induced by mechanical stimuli. Our strategy will create new opportunities for many applications, such as gas-involved chemical reactions, multiphase separation, microfluidics, multiphase microreactors, and particulate material synthesis.

18 February 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JYJihong Yu
Jihong Yu
YGYue Gong
Yue Gong
JFJinhui Fang
Jinhui Fang
RZRongrong Zhang
Rongrong Zhang
JAJianping An
Jianping An
The satellite–air–ground networks (SAGNs) are experiencing unprecedented deployment for the advantages of global coverage and flexibility. However, the open light-of-sight communication links from satellites to the unmanned aerial vehicles (S2U) in SAGNs are vulnerable to malicious jamming and inadvertent interferences from other communication satellites, challenging the reliability of SAGNs. Despite the great importance, the anti-jamming S2U communication problem in SAGNs has been largely overlooked. To address this problem, we propose a two-stage anti-jamming scheme that embraces the cooperation among the unmanned aerial vehicles (UAVs) within the same group and jointly designs the hovering altitude of UAVs and the beamformers of satellites and cooperative UAVs to combat the malicious jamming and the cross-tier interferences. Specifically, following the proposed scheme, we formulate the problem of maximizing the minimum rate of the UAVs with the presence of the malicious jamming and inadvertent interferences into a nonconvex optimization problem. We then transform the problem into two tractable convex subproblems with feasible point pursuit successive convex approximation (FPP-SCA) method and provide the solutions to configure the hovering altitudes and the beamformers. We also conduct extensive simulations and the results show that the proposed anti-jamming scheme is efficient in terms of the UAVs’ capacity and the anti-jamming ability compared with the ones without cooperative UAVs and with fixed cooperators (FixCo).