This paper introduces ProxyLLM, a novel framework designed to enhance the tool utilization capabilities of Large Language Models (LLMs) by leveraging an ensemble of smaller, specialized proxy models. Specifically, instead of invoking tools directly, ProxyLLM delegates tasks to these proxy models, each of which is responsible for a distinct domain and equipped with a curated set of relevant tools. Meanwhile, ProxyLLM employs a two-step knowledge transfer mechanism, utilizing data generated by the LLM for knowledge distillation and LLM-guided Deep Reinforcement Learning (DRL) to enhance the decision-making abilities of the proxy models. During the data-driven knowledge distillation process, the introduction of rationales ensures that proxy models maintain a comprehensive understanding of tasks, thereby improving the learning effectiveness. In the DRL learning process, LLM guidance is separately integrated into both the actor and critic learning phases. This ensures consistency in strategy and uniformity in evaluating the action space, which enhances both the efficiency and effectiveness of the learning process. Extensive experiments, including real-world applications such as network service generation in a Computing Power Network (CPN) system, demonstrate that ProxyLLM significantly outperforms existing methods in terms of task accuracy and tool invocation efficiency. The proposed framework offers a promising solution for constructing generalizable, large-scale intelligent agents capable of effectively leveraging diverse tools to solve complex, cross-domain problems.

Federated learning (FL) is a new paradigm to train AI models over distributed edge devices (i.e., workers) using their local data, while confronting various challenges including communication resource constraints, edge heterogeneity and data Non-IID. Over-the-air computation (AirComp) is a promising technique to achieve efficient utilization of communication resource for model aggregation by leveraging the superposition property of a wireless multiple access channel (MAC). However, AirComp requires strict synchronization among edge devices, which is hard to achieve in heterogeneous scenarios. In this paper, we propose an AirComp-based grouping asynchronous federated learning mechanism (Air-FedGA), which combines the advantages of AirComp and asynchronous FL to address the communication and heterogeneity challenges. Specifically, AirFedGA organizes workers into groups and performs over-theair aggregation within each group, while groups asynchronously communicate with the parameter server to update the global model. In this way, Air-FedGA accelerates the FL model training by over-the-air aggregation, while relaxing the synchronization requirement of this aggregation technology. We theoretically prove the convergence of Air-FedGA. We formulate a training time minimization problem for Air-FedGA and propose the power control and worker grouping algorithm to solve it, which jointly optimizes the power scaling factors at edge devices, the denoising factors at the parameter server, as well as the worker grouping strategy. We conduct experiments on classical models and datasets, and the results demonstrate that our proposed mechanism and algorithm can speed up FL model training by$\mathbf{29.9\% - 71.6\%}$compared with the state-of-the-art solutions.

Existing video-based human pose estimation (HPE) methods commonly rely on large networks to localize body joints across all frames, achieving remarkable accuracy but imposing high memory and computational demands that limit their applications on resource-constrained devices. Moreover, most models lack the capability to accommodate dynamic changes in available resources, which can negatively impact the performance of parallel tasks. To address these issues, this article proposes a novel yet effective framework for efficient and adaptive HPE on resource-constrained devices. Specifically, the proposed approach adopts the knowledge distillation (KD) strategy to train a light-weight pose estimator network, which is capable of executing rapidly with low computational cost. To further increase the overall efficiency, it exploits the temporal coherence between successive video frames and explicitly propagates body joints from previous frames rather than naively extracting them using a pose estimator. Furthermore, a prediction-based mechanism is adopted to facilitate adaptive key-frame selection, dynamically determining the optimal number of keyframes, thus enhancing the overall efficiency and adaptability. Experiments on Penn Action, Sub-JHMDB, and real-world systems demonstrate that the proposed method achieves comparative accuracy, superior efficiency, and robust flexibility in dynamic scenarios.

Federated learning (FL) has emerged as a pivotal approach for edge-based distributed machine learning, yet it faces significant challenges due to the constrained capacities and heterogeneity of edge devices, including non-IID data distribution, communication constraints, and learning inefficiencies. Furthermore, a one-fits-all global model often fails to perform optimally across diverse participating devices. In this paper, we present NestFL, an efficient FL framework for edge computing that can jointly improve the training efficiency and achieve personalization. Specifically, NestFL innovates by incorporating distributed model pruning, creating a hierarchy of structured-sparse subnetworks tailored to the unique resource profiles of client devices. These subnetworks are integrated into a nested global model, ensuring parameter sharing without increasing the parameter space, thereby significantly reducing computational and communication burdens. Meanwhile, it implements a cross-training mechanism, allowing clients to train on a broader dataset and maintain consistent decision boundaries. Furthermore, a weighted aggregation mechanism is designed to improve training performance and maximally preserve personalization. Experimental results in different applications demonstrate the superiority of NestFL over the baseline approaches in terms of model accuracy, convergence speed, and personalization preservation.

This paper presents AdaHPE, an innovative and efficient framework for human pose estimation (HPE) designed specifically for edge computing devices with constrained and fluctuating resources. AdaHPE redefines the conventional HPE workflow by converting the resource-demanding pose regression into a sequence of computationally feasible pose propagation tasks. The framework incorporates a memory-augmented LSTM network with a global memory repository, allowing AdaHPE to adaptively choose keyframes based on real-time data and the device’s resource status, thereby optimizing the trade-off between accuracy and computational efficiency. A reinforcement learning component is further integrated to intelligently adjust the ratio of keyframes used, enhancing the framework’s adaptability. Utilizing policy gradient algorithms, AdaHPE is optimized to maximize a reward function that encourages both accurate and resource-efficient pose estimations, while respecting a given keyframe constraint. Extensive experiments on benchmarks including Penn Action, Sub-JHMDB, NTU RGB+D 120, and real-world datasets demonstrate that AdaHPE can significantly reduce computational overhead compared to per-frame HPE models while preserving high accuracy and robustness under varying resource limitations. Moreover, the seamless compatibility of our approach with various off-the-shelf HPE models highlights its versatility and potential for broad applications.

Decentralized federated learning (DFL) is a promising technique to enable distributed machine learning over edge nodes without relying on a centralized parameter server. However, existing DFL network topologies, such as fully connected, partially connected, or lower-tier hierarchical topology often struggle to effectively address the unique challenges presented by edge networks, including edge heterogeneity, communication resource constraint, and data Non-IID. In order to tackle these challenges, we propose a data-aware clustering algorithm, called FRACTAL, to construct a multi-tier hierarchical topology in a bottomup manner taking into consideration both data distribution and communication efficiency for DFL. We theoretically explore the quantitative relationship between the convergence bound of multi-tier FL and the data distribution among each-tier servers. To further improve communication efficiency and address edge heterogeneity, we deploy a time-sharing communication scheduling algorithm within each fractal unit (the basic structure in FRACTAL consisting of multiple nodes and an aggregator), called magic mirror method (MMM), to determine the optimal order of model distributing and uploading for nodes. We conduct extensive experiments on the classical models and datasets to evaluate the performance of FRACTAL, and the results show that FRACTAL can significantly accelerate the DFL model training by 48.6%- 72.3% compared with the state-of-the-art solutions.

Multiagent routing problems, arising from practical applications, such as logistics, transportation, and emergency response, face challenges due to the exponential growth of the search space with increasing problem scales. This article proposes RouteMaker to address the often-overlooked multiagent routing problems involving dedicated multiple depots. RouteMaker leverages role-interaction-based graph neural network (RIGNN) to realize effective locations assignments and integrates an advanced planner to plan travel path for each agent. RouteMaker is trained on small-scale problems and can produce comparable or superior approximate optimal solutions compared with the best heuristic baselines. Notably, the learned RouteMaker generalizes seamlessly to large-scale problems and real-world problems without the need for fine-tuning, delivering significantly higher quality solutions in relatively less time. For scenarios involving 40 agents and 1000 locations, RouteMaker achieves over $600\times $ speed improvement and more than 88% cost reduction, compared with the representative classical heuristic solver (ORTools).

The Industrial Internet of Things (IIoT) has become a critical technology to accelerate the process of digital and intelligent transformation of industries. As the cooperative relationship between smart devices in IIoT becomes more complex, obtaining deterministic responses of IIoT periodic time-critical computing tasks becomes a crucial and nontrivial problem. However, few current works in cloud/edge/fog computing focus on this problem. This paper is a pioneer in exploring deterministic scheduling and network structural optimization problems for IIoT periodic time-critical computing tasks. We first formulate the two problems and derive theorems to help quickly identify computation and network resource sharing conflicts. Based on this, we propose a deterministic scheduling algorithm,IIoTBroker, which realizes a deterministic response for each IIoT task by optimizing the fine-grained computation and network resources, and a network optimization algorithm,IIoTDeployer, which provides a cost-effective structural upgrade solution for existing IIoT networks. Our methods are illustrated to be cost-friendly, scalable, and deterministic response guaranteed with low computation cost from our simulation results.

Multiedge cooperative computing that combines constrained resources of multiple edges into a powerful resource pool has the potential to deliver great benefits, such as a tremendous computing power, improved response time, and more diversified services. However, the mass heterogeneous resources composition and lack of scheduling strategies make the modeling and cooperating of multiedge computing system particularly complicated. This article first proposes a system-level state evaluation model to shield the complex hardware configurations and redefine the different service capabilities at heterogeneous edges. Second, an integer linear programming model is designed to cater for optimally dispatching the distributed arriving requests. Finally, a learning-based lightweight real-time scheduler, CoRaiS is proposed. CoRaiS embeds the real-time states of the multiedge system and requests information, and combines the embeddings with a policy network to schedule the requests, so that the response time of all requests can be minimized. Evaluation results verify that the CoRaiS can make a high-quality scheduling decision in real-time, and can be generalized to other multiedge computing system, regardless of the system scales. Characteristic validation also demonstrates that the CoRaiS successfully learns to balance loads, perceive real-time state and recognize heterogeneity while scheduling.

The fiercely competitive business environment and increasingly personalized customization needs are driving the digital transformation and upgrading of the manufacturing industry. IIoT intelligence, which can provide innovative and efficient solutions for various aspects of the manufacturing value chain, illuminates the path of transformation for the manufacturing industry. It’s time to provide a systematic vision of IIoT intelligence. However, existing surveys often focus on specific areas of IIoT intelligence, leading researchers and readers to have biases in their understanding of IIoT intelligence, that is, believing that research in one direction is the most important for the development of IIoT intelligence, while ignoring contributions from other directions. Therefore, this paper provides a comprehensive overview of IIoT intelligence. We first conduct an in-depth analysis of the inevitability of manufacturing transformation and study the successful experiences from the practices of Chinese enterprises. Then we give our definition of IIoT intelligence and demonstrate the value of IIoT intelligence for industries in fucntions, operations, deployments, and application. Afterwards, we propose a hierarchical development architecture for IIoT intelligence, which consists of five layers. The practical values of technical upgrades at each layer are illustrated by a close look on lighthouse factories. Following that, we identify seven kinds of technologies that accelerate the transformation of manufacturing, and clarify their contributions. The ethical implications and environmental impacts of adopting IIoT intelligence in manufacturing are analyzed as well. Finally, we explore the open challenges and development trends from four aspects to inspire future researches.

In this paper, we present NestFL, a learning-efficient FL framework for edge computing, which can jointly improve the training efficiency and achieve personalization. Specifically, NestFL takes the runtime resources of the edge devices into consideration and assigns each device a sparse-structured subnetwork by progressively performing the structured pruning. During training, only the updates of these subnetworks are transmitted to the central server. Additionally, these generated subnetworks adopt a structure- and parameter-sharing mechanism, making themselves nested inside a multi-capacity global model. In doing so, the overall communication and computation costs can be significantly reduced, and each device can learn a personalized model without introducing extra parameters. Furthermore, a weighted aggregation mechanism is designed to improve the training performance and maximally preserve personalization.

Computation offloading has been considered as one of the key research issues in edge computing fields. In order to reduce the energy consumption of the mobile terminal, the energy efficiency issue of computation offloading has attracted a lot of attention from academia and industry. In this study, the authors propose an energy‐efficient computation offloading scheme in 5G cellular networks with edge computing and device‐to‐device (D2D) communications. They consider the computation offloading to fog computing devices via D2D communications and mobile edge computing (MEC) servers via cellular networks. And thus the computation task execution model can be composed of local execution, fog computing device execution and MEC server execution. Then, they formulate the computation offloading issue as stochastic optimisation problem, and use the Lyapunov optimisation technology framework to solve this problem. Finally, extensive simulation results are presented to illustrate the effectiveness of the proposed scheme.

Network slicing has been considered as one of the key technologies in the next generation mobile network (fifth generation – 5G), which can create virtual network and provide customised services on demand. Most of the current work on network slicing mainly focuses on virtualisation technology, especially in virtual resource allocation. However, caching as a significant approach to improve the content delivery and quality of experience for end‐users has not been well considered in network slicing. In this study, the authors consider in‐network caching combining with network slicing, and propose an efficient caching resource allocation scheme for network slicing in 5G core network. They first formulate the caching resource allocation issue as an integer linear programming model, and then propose a caching resource allocation scheme based on chemical reaction optimisation (CRO) algorithm, which can significantly improve the caching resource utilisation. The CRO algorithm is a population‐based optimisation metaheuristic, which has advantages in searching optimal solution and computation complexity. Finally, extensive simulation results are presented to illustrate the performance of the proposed scheme.