Search

Federated learning trains a neural network model using the client's data to maintain the benefits of centralized model training while maintaining their privacy. However, if the client data are not independently and identically distributed (non-IID) because of different environments, the accuracy of the model may suffer from client drift during training owing to discrepancies in each client's data. This study proposes a personalized federated learning algorithm based on the concept of multitask learning to divide each client model into two layers: a feature extraction layer and a category prediction layer. The feature extraction layer maps the input data to a low-dimensional feature vector space. Furthermore, the parameters of the neural network are aggregated with those of other clients using an adaptive method. The category prediction layer maps low-dimensional feature vectors to the label sample space, with its parameters remaining unaffected by other clients to maintain client uniqueness. The proposed personalized federated learning method produces faster learning model convergence rates and higher accuracy rates for the non-IID datasets in our experiments. [ABSTRACT FROM AUTHOR]

Accurately and efficiently predicting elephant flows (elephants) is crucial for optimizing network performance and resource utilization. Current prediction approaches for software-defined networks (SDNs) typically rely on complete traffic and statistics moving from switches to controllers. This leads to an extra control channel bandwidth occupation and network delay. To address this issue, this paper proposes a prediction strategy based on incomplete traffic that is sampled by the timeouts for the installation or reactivation of flow entries. The strategy involves assigning a very short hard timeout ( T i n i t i a l ) to flow entries and then increasing it at a rate of r until flows are identified as elephants or out of their lifespans. Predicted elephants are switched to an idle timeout of 5 s. Logistic regression is used to model elephants based on a complete dataset. Bayesian optimization is then used to tune the trained model T i n i t i a l and r over the incomplete dataset. The process of feature selection, model learning, and optimization is explained. An extensive evaluation shows that the proposed approach can achieve over 90% generalization accuracy over 7 different datasets, including campus, backbone, and the Internet of Things (IoT). Elephants can be correctly predicted for about half of their lifetime. The proposed approach can significantly reduce the controller–switch interaction in campus and IoT networks, although packet completion approaches may need to be applied in networks with a short mean packet inter-arrival time. [ABSTRACT FROM AUTHOR]

In Intelligent Transport Systems (ITSs), Internet of Vehicles (IoV) communications and computation offloading technology have been introduced to assist with the burdensome sensing task processing, thus prompting a new design paradigm called mobile sensing–communication–computation (MSCC) synergy. Most researchers have focused on offloading strategy design to reduce energy consumption or execution costs, but ignore the intrinsic characteristics of tasks, which may lead to poor performance. This paper studies the offloading strategy of vehicle MSCC tasks represented by a Directed Acyclic Graph (DAG) structure. According to the DAG dependency of the subtasks, this paper proposes a computation offloading strategy to optimize energy consumption under time constraints. An energy consumption model for task execution is established. Then, the Simulated Annealing and Tabu Search hybrid optimization algorithm (ST-HO) is designed to solve the problem of minimizing the energy consumption. Crucially, this research integrates the concept of symmetry into the typical DAG structure of MSCC tasks, ensuring the integrity and efficiency of task execution in ITS. The simulation results show that ST-HO reduces energy consumption by at least 5.58% compared to the conventional algorithm. Particularly, the convergence speed of ST-HO is improved by 52.63% when the replication strategy of symmetric task is considered. [ABSTRACT FROM AUTHOR]

The proliferation of IoT devices has led to an unprecedented integration of machine learning techniques, raising concerns about data privacy. To address these concerns, federated learning has been introduced. However, practical implementations face challenges, including communication costs, data and device heterogeneity, and privacy security. This paper proposes an innovative approach within the context of federated learning, introducing a personalized joint learning algorithm for Non-IID IoT data. This algorithm incorporates multi-task learning principles and leverages neural network model characteristics. To overcome data heterogeneity, we present a novel clustering algorithm designed specifically for federated learning. Unlike conventional methods that require a predetermined number of clusters, our approach utilizes automatic clustering, eliminating the need for fixed cluster specifications. Extensive experimentation demonstrates the exceptional performance of the proposed algorithm, particularly in scenarios with specific client distributions. By significantly improving the accuracy of trained models, our approach not only addresses data heterogeneity but also strengthens privacy preservation in federated learning. In conclusion, we offer a robust solution to the practical challenges of federated learning in IoT environments. By combining personalized joint learning, automatic clustering, and neural network model characteristics, we facilitate more effective and privacy-conscious machine learning in Non-IID IoT data settings. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet and the popularization of mobile devices, participating in a mobile community becomes a part of daily life. This study aims the influence impact of social interactions on mobile learning communities. With m-learning content recommendation services developed from mobile devices and mobile network techniques, learners can generate the learning stickiness by active participation and two-way interaction within a mobile learning community. Individual learning content is able to be recommended according to the behavioral characteristics of the response message of individual learners in the community, and other browsers not of this community are attracted to participate in the learning content with the proposed recommendation service. Finally, as the degree of devotion to the community and learning time increases, the learners' willingness to continue learning increases. The experiment results and analysis show that individualized learning content recommendation results in better learning effect. In addition, the proposed service proved that the experiment results can be easily extended to handle the recommended learning content for learners' time-varying interests.

Blockchain has become a well-known, secured, decentralized datastore in many domains, including medical, industrial, and especially the financial field. However, to meet the requirements of different fields, platforms that are built on blockchain technology must provide functions and characteristics with a wide variety of options. Although they may share similar technology at the fundamental level, the differences among them make data or transaction exchange challenging. Cross-chain transactions have become a commonly utilized function, while at the same time, some have pointed out its security loopholes. It is evident that a secure transaction scheme is desperately needed. However, what about those nodes that do not behave? It is clear that not only a secure transaction scheme is necessary, but also a system that can gradually eliminate malicious players is of dire need. At the same time, integrating different blockchain systems can be difficult due to their independent architectures, and cross-chain transactions can be at risk if malicious attackers try to control the nodes in the cross-chain system. In this paper, we propose a dynamic reputation management scheme based on the past transaction behaviors of nodes. These behaviors serve as the basis for evaluating a node's reputation to support the decision on malicious behavior and enable the system to intercept it in a timely manner. Furthermore, to establish a reputation index with high precision and flexibility, we integrate Particle Swarm Optimization (PSO) into our proposed scheme. This allows our system to meet the needs of a wide variety of blockchain platforms. Overall, the article highlights the importance of securing cross-chain transactions and proposes a method to prevent misbehavior by evaluating and managing node reputation. [ABSTRACT FROM AUTHOR]

This article develops an environment for mobile e-learning that includes an interactive course, virtual online labs, an interactive online test, and lab-exercise training platform on the fourth generation mobile communication system. The Next Generation Learning Environment (NeGL) promotes the term "knowledge economy." Inter-networking has become one of the most popular technologies in mobile e-learning for the next generation communication environment. This system uses a variety of computer embedded devices to ubiquitously access multimedia information, such as smart phones and PDAs. The most important feature is greater available bandwidth. The learning mode in the future will be an international, immediate, virtual, and interactive classroom that enables learners to learn and interact.

Software-Defined Networking (SDN) systems are sensitive to the lifespans of flow entries in flow tables as such lifespans affect the overall network-forwarding latency and the flow table space usage, particularly when the systems are under cyber attack. Instead of developing extra approaches to reactively detect the attacks and mitigate the impact of the attacks, this paper views the lifespans of flow entries as the privacy of the SDN systems and proposes a Flow-Entry Aging RandOmization Layer (FEAROL), which applies the staircase randomized response mechanism in the flow-entry-aging process at switches. FEAROL locally perturbs the lifespan of each flow entry in the flow table. Since the true lifespan of each flow entry is different from the lifespan set in the entry by the controller and dynamically perturbed by FEAROL, Low-rate Denial-of-Service (LDoS) attacks based on the sniffed flow-entry timeouts cannot be effectively organized. FEAROL proactively prevents LDoS attacks from overflowing the flow tables and legitimate flow packets from being dropped due to the broken synchronization between attack flows and the network settings. FEAROL can adjust its aging policies and privacy budget based on the real-time monitored network performance. FEAROL is prototyped in an open-source soft switch (OpenVSwitch) and evaluated through simulations on real network traces. The results show that FEAROL increases the overhead of aging a flow entry. However, this overhead can be significantly reduced by adjusting the interval at which the aging process is triggered. FEAROL also effectively defends against flow table overflow LDoS attacks by significantly reducing the table usage of LDoS attack flows. When the aging strategy is carefully chosen, the table space used by attack flow entries can be reduced to 0. [ABSTRACT FROM AUTHOR]

To extend a network's lifetime, wireless rechargeable sensor networks are promising solutions. Chargers can be deployed to replenish energy for the sensors. However, deployment cost will increase when the number of chargers increases. Many metrics may affect the final policy for charger deployment, such as distance, the power requirement of the sensors and transmission radius, which makes the charger deployment problem very complex and difficult to solve. In this paper, we propose an efficient method for determining the field of interest (FoI) in which to find suitable candidate positions of chargers with lower computational costs. In addition, we designed four metaheuristic algorithms to address the local optima problem. Since we know that metaheuristic algorithms always require more computational costs for escaping local optima, we designed a new framework to reduce the searching space effectively. The simulation results show that the proposed method can achieve the best price–performance ratio. [ABSTRACT FROM AUTHOR]