KWKai Wan

Kai Wan

*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


Kai Wan has a total of 115 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Position-Flexible STAR-RIS-Assisted Wireless Networks in Coal Mines: Location and Beamforming Design

    by Xianzhong Li, Yuanchao Yan, Tianhao Guo, Lexi Xu, Zhaohui Yang, Xiaoshuai Zhang, Kai Wan

    To overcome the 180° coverage limitation of conventional reflective Reconfigurable Intelligent Surfaces (RIS) in challenging Non-Line-of-Sight (NLoS) environments like underground coal mines, this paper proposes the deployment of a Simultaneously Transmitting and Reflecting RIS (STAR-RIS). The STAR-RIS achieves full 360° signal coverage, effectively addressing the spatial constraints of complex tunnel topologies. Furthermore, we introduce a “Position-Flexible” approach, where the entire panel’s location is dynamically adjusted to maximize the average sum-rate across wideband OFDM subcarriers. By exploiting frequency diversity, the proposed system effectively combats the severe frequency-selective fading inherent in multipath-rich mine tunnels. This holistic movement strategy is specifically designed to enhance hardware reliability in harsh, dust-prone mining conditions by mitigating failure risks associated with complex element-wise mechanical actuation. We formulate a joint optimization problem involving broadband active beamforming, passive phase shifts, and the STAR-RIS coordinates. To solve this non-convex problem, an Alternating Optimization (AO) algorithm is developed. Specifically, the STAR-RIS location is optimized via Projected Gradient Ascent (PGA), while the beamforming and phase-shift coefficients are refined using Successive Convex Approximation (SCA) and Semidefinite Relaxation (SDR). Simulation results confirm that the proposed system significantly improves the sum rate, validating its effectiveness for robust underground wireless connectivity.


  • A New Construction Structure on Coded Caching With Linear Subpacketization: Non-Half-Sum Disjoint Packing

    by Minquan Cheng, Huimei Wei, Kai Wan, Giuseppe Caire

    Coded caching is a promising technique for effectively reducing peak traffic by using local caches and the multicast gains generated by these local caches. Coded caching schemes have been widely investigated, following the seminal work of Maddah-Ali and Niesen. Explicit coding constructions have been proposed for a variety of network topologies with information-theoretically optimal or near-optimal transmission load $R$ . An important parameter in these constructions is the subpacketization $F$ , i.e., the number of subpackets that each content file needs to be divided into. In particular, the original scheme of Maddah-Ali and Niesen as well as several other variants require $F$ to grow exponentially with the number of users $K$ . In practice, files have finite size and too large $F$ yields impractically small subpackets. Therefore, it is important to design coded caching schemes with $F$ and $R$ as small as possible. At present, the few known schemes with subpacketization linear in $K$ achieve large load. In this paper, we consider the linear scaling regime $F = O(K)$ and design schemes with a lower transmission load $R$ . Specifically, we first introduce a new combinatorial structure called non-half-sum disjoint packing (NHSDP) which can be used to generate a coded caching scheme with $K=O(F)$ . A class of new schemes is then obtained by constructing NHSDP. Theoretical analysis and numerical results demonstrate that 1) in comparison to existing schemes with linear subpacketization, the proposed scheme achieves a lower load; 2) proposed scheme also attains a lower load than some existing schemes with polynomial subpacketization in some cases; and 3) proposed scheme achieves load values comparable to those of existing schemes with exponential subpacketization in some cases. Furthermore, the newly introduced concept of NHSDP is closely related to classical combinatorial structures, including cyclic difference packings (CDP), non-three-term arithmetic progressions (NTAP), and perfect hash families (PHF). These relationships underscore the significance of NHSDP as a combinatorial structure of independent interest in the field of combinatorial design, even beyond its application to coded caching.

  • Information-Theoretic Decentralized Secure Aggregation With Passive Collusion Resilience

    by Xiang Zhang, Zhou Li, Shuangyang Li, Kai Wan, Derrick Wing Kwan Ng, Giuseppe Caire

    In decentralized federated learning (FL), multiple clients collaboratively learn a shared machine learning (ML) model by leveraging their privately held datasets distributed across the network, through interactive exchange of intermediate model updates. To ensure data security, cryptographic techniques are commonly employed to protect model updates during aggregation. Despite growing interest in secure aggregation, existing works predominantly focus on protocol design and computational guarantees, with limited understanding of the fundamental information-theoretic limits of such systems. Moreover, optimal bounds on communication and key usage remain unknown in decentralized settings, where no central aggregator is available. Motivated by these gaps, we study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective. Specifically, we consider a network of K fully-connected users, each holding a private input—an abstraction of local training data—who aim to securely compute the sum of all inputs. The security constraint requires that no user learns anything beyond the input sum, even when colluding with up to T other users. We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA. In particular, we show that to securely compute one symbol of the desired input sum, each user must (i) transmit at least one symbol to others, (ii) hold at least one symbol of secret key, and (iii) all users must collectively hold no fewer than K − 1 independent key symbols. Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols in decentralized learning.


  • Fundamental Limits of Distributed Linearly Separable Computation Under Cyclic Assignment

    by Wenbo Huang, Kai Wan, Hua Sun, Mingyue Ji, Robert Caiming Qiu, Giuseppe Caire

    This paper studies the master-worker distributed linearly separable computation problem, where the considered computation task, referred to as linearly separable function, is a generic linear map. This model includes cooperative distributed gradient coding, real-time rendering, linear transforms, etc. as special cases. The computation task on $\mathsf K$ datasets can be expressed as ${\mathsf K}_{\mathrm { c}}$ linear combinations of $\mathsf K$ messages, where each message is the output of an individual function on one dataset. In this distributed computing model, the $\mathsf K$ datasets are assigned to $\mathsf N$ workers for computation. Due to the possible presence of stragglers, it is required that the master can obtain the desired computation task from the answers of any ${\mathsf N}_{\mathrm { r}}$ out of $\mathsf N$ workers. The computation cost is defined as the number of datasets assigned to each worker, while the communication cost is defined as the number of codewords that should be received. The objective is to characterize the optimal tradeoff between the computation and communication costs. A common way to assign the datasets to the workers is “cyclic assignment”. This has been considered in several theoretical works, as well as gradient coding, etc. Motivated by its theoretical and practical relevance, in this paper we focus on the cyclic assignment and solve the problem by determining the optimal computation/communication cost tradeoff when ${\mathsf N}={\mathsf K}$ and order optimal within a factor of 2 otherwise. In particular, this paper proposes a new computing scheme with the cyclic assignment based on the concept of interference alignment, by treating each message which cannot be computed by a worker as an interference from this worker. The decodability of our scheme is proved for the cases ${\mathsf K}_{\mathrm { c}} \in \left [{ \frac {\mathsf K}{\mathsf N}({\mathsf N}_{\mathrm { r}}-{\mathsf m}+1): {\mathsf K}}\right ]$ and ${\mathsf N}={\mathsf N}_{\mathrm { r}}$ with ${\mathsf m}+{\mathsf u}-1$ dividing $\mathsf N$ (where ${\mathsf u}= \left \lceil { \frac {{{\mathsf K}_{\mathrm { c}}}{\mathsf N}}{\mathsf K}}\right \rceil $ ), and is further numerically verified for ${\mathsf N}\leq 60$ . Beyond the appealing order-optimality result, we also show that the proposed scheme achieves significant gains over the current state of the art in practice. Experimental results over Tencent Cloud show the reduction of whole distributed computing process time of our scheme is up to 72.8% compared to the benchmark scheme which treats the computation on ${\mathsf K}_{\mathrm { c}}$ linear combinations as ${\mathsf K}_{\mathrm { c}}$ individual computations.

  • Communication and Storage Efficient Coded CNN Inference for Straggler-Resistant Over IoT Devices

    by Shuangjun Xie, Rui Liu, Kai Wan, Qingguo Lü, Yong Li

    This article proposes the low upload and storage cost (LUSC) scheme, a coded distributed computing (CDC) approach that accelerates convolutional neural network (CNN) inference on resource-constrained edge devices. LUSC introduces a new encoding and decoding mechanism that exploits the periodicity and evenness of cosine functions, reducing communication and storage overhead while ensuring numerical stability. Orthogonal decoding matrices derived from this cosine-based design guarantee stable inversion and preserve numerical precision. By leveraging the duality property of cosine functions, LUSC reduces the number of workers required for decoding, enabling finer-grained task decomposition and further lowering upload and storage costs. When combined with a spatial and channel grid partition (SCGP) strategy, LUSC (including other matrix-multiplication-based CDC schemes) can be applied to convolutions, accelerating CNN inference while maintaining resilience to stragglers. Experimental results demonstrate that LUSC consistently outperforms existing numerically stable CDC schemes, providing efficient inference with reduced communication and storage costs and maintaining robustness under straggler conditions.

  • Open Access

    Multiaccess Coded Caching with Heterogeneous Retrieval Costs

    by Wenbo Huang, Minquan Cheng, Kai Wan, Xiaojun Li, Robert Caiming Qiu, Giuseppe Caire

    The multiaccess coded caching (MACC) system, as formulated by Hachem {\it et al.}, consists of a central server with a library of $N$ files, connected to $K$ cache-less users via an error-free shared link, and $K$ cache nodes, each equipped with cache memory of size $M$ files. Each user can access $L$ neighboring cache nodes under a cyclic wrap-around topology. Most existing studies operate under the strong assumption that users can retrieve content from their connected cache nodes at no communication cost. In practice, each user retrieves content from its $L$ different connected cache nodes at varying costs. Additionally, the server also incurs certain costs to transmit the content to the users. In this paper, we focus on a cost-aware MACC system and aim to minimize the total system cost, which includes cache-access costs and broadcast costs. Firstly, we propose a novel coded caching framework based on superposition coding, where the MACC schemes of Cheng \textit{et al.} are layered. Then, a cost-aware optimization problem is derived that optimizes cache placement and minimizes system cost. By identifying a sparsity property of the optimal solution, we propose a structure-aware algorithm with reduced complexity. Simulation results demonstrate that our proposed scheme consistently outperforms the scheme of Cheng {\it et al.} in scenarios with heterogeneous retrieval costs.

  • Open Access

    Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment

    by Ziting Zhang, Kai Wan, Minquan Cheng, Shuo Shao, Giuseppe Caire

    Distributed linearly separable computation is a fundamental problem in large-scale distributed systems, requiring the computation of linearly separable functions over different datasets across distributed workers. This paper studies a heterogeneous distributed linearly separable computation problem, including one master and N distributed workers. The linearly separable task function involves Kc linear combinations of K messages, where each message is a function of one dataset. Distinguished from the existing homogeneous settings that assume each worker holds the same number of datasets, where the data assignment is carefully designed and controlled by the data center (e.g., the cyclic assignment), we consider a more general setting with arbitrary heterogeneous data assignment across workers, where `arbitrary' means that the data assignment is given in advance and `heterogeneous' means that the workers may hold different numbers of datasets. Our objective is to characterize the fundamental tradeoff between the computable dimension of the task function and the communication cost under arbitrary heterogeneous data assignment. Under the constraint of integer communication costs, for arbitrary heterogeneous data assignment, we propose a universal computing scheme and a universal converse bound by characterizing the structure of data assignment, where they coincide under some parameter regimes. We then extend the proposed computing scheme and converse bound to the case of fractional communication costs.

  • Open Access

    A New Construction Structure on MISO Coded Caching with Linear Subpacketization: Half-Sum Disjoint Packing

    by Bowen Zheng, Minquan Cheng, Kai Wan, Giuseppe Caire

    In the $(L,K,M,N)$ cache-aided multiple-input single-output (MISO) broadcast channel (BC) system, the server is equipped with $L$ antennas and communicates with $K$ single-antenna users through a wireless broadcast channel where the server has a library containing $N$ files, and each user is equipped with a cache of size $M$ files. Under the constraints of uncoded placement and one-shot linear delivery strategies, many schemes achieve the maximum sum Degree-of-Freedom (sum-DoF). However, for general parameters $L$, $M$, and $N$, their subpacketizations increase exponentially with the number of users. We aim to design a MISO coded caching scheme that achieves a large sum-DoF with low subpacketization $F$. An interesting combinatorial structure, called the multiple-antenna placement delivery array (MAPDA), can be used to generate MISO coded caching schemes under these two strategies; moreover, all existing schemes with these strategies can be represented by the corresponding MAPDAs. In this paper, we study the case with $F=K$ (i.e., $F$ grows linearly with $K$) by investigating MAPDAs. Specifically, based on the framework of Latin squares, we transform the design of MAPDA with $F=K$ into the construction of a combinatorial structure called the $L$-half-sum disjoint packing (HSDP). It is worth noting that a $1$-HSDP is exactly the concept of NHSDP, which is used to generate the shared-link coded caching scheme with $F=K$. By constructing $L$-HSDPs, we obtain a class of new schemes with $F=K$. Finally, theoretical and numerical analyses show that our $L$-HSDP schemes significantly reduce subpacketization compared to existing schemes with exponential subpacketization, while only slightly sacrificing sum-DoF, and achieve both a higher sum-DoF and lower subpacketization than the existing schemes with linear subpacketization.

  • Open Access

    A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Latin Rectangle

    by Yongcheng Yang, Minquan Cheng, Kai Wan, Giuseppe Caire

    Coded caching is recognized as an effective method for alleviating network congestion during peak periods by leveraging local caching and coded multicasting gains. The key challenge in designing coded caching schemes lies in simultaneously achieving low subpacketization and low transmission load. Most existing schemes require exponential or polynomial subpacketization levels, while some linear subpacketization schemes often result in excessive transmission load. Recently, Cheng et al. proposed a construction framework for linear coded caching schemes called Non-Half-Sum Disjoint Packing (NHSDP), where the subpacketization equals the number of users $K$. This paper introduces a novel combinatorial structure, termed the Non-Half-Sum Latin Rectangle (NHSLR), which extends the framework of linear coded caching schemes from $F=K$ (i.e., the construction via NHSDP) to a broader scenario with $F=\mathcal{O}(K)$. By constructing NHSLR, we have obtained a new class of coded caching schemes that achieves linearly scalable subpacketization, while further reducing the transmission load compared with the NHSDP scheme. Theoretical and numerical analyses demonstrate that the proposed schemes not only achieves lower transmission load than existing linear subpacketization schemes but also approaches the performance of certain exponential subpacketization schemes.