Zhe Ren

Zhe Ren

Auto-generated profile, based on publicly available information

Zhe Ren

Xidian University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
24 July 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
ZWZihao Wang
Zihao Wang
HWHang Wang
Hang Wang
ZLZhuowen Li
Zhuowen Li
XLXinghua Li
Xinghua Li
M苗MIAO Yinbin 苗银宾
MIAO Yinbin 苗银宾
RDRobert H. Deng
Robert H. Deng
The utilization of blockchain technology as a distributed information sharing system has gained widespread adoption across various domains. However, its application to Flying Ad-Hoc Network (FANET), characterized by severe packet loss, poses significant challenges. The high packet loss rates in FANETs can result in decreased consensus success rates and negatively impact information sharing consistency and efficiency. In this paper, we proposed RoUBC, a novel consensus scheme for Flying Ad-Hoc Networks (FANET), which is based on the Raft protocol and is designed to address the challenges posed by the severe packet loss network in FANET. The proposed scheme consists of two phases: leader election and block consensus. In the leader election phase, we integrate multi-criteria decision-making and link prediction algorithms to design an efficient stable-leader election method. In the block consensus phase, we propose a dynamic block verification algorithm based on historical verification information to achieve efficient block consensus. Our theoretical analysis demonstrates that the proposed consensus protocol is safe and live, effectively ensuring the consistency of message sharing in FANET. Experiment results show that our scheme outperforms traditional Raft schemes, with 35% increase in consensus success rate and 25% improvement in consensus efficiency.

10 October 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZRZhe Ren
Zhe Ren
XLXinghua Li
Xinghua Li
M苗MIAO Yinbin 苗银宾
MIAO Yinbin 苗银宾
ZLZhuowen Li
Zhuowen Li
ZWZihao Wang
Zihao Wang
RDRobert H. Deng
Robert H. Deng
UAV-assisted mobile edge computing (UAV-MEC) has been proposed to offer computing resources for smart devices and user equipment. UAV cluster aided MEC rather than one UAV-aided MEC as edge pool is the newest edge computing architecture. Unfortunately, the data packet exchange during edge computing within the UAV cluster hasn't received enough attention. UAVs need to collaborate for the wide implementation of MEC, relying on the gossip-based broadcast protocol. However, gossip has the problem of long propagation delay, where the forwarding probability and neighbors are two factors that are difficult to balance. The existing works improve gossip from only one factor, which cannot select suitable forwarding probability and avoid redundant messages. Besides, these schemes do not consider the historical packet reception of new neighbors when UAVs fly around, which decreases forwarding efficiency. To solve these problems, we first propose a data structure called Bitgraph that can record the historical packet reception of UAVs. Then, we formulate gossip broadcasting as a partially observable Markov decision process. Based on Bitgraph, we design the reward function. Finally, we design a multi-agent reinforcement learning algorithm, Branching Deep Graph Network (BDGN), which simultaneously makes decisions on forwarding probability and neighbors. Extensive experiments illustrate that our proposal gets more than 29% advantage in terms of the propagation delay and 20% advantage in terms of the redundant messages compared to the existing works.

1 December 2014
Verified
Conference Paper
Closed access
ZRZhe Ren
Zhe Ren
SSSlawomir Stanczak
Slawomir Stanczak
PFPeter Fertl
Peter Fertl
This paper presents an optimization framework for energy savings in nomadic relay networks, where interference and load are changing over time due to varying assignments. We prove the existence of an explicit load function taking assignments as arguments and we show the function is continuously differentiable. Based on the properties of the load function, we design iterative relay and user association algorithm for energy savings, where the non-convex load constraints are linearly approximated such that each sub-problem is a linear program and hence can be solved efficiently. Simulation results confirm that our proposed algorithmic approach leads to a significant reduction of the energy consumption when compared with algorithms considering the worst-case interference.

31 January 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
ZRZhe Ren
Zhe Ren
XLXinghua Li
Xinghua Li
QJQi Jiang
Qi Jiang
QCQingfeng Cheng
Qingfeng Cheng
JMJianfeng Ma
Jianfeng Ma
In a 5G network-sliced environment, mobility management introduces a new form of handover called inter-slice handover among network slices. Users can change their slices as their preferences or requirements vary over time. However, existing handover-authentication mechanisms cannot support inter-slice handover because of the fine-grained demand among network slice services, which could cause challenging issues, such as the compromise of service quality, anonymity, and universality. In this paper, we address these issues by introducing a fast and universal inter-slice (FUIS) handover authentication framework based on blockchain, chameleon hash, and ring signature. To address these issues, we introduce an anonymous service-oriented authentication protocol with a key agreement for inter-slice handover by constructing an anonymous ticket with the trapdoor collision property of chameleon hash functions. In order to reduce the computation overhead of the user side in the process of authentication, a privacy-preserving ticket validation with a ring signature is designed to finish in the consensus phase of the blockchain in advance. Thanks to the edge computing capabilities in 5G, distributed edge nodes help to store the anonymous ticket information, which guarantees that the legal users can finish authentication swiftly during handover. Our scheme's performance is evaluated through simulation experiments to testify the efficiency and feasibility in a 5G network-sliced environment. The results show that compared to other authentication schemes of the same type, the overall inter-slice handover delay has been reduced by 97.94%.


30 October 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
ZCZekai Chen
Zekai Chen
ZRZhe Ren
Zhe Ren
XLXinghua Li
Xinghua Li
ZZZhan Zhang
Zhan Zhang
YWYunwei Wang
Yunwei Wang
RDRobert H. Deng
Robert H. Deng
In Unmanned Aerial Vehicle (UAV) networks, UAVs usually perform tasks in the form of groups. When tasks change, the Ground Control Station (GCS) will assign the complemental UAV to join the group for notification or reinforcement. Since UAVs communicate over open wireless channels, secure authentication is required for complemental UAV joining the group. However, one-by-one authentication between complemental UAV and the group members leads to high overhead and delays. At the same time, when the UAV group is far away from the coverage of the GCS, the GCS is unable to assist the authentication process in real-time. To solve the above problems, we propose a one-to-many UAV authentication scheme using Identity-Based Broadcast Encryption (IBBE) and batch authentication. This scheme does not require a trusted third party to be online in real time. We also design an algorithm based on reinforcement learning for identifying illegal requests during batch authentication, enhancing efficiency and ensuring successful authentication. Our scheme meets UAV networks’ security requirements, defending against various attacks. Experimental results show that it reduces computational overhead by 55.27% and communication overhead by 23.16% compared to similar schemes. Additionally, the illegal request identification algorithm reduces identification numbers by 15.44% to 25.72% and lowers latency by 14.64% to 25.12% compared to existing methods.