Huibin Zhang

Dr. Huibin Zhang


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
31 December 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XYXiaosong Yu
Xiaosong Yu
XNXian Ning
Xian Ning
QZQingcheng Zhu
Qingcheng Zhu
JLJiaqi Lv
Jiaqi Lv
Yongli ZhaoYongli Zhao
Yongli Zhao
JZJie Zhang
Jie Zhang
Currently, with the continuous advancement of network and communication technology, the amount of data carried by the optical network is very huge. The security of high-speed and large-capacity information in optical networks has attracted more and more attention. Quantum key distribution (QKD) provides information-theoretic security based on the laws of quantum mechanics. Introducing QKD into an optical network can greatly improve the security of the optical network. In order to reduce the cost of deployment on QKD infrastructure, quantum signals in QKD and classical signals in optical networks are multiplexed in the same fiber by wavelength-division manner. Moreover, due to the limited wavelength resources in an optical fiber, time-division technology is adopted to construct different kinds of channels in QKD system for efficient utilization of wavelength resources. Under such situation, how to satisfy the security requirements of service requests and complete the efficient scheduling of multi-dimensional resources, i.e., wavelengths and timeslots, is a challenging problem. This paper addresses this problem by considering multi-dimensional routing, wavelength, and timeslot allocation (RWTA) in short-distance quantum key distribution optical networks (QKD-ON), in which any two nodes can directly establish a quantum channel, and the maximum distance between any two nodes is less than the distance that can carry out point-to-point quantum key distribution process. While accommodating services with security requirements in QKD optical networks, to avoid the wavelength time-slot fragmentation caused by the constraints of wavelength consistency and time-slot continuity, we propose a time-window-based security orchestration strategy as well as relative-loss of time continuous compactness based RWTA strategy. We conducted the simulations under various scenarios, e.g., different key updating periods and different distributions on wavelength resources, etc., and the results show that the proposed strategy can achieve better performance compared with the baselines in terms of key success rate, key-updating delay, and blocking probability.

1 July 2024 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
XSXiaohui Sun
Xiaohui Sun
YSYuefeng Shen
Yuefeng Shen
HZHuibin Zhang
Huibin Zhang
This paper focuses on solving the routing optimization problem under the dynamic topology of the satellite communication network. With the rapid development of low-earth-orbit (LEO) satellite network communication technology, the dynamically changing topology of satellite networks has brought about frequent link switching and triggered a large number of routing updates. This paper proposes an improved routing algorithm named the Stable A-Star Routing (SASR) algorithm. The SASR algorithm is based on the A-star algorithm and aims to reduce path-switching frequency and enhance path stability by optimizing the path selection strategy. Through detailed simulation experiments and performance evaluation, we verified the performance advantages of the SASR algorithm in terms of the number of path switches, the number of path hops, the route convergence time, and the occurrences of congestion in business under different business volumes, and conducted comparative studies with classic algorithms. The results show that the SASR algorithm offers obvious advantages in key performance indicators. Compared with the Dijkstra algorithm and the A-star algorithm, the average number of path switches can be reduced by 22% and 10%, respectively. It shows more prominent advantages under a larger business volume, providing an efficient and reliable solution for routing optimization under the dynamic topology of satellite communication networks.

30 December 2022
Verified
Conference Paper
Open access
PDF file
CYChenguang Yang
Chenguang Yang
HZHuibin Zhang
Huibin Zhang
A resource efficient hardware implementation method of polar decode is presented in this paper. It supports the configuration of bit allocation table with various code lengths and rates. The hardware implementation based on Successive Cancellation List Decoding (SCL) scheme makes BER (Bit-Error-Rate) performance more excellent, and the pipe-lined and paralleled design achieved a good balance between performance and complexity, maintaining a high throughput while consuming less resources. The method is implemented on FPGA and has excellent performance. Compared with other hardware implementation methods, the method can achieve the same throughput with less hardware resource.

1 July 2024 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
HLHaojiang Liu
Haojiang Liu
HZHuibin Zhang
Huibin Zhang
Satellite communication is integral to modern communication systems, yet navigating the intricacies of routing in networks characterized by high loads and dynamic evolution poses a significant challenge. This research is dedicated to enhancing satellite communication routing algorithms, with the goal of bolstering network efficiency and amplifying the success rate of business transmissions. Our approach introduces an improved simulated annealing algorithm incorporating adaptive temperature control and innovative path neighborhood exploration strategies. This novel algorithm is adept at adjusting to ever-shifting network topologies and meeting various business requirements. Our simulation results reveal that this refined algorithm outperforms traditional annealing methods in several critical aspects. It elevates the success rate of business transmissions, reduces the average number of forwardings by 6.546% across various load scenarios, and diminishes system response time by 15.05%, thereby marking a substantial improvement in network performance.

31 July 2025 in Electronics
Verified
Journal Article
Open access
PDF file
HZHuibin Zhang
Huibin Zhang
DDDandan Du
Dandan Du
KZKunpeng Zheng
Kunpeng Zheng
YCYuan Cao
Yuan Cao
LZLihan Zhao
Lihan Zhao
JZJie Zhang
Jie Zhang
Research in on-orbit processing enables edge AI deployment over satellite optical networks. However, these operations induce frequent battery discharge cycles, particularly depth-of-discharge (DoD) events, which accelerate degradation and curtail satellite longevity. To address this, we propose green task-aware routing planning (GreenRP), a task-aware routing framework that achieves sustainable edge AI through dynamic task offloading and discharge-resilient path orchestration. GreenRP employs a novel battery aging model explicitly coupling DoD effects with laser inter-satellite link dynamics under AI workloads, enhancing system sustainability. Comprehensive evaluation on a 1152-satellite constellation demonstrates that GreenRP extends network lifetime by 176% over shortest-path routing while meeting latency and completion rate targets. This work enables reliable edge AI via sustainable satellite resource utilization.