SearcharxivSearch

arXiv subjects

Jingjin Wu

Publications and source records attributed to Jingjin Wu.

14 recordsLinked to original sources

Cluster-Based Client Selection for Dependent Multi-Task Federated Learning in Edge Computing

We study the client selection problem in Federated Learning (FL) within mobile edge computing (MEC) environments, particularly under the dependent multi-task settings, to reduce the total time required to complete various learning tasks. We propose CoDa-FL, a Cluster-oriented and Dependency-aware framework designed to reduce the total required time via cluster-based client selection and dependent task assignment. Our approach considers Earth Mover's Distance (EMD) for client clustering based on their local data distributions to lower computational cost and improve communication efficiency. We derive a direct and explicit relationship between intra-cluster EMD and the number of training rounds required for convergence, thereby simplifying the otherwise complex process of obtaining the optimal solution. Additionally, we incorporate a directed acyclic graph-based task scheduling mechanism to effectively manage task dependencies. Through numerical experiments, we validate that our proposed CoDa-FL outperforms existing benchmarks by achieving faster convergence, lower communication and computational costs, and higher learning accuracy under heterogeneous MEC settings.

cs.LG

Adaptive Client Selection via Q-Learning-based Whittle Index in Wireless Federated Learning

We consider the client selection problem in wireless Federated Learning (FL), with the objective of reducing the total required time to achieve a certain level of learning accuracy. Since the server cannot observe the clients' dynamic states that can change their computation and communication efficiency, we formulate client selection as a restless multi-armed bandit problem. We propose a scalable and efficient approach called the Whittle Index Learning in Federated Q-learning (WILF-Q), which uses Q-learning to adaptively learn and update an approximated Whittle index associated with each client, and then selects the clients with the highest indices. Compared to existing approaches, WILF-Q does not require explicit knowledge of client state transitions or data distributions, making it well-suited for deployment in practical FL settings. Experiment results demonstrate that WILF-Q significantly outperforms existing baseline policies in terms of learning efficiency, providing a robust and efficient approach to client selection in wireless FL.

cs.LG

Energy Efficient Offloading Policies in Multi-Access Edge Computing Systems with Task Handover

The rapid growth of mobile devices and the increasing complexity of tasks have made energy efficiency a critical challenge in Multi-Access Edge Computing (MEC) systems. This paper explores energy-efficient offloading strategies in large-scale MEC systems with heterogeneous mobile users, diverse network components, and frequent task handovers to capture user mobility. The problem is inherently complex due to the system's scale, task and resource diversity, and the need to maintain real-time performance. Traditional optimization approaches are often computationally infeasible for such scenarios. To tackle these challenges, we model the offloading problem using the restless multi-armed bandit (RMAB) framework and develop two scalable online policies that prioritize resources based on their marginal costs. The proposed policies dynamically adapt to the system's heterogeneity and mobility while ensuring near-optimal energy efficiency. Through extensive numerical simulations, we demonstrate that the policies significantly outperform baseline methods in power conservation and show robust performance under non-exponentially distributed task lifespans. These results highlight the practical applicability and scalability of our approach in dynamic MEC environments.

cs.DC

Energy-Aware Holistic Optimization in UAV-Assisted Fog Computing: Attitude, Trajectory, Task Assignment

Unmanned Aerial Vehicles (UAVs) have significantly enhanced fog computing by acting as both flexible computation platforms and communication mobile relays. In this paper, we consider four important and interdependent modules: attitude control, trajectory planning, resource allocation, and task assignment, and propose a holistic framework that jointly optimizes the total latency and energy consumption for UAV-assisted fog computing in a three-dimensional spatial domain with varying terrain elevations and dynamic task generations. We first establish a fuzzy-enhanced adaptive reinforcement proportional-integral-derivative control model to control the attitude. Then, we propose an enhanced Ant Colony System (ACS) based algorithm, that includes a safety value and a decoupling mechanism to overcome the convergence issue in classical ACS, to compute the optimal UAV trajectory. Finally, we design an algorithm based on the Particle Swarm Optimization technique, to determine where each offloaded task should be executed. Under our proposed framework, the outcome of one module would affect the decision-making in another, providing a holistic perspective of the system and thus leading to improved solutions. We demonstrate by extensive simulation results that our proposed framework can significantly improve the overall performance, measured by latency and energy consumption, compared to existing mainstream approaches.

eess.SY

A Study of a Loss System with Priorities

The Erlang loss formula, also known as the Erlang B formula, has been known for over a century and has been used in a wide range of applications, from telephony to hospital intensive care unit management. It provides the blocking probability of arriving customers to a loss system involving a finite number of servers without a waiting room. Because of the need to introduce priorities in many services, an extension of the Erlang B formula to the case of a loss system with preemptive priority is valuable and essential. This paper analytically establishes the consistency between the global balance (steady state) equations for a loss system with preemptive priorities and a known result obtained using traffic loss arguments for the same problem. This paper, for the first time, derives this known result directly from the global balance equations based on the relevant multidimensional Markov chain. The paper also addresses the question of whether or not the well-known insensitivity property of the Erlang loss system is also applicable to the case of a loss system with preemptive priorities, provides explanations, and demonstrates through simulations that, except for the blocking probability of the highest priority customers, the blocking probabilities of the other customers are sensitive to the holding time distributions and that a higher variance of the service time distribution leads to a lower blocking probability of the lower priority traffic.

math.PR

Modeling and Joint Optimization of Security, Latency, and Computational Cost in Blockchain-based Healthcare Systems

In the era of the Internet of Things (IoT), blockchain is a promising technology for improving the efficiency of healthcare systems, as it enables secure storage, management, and sharing of real-time health data collected by the IoT devices. As the implementations of blockchain-based healthcare systems usually involve multiple conflicting metrics, it is essential to balance them according to the requirements of specific scenarios. In this paper, we formulate a joint optimization model with three metrics, namely latency, security, and computational cost, that are particularly important for IoT-enabled healthcare. However, it is computationally intractable to identify the exact optimal solution of this problem for practical sized systems. Thus, we propose an algorithm called the Adaptive Discrete Particle Swarm Algorithm (ADPSA) to obtain near-optimal solutions in a low-complexity manner. With its roots in the classical Particle Swarm Optimization (PSO) algorithm, our proposed ADPSA can effectively manage the numerous binary and integer variables in the formulation. We demonstrate by extensive numerical experiments that the ADPSA consistently outperforms existing benchmark approaches, including the original PSO, exhaustive search and Simulated Annealing, in a wide range of scenarios.

cs.NE

A Ring Topology-based Communication-Efficient Scheme for D2D Wireless Federated Learning

Federated learning (FL) is an emerging technique aiming at improving communication efficiency in distributed networks, where many clients often request to transmit their calculated parameters to an FL server simultaneously. However, in wireless networks, the above mechanism may lead to prolonged transmission time due to unreliable wireless transmission and limited bandwidth. This paper proposes a communication scheme to minimize the uplink transmission time for FL in wireless networks. The proposed approach consists of two major elements, namely a modified Ring All-reduce (MRAR) architecture that integrates D2D wireless communications to facilitate the communication process in FL, and a modified Ant Colony Optimization algorithm to identify the optimal composition of the MRAR architecture. Numerical results show that our proposed approach is robust and can significantly reduce the transmission time compared to the conventional star topology. Notably, the reduction in uplink transmission time compared to baseline policies can be substantial in scenarios applicable to large-scale FL, where client devices are densely distributed.

math.OC

Optimal Trajectory Planning and Task Assignment for UAV-assisted Fog Computing

Fog computing is an emerging distributed computing model for the Internet of Things (IoT). It extends computing and caching functions to the edge of wireless networks. Uncrewed Aerial Vehicles (UAVs) provide adequate support for fog computing. UAVs can not only act as a relay between mobile users and physically remote edge devices to avoid costly long-range wireless communications but also are equipped with computing facilities that can take over specific tasks. In this paper, we aim to optimize the energy efficiency of a fog computing system assisted by a single UAV by planning the trajectories of the UAV and assigning computing tasks to different devices, including the UAV itself. We propose two algorithms based on the classical Ant Colony and Particle Swarm Optimization techniques and solve the problem by continuous convex approximation. Unlike most existing studies where the trajectories are assumed to be straight lines, we account for the effect of obstacles, such as buildings, and deliberately avoid them during the trajectory planning phase. Through extensive simulation experiments, we demonstrate that our proposed approach can achieve significantly better energy efficiency than existing benchmark algorithms.

math.OC

An Attention-based Long Short-Term Memory Framework for Detection of Bitcoin Scams

Bitcoin is the most common cryptocurrency involved in cyber scams. Cybercriminals often utilize pseudonymity and privacy protection mechanism associated with Bitcoin transactions to make their scams virtually untraceable. The Ponzi scheme has attracted particularly significant attention among Bitcoin fraudulent activities. This paper considers a multi-class classification problem to determine whether a transaction is involved in Ponzi schemes or other cyber scams, or is a non-scam transaction. We design a specifically designed crawler to collect data and propose a novel Attention-based Long Short-Term Memory (A-LSTM) method for the classification problem. The experimental results show that the proposed model has better efficiency and accuracy than existing approaches, including Random Forest, Extra Trees, Gradient Boosting, and classical LSTM. With correctly identified scam features, our proposed A-LSTM achieves an F1-score over 82% for the original data and outperforms the existing approaches.

cs.CR

Sequence Q-Learning Algorithm for Optimal Mobility-Aware User Association

We consider a wireless network scenario applicable to metropolitan areas with developed public transport networks and high commute demands, where the mobile user equipments (UEs) move along fixed and predetermined trajectories and request to associate with millimeter-wave (mmWave) base stations (BSs). An effective and efficient algorithm, called the Sequence Q-learning Algorithm (SQA), is proposed to maximize the long-run average transmission rate of the network, which is an NP-hard problem. Furthermore, the SQA tackles the complexity issue by only allowing possible re-associations (handover of a UE from one BS to another) at a discrete set of decision epochs and has polynomial time complexity. This feature of the SQA also restricts too frequent handovers, which are considered highly undesirable in mmWave networks. Moreover, we demonstrate by extensive numerical results that the SQA can significantly outperform the benchmark algorithms proposed in existing research by taking all UEs' future trajectories and possible decisions into account at every decision epoch.

math.OC

Energy Efficient Priority-Based Task Scheduling for Computation Offloading in Fog Computing

Fog computing offers a flexible solution for computational offloading for Internet of Things (IoT) services at the edge of wireless networks. It serves as a complement to traditional cloud computing, which is not cost-efficient for most offloaded tasks in IoT applications involving small-to-medium levels of computing tasks. Given the heterogeneity of tasks and resources in fog computing, it is vital to offload each task to an appropriate destination to fully utilize the potential benefit of this promising technology. In this paper, we propose a scalable priority-based index policy, referred to as the Prioritized Incremental Energy Rate (PIER), to optimize the energy efficiency of the network. We demonstrate that PIER is asymptotically optimal in a special case applicable for local areas with high volumes of homogeneous offloaded tasks and exponentially distributed task durations. In more general cases with statistically different offloaded tasks, we further demonstrate the improvement of PIER over benchmark policies in terms of energy efficiency and the robustness of PIER to different task duration distributions by extensive simulations. Our results show that PIER can perform better than benchmark policies in more than 78.6% of all simulation runs.

math.OC

A High-Performance Energy Management System based on Evolving Graph

As the fast growth and large integration of distributed generation, renewable energy resource, energy storage system and load response, the modern power system operation becomes much more complicated with increasing uncertainties and frequent changes. Increased operation risks are introduced to the existing commercial Energy Management System (EMS), due to its limited computational capability. In this paper, a high-performance EMS analysis framework based on the evolving graph is developed. A power grid is first modeled as an evolving graph and then the power system dynamic analysis applications, like network topology processing (NTP), state estimation (SE), power flow (PF), and contingency analysis (CA), are efficiently implemented on the system evolving graph to build a high-performance EMS analysis framework. Its computation performance is field tested using a 2749-bus power system in Sichuan, China. The results illustrate that the proposed EMS remarkably speeds up the computation performance and reaches the goal of real-time power system analysis.

cs.DC

A Graph Computation based Sequential Power Flow Calculation for Large-Scale ACDC Systems

This paper proposes a graph computation based sequential power flow calculation method for Line Commutated Converter (LCC) based large-scale AC/DC systems to achieve a high computing performance. Based on the graph theory, the complex AC/DC system is first converted to a graph model and stored in a graph database. Then, the hybrid system is divided into several isolated areas with graph partition algorithm by decoupling AC and DC networks. Thus, the power flow analysis can be executed in parallel for each independent area with the new selected slack buses. Furthermore, for each area, the node-based parallel computing (NPC) and hierarchical parallel computing (HPC) used in graph computation are employed to speed up fast decoupled power flow (FDPF). Comprehensive case studies on the IEEE 300-bus, polished South Carolina 12,000-bus system and a China 11,119-bus system are performed to demonstrate the accuracy and efficiency of the proposed method

cs.DC

Graph Based Power Flow Calculation for Energy Management System

Power flow calculation in EMS is required to accommodate a large and complex power system. To achieve a faster than real-time calculation, a graph based power flow calculation is proposed in this paper. Graph database and graph computing advantages in power system calculations are presented. A linear solver for power flow application is formulated and decomposed in nodal parallelism and hierarchical parallelism to fully utilize graph parallel computing capability. Comparison of the algorithm with traditional sequential programs shows significant benefits on computation efficiency. Case studies on practical large-scale systems provide supporting evidence that the new algorithm is promising for online computing for EMS.

eess.SP