KWKunlun Wang

Kunlun Wang

*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


Kunlun Wang has a total of 154 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • RIS Codebook Index Assignment Under Imperfect Control Links Using TSP-Inspired Optimization

    by Liangshun Wu, Wen Chen, Xudong Bai, Kunlun Wang

    Reconfigurable Intelligent Surfaces (RIS) promise transformative gains in wireless communications by enabling programmable control of the propagation environment through discrete phase configurations. In practical deployments, the control of RIS phase states is typically managed using finite codebooks, with configuration indices transmitted over low-latency, yet imperfect, wireless feedback channels. Even rare feedback bit errors can lead to significant mismatches between intended and applied RIS states, degrading system performance. This paper addresses the challenge of robust RIS codebook index assignment by formulating it as a combinatorial optimization problem, equivalent to the Traveling Salesman Problem (TSP), where codewords are “cities” and edge weights reflect SNR degradation under codeword confusion. A novel three-phase heuristic algorithm is proposed to solve this, consisting of a provision phase, a shotgun phase, and a fuzzy concatenation phase. Simulation results show that the method outperforms conventional indexing strategies and achieves near-optimal robustness to index errors, while also being scalable and hardware-agnostic for real-time deployment.


  • Fair Rate Maximization for Multi-User Multi-Cell MISO Communication Systems via Novel Transmissive RIS Transceiver

    by Yuan Guo, Wen Chen, Qingqing Wu, Zhendong Li, Kunlun Wang, Hongying Tang, Jun Li

    This paper explores a multi-cell multiple-input single-output (MISO) downlink communication system enabled by a unique transmissive reconfigurable intelligent surface (TRIS) transceiver configuration. Within this system framework, we formulate an optimization problem for the purpose of maximizing the minimum rate of users for each cell via designing the transmit beamforming of the TRIS transceiver, subject to the power constraints of each TRIS transceiver unit. Since the objective function is non-differentiable, the max-min rate problem is difficult to solve. In order to tackle this challenging optimization problem, an efficient low-complexity optimization algorithm is developed. Specifically, the log-form rate function is transformed into a tractable form by employing the fractional programming (FP) methodology. Next, the max-min objective function can be approximated using a differentiable function derived from smooth approximation theory. Moreover, by applying the majorization-minimization (MM) technique and examining the optimality conditions, a solution is proposed that updates all variables analytically without relying on any numerical solvers. Numerical results are presented to demonstrate the convergence and effectiveness of the proposed low-complexity algorithm. Additionally, the algorithm can significantly reduce the computational complexity without performance loss. Furthermore, the simulation results illustrate the clear superiority of the deployment of the TRIS transceiver over the benchmark schemes.


  • Vehicular Multi-Tier Distributed Computing With Hybrid THz-RF Transmission in Satellite–Terrestrial Integrated Networks

    by Ni Zhang, Kunlun Wang, Wen Chen, Jing Xu, Arumugam Nallanathan

    In this paper, we propose a Satellite-Terrestrial Integrated Network (STIN) assisted vehicular multi-tier distributed computing (VMDC) system leveraging hybrid terahertz (THz) and radio frequency (RF) communication technologies. Task offloading for satellite edge computing is enabled by THz communication using the orthogonal frequency division multiple access (OFDMA) technique. For terrestrial edge computing, we employ non-orthogonal multiple access (NOMA) and vehicle clustering to realize task offloading. We formulate a non-convex optimization problem aimed at maximizing computation efficiency by jointly optimizing bandwidth allocation, task allocation, subchannel-vehicle matching and power allocation. To address this non-convex optimization problem, we decompose the original problem into four sub-problems and solve them using an alternating iterative optimization approach. For the subproblem of task allocation, we solve it by linear programming. To solve the subproblem of sub-channel allocation, we exploit many-to-one matching theory to obtain the result. The subproblem of bandwidth allocation of OFDMA and the subproblem of power allocation of NOMA are solved by quadratic transformation method. Finally, the simulation results show that our proposed scheme significantly enhances the computation efficiency of the STIN-based VMDC system compared with the benchmark schemes.


  • Digital Twin-Assisted Federated Learning With Blockchain in Multi-Tier Computing Systems

    by Yongyi Tang, Kunlun Wang, Dusit Niyato, Wen Chen, George K. Karagiannidis

    In Industry 4.0 systems, numerous resource-constrained Industrial Internet of Things (IIoT) devices frequently exchange data for model training, raising serious security and privacy concerns. To address these issues, this paper proposes a digital twin (DT) and blockchain-assisted federated learning (FL) framework. In the proposed scheme, fog devices with sufficient computational resources generate DTs for edge devices to support local model training. We formulate an FL delay minimization problem that considers both model transmission and synchronization delays while introducing cooperative jamming to secure DT synchronization. To solve this non-convex problem, a decomposition-based optimization algorithm is developed. By introducing upper bounds on local training delay and jamming effects as auxiliary variables, the problem is transformed into a convex form that can be efficiently decomposed and solved. Furthermore, a blockchain-based verification mechanism and a validator selection algorithm are designed to ensure model integrity and participant authentication during the FL process, thereby enhancing blockchain scalability. The final global model is obtained by aggregating verified local updates through deep learning techniques. Numerical results demonstrate that the proposed cooperative interference-based DT–blockchain-assisted FL framework outperforms benchmark schemes in execution time, block efficiency, and model accuracy.


  • Open Access

    Green Emergency Communications in RIS- and MA-Assisted Multi-UAV SAGINs: A Partially Observable Reinforcement Learning Approach

    by Liangshun Wu, Wen Chen, Shunqing Zhang, Yajun Wang, Kunlun Wang

    In post-disaster space-air-ground integrated networks (SAGINs), terrestrial infrastructure is often impaired, and unmanned aerial vehicles (UAVs) must rapidly restore connectivity for mission-critical ground terminals in cluttered non-line-of-sight (NLoS) urban environments. To enhance coverage, UAVs employ movable antennas (MAs), while reconfigurable intelligent surfaces (RISs) on surviving high-rises redirect signals. The key challenge is communication-limited partial observability, leaving each UAV with a narrow, fast-changing neighborhood view that destabilizes value estimation. Existing multi-agent reinforcement learning (MARL) approaches are inadequate--non-communication methods rely on unavailable global critics, heuristic sharing is brittle and redundant, and learnable protocols (e.g., CommNet, DIAL) lose per-neighbor structure and aggravate non-stationarity under tight bandwidth. To address partial observability, we propose a spatiotemporal A2C where each UAV transmits prior-decision messages with local state, a compact policy fingerprint, and a recurrent belief, encoded per neighbor and concatenated. A spatial discount shapes value targets to emphasize local interactions, while analysis under one-hop-per-slot latency explains stable training with delayed views. Experimental results show our policy outperforms IA2C, ConseNet, FPrint, DIAL, and CommNet--achieving faster convergence, higher asymptotic reward, reduced Temporal-Difference(TD)/advantage errors, and a better communication throughput-energy trade-off.

  • Open Access

    Virtual-Real Collaborated Split Learning via Model Partitioning in IRS-Assisted IoT Networks

    by Jiaying Di, Kunlun Wang, Jing Xu, Wen Chen, Dusit Niyato

    This paper investigates a novel computation and communication co-design framework for large-scale split learning in intelligent reflecting surface (IRS)-assisted internet of things (IoT) networks integrated with digital twin (DT) technique. The considered system consists of a multi-antenna access point (AP), multiple heterogeneous user devices (UDs), and an deployed IRS to enhance both uplink and downlink transmission. The training process of a deep neural network is partitioned between devices and the AP, where a DT replica is activated to replace UDs with insufficient local computation capabilities. We formulate a delay-optimal split learning problem, which optimizes five key variables: layer partitioning points, DT assignment decisions, IRS phase shift matrix, AP downlink power allocation, and DT frequency adjustment, aiming to minimize the overall end-to-end delay under communication and computation. The proposed optimization problem is a highly coupled non-convex mixed-integer problem. Therefore, we solve using an alternating optimization approach combining closed-form updates, semidefinite relaxation (SDR), and low-complexity heuristics. Extensive simulations demonstrate that the proposed scheme significantly reduces training delay compared to conventional baselines and achieves up to 35\% delay improvement, especially under high UD density and stringent power constraints.

  • Movable Antenna Enhanced Networked Integrated Sensing and Communication System

    by Yuan Guo, Wen Chen, Qingqing Wu, Yang Liu, Qiong Wu, Kunlun Wang, Jun Li, Lexi Xu

    Integrated sensing and communication (ISAC) is a key technology for future 6G networks. Most existing studies focus on monostatic and/or bistatic setups with limited coverage and capabilities. Networked ISAC systems with distributed base stations (BSs) can overcome these limitations. Moreover, movable antenna (MA) architectures offer improved ISAC performance over fixed-position antennas (FPAs) by enabling adaptable antenna movement. In this paper, we utilize the MA to promote communication capability with guaranteed sensing performance via jointly designing beamforming, power allocation, receiving filters and position configuration of transmit/receive MA towards maximizing the sum rate for both downlink (DL) and uplink (UL) users. The optimization problem is highly difficult due to the unique channel model derived from the position coefficient of the MA. To resolve this challenge, via leveraging the cutting-the-edge majorization-minimization (MM) method, we develop an efficient solution that optimizes all variables via convex optimization techniques. Extensive simulation results verify the effectiveness of our proposed algorithms and demonstrate the substantial performance promotion by deploying the MA framework in the networked ISAC system.


  • Open Access

    Exploiting Movable Antennas in NOMA Networks: Joint Beamforming, Power Allocation and Antenna Position Optimization

    by Yufeng Zhou, Wen Chen, Qingqing Wu, Xusheng Zhu, Zhendong Li, Kunlun Wang, Qiong Wu

    This paper investigates the movable antenna (MA)- assisted downlink non-orthogonal multiple access (NOMA) network to maximize system throughput. In the considered scenario, both the base station (BS) and users are equipped with MA, and a predetermined successive interference cancellation (SIC) decoding order is adopted. Based on the field-response channel model, we formulate a complex, non-convex problem to jointly optimize the BS beamforming, power allocation, and MA positions at both the transmitter and receivers. To address this, we propose an efficient algorithm based on an alternating optimization (AO) framework, which decomposes the original problem into three distinct subproblems. By employing sequential parametric convex approximation (SPCA) and successive convex approximation (SCA) techniques, the non-convex constraints within each subproblem are transformed into tractable. This methodology ensures the algorithm converges to a stable, locally optimal solution. Numerical results validate that the proposed system, which fully exploits the degrees of freedom from antenna mobility at both ends, significantly outperforms benchmarks in terms of throughput.