Bibo Wu

dblp:217/8635 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
6since 2021 · last 2025
0009-0002-3918-2510ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 4 first-author · 5 since 2021
YearPublicationVenuePosition
2025 Optimizing Value of Learning in Task-Oriented Federated Meta-Learning Systems
abstract
Federated Learning (FL) has gained significant attention in recent years due to its distributed nature and privacy-preserving benefits. However, a key limitation of conventional FL is that it learns and distributes a common global model to all participants, which fails to provide customized solutions for diverse task requirements. Federated meta-learning (FML) offers a promising solution to this issue by enabling devices to fine-tune local models after receiving a shared meta-model from the server. In this paper, we propose a task-oriented FML framework over non-orthogonal multiple access (NOMA) networks. A novel metric, termed value of learning (VoL), is introduced to assess the individual training needs across devices. Moreover, a task-level weight (TLW) metric is defined based on task requirements and fairness considerations, guiding the prioritization of edge devices during FML training. The formulated problem—to maximize the sum of TLW-based VoL across devices—forms a non-convex mixed-integer non-linear programming (MINLP) challenge, addressed here using a parameterized deep Q-network (PDQN) algorithm to handle both discrete and continuous variables. Simulation results demonstrate that our approach significantly outperforms baseline schemes, underscoring the advantages of the proposed framework.
Bibo Wu, Fang Fang 0005, Xianbin Wang 0001
ICC1
2025 Stackelberg Game-Based Performance Optimization in Digital Twin-Assisted Federated Learning Over NOMA Networks
abstract
Despite the advantage of preserving data privacy, federated learning (FL) still suffers from the straggler issue due to the limited computation resources of distributed clients and the unreliable wireless communication environment. By effectively imitating the distributed resources, digital twin (DT) shows great potential in alleviating this issue. In this paper, we leverage DT in the FL framework over non-orthogonal multiple access (NOMA) network to assist FL training process, considering malicious attacks on model updates from clients. A reputation-based client selection scheme is proposed, which accounts for client heterogeneity in multiple aspects and effectively mitigates the risks of poisoning attacks in FL systems. To minimize the total latency and energy consumption in the proposed system, we then formulate a Stackelberg game by considering clients and the server as the leader and the follower, respectively. Specifically, the leader aims to minimize the energy consumption while the objective of the follower is to minimize the total latency during FL training. The Stackelberg equilibrium is achieved to obtain the optimal solutions. We first derive the strategies for the follower-level problem and include them in the leader-level problem which is then solved via problem decomposition. Simulation results verify the superior performance of the proposed scheme.
Bibo Wu, Fang Fang 0005, Xianbin Wang 0001
IEEE Trans. Wirel. Commun.1
2024 Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks
abstract
Despite its advantage of preserving data privacy, federated learning (FL) could suffer from the limited computation resources of the distributed clients particularly when they are connected by wireless networks. By imitating the distributed resources effectively, digital twin (DT) shows great potential in eliminating the straggler issue in FL. In this paper, we leverage DT in the FL framework over non-orthogonal multiple access (NOMA) network, where DT deployed at the server can assist FL training process. To minimize the total latency and energy consumption in the proposed system, we formulate a Stackelberg game by considering clients and the server as the leader and the follower, respectively. Specifically, the leader aims to minimize the energy consumption via the optimization of DT mapping data ratio and resource allocation, while the objective of the follower is to minimize the total latency during FL training by optimally allocating DT computation resource. The Stackelberg equilibrium is considered to obtain the optimal solutions. We first derive the closed-form solution for the follower-level problem and include it in the leader-level problem which is then solved through the deep reinforcement learning (DRL) method. Simulation results verify the superior performance of the proposed scheme.
Bibo Wu, Fang Fang 0005, Ming Zeng 0002, Xianbin Wang 0001
VTC Fall1
2024 Joint Age-Based Client Selection and Resource Allocation for Communication-Efficient Federated Learning Over NOMA Networks
abstract
In federated learning (FL), distributed clients can collaboratively train a shared global model while retaining their own training data locally. Nevertheless, the performance of FL is often limited by the slow convergence because of poor communications links when FL is deployed over wireless networks. Due to the scarceness of radio resources, it is crucial to select appropriate clients and allocate communication resource accurately for enhancing FL performance. To address these challenges, in this paper, a joint optimization problem of client selection and resource allocation is formulated, aiming to minimize the total time consumption of each round in FL over a non-orthogonal multiple access (NOMA) enabled wireless network. Specifically, considering the staleness of local FL models, we propose an age of update (AoU) based novel client selection scheme. Subsequently, the closed-form expressions for resource allocation are derived by monotonicity analysis and dual decomposition method. In addition, a server-side artificial neural network (ANN) is proposed to predict the FL models of clients who are not selected at each round to further improve FL performance. Finally, extensive simulation results demonstrate the superior performance of the proposed schemes over FL performance, average AoU and total time consumption.
Bibo Wu, Fang Fang 0005, Xianbin Wang 0001
IEEE Trans. Commun.1
2024 Client Selection and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning
abstract
Hierarchical federated learning (HFL) shows great advantages over conventional two-layer federated learning (FL) in reducing network overhead and interaction latency while still retaining the data privacy of distributed FL clients. However, the communication and energy overhead still pose a bottleneck for HFL performance, especially as the number of clients raises dramatically. To tackle this issue, we propose a non-orthogonal multiple access (NOMA) enabled HFL system under semi-synchronous cloud model aggregation in this paper, aiming to minimize the total cost of time and energy at each HFL global round. Specifically, we first propose a novel fuzzy logic based client selection policy considering client heterogeneity in multiple aspects, including channel quality, data quantity and model staleness. Subsequently, given the fuzzy based client-edge association, a joint edge server scheduling and resource allocation problem is formulated. Utilizing problem decomposition, we firstly derive the closed-form solution for the edge server scheduling subproblem via the penalty dual decomposition (PDD) method. Next, a deep deterministic policy gradient (DDPG) based algorithm is proposed to tackle the resource allocation subproblem considering time-varying environments. Finally, extensive simulations demonstrate that the proposed scheme outperforms the considered benchmarks regarding HFL performance improvement and total cost reduction.
Bibo Wu, Fang Fang 0005, Xianbin Wang 0001, Donghong Cai, Shu Fu, Zhiguo Ding 0001
IEEE Trans. Wirel. Commun.1
2023 Energy-Efficient Design of STAR-RIS Aided MIMO-NOMA Networks
abstract
Simultaneous transmission and reflection-reconfigurable intelligent surface (STAR-RIS) can provide expanded coverage compared with the conventional reflection-only RIS. This paper exploits the energy efficient potential of STAR-RIS in a multiple-input and multiple-output (MIMO) enabled non-orthogonal multiple access (NOMA) system. Specifically, we mainly focus on energy-efficient resource allocation with MIMO technology in the STAR-RIS assisted NOMA network. To maximize the system energy efficiency, we propose an algorithm to optimize the transmit beamforming and the phases of the low-cost passive elements on the STAR-RIS alternatively until the convergence. Specifically, we first decompose the formulated energy efficiency problem into beamforming and phase shift optimization problems. To efficiently address the non-convex beamforming optimization problem, we exploit signal alignment and zero-forcing precoding methods in each user pair to decompose MIMO-NOMA channels into single-antenna NOMA channels. Then, the Dinkelbach approach and dual decomposition are utilized to optimize the beamforming vectors. In order to solve non-convex phase shift optimization problem, we propose a successive convex approximation (SCA) based method to efficiently obtain the optimized phase shift of STAR-RIS. Simulation results demonstrate that the proposed algorithm with NOMA technology can yield superior energy efficiency performance over the orthogonal multiple access (OMA) scheme and the random phase shift scheme.
Fang Fang 0005, Bibo Wu, Shu Fu, Zhiguo Ding 0001, Xianbin Wang 0001
IEEE Trans. Commun.2