ABSTRACT In the context of security protection against false data injection attacks (FDIAs) in power grids, traditional federated learning effectively utilizes decentralized data resources for distributed training and achieves global collaboration. However, during the model aggregation process, it often overlooks or drowns out local sparse key features, significantly increasing the risk of missed detection of specific attack patterns. To address this issue, this paper proposes a personalized detection framework based on federated learning. Initially, the bidirectional transformer detection (BTD) model detection algorithm is deployed on the client side and trained on local data. Subsequently, through personalized federated learning, the client dynamically combines the weights of the global and local models to generate a personalized detection model. The framework employs a collaborative optimization mechanism of “global knowledge sharing and local feature adaptation” to effectively mitigate the feature drowning problem while strictly safeguarding data privacy. Compared to existing methods, this approach significantly enhances detection accuracy and robustness against differentiated attack patterns, thereby establishing a more reliable security defense system for smart grids.

As the core charging equipment of electric vehicles, the reliable operation of charging piles is directly related to user experience and industrial promotion. Accurate prediction of charging pile failures is crucial to ensure charging safety and build a city-level safety protection system. In this paper, a fault prediction model based on hierarchical modeling of temporal features and hierarchical attention mechanism is proposed to construct a multi-level fault prediction system. Firstly, a time series dataset with hierarchical constraints is generated according to the topological relationship of charging piles, and then a differentiated time series model is designed to realize the basic prediction according to the sparsity characteristics of different levels of time series, and then the cross-level features are fused through the hierarchical attention mechanism to constrain the basic prediction results to meet the hierarchical consistency. Experimental results demonstrate that the proposed model achieves the best overall performance in multi-level prediction, with significantly lower prediction error for outliers compared to the baseline models. At the global level, compared with the Transformer, Bi-LSTM, PROFHiT, and HAILS models, the proposed model reduces the Mean Squared Error (MSE) by 21.53%, 17.52%, 31.52%, and 6.61% respectively, the Root Mean Squared Error (RMSE) by 11.57%, 9.15%, 17.35%, and 3.63% respectively, and the Mean Absolute Error (MAE) by 5.70%, 16.76%, 36.60%, and 25.87% respectively.

How to recommend an effective prescription with intelligent assistant treatment remains a key issue in Traditional Chinese Medicine (TCM). To address this issue, various intelligent assistant treatment methods have been developed in recent years. However, existing methods barely integrate together knowledge graphs of TCM and the characteristics of individual differences between patients, which play very important roles in the prescription recommendation of TCM. For this reason, this work proposes a novel framework of TCM prescription recommendation, referred to as CETCMKG , which integrates the TCM knowledge graph to improve the accuracy and interpretability of prescription recommendation. More specifically, features of herb and symptom nodes are learned by combining the graph embedding models and graph convolutional neural networks. During the prediction and recommendation phase, multi-head attention mechanisms and multi-layer perceptrons jointly analyze symptom patterns to guide herb selection. Following this analysis, the performance of CETCMKG is rigorously evaluated through comparative experiments, demonstrating its superiority over existing state-of-the-art prescription recommendation methods in TCM.

This article revisits the federated policy gradient algorithm with environment heterogeneity for finding the optimal policy in multiagent reinforcement learning (RL). Toward this direction, personalized federated RL methods have been presented recently. However, existing personalized federated policy gradient methods may confine the personalized capacity of local policy models. In order to tackle this challenge, this article develops a provably convergent personalized federated first-order policy gradient algorithm, referred to as PfoPG, which learns a personalized policy model by adaptively mixing optimal global and local policies. Moreover, the momentum-based importance sampling is also introduced into PfoPG to improve its convergence speed. Meanwhile, this article rigorously analyzes the nonasymptotic convergence behavior of PfoPG. More specifically, PfoPG converges to a stationary policy with rateO(1/K), whereKdenotes the number of iterations. Compared to the state-of-the-art federated policy gradient methods, PfoPG can improve the convergence rate fromO(1/K2/3) toO(1/K). Finally, we verify the effectiveness of PfoPG by various experiments based on the multiagent particle environment.

To solve min–max optimization problems, decentralized adaptive methods have been presented over multi-agent networks. In the non-convex non-concave structure, however, existing decentralized adaptive min–max methods may be divergence due to the inconsistency in the adaptive learning rate. To address this issue, we propose a novel decentralized adaptive algorithm named DADAMC, where the consensus protocol is introduced to synchronize the adaptive learning rates of all agents. Furthermore, we rigorously analyze that DADAMC converges to an ϵ -stochastic first-order stationary point with O ( ϵ − 4 ) complexity. In addition, we also conduct experiments to verify the performance of DADAMC for solving a robust regression problem. The experimental results show that DADAMC outperforms state-of-the-art decentralized min–max algorithms.

A pivotal problem in the Internet of Things (IoT) is resource allocation, where the goal is to optimize allocation strategies of IoT resources. In general, resource allocation problems are formulated as constrained optimization problems, which can be effectively solved by the zeroth-order Frank-Wolfe algorithm. However, the existing zeroth-order Frank-Wolfe algorithms suffer from slow convergence since they scale the zeroth-order gradient in all directions. For this reason, we propose a faster zeroth-order Frank-Wolfe algorithm, referred to as ZO-AdaSFW, which incorporates adaptive gradient methods and the variance-reduced technique (SPIDER) into the zeroth-order Frank-Wolfe algorithm. Moreover, ZO-AdaSFW can achieve the convergence rate of$O(T^{-1}) $in the convex setting, where T is the time horizon. Meanwhile, we also prove that ZO-AdaSFW has the best-known convergence rate$O(T^{-1/2})$among zeroth-order algorithms in the nonconvex setting. In addition, the experimental results show that the performance of ZO-AdaSFW outperforms state-of-the-art zeroth-order Frank-Wolfe algorithms on different applications.

Decentralized actor-critic (AC) is one of the most dominant algorithms for dealing with multiagent reinforcement learning (MARL) problems. However, exploration-efficient, sample-efficient, and communication-efficient are difficult to achieve simultaneously by existing decentralized AC methods. For this reason, this article develops a decentralized multiagent AC algorithm by incorporating entropy regularization to improve exploration with theoretical guarantees, referred to as multi-agent AC algorithm with entropy regularization (MACE). Moreover, we rigorously prove that MACE can achieve sample complexity $\mathcal {O}(\epsilon ^{-2}\ln \epsilon ^{-1})$ and communication complexity of $\mathcal {O}(\epsilon ^{-1}\ln \epsilon ^{-1})$ , which match the best complexities at present. Finally, the performance of MACE is also evaluated on reinforcement learning (RL) tasks. The experimental results show that the proposed algorithm achieves better exploration efficiency than state-of-the-art decentralized AC-type algorithms.

Federated meta-learning (ML) is a promising optimization framework for the intelligent Internet of Things (IoT). However, the generalization ability of existing federated ML is limited because it is a bilayer structure, which has a more complex loss landscape. Moreover, the loss landscape of bilevel optimization has more saddle points and sharp points, which may lead to different generalization performances. Therefore, how to choose an optimal point is crucial for improving the generalization ability of federated ML. For this reason, this article proposes a provable federated ML algorithm by using the sharpness-aware minimization technique, referred to as FedAvg-sharp-MAML (FSM). Furthermore, we rigorously analyse the convergence and generalization bound of FSM. Specifically, when local iteration rounds$T=1$, the rate of$O(1/K)$can be achieved, where K is the number of global iterations. Furthermore, this rate can match the Per-Fedavg method. Meanwhile, we achieve a better generalization bound than the state of the art federated ML, where PAC-Bayesian generalization bounds are introduced in our analysis. Finally, we conduct some experiments to verify the performance of FSM. The experimental results show that the FSM has good generalization performance compared to the existing federated ML algorithms.

In multiagent reinforcement learning, policy evaluation is a central problem. To solve this problem, decentralized temporal-difference (TD) learning is one of the most popular methods, which has been investigated in recent years. However, existing decentralized variants of TD learning often suffer from slow convergence due to the sensitive selection of learning rates. Inspired by the great success of adaptive gradient methods in the training of deep neural networks, this article proposes a decentralized adaptive TD$(\lambda )$learning algorithm for general$\lambda $with linear function approximation, referred to asD-AMSTD$(\boldsymbol {\lambda })$, which can mitigate the selective sensitivity of learning rates. Furthermore, we establish the finite-time performance bounds ofD-AMSTD$(\boldsymbol {\lambda })$under the Markovian observation model. The theoretical results show thatD-AMSTD$(\boldsymbol {\lambda })$can linearly converge to an arbitrarily small size of neighborhood of the optimal weight. Finally, we verify the efficacy ofD-AMSTD$(\boldsymbol {\lambda })$through a variety of experiments. The results show thatD-AMSTD$(\boldsymbol {\lambda })$outperforms existing decentralized TD learning methods.

Adaptive gradient algorithms have recently become extremely popular because they have been applied successfully in training deep neural networks, such as Adam, AMSGrad, and AdaBound. Despite their success, however, the distributed variant of the adaptive method, which is expected to possess a rapid training speed at the beginning and a good generalization capacity at the end, is rarely studied. To fill the gap, a distributed adaptive subgradient algorithm is presented, called D-AdaBound, where the learning rates are dynamically bounded by clipping the learning rates. Moreover, we obtain the regret bound of D-AdaBound, in which the objective functions are convex. Finally, we confirm the effectiveness of D-AdaBound by simulation experiments on different datasets. The results show the performance improvement of D-AdaBound relative to existing distributed online learning algorithms.

We consider decentralized large-scale continuous submodular constrained optimization problems over networks, where the goal is to maximize a sum of nonconvex functions with diminishing returns property. However, the computations of the projection step and the whole gradient can become prohibitive in high-dimensional constrained optimization problems. For this reason, a decentralized randomized block-coordinate Frank-Wolfe algorithm is proposed for submoduar maximization over networks by local communication and computation, which adopts the randomized block-coordinate descent and the Frank-Wolfe technique. We also show that the proposed algorithm converges to an approximation fact$(1-e^{-p_{\max }/p_{\min }})$of the global maximal points at a rate of$\mathcal {O}(1/T)$by choosing a suitable stepsize, where$T$is the number of iterations. In addition, we confirm the theoretical results by experiments.

This paper considers a decentralized online submodular maximization problem over time-varying networks, where each agent only utilizes its own information and the received information from its neighbors. To address the problem, we propose a decentralized Meta-Frank-Wolfe online learning method in the adversarial online setting by using local communication and local computation. Moreover, we show that an expected regret bound of $O(\sqrt{T})$ is achieved with $(1-1/e)$ approximation guarantee, where $T$ is a time horizon. In addition, we also propose a decentralized one-shot Frank-Wolfe online learning method in the stochastic online setting. Furthermore, we also show that an expected regret bound $O(T^{2/3})$ is obtained with $(1-1/e)$ approximation guarantee. Finally, we confirm the theoretical results via various experiments on different datasets.

Named Data Networking (NDN) can effectively deal with the rapid development of mobile video services. For NDN, selecting a suitable forwarding interface according to the current network status can improve the efficiency of mobile video communication and can also avoid attacks to improve communication security. For this reason, we propose a stochastic adaptive forwarding strategy based on deep reinforcement learning (SAF-DRL) for secure mobile video communications in NDN. For each available forwarding interface, we introduce the twin delayed deep deterministic policy gradient algorithm to obtain a more robust forwarding strategy. Moreover, we conduct various numerical experiments to validate the performance of SAF-DRL. Compared with BR, RFA, SAF, and AFSndn forwarding strategies, the results show that SAF-DRL can reduce the delivery time and the average number of lost packets to improve the performance of NDN.

We introduce a novel notion of distributed functional signature. In such a signature scheme, the signing key for function f will be split into n shares sk f i and distributed to different parties. Given a message m and a share sk f i , one can compute locally and obtain a pair signature f i m , σ i . When given all of the signature pairs, everyone can recover the actual value f m and corresponding signature σ . When the number signature pairs are not enough, nobody can recover the signature f m , σ . We formalize the notion of function privacy in this new model which is not possible for the standard functional signature and give a construction from standard functional signature and function secret sharing based on one-way function and learning with error assumption. We then consider the problem of hosting services in multiple untrusted clouds, in which the verifiability and program privacy are considered. The verifiability requires that the returned results from the cloud can be checked. The program privacy requires that the evaluation procedure does not reveal the program for the untrusted cloud. We give a verifiable distributed secure cloud service scheme from distributed functional signature and prove the securities which include untrusted cloud security (program privacy and verifiability) and untrusted client security.

Cooperative caching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperative caching mechanisms are performed in an arbitrary graph topology, leading to the complex cooperative operation. For this reason, hierarchical CCN has received widespread attention, which provides simple cooperative operation due to the explicit affiliation between nodes. In this study, the authors propose a heuristic cooperative caching algorithm for maximising the average provider earned profit under the two‐level CCN topology. This algorithm divides the cache space of control nodes into two fractions for caching contents which are downloaded from different sources. One fraction caches duplicated contents and the other caches unique contents. The optimal value of the split factor can be obtained by maximising the earned profit. Furthermore, they also propose a replacement policy to support the proposed caching algorithm. Finally, simulation results show that the proposed caching algorithm can perform better than some traditional caching strategies.

Many problems in the Internet of Things (IoT) can be regarded as online optimization problems. For this reason, an online-constrained problem in IoT is considered in this article, where the cost functions change over time. To solve this problem, many projected online optimization algorithms have been widely used. However, the projections of these algorithms become prohibitive in problems involving high-dimensional parameters and massive data. To address this issue, we propose a Frank- Wolfe Adam online learning algorithm called Frank-Wolfe Adam (FWAdam), which uses a Frank-Wolfe method to eschew costly projection operations. Furthermore, we first give the convergence analysis of the FWAdam algorithm, and prove its regret bound to O(T3/4) when cost functions are convex, where T is a time horizon. Finally, we present simulated experiments on two data sets to validate our theoretical results.

The information name replaces traditional IP address as the identity of the network transmission is a typical feature of Information-Centric Networking (ICN). Therefore, designing efficient lookup algorithms of information names becomes a new challenge. For this reason, we propose an efficient name lookup structure for ICN, called Learned Bloom-Filter Lookup, which combines Recurrent Neural Networks (RNN) with standard Bloom filter to improve lookup efficiency. In our scheme, RNN trains the element set and non-element set, which are used to obtain the pre-filtering of names. Moreover, we look up the contents by using the backup Bloom filter, which can improve the accuracy of the search. In addition, we evaluate the performance of the proposed algorithm by experimental simulations. Compared with the Bloom-Hash method, our results show that our method can reduce the false positive rate. Furthermore, the memory required by our method is less than the Bloom-Hash method.

Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer. In a constrained VRF, one can drive a constrained key skS from the master secret key sk , where S is a subset of the domain. Using the constrained key skS , one can compute function values at points which are not in the set S. The security of constrained VRFs requires that the VRFs’ output should be indistinguishable from a random value in the range. They showed how to construct constrained VRFs for the bit-fixing class and the circuit constrained class based on multilinear maps. Their construction can only achieve selective security where an attacker must declare which point he will attack at the beginning of experiment. In this work, we propose a novel construction for constrained verifiable random function from bilinear maps and prove that it satisfies a new security definition which is stronger than the selective security. We call it semiadaptive security where the attacker is allowed to make the evaluation queries before it outputs the challenge point. It can immediately get that if a scheme satisfied semiadaptive security, and it must satisfy selective security.

A dense micro-block difference (DMD)-based method was proposed for performing texture representation that is a fundamental task of image and video analysis. However, it cannot capture effectively the rotation invariance and multiscale spatial information of textures. To alleviate these problems, in this paper, we propose a multiscale symmetric DMD (MSDMD) method for texture classification. In particular, we first combine K-rotation and Gaussian distribution to analyze the Symmetric DMD in order to capture the rotation invariance of textures. Furthermore, we propose a high-order vector of locally aggregated descriptor called HVLAD by incorporating the second-order and third-order statistics into the original vector of VLAD. To effectively extract the spatial information of textures, we implement the above-mentioned steps in a Gaussian pyramid structure to construct an MSDMD feature and use a support vector machine (SVM) to perform texture classification. The experimental results on five available published texture datasets (KTH-TIPS, CUReT, UIUC, UMD, and KTH-TIPS2-b) reveal that our proposed method is effective when compared with 15 representative texture classification methods.

Mobile Microlearning, a novel fusion form of the mobile Internet, cloud computing, and microlearning, becomes more prevalent in recent years. However, its high deployment and operational costs make energy saving in cloud become a concerning issue. In this paper, to save energy consumption, a resource deployment approach to cloud service provision for Mobile Microlearning is proposed. Chinese Lexical Analysis System and Dynamic Term Frequency-Inverse Document Frequency (D-TF-IDF) are adopted to implement resource classification. Resources are deployed to the 2-tier cloud architecture according to the classification results. Grey Wolf Optimization (GWO) algorithm is used to forecast real-time energy consumption per byte. The simulation results show that, compared to traditional algorithm, the classification accuracy of small sample categories was significantly improved; the forecast energy consumption value and the standard values are 7.67% in private cloud and 2.93% in public cloud; the energy saving reaches 2.22% to 16.23% in 3G and 7.35% to 20.74% in Wi-Fi.

Computing offloading of mobile devices (MDs) through cloud is a greatly effective way to solve the problem of local resource constraints. However, cloud servers are usually located far away from MDs leading to a long response time. To this end, edge cloud servers (ECSs) provide a shorter response time due to being closer to MDs. In this paper, we propose a computing offloading game for MDs and ECSs. We prove the existence of a Stackelberg equilibrium in the game. In addition, we propose two algorithms, F‐SGA and C‐SGA, for delay‐sensitive and compute‐intensive applications, respectively. Moreover, the response time is reduced by F‐SGA, which makes decisions quickly. An optimal decision is obtained by C‐SGA, which achieves the equilibrium. Both algorithms above proposed can adjust the computing resource and utility of system users according to parameters control in computing offloading. The simulation results show that the game significantly saves the computing resources and response time of both the MD and the ECSs during the computing offloading process.

The widely used energy features extracted from the wavelet domain can effectively represent the common image textures. However, they are not robust to the rotated textures. In this letter, we propose a multiscale rotation-invariant representation (MRIR) of textures by using multiscale sampling. Particularly, a multiscale wavelet transform is used to decompose the magnitude pattern (MP) mapping of a texture. Furthermore, the sign pattern (SP) mapping of a texture is used as a step function, which is further sampled and used to fit the wavelet subbands of the MP mapping for computing the sampled directional mean vectors (SDMVs) of the subbands. Moreover, we construct frequency vectors (FVs) of those SP mappings for capturing the structural information of textures. Finally, we can obtain the MRIR vector of an image texture by concatenating those SDMVs and FVs for texture classification. The comprehensive experimental results demonstrate that our proposed approach outperforms six representative texture classification methods.

Routing in mobile ad hoc networks (MANETs) is an extremely challenging issue due to the features of MANETs. In this paper, we present a novel bio-inspired hybrid routing protocol (B-iHRP) supporting multimedia delivery based on zone routing framework, ant colony optimization (ACO) and physarum autonomic optimization (PAO). B-iHRP divides network topology into a series of zones subjectively. Within a zone, the route table of central node is proactively maintained by perceptive ants which can sense link status metrics through cross-layer perception to assess the discovered routes. Among zones, perceptive ants are sent to reactively find routes to destinations as well as assess the discovered routes with the metrics by source nodes. Afterwards, B-iHRP uses PAO to select the optimal one from the found routes and optimize autonomically the local routes during the course of multi-zone communication sessions. Simulation results show how B-iHRP can achieve the effective performance compared to existing state-of-the-art algorithms.

In this paper, we present a novel bio-inspired trusted routing framework (B-iTRF) which composed of trust mechanism and routing strategy. For trust mechanism, B-iTRF monitors neighbors' behavior in real time and then assesses neighbors' trust value based on the priori knowledge. For routing strategy, each node finds routes to the Sink based on ant colony optimization. In the process of path finding, B-iTRF senses and calculates the metrics of the found routes to support the route selection. Moreover, B-iTRF also assesses the availability of route based on Physarum autonomic optimization to maintain the route table. Simulation results show that B-iTRF can achieve the effective performance compared to existing state-of-the-art algorithms.

There is a trade-off between routing efficiency and energy equilibrium for sensor nodes in wireless sensor networks (WSNs). Inspired by the large and single-celled amoeboid organism-slime mold physarum polycephalum, this paper presents a novel physarum-inspired routing protocol (P-iRP) for WSNs to address the above issue. In P-iRP, a sensor node selects its proper next hop by using a proposed physarum-inspired selecting next hop model (PSN), which considers comprehensively the distance, energy residue and location of the next hop. We introduce the PSN's routing selecting strategy and detail PiRP's algorithms. Simulation results show how P-iRP can achieve the effective trade-off between routing efficiency and energy equilibrium compared to existing classical algorithms.