ZJZhu Jin

Zhu Jin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Zhu Jin has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • SVQ-VAE: Federated-Learning-Based Semantic-Aware Communication for Vehicular Networks

    by Zhu Jin, Yundi Li, Tiecheng Song, Wen-Kang Jia, Xiaoqin Song

    The integration of semantic communication technology into intelligent vehicular networks represents a promising research direction, as it significantly reduces data transmission volume and spectrum usage, addressing the high demands of transmitting large-scale visual information between vehicles. Existing studies typically assume that communicating parties share a common database. However, this assumption poses significant privacy risks, particularly in intervehicle scenarios. To address these challenges, we propose a federated-learning-based semantic-aware communication for vehicular networks. In this approach, each intelligent vehicle locally trains a semantic communication model and uploads its model parameters to the edge server for aggregation. To further enhance data transmission efficiency, we introduce a semantic-aware vector quantized variational autoencoder (SVQ-VAE) architecture as the local semantic communication model. This architecture optimizes transmission by selectively compressing and quantizing only the most relevant semantic information for the task. In addition, to address data heterogeneity among vehicles, we propose a hypernetwork-based personalized federated learning (HPFL) scheme. This approach enhances the model’s scalability and generalization by training a hypernetwork at the edge server to generate specific weight parameters for each vehicle’s semantic communication model. Simulation experiments on the CIFAR-10 and BDD100K datasets demonstrate that our proposed federated-learning-based semantic-aware communication achieves superior task completion rates, semantic transmission efficiency (STE), and transmission delay compared with existing federated semantic communication architectures.

  • Task-Oriented Semantic Communication With Adaptive Semantic Reconstruction Network

    by Zhu Jin, Tiecheng Song, Wen-Kang Jia, Wenbin Zou, Xiaoqin Song

    In recent years, semantic communication has garnered significant attention for its potential to address challenges in traditional communication systems. However, in complex communication environments, semantic communication still faces challenges, such as semantic information loss, low transmission efficiency, and poor adaptability. This article proposes a novel semantic communication with adaptive semantic reconstruction (SCASR) scheme to enhance transmission efficiency and adaptability in complex communication environments. First, a compression mechanism based on semantic importance is designed to achieve flexible and efficient semantic compression. Then, we develop an adaptive semantic reconstruction network to predict and reconstruct lost semantic information. Finally, we integrate an attention mechanism into the reconstruction network, dynamically adjusting parameter weights based on signal-to-noise ratio (SNR), semantic compression rate (SCR), and packet loss rate (PLR) to improve reconstruction quality and adaptability. To evaluate the efficiency of SCASR, we conduct extensive simulation experiments on semantic segmentation tasks using the Cityscapes dataset. Results demonstrate that SCASR outperforms existing semantic communication and traditional schemes, offering higher mean Intersection over Union (mIoU), and enhanced semantic transmission benefit (STB).


  • Open Access

    RS-DRL-based offloading policy and UAV trajectory design in F-MEC systems

    by Yulu Yang, Han Xu, Zhu Jin, Tiecheng Song, Jing Hu, Xiaoqin Song


  • Energy-Efficient Resource Allocation for NOMA-Enabled Vehicular Networks

    by Wei Jiang, Tiecheng Song, Xiaoqin Song, Cong Wang, Zhu Jin, Jing Hu

    Vehicular networks face significant challenges in achieving high energy efficiency (EE) while guaranteeing diverse quality of service (QoS) requirements of users, especially under limited bandwidth and power budgets in highly dynamic and dense topologies. To address these challenges, this study formulates a joint resource optimization problem to maximize the average EE of cellular users (CUs) and vehicle-to-vehicle (V2V) users by jointly optimizing subchannel assignment, frequency reuse patterns, and power allocation while ensuring the required QoS of both users. To solve the non-convex optimization problem, we propose a semi-persistent scheduling (SPS)-based energy-efficient resource allocation scheme that integrates non-orthogonal multiple access (NOMA) with network slicing (NS). Specifically, during the frequency reservation phase of SPS periods, CUs are assigned to network slices using the proposed NS grouping strategy, and V2V users are clustered into V2V NOMA clusters using the proposed clustering optimization algorithm. Frequency reuse patterns are then determined for network slices and V2V NOMA clusters. In the subsequent data transmission phase, a centralized energy-efficient iterative power control algorithm is introduced to enhance the average CU EE, and a distributed heuristic power control method is leveraged to improve the average V2V EE. Simulation results demonstrate that the proposed scheme outperforms the baseline methods in improving EE and satisfying the required QoS of both CUs and V2V users while avoiding over-allocation of frequency resources.


  • An Adaptive Cooperative Caching Strategy for Vehicular Networks

    by Zhu Jin, Tiecheng Song, Wen-Kang Jia

    Edge caching has emerged as an effective solution to the challenges posed by massive content delivery in the vehicular network. In vehicular networks, vehicles and roadside units (RSUs) can serve as intermediate relays with caching capabilities. However, due to the mobility of vehicles, the topology of the edge network changes frequently, which leads to frequent link interruptions and increases the transmission delay. This paper proposes an adaptive cooperative caching (ACC) strategy to adapt the frequent changes in the vehicular edge network topology and describes an optimization problem to minimize the average transmission delay. Then, the optimization problem is transformed into two sub-optimization problems: multiplechoice knapsack (MCK) problem and multiple minimum-weight dominating set (MMWDS) problem. Finally, two greedy algorithms with low complexity are designed to solve the above two optimization problems and obtain approximate solutions to the optimal caching decision. Simulation results show that ACC can effectively improve the cache hit rate and reduce the average transmission delay and the communication overhead compared with other caching strategies.


  • P3FA: Unified Unicast/Multicast Forwarding Algorithm for High-Performance Router/Switch

    by Zhu Jin, Wen-Kang Jia

    High-performance multicast packet switching technologies are evolving to meet the growing demand for scalability on the Internet and datacenters, etc. Implementing a high-performance switch/router relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representatives of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as false-positive probability and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the RNS, we propose a simplified forwarding algorithm in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, P3FA improves multicast and unicast time efficiency by 1 to 4 orders of magnitude in the port-density 16–1024 range compared to previous works. Although it comes at the expense of hardware cost, it is still acceptable compared to recently improved previous work.


  • DH-SVRF: A Reconfigurable Unicast/Multicast Forwarding for High-Performance Packet Forwarding Engines

    by Zhu Jin, Wen-Kang Jia

    High-performance multicast-enabled packet forwarding engines (PFEs), as an essential component of high-end switches, use a polynomial-time membership query algorithm to determine which port(s) the data packet should be forwarded. The currently widely used query algorithm is Bloom Filter (BF), which has been proven to have many fatal flaws. Another error-free membership query algorithm includes Scalar-pair Vectors Routing Forwarding (SVRF), Fractional- N Scalar-pair Vectors Routing Forwarding (Frac- N SVRF), and the Per-Port Prime Filter Array (P 3 FA) also have some shortcomings in space and time efficiencies. In this paper, we proposed a hybrid strategy: Divaricate Heterogeneous SVRF (DH-SVRF) scheme, which based on the P 3 FA and Frac- N SVRF, which randomly divides all member ships into N groups, and each group has the same structure and is independent of each other to obtain higher time efficiency and space utilization. Finally, we also discussed the selection of the optimal egress-diversity threshold. Through mathematical modeling and simulation, we validate that the proposed DH-SVRF scheme is superior to the SVRF/Frac -N SVRF and traditional BF in terms of scalability, space utilization, and time efficiency in specific conditions such as appropriate egress-diversity thresholds.


  • Fractional-N SVRF Forwarding Algorithm for Low Port-Density Packet Forwarding Engines

    by Zhu Jin, Xiang Wu, Wen-Kang Jia, Xiaoning Shi

    High-performance multicast-enabled switches and routers are being constantly developed, which use a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether or not a packet is forwarded through a unique or multiple egress ports. Among these, Bloom filter (BF) and Scalar-pair Vectors Routing and Forwarding (SVRF) are being considered as two representations of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as space and time inefficiencies, especially for a carrier-grade PFE with high port-density feature. In order to solve these imperfections of SVRF, we propose an improved Fractional-N Scalar-matrix and Vectors Routing and Forwarding (Fractional-N SVRF) scheme based on re-examining the idea of the original SVRF. The Fractional-N SVRF preprocesses a scalar-matrix by dividing an n-element group into N-columns (sub-blocks), thus element’ keys belonging to distinct sub-blocks and sub-scalars are allowed to reuse relatively smaller identical prime keys. Based on Fractional-N SVRF, membership queries can be partitioned to leverage task parallelism, therefore better performance is achieved in terms of memory consumption and computational complexity.