Search

Recent breakthroughs in medical AI have proven the effectiveness of deep learning in fetal echocardiography. However, the limited processing power of edge devices hinders real-time clinical application. We aim to pioneer the future of intelligent echocardiography equipment by enabling real-time recognition and tracking in fetal echocardiography, ultimately assisting medical professionals in their practice. Our study presents the YOLOv5s_emn (Extremely Mini Network) Series, a collection of resource-efficient algorithms for fetal echocardiography detection. Built on the YOLOv5s architecture, these models, through backbone substitution, pruning, and inference optimization, while maintaining high accuracy, the models achieve a significant reduction in size and number of parameters, amounting to only 5%-19% of YOLOv5s. Tested on the NVIDIA Jetson Nano, the YOLOv5s_emn Series demonstrated superior inference speed, being 52.8-125.0 milliseconds per frame(ms/f) faster than YOLOv5s, showcasing their potential for efficient real-time detection in embedded systems., Competing Interests: he authors have declared that no competing interests exist., (Copyright: © 2024 Zhu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Physiological Signals like Electromography (EMG) and Electroencephalography (EEG) can be analysed and decoded to provide vital information that can be used in a range of applications like rehabilitative robotics and remote device control. The process of acquiring and using these signals requires many compute-intensive tasks like signal acquisition, signal processing, feature extraction, and machine learning. Performing these activities on a PC-based system with well-established software tools like Python and Matlab is the first step in designing solutions based upon these signals. In the application domain of rehabilitative robotics, one of the main goals is to develop solutions that can be deployed for the use of individuals who need them in improving their Acitivities-for-Daily Living (ADL). To achieve this objective, the final solution must be deployed onto an embedded solution that allows high portability and ease-of-use. Porting a solution from a PC-based environment onto a resource-constraint one such as a microcontroller poses many challenges. In this research paper, we propose the use of an ARM-based Corex M-4 processor. We explore the various stages of the design from the initial testing and validation, to the deployment of the proposed algorithm on the controller, and further investigate the use of Cepstrum features to obtain a high classification accuracy with minimal input features. The proposed solution is able to achieve an average classification accuracy of 95.34% for all five classes in the EMG domain and 96.16% in the EEG domain on the embedded board., (Creative Commons Attribution license.)

The phonocardiogram (PCG) can be used as an affordable way to monitor heart conditions. This study proposes the training and testing of several classifiers based on SVMs (support vector machines), k-NN (k-Nearest Neighbor), and NNs (neural networks) to perform binary ("Normal"/"Pathologic") and multiclass ("Normal", "CAD" (coronary artery disease), "MVP" (mitral valve prolapse), and "Benign" (benign murmurs)) classification of PCG signals, without heart sound segmentation algorithms. Two datasets of 482 and 826 PCG signals from the Physionet/CinC 2016 dataset are used to train the binary and multiclass classifiers, respectively. Each PCG signal is pre-processed, with spike removal, denoising, filtering, and normalization; afterward, it is divided into 5 s frames with a 1 s shift. Subsequently, a feature set is extracted from each frame to train and test the binary and multiclass classifiers. Concerning the binary classification, the trained classifiers yielded accuracies ranging from 92.4 to 98.7% on the test set, with memory occupations from 92.7 kB to 11.1 MB. Regarding the multiclass classification, the trained classifiers achieved accuracies spanning from 95.3 to 98.6% on the test set, occupying a memory portion from 233 kB to 14.1 MB. The NNs trained and tested in this work offer the best trade-off between performance and memory occupation, whereas the trained k-NN models obtained the best performance at the cost of large memory occupation (up to 14.1 MB). The classifiers' performance slightly depends on the signal quality, since a denoising step is performed during pre-processing. To this end, the signal-to-noise ratio (SNR) was acquired before and after the denoising, indicating an improvement between 15 and 30 dB. The trained and tested models occupy relatively little memory, enabling their implementation in resource-limited systems.

Edge computing is a scalable, modern, and distributed computing architecture that brings computational workloads closer to smart gateways or Edge devices. This computing model delivers IoT (Internet of Things) computations and processes the IoT requests from the Edge of the network. In a diverse and independent environment like Fog-Edge, resource management is a critical issue. Hence, scheduling is a vital process to enhance efficiency and allocation of resources properly to the tasks. The manuscript proposes an Artificial Neural Network (ANN) inspired Antlion algorithm for task orchestration Edge environments. Its aim is to enhance resource utilization and reduce energy consumption. Comparative analysis with different algorithms shows that the proposed algorithm balances the load on the Edge layer, which results in lower load on the cloud, improves power consumption, CPU utilization, network utilization, and reduces average waiting time for requests. The proposed model is tested for healthcare application in Edge computing environment. The evaluation shows that the proposed algorithm outperforms existing fuzzy logic algorithms. The performance of the ANN inspired Antlion based orchestration approach is evaluated using performance metrics, power consumption, CPU utilization, network utilization, and average waiting time for requests respectively. It outperforms the existing fuzzy logic, round robin algorithm. The proposed technique achieves an average cloud energy consumption improvement of 95.94%, and average Edge energy consumption improvement of 16.79%, 19.85% in average CPU utilization in Edge computing environment, 10.64% in average CPU utilization in cloud environment, and 23.33% in average network utilization, and the average waiting time decreases by 96% compared to fuzzy logic and 1.4% compared to round-robin respectively., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 H. S., Gupta. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The existing algorithms for identifying and tracking pigs in barns generally have a large number of parameters, relatively complex networks and a high demand for computational resources, which are not suitable for deployment in embedded-edge nodes on farms. A lightweight multi-objective identification and tracking algorithm based on improved YOLOv5s and DeepSort was developed for group-housed pigs in this study. The identification algorithm was optimized by: (i) using a dilated convolution in the YOLOv5s backbone network to reduce the number of model parameters and computational power requirements; (ii) adding a coordinate attention mechanism to improve the model precision; and (iii) pruning the BN layers to reduce the computational requirements. The optimized identification model was combined with DeepSort to form the final Tracking by Detecting algorithm and ported to a Jetson AGX Xavier edge computing node. The algorithm reduced the model size by 65.3% compared to the original YOLOv5s. The algorithm achieved a recognition precision of 96.6%; a tracking time of 46 ms; and a tracking frame rate of 21.7 FPS, and the precision of the tracking statistics was greater than 90%. The model size and performance met the requirements for stable real-time operation in embedded-edge computing nodes for monitoring group-housed pigs.

Mobile edge computing has been an important computing paradigm for providing delay-sensitive and computation-intensive services to mobile users. In this paper, we study the problem of the joint optimization of task assignment and energy management in a mobile-server-assisted edge computing network, where mobile servers can provide assisted task offloading services on behalf of the fixed servers at the network edge. The design objective is to minimize the system delay. As far as we know, our paper presents the first work that improves the quality of service of the whole system from a long-term aspect by prolonging the operational time of assisted mobile servers. We formulate the system delay minimization problem as a mixed-integer programming (MIP) problem. Due to the NP-hardness of this problem, we propose a dynamic energy criticality avoidance-based delay minimization ant colony algorithm (EACO), which strives for a balance between delay minimization for offloaded tasks and operational time maximization for mobile servers. We present a detailed algorithm design and deduce its computational complexity. We conduct extensive simulations, and the results demonstrate the high performance of the proposed algorithm compared to the benchmark algorithms.

Mobile edge computing (MEC)-enabled satellite-terrestrial networks (STNs) can provide task computing services for Internet of Things (IoT) devices. However, since some applications' tasks require huge amounts of computing resources, sometimes the computing resources of a local satellite's MEC server are insufficient, but the computing resources of neighboring satellites' MEC servers are redundant. Therefore, we investigated inter-satellite cooperation in MEC-enabled STNs. First, we designed a system model of the MEC-enabled STN architecture, where the local satellite and the neighboring satellites assist IoT devices in computing tasks through inter-satellite cooperation. The local satellite migrates some tasks to the neighboring satellites to utilize their idle resources. Next, the task completion delay minimization problem for all IoT devices is formulated and decomposed. Then, we propose an inter-satellite cooperative joint offloading decision and resource allocation optimization scheme, which consists of a task offloading decision algorithm based on the Grey Wolf Optimizer (GWO) algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method. The optimal solution is obtained by continuous iterations. Finally, simulation results demonstrate that the proposed scheme achieves relatively better performance than other baseline schemes.

As far as mobile edge computing is concerned, it is necessary to ensure the data integrity of latency-sensitive applications during the process of computing. While certain research programs have demonstrated efficacy, challenges persist, including the inefficient utilization of computing resources, network backhaul issues, and the occurrence of false-negative detections. To solve these problems, an integrity protection scheme is proposed in this paper on the basis of data right confirmation (DRC). Under this scheme, a two-layer consensus algorithm is developed. The outer algorithm is applied to establish a data authorization mechanism by marking the original data source to avoid the false negative results caused by network attacks from the data source. In addition, blockchain-based mobile edge computing (BMEC) technology is applied to enable data sharing in the context of mobile edge computing while minimizing the network backhaul of edge computing. Based on the Merkle Tree algorithm, the inner layer algorithm is capable not only of accurately locating and promptly repairing damaged data but also of verifying all servers in the mobile edge computing network either regularly or on demand. Finally, our proposal is evaluated against two existing research schemes. The experimental results show that our proposed scheme is not only effective in ensuring data integrity in mobile edge computing, but it is also capable of achieving better performance. [ABSTRACT FROM AUTHOR]

A production status monitoring method based on edge computing is proposed for traditional machining offline equipment to address the deficiencies that traditional machining offline equipment have, which cannot automatically count the number of parts produced, obtain part processing time information, and discern anomalous operation status. Firstly, the total current signal of the collected equipment was filtered to extract the processing segment data. The processing segment data were then used to manually calibrate the feature vector of the equipment for specific parts and processes, and the feature vector was used as a reference to match with the real-time electric current data on the edge device to identify and obtain the processing start time, processing end time, and anomalous marks for each part. Finally, the information was uploaded to further obtain the part processing time, loading and unloading standby time, and the cause of the anomaly. To verify the reliability of the method, a prototype system was built, and extensive experiments were conducted on many different types of equipment in an auto parts manufacturer. The experimental results show that the proposed monitoring algorithm based on the calibration vector can stably and effectively identify the production information of each part on an independently developed edge device.

This study proposes an innovative method for structural health monitoring of simply supported PCI girder bridges based on dynamic strain and edge computing. Field static and dynamic load tests were conducted on a bridge consisting of a span with newly replaced PCI girders and numerous spans with old PCI girders. Both the static and dynamic test results showed that the flexural rigidity of the old PCI girders decreased significantly due to deterioration. To improve the efficiency of on-site monitoring data transmission and data analysis, this study developed a smart dynamic strain gauge node with the function of edge computing. Continuous data with a sampling frequency of 100 Hz were computed at the sensor node. Among the computed results, only the maximum dynamic strain data caused by the passage of the heaviest vehicle within 1 min were transmitted. The on-site monitoring results indicated that under routine traffic conditions, the dynamic strain response of the new PCI girder was smaller than that of the deteriorated PCI girder. When the monitored dynamic strain response has a tendency to magnify, attention should be paid to the potential prestress loss or other deterioration behaviors of the bridge.

We address the problem of resource allocation with multi-attribute demand considering heterogeneous servers in mobile edge computing (MEC). A mobile device (MD) may be within the coverage area of multiple access points and can get resources from any server that can establish direct communication. However, the configurations of heterogeneous servers are different, so the demand for each MEC server is different. We tackle this problem and consider multi-attribute demand, where each MD is assigned exactly one of multiple demands. We formulate the allocation problem in an auction-based setting to provide server scalability. We propose a family of greedy mechanisms to solve the resource allocation problem. However, each MD is self-interested and may try to manipulate the system to maximize its utility. We show our mechanisms are truthful, and they drive the system into an equilibrium where no MD can declare an untrue value to obtain higher utility. We also analyze the approximation ratios of our greedy mechanisms. Experimental results demonstrate that the greedy mechanisms obtain the near-optimal allocation in a short period while benefiting MDs and edge cloud providers. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC), which sinks the functions of cloud servers, has become an emerging paradigm to solve the contradiction between delay-sensitive tasks and resource-constrained terminals. Task offloading assisted by service caching in a collaborative manner can reduce delay and balance the edge load in MEC. Due to the limited storage resources of edge servers, it is a significant issue to develop a dynamical service caching strategy according to the actual variable user demands in task offloading. Therefore, this paper investigates the collaborative task offloading problem assisted by a dynamical caching strategy in MEC. Furthermore, a two-level computing strategy called joint task offloading and service caching (JTOSC) is proposed to solve the optimized problem. The outer layer in JTOSC iteratively updates the service caching decisions based on the Gibbs sampling. The inner layer in JTOSC adopts the fairness-aware allocation algorithm and the offloading revenue preference-based bilateral matching algorithm to get a great computing resource allocation and task offloading scheme. The simulation results indicate that the proposed strategy outperforms the other four comparison strategies in terms of maximum offloading delay, service cache hit rate, and edge load balance.

To not only achieve the goal of urban cultural construction but also save the cost of urban sculpture space design, EC (edge computing) is combined with urban sculpture space design and planning first. Then it briefly discusses the service category, system architecture, advantages, and characteristics of urban sculpture, as well as the key points and difficulties of its construction, and the layered architecture of EC for urban sculpture spaces is proposed. Secondly, the cloud edge combination technology is adopted, and the urban sculpture is used as a specific function of the edge system node to conduct an in-depth analysis to build an urban sculpture safety supervision system architecture platform. Finally, the actual energy required for implementation is predicted and evaluated, the specific monitoring system coverage is set up, and some equations are made for calculating the energy consumption of the monitored machines according to the number of devices and route planning required by the urban sculpture safety supervision system. An optimization algorithm for energy consumption is proposed based on reinforcement learning and compared with the three control groups. The results show that when the seven monitoring devices cover detection points less than 800, the required energy consumption increases linearly. When the detection devices cover more than 800 detection points, the required energy consumption is stable and varies from 10000 to 12000; that is, when the number of monitoring devices is 7, the optimal number of monitoring points is about 800. When the number of detection points is fixed, increasing the number of monitoring devices in a small range can reduce the total energy consumption. The optimization algorithm based on the reinforcement learning proposal can obtain an approximate optimal solution. The research results show that the combination of edge computing and urban sculpture can expand the function of urban sculpture and make it serve people better., Competing Interests: All authors declare that they have no conflicts of interest., (Copyright © 2022 Junru Zhu.)

With the wide application of advanced communication and information technology, false data injection attack (FDIA) has become one of the significant potential threats to the security of smart grid. Malicious attack detection is the primary task of defense. Therefore, this paper proposes a method of FDIA detection based on vector auto-regression (VAR), aiming to improve safe operation and reliable power supply in smart grid applications. The proposed method is characterized by incorporating with VAR model and measurement residual analysis based on infinite norm and 2-norm to achieve the FDIA detection under the edge computing architecture, where the VAR model is used to make a short-term prediction of FDIA, and the infinite norm and 2-norm are utilized to generate the classification detector. To assess the performance of the proposed method, we conducted experiments by the IEEE 14-bus system power grid model. The experimental results demonstrate that the method based on VAR model has a better detection of FDIA compared to the method based on auto-regressive (AR) model.

In order to explore the current income gap, a method based on the PSO algorithm in the edge computing environment is proposed. PSO calculates and simulates bird flock foraging activities, the Frank Heppner biological group model, and the three rules in bird activities. After studying the activities of these natural creatures, abstract problems are quantified and similar models established. The Gini coefficient is calculated by using grouped data, and the grouping basis is also innovative. The quantile grouping method is adopted, which can effectively solve the difference between the concentration index and the Gini coefficient, and the Gini coefficients of each year can be added up to finally get the Gini coefficient of the stock income. Experimental results show that the Gini coefficient of traffic income in 2017 and 2018 had dropped significantly, but the variation of the Gini coefficient of stock income (Delta CG) was still greater than 0. Obviously, the adjustment speed of the Gini coefficient of stock income was lagging behind, as was the Gini coefficient of traffic income. We found that after 1986, the facilitation effect was greater than the dilution effect, and the facilitation effect continued to push up the stock income gap, which indicated more income flow to the high-income group, with the income flow gap showing an upward trend and the upward trend becoming more and more obvious. It has been proved that the PSO algorithm can effectively identify the income gap in the edge computing environment, and the corresponding policy suggestions are given., Competing Interests: The authors declare that there are no conflicts of interest., (Copyright © 2022 Xiaomeng Zhao and Lin Liu.)

This exploration is to solve the efficiency and accuracy of cell recognition in biological experiments. Neural network technology is applied to the research of cell image recognition. The cell image recognition problem is solved by constructing an image recognition algorithm. First, with an in-depth understanding of computer functions, as a basic intelligent algorithm, the artificial neural network (ANN) is widely used to solve the problem of image recognition. Recently, the backpropagation neural network (BPNN) algorithm has developed into a powerful pattern recognition tool and has been widely used in image edge detection. Then, the structural model of BPNN is introduced in detail. Given the complexity of cell image recognition, an algorithm based on the ANN and BPNN is used to solve this problem. The BPNN algorithm has multiple advantages, such as simple structure, easy hardware implementation, and good learning effect. Next, an image recognition algorithm based on the BPNN is designed and the image recognition process is optimized in combination with edge computing technology to improve the efficiency of algorithm recognition. The experimental results show that compared with the traditional image pattern recognition algorithm, the recognition accuracy of the designed algorithm for cell images is higher than 93.12%, so it has more advantages for processing the cell image algorithm. The results show that the BPNN edge computing can improve the scientific accuracy of cell recognition results, suggesting that edge computing based on the BPNN has a significant practical value for the research and application of cell recognition., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2022 Xiangxi Du et al.)

For 5G and future Internet, in this paper, we propose a task allocation method for future Internet application to reduce the total latency in a mobile edge computing (MEC) platform with three types of servers: a dedicated MEC server, a shared MEC server, and a cloud server. For this platform, we first calculate the delay between sending a task and receiving a response for the dedicated MEC server, shared MEC server, and cloud server by considering the processing time and transmission delay. Here, the transmission delay for the shared MEC server is derived using queueing theory. Then, we formulate an optimization problem for task allocation to minimize the total latency for all tasks. By solving this optimization problem, tasks can be allocated to the MEC servers and cloud server appropriately. In addition, we propose a heuristic algorithm to obtain the approximate optimal solution in a shorter time. This heuristic algorithm consists of four algorithms: a main algorithm and three additional algorithms. In this algorithm, tasks are divided into two groups, and task allocation is executed for each group. We compare the performance of our proposed heuristic algorithm with the solution obtained by three other methods and investigate the effectiveness of our algorithm. Numerical examples are used to demonstrate the effectiveness of our proposed heuristic algorithm. From some results, we observe that our proposed heuristic algorithm can perform task allocation in a short time and can effectively reduce the total latency in a short time. We conclude that our proposed heuristic algorithm is effective for task allocation in a MEC platform with multiple types of MEC servers.

In the mobile edge computing environment, aiming at the problems of few classifications of resource nodes and low resource utilization in the process of multi-user and multi-server resource allocation, a resource optimization algorithm based on comprehensive utility is proposed. First, the algorithm improves the Naive Bayes algorithm, obtains the conditional probabilities of job types based on the established Naive Bayes formula and calculates the posterior probabilities of different job types under specific conditions. Second, the classification method of resource service nodes is designed. According to the resource utilization rate of the CPU and I/O, the resource service nodes are divided into CPU main resources and I/O main resources. Finally, the resource allocation based on comprehensive utility is considered. According to three factors, resource location, task priority and network transmission cost, the matching computing resource nodes are allocated to the job, and the optimal solution of matching job and resource nodes is obtained by the weighted bipartite graph method. The experimental results show that, compared with similar resource optimization algorithms, this method can effectively classify job types and resource service nodes, reduce resource occupancy rate and improve resource utilization rate.

The feeding behaviour of cows is an essential sign of their health in dairy farming. For the impression of cow health status, precise and quick assessment of cow feeding behaviour is critical. This research presents a method for monitoring dairy cow feeding behaviour utilizing edge computing and deep learning algorithms based on the characteristics of dairy cow feeding behaviour. Images of cow feeding behaviour were captured and processed in real time using an edge computing device. A DenseResNet-You Only Look Once (DRN-YOLO) deep learning method was presented to address the difficulties of existing cow feeding behaviour detection algorithms' low accuracy and sensitivity to the open farm environment. The deep learning and feature extraction enhancement of the model was improved by replacing the CSPDarknet backbone network with the self-designed DRNet backbone network based on the YOLOv4 algorithm using multiple feature scales and the Spatial Pyramid Pooling (SPP) structure to enrich the scale semantic feature interactions, finally achieving the recognition of cow feeding behaviour in the farm feeding environment. The experimental results showed that DRN-YOLO improved the accuracy, recall, and mAP by 1.70%, 1.82%, and 0.97%, respectively, compared to YOLOv4. The research results can effectively solve the problems of low recognition accuracy and insufficient feature extraction in the analysis of dairy cow feeding behaviour by traditional methods in complex breeding environments, and at the same time provide an important reference for the realization of intelligent animal husbandry and precision breeding.

With the rapid advancement of the Internet and big data technologies, traditional centralized machine learning methods are challenged when dealing with large-scale datasets. Federated Learning (FL), as an emerging distributed machine learning paradigm, enables multiple clients to collaboratively train a global model while preserving privacy. Edge computing, also recognized as a critical technology for handling massive datasets, has garnered significant attention. However, the heterogeneity of clients in edge computing environments can severely impact the performance of the resultant models. This study introduces an Adaptive Personalized Client-Selection and Model-Aggregation Algorithm, APCSMA, aimed at optimizing FL performance in edge computing settings. The algorithm evaluates clients' contributions by calculating the real-time performance of local models and the cosine similarity between local and global models, and it designs a ContriFunc function to quantify each client's contribution. The server then selects clients and assigns weights during model aggregation based on these contributions. Moreover, the algorithm accommodates personalized needs in local model updates, rather than simply overwriting with the global model. Extensive experiments were conducted on the FashionMNIST and Cifar-10 datasets, simulating three data distributions with parameters dir = 0.1, 0.3, and 0.5. The accuracy improvements achieved were 3.9%, 1.9%, and 1.1% for the FashionMNIST dataset, and 31.9%, 8.4%, and 5.4% for the Cifar-10 dataset, respectively. [ABSTRACT FROM AUTHOR]

Recently, the unmanned aerial vehicle (UAV)-assisted edge computing is proposed to improve the quality of service in some scenarios within sparse or unavailable base stations (BSs). Meanwhile, the caching technology is adopted to reduce the wireless traffic load and the data transmission delay. However, due to the limited storage capacity of edge nodes, the edge nodes cannot store all of the contents required by user equipment (UE). So, how to select the reasonable contents for caching on edge nodes to reduce the content delivery delay becomes a challenge in the UAV-assisted edge computing environment. In this paper, the Dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system is proposed. Specially, the content transmission delay between two nodes is computed. Then, for each requested content, the weighted edge-undirected graph (WEUG), in which one vertex represents one node, is built. Furthermore, Dijkstra algorithm is adopted to achieve the minimal content transmission delay from the edge node caching the requested content to UE. Finally, the optimization problem of content caching is built, and the corresponding cache strategy is achieved by solving the optimization problem. The experimental results imply that the proposed cooperative caching algorithm can achieve better performance on the average content transmission delay, the average cache hit rate, and the total of hops, respectively, comparing with the benchmark algorithms. [ABSTRACT FROM AUTHOR]

Dynamic Adaptive Streaming over HTTP (DASH) is a promising scheme for improving the Quality of Experience (QoE) of users in video streaming. However, the existing schemes do not perform coordination among clients and depend on fixed heuristics. In this paper, we propose an adaptive streaming scheme with reinforcement learning in edge computing environments. The proposed scheme improves the overall QoE of clients and QoE fairness among clients based on a state-of-the-art reinforcement learning algorithm. Edge computing assistance plays a role in providing client-side observations to the mobile edge, making agents utilize this information when generating a policy for multi-client adaptive streaming. We evaluated the proposed scheme through simulation-based experiments under various network conditions. The experimental results show that the proposed scheme achieves better performance than the existing schemes.

As a popular data representation technique, Nonnegative matrix factorization (NMF) has been widely applied in edge computing, information retrieval and pattern recognition. Although it can learn parts-based data representations, existing NMF-based algorithms fail to integrate local and global structures of data to steer matrix factorization. Meanwhile, semi-supervised ones ignore the important role of instances from different classes in learning the representation. To solve such an issue, we propose a novel semi-supervised NMF approach via joint graph regularization and constraint propagation for edge computing, called robust constrained nonnegative matrix factorization (RCNMF), which learns robust discriminative representations by leveraging the power of both L2, 1-norm NMF and constraint propagation. Specifically, RCNMF explicitly exploits global and local structures of data to make latent representations of instances involved by the same class closer and those of instances involved by different classes farther. Furthermore, RCNMF introduces the L2, 1-norm cost function for addressing the problems of noise and outliers. Moreover, L2, 1-norm constraints on the factorial matrix are used to ensure the new representation sparse in rows. Finally, we exploit an optimization algorithm to solve the proposed framework. The convergence of such an optimization algorithm has been proven theoretically and empirically. Empirical experiments show that the proposed RCNMF is superior to other state-of-the-art algorithms.

Edge computing is frequently employed in the Internet of Vehicles, although the computation and communication capabilities of roadside units with edge servers are limited. As a result, to perform distributed machine learning on resource-limited MEC systems, resources have to be allocated sensibly. This paper presents an Improved MADDPG algorithm to overcome the current IoV concerns of high delay and limited offloading utility. Firstly, we employ the MADDPG algorithm for task offloading. Secondly, the edge server aggregates the updated model and modifies the aggregation model parameters to achieve optimal policy learning. Finally, the new approach is contrasted with current reinforcement learning techniques. The simulation results show that compared with MADDPG and MAA2C algorithms, our algorithm improves offloading utility by 2% and 9%, and reduces delay by 29.6%. [ABSTRACT FROM AUTHOR]

Distributed edge intelligence is a disruptive research area that enables the execution of machine learning and deep learning (ML/DL) algorithms close to where data are generated. Since edge devices are more limited and heterogeneous than typical cloud devices, many hindrances have to be overcome to fully extract the potential benefits of such an approach (such as data-in-motion analytics). In this paper, we investigate the challenges of running ML/DL on edge devices in a distributed way, paying special attention to how techniques are adapted or designed to execute on these restricted devices. The techniques under discussion pervade the processes of caching, training, inference, and offloading on edge devices. We also explore the benefits and drawbacks of these strategies.

In the context of smart agriculture, high-value data sensing in the entire crop lifecycle is fundamental for realizing crop cultivation control. However, the existing data sensing methods are deficient regarding the sensing data value, poor data correlation, and high data collection cost. The main problem for data sensing over the entire crop lifecycle is how to sense high-value data according to crop growth stage at a low cost. To solve this problem, a data sensing framework was developed by combining edge computing with the Internet of Things, and a novel data sensing strategy for the entire crop lifecycle is proposed in this paper. The proposed strategy includes four phases. In the first phase, the crop growth stage is divided by Gath-Geva (GG) fuzzy clustering, and the key growth parameters corresponding to the growth stage are extracted. In the second phase, based on the current crop growth information, a prediction method of the current crop growth stage is constructed by using a Tkagi-Sugneo (T-S) fuzzy neural network. In the third phase, based on Deng's grey relational analysis method, the environmental sensing parameters of the corresponding crop growth stage are optimized. In the fourth phase, an adaptive sensing method of sensing nodes with effective sensing area constraints is established. Finally, based on the actual crop growth history data, the whole crop life cycle dataset is established to test the performance and prediction accuracy of the proposed method for crop growth stage division. Based on the historical data, the simulation data sensing environment is established. Then, the proposed algorithm is tested and compared with the traditional algorithms. The comparison results show that the proposed strategy can divide and predict a crop growth cycle with high accuracy. The proposed strategy can significantly reduce the sensing and data collection times and energy consumption and significantly improve the value of sensing data.

The current computation offloading algorithm for the mobile cloud ignores the selection of offloading opportunities and does not consider the uninstall frequency, resource waste, and energy efficiency reduction of the user's offloading success probability. Therefore, in this study, a dynamic computation offloading algorithm based on particle swarm optimization with a mutation operator in a multi-access edge computing environment is proposed (DCO-PSOMO). According to the CPU utilization and the memory utilization rate of the mobile terminal, this method can dynamically obtain the overload time by using a strong, locally weighted regression method. After detecting the overload time, the probability of successful downloading is predicted by the mobile user's dwell time and edge computing communication range, and the offloading is either conducted immediately or delayed. A computation offloading model was established via the use of the response time and energy consumption of the mobile terminal. Additionally, the optimal computing offloading algorithm was designed via the use of a particle swarm with a mutation operator. Finally, the DCO-PSOMO algorithm was compared with the JOCAP, ECOMC and ESRLR algorithms, and the experimental results demonstrated that the DCO-PSOMO offloading method can effectively reduce the offloading cost and terminal energy consumption, and improves the success probability of offloading and the user's QoS.

As the performance of Radio Frequency Identification (RFID) devices is susceptible to the influence of the surrounding environment, making the original data collected by RFID devices with uncertain, of which missed data and redundant data are the main source of uncertainty data, these uncertainty data will seriously affect the quality of RFID upper layer applications. Therefore, to solve the uncertainty in RFID data, the original data must be cleaned. For the shortcomings of tag dynamics detection in the traditional data cleaning algorithm named Statistical Smoothing for Unreliable RFID data (SMURF), an adaptive sliding window-based data cleaning algorithm for RFID single-tag is proposed. The method takes into account the influence of tag speed on tag integrity judgment, and divides sliding sub-windows to accurately detect tag changes and then reasonably adjusts the sliding window size. In addition, considering that the average reading rate of tags is affected by the collision between multiple tags, an RFID multi-tag cleaning method based on twice-tag number estimation is proposed. The method accurately estimates the number of tags by the twice-tag estimation method, controls the read period by the Markov chain, and reduces the occurrence of multiple tag collisions by using an unequal time slot optimization method. Experimental results show that the proposed method in this paper can form a complete set of RFID data stream cleaning algorithms, which effectively reduces the uncertain data and improves the data accuracy. [ABSTRACT FROM AUTHOR]

The synergy between Artificial Intelligence and the Edge Computing paradigm promises to transfer decision-making processes to the periphery of sensor networks without the involvement of central data servers. For this reason, we recently witnessed an impetuous development of devices that integrate sensors and computing resources in a single board to process data directly on the collection place. Due to the particular context where they are used, the main feature of these boards is the reduced energy consumption, even if they do not exhibit absolute computing powers comparable to modern high-end CPUs. Among the most popular Artificial Intelligence techniques, clustering algorithms are practical tools for discovering correlations or affinities within data collected in large datasets, but a parallel implementation is an essential requirement because of their high computational cost. Therefore, in the present work, we investigate how to implement clustering algorithms on parallel and low-energy devices for edge computing environments. In particular, we present the experiments related to two devices with different features: the quad-core UDOO X86 Advanced+ board and the GPU-based NVIDIA Jetson Nano board, evaluating them from the performance and the energy consumption points of view. The experiments show that they realize a more favorable trade-off between these two requirements than other high-end computing devices.

In recent years, more and more devices are connected to the network, generating an overwhelming amount of data. This term that is booming today is known as the Internet of Things. In order to deal with these data close to the source, the term Edge Computing arises. The main objective is to address the limitations of cloud processing and satisfy the growing demand for applications and services that require low latency, greater efficiency and real-time response capabilities. Furthermore, it is essential to underscore the intrinsic connection between artificial intelligence and edge computing within the context of our study. This integral relationship not only addresses the challenges posed by data proliferation but also propels a transformative wave of innovation, shaping a new era of data processing capabilities at the network's edge. Edge devices can perform real-time data analysis and make autonomous decisions without relying on constant connectivity to the cloud. This article aims at analysing and comparing Edge Computing devices when artificial intelligence algorithms are deployed on them. To this end, a detailed experiment involving various edge devices, models and metrics is conducted. In addition, we will observe how artificial intelligence accelerators such as Tensor Processing Unit behave. This analysis seeks to respond to the choice of a device that best suits the necessary AI requirements. As a summary, in general terms, the Jetson Nano provides the best performance when only CPU is used. Nevertheless the utilisation of a TPU drastically enhances the results. [ABSTRACT FROM AUTHOR]

The task offloading of mobile edge computing (MEC) is to find proper edge or cloud resources for the execution tasks to efficiently utilize resources and meet different user's requirements. However, it is difficult for task offloading when the number of tasks and resources providers increases and to optimize multiple objectives while satisfying users' requirements. In this paper, a new multi-objective strategy based on the biogeography-based optimization (BBO) algorithm is proposed for MEC offloading to satisfied users' multiple requirements (the execution time, energy consumption and cost). In this strategy, a time-energy consumption model and a cost model are constructed for task offloading firstly. Based on these models, the BBO algorithm is introduced into task offloading for MEC to solve the problem of multi-objective optimization. Compared with the traditional strategies, the offloading strategy based on BBO decreases the average task completion time by an average of 25.03%, and compared with the technique for order preference by similarity to an ideal solution (TOPSIS) strategy, the BBO offloading strategy proposed in this paper reduces energy consumption 75% and cost by 36.9%. The proposed strategy can well solve the problem of multi-objective optimization in the task offloading for MEC. [ABSTRACT FROM AUTHOR]

Traffic sensing system requires to periodically collect spatial–temporal traffic data distributed among road networks, which results in overhigh bandwidth consumption and storage cost in a large-scale road network. Several compressive sensing-based algorithms are proposed to reconstruct missing traffic data with limited traffic observation. However, there still exist great challenges to be addressed. First, these existing algorithms are always iteration-based, whose time complexity will explosively increase with the growth of network scale. Furthermore, these algorithms have to be re-executed even if only a small fraction of data changes, which is not suitable for dynamic traffic environments. To overcome these issues, we investigate a novel service architecture of traffic sensing based on mobile edge computing where collected data is pre-processed at the edge node and reconstructed at cloud servers, respectively. On this basis, we formulate the problem of Missing Traffic Data reconstruction (MTDR), which aims at maximizing data reconstruction accuracy within limited observation data. Further, we develop a deep-learning-based algorithm called stacked denoising autoencoder for MTDR (SDAE-MTDR), where three denoising autoencoders are trained in order and then stacked together for parameter fine-tuning based on cross-entropy-based loss function. Finally, we conduct comprehensive performance evaluation based on realistic vehicular traces and the simulation results demonstrate the superiority of the proposed algorithm compared with competitive solutions. [ABSTRACT FROM AUTHOR]

The original pattern recognition and classification of crop diseases needs to collect a large amount of data in the field and send them next to a computer server through the network for recognition and classification. This method usually takes a long time, is expensive, and is difficult to carry out for timely monitoring of crop diseases, causing delays to diagnosis and treatment. With the emergence of edge computing, one can attempt to deploy the pattern recognition algorithm to the farmland environment and monitor the growth of crops promptly. However, due to the limited resources of the edge device, the original deep recognition model is challenging to apply. Due to this, in this article, a recognition model based on a depthwise separable convolutional neural network (DSCNN) is proposed, which operation particularities include a significant reduction in the number of parameters and the amount of computation, making the proposed design well suited for the edge. To show its effectiveness, simulation results are compared with the main convolution neural network (CNN) models LeNet and Visual Geometry Group Network (VGGNet) and show that, based on high recognition accuracy, the recognition time of the proposed model is reduced by 80.9% and 94.4%, respectively. Given its fast recognition speed and high recognition accuracy, the model is suitable for the real-time monitoring and recognition of crop diseases by provisioning remote embedded equipment and deploying the proposed model using edge computing.

In order to cope with the problems of high frequency and multiple causes of mountain fires, it is very important to adopt appropriate technologies to monitor and warn mountain fires through a few surface parameters. At the same time, the existing mobile terminal equipment is insufficient in image processing and storage capacity, and the energy consumption is high in the data transmission process, which requires calculation unloading. For this circumstance, first, a hierarchical discriminant analysis algorithm based on image feature extraction is introduced, and the image acquisition software in the mobile edge computing environment in the android system is designed and installed. Based on the remote sensing data, the land surface parameters of mountain fire are obtained, and the application of image recognition optimization algorithm in the mobile edge computing (MEC) environment is realized to solve the problem of transmission delay caused by traditional mobile cloud computing (MCC). Then, according to the forest fire sensitivity index, a forest fire early warning model based on MEC is designed. Finally, the image recognition response time and bandwidth consumption of the algorithm are studied, and the occurrence probability of mountain fire in Muli county, Liangshan prefecture, Sichuan is predicted. The results show that, compared with the MCC architecture, the algorithm presented in this study has shorter recognition and response time to different images in WiFi network environment; compared with MCC, MEC architecture can identify close users and transmit less data, which can effectively reduce the bandwidth pressure of the network. In most areas of Muli county, Liangshan prefecture, the probability of mountain fire is relatively low, the probability of mountain fire caused by non-surface environment is about 8 times that of the surface environment, and the influence of non-surface environment in the period of high incidence of mountain fire is lower than that in the period of low incidence. In conclusion, the surface parameters of MEC can be used to effectively predict the mountain fire and provide preventive measures in time., Competing Interests: The authors have declared that no competing interests exist.

In the field of traffic management and control systems, we are witnessing a symbiotic evolution, where intelligent infrastructure is progressively collaborating with smart vehicles to produce benefits for traffic monitoring and security, by rapidly identifying hazardous behaviours. This exponential growth is due to the rapid development of deep learning in recent years, as well as the improvements in computer vision models. These technologies allow for monitoring tasks without the need to install numerous sensors or stop the traffic, using the extensive camera network of surveillance cameras already present in worldwide roads. This study proposes a computer vision-based solution that allows for real-time processing of video streams through edge computing devices, eliminating the need for Internet connectivity or dedicated sensors. The proposed system employs deep learning algorithms and vision techniques that perform vehicle detection, classification, tracking, speed estimation, and vehicle geolocation., Author(s): Jaime Villa (corresponding author) [1]; Franz García [1]; Rubén Jover [2]; Ventura Martínez [2]; José M. Armingol [1] 1. Introduction In the 21st century, where mobility is at the [...]

The Internet of Things (IoT) requires a new processing model that will allow scalability in cloud computing while reducing time delay caused by data transmission within a network. Such a model can be achieved by using resources that are closer to the user, i.e., by relying on edge computing (EC). The amount of IoT data also grows with an increase in the number of IoT devices. However, building such a flexible model within a heterogeneous environment is difficult in terms of resources. Moreover, the increasing demand for IoT services necessitates shortening time delay and response time by achieving effective load balancing. IoT devices are expected to generate huge amounts of data within a short amount of time. They will be dynamically deployed, and IoT services will be provided to EC devices or cloud servers to minimize resource costs while meeting the latency and quality of service (QoS) constraints of IoT applications when IoT devices are at the endpoint. EC is an emerging solution to the data processing problem in IoT. In this study, we improve the load balancing process and distribute resources fairly to tasks, which, in turn, will improve QoS in cloud and reduce processing time, and consequently, response time. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The overlap between edge computing and unmanned aerial systems enables Unmanned Aerial Vehicles (UAV) to quickly offload image processing tasks onto edge devices, avoiding the transmission of images over long distances. To improve the speed and efficiency of UAV image stitching in an edge computing environment, this paper proposes an adaptive UAV image parallel stitching algorithm in an edge computing environment. The algorithm incorporates both route-based parallel processing and inverted binary tree-based parallel processing, dividing the image stitching task into multiple processes and allocating them to different cores based on the CPU core count, number of flight routes, and number of images, thereby enhancing computational efficiency in edge scenarios. The experimental results indicate that, when the number of flight routes is greater than or equal to the number of CPUs, the adaptive algorithm will employ the more efficient route parallelism. Conversely, when the number of flight routes is less than the number of CPUs, the efficiency of inverted binary tree parallelism is higher. In the same experimental environment and dataset, the adaptive image stitching algorithm demonstrates an efficiency improvement of approximately 2–10 times compared to other algorithms, with no significant degradation in image quality. This demonstrates that in edge environments, the utilization of multi-threaded adaptive route and inverted binary tree-based parallel approaches can effectively harness the computing resources of edge devices, significantly improving the stitching speed of UAV images and providing technical support for rapid real-time monitoring by UAV. [ABSTRACT FROM AUTHOR]

In the mobile edge computing scenario, a large number of computing tasks are offloaded to the edge computing server, which may cause the tasks not to be processed on time. In this paper, the response time of the computing tasks, the energy consumption of the mobile terminal device and the load balance of the server were regarded as three optimization objectives, a multi-objective optimization model were set up, and an offloading decision scheme based on multi-objective optimization immune algorithm was proposed. A large number of comparative experiments are done to verify the effectiveness of proposed scheme. Experimental results show that the proposed scheme can make the whole server system achieve a better load balancing state while meeting the requirements of response time and energy consumption. [ABSTRACT FROM AUTHOR]

Edge computing brings storage and compute resources down to the edge of the network. Users can offload latencysensitive and compute-intensive applications to the edge server for execution, thereby reducing latency and energy consumption. Existing task offload studies often fall short. The first point is that the existing research on task offloading often overlooks the heterogeneity of offloading tasks. The second point is that the default edge server caching service can meet the long-term service needs of users. However, different tasks require different services to provide execution environments. And the finite resources of edge servers can only deploy a small number of services. Therefore, to minimize latency and energy consumption (i. e. cost), this article proposed a heterogeneous task offloading method that combined service updates and cloud edge collaboration. The method consisted two following main parts. The first part was an improved page replacement algorithm. The algorithm could predict the potential user service demand and updated the service of the edge server in time. The second part was the collaboration between the cloud-side ends, offloading tasks through collaboration and keeping minimum total costs. Finally, it conducted thorough experiments using real datasets. The experimental results show that the proposed method can reduce the total cost by 7% to 16% compared to the comparison methods. [ABSTRACT FROM AUTHOR]

With the advent of Mobile Edge Computing (MEC), shifting data processing from cloud centers to the network edge presents an advanced computational paradigm for addressing latency-sensitive applications. Specifically, in radar systems, the real-time processing and prediction of radar echo data pose significant challenges in dynamic and resource-constrained environments. MEC, by processing data near its source, not only significantly reduces communication latency and enhances bandwidth utilization but also diminishes the necessity of transmitting large volumes of data to the cloud, which is crucial for improving the timeliness and efficiency of radar data processing. To meet this demand, this paper proposes a model that integrates a spatiotemporal Attention Module (STAM) with a Long Short-Term Memory Gated Recurrent Unit (ST-ConvLSGRU) to enhance the accuracy of radar echo prediction while leveraging the advantages of MEC. STAM, by extending the spatiotemporal receptive field of the prediction units, effectively captures key inter-frame motion information, while optimizations to the convolutional structure and loss function further boost the model's predictive performance. Experimental results demonstrate that our approach significantly improves the accuracy of short-term weather forecasting in a mobile edge computing environment, showcasing an efficient and practical solution for processing radar echo data under dynamic, resource-limited conditions. [ABSTRACT FROM AUTHOR]

• Multi-modal fusing algorithm with rice disease image and non-imaging spectral signals. • Image feature extraction with a new neural network root in MobilenetV2. • Linear SVM method with fused features obtained by effective fusion strategy for crop disease classification. Frequent occurrences of pests and diseases in farmland pose a severe threat to crop yield and quality. Various techniques utilized for the automatic detection of diseases and pests are mostly based on a single modality with limited diagnostic information. In this study, a multi-modal classification algorithm, ISMSFuse, was proposed to fuse the image and spectral information. This algorithm combines a MobilenNetV2 lightweight neural network with a traditional low-computational linear SVM method to adapt to edge computing terminals. The spectral information was extracted with non-imaging spectral signals to reduce the acquisition costs and hardware requirements. A proprietary multi-mode rice bacterial blight dataset, denoted as ImgS-RBB2022, was curated specifically for evaluating the algorithm. The effectiveness of the image features extracted by the algorithm model was evaluated by the t-SNE method and the Fisher scores. Finally, comparing the results with only using imaging data, the multi-mode fusion algorithm had a superior recognition accuracy of 98.14%. Through the SHAP method, it was shown that the added spectral features became the most critical feature affecting the output of the algorithm model. To further explore the application potential of the proposed algorithm, we deployed it on a board-based microcomputer Raspberry Pi to test its feasibility in an edge computing circumstance. The proposed method can be applied to various agricultural diseases and pest detection tasks, particularly in the case of foliar-type diseases and pests. [ABSTRACT FROM AUTHOR]

Vehicular Edge Computing is the specific application of Mobile Edge Computing in vehicular scenarios. In this work, to efficiently provide on-demand computational resource access for Mission Vehicles, Road Side Units (RSUs) and Cooperative Vehicles are both mounted with edge servers. To further improve the performance of this system, we firstly study the dynamic and cooperative task caching between RSUs. Under the control of the central controller, our caching scheme fully utilizes edge servers' storage resources. Then, we resort to Deep Deterministic Policy Gradient (DDPG) algorithm to adapt to the time-varying wireless environment. Moreover, we propose the DDPG-OCWB algorithm to improve the convergence performance of DDPG. Finally, numerical results verify the improved performance of our proposed algorithm. Based on a detailed comparison with existing research schemes, it is evident that our scheme dramatically reduces system delay while utilizing edge servers' energy efficiently. [ABSTRACT FROM AUTHOR]

Amid the escalating complexity of networks, wireless intelligent devices, constrained by energy and resources, bear the increasing burden of managing various tasks. The decision of whether to allocate tasks to edge servers or handle them locally on devices now significantly impacts network performance. This study focuses on optimizing task-offloading decisions to balance network latency and energy consumption. An advanced learning-based multi-objective bat algorithm, MOBA-CV-SARSA, tailored to the constraints of wireless devices, presents a promising solution for edge computing task offloading. Developed in C++, MOBA-CV-SARSA demonstrates significant improvements over NSGA-RL-CV and QLPSO-CV, enhancing hypervolume and diversity-metric indicators by 0.9%, 15.07%, 4.72%, and 0.1%, respectively. Remarkably, MOBA-CV-SARSA effectively reduces network energy consumption within acceptable latency thresholds. Moreover, integrating an automatic switching mechanism enables MOBA-CV-SARSA to accelerate convergence speed while conserving 150.825 W of energy, resulting in a substantial 20.24% reduction in overall network energy consumption. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the power grid security hidden danger data investigation is interfered by the power grid attack path, which leads to the poor accuracy and low efficiency of the security hidden danger data investigation, an edge computing-based power grid security hidden danger data investigation algorithm is proposed. Combined with the quantitative regression analysis method, the ambiguity function of the power grid security situation awareness assessment is established, the power grid security situation is analyzed, the characteristics of the power grid security hidden danger data samples are extracted, and the power grid security hidden danger data analysis model is constructed based on the support vector machine. Based on the collaborative work of edge computing center nodes and edge nodes, the distributed data detection of power grid security is realized. The power grid security hidden danger data is reconstructed by the joint sparse model, the power grid security hidden danger data is classified, the power grid security hidden danger data feature set is calculated in the high-dimensional space, and the power grid security hidden danger data is checked through the edge detection. The experimental results show that the method has high accuracy and good throughput for the data investigation of power grid security risks, and can efficiently and accurately realize the data investigation of power grid security risks. [ABSTRACT FROM AUTHOR]

In edge computing switching strategy, aiming at the problems of high transmission delay a nd poor environmental adaptability of Markov decision process ( MDP), this paper proposed an edge computing switching strategy integrating fuzzy logic a nd Markov decision process. The method used fuzzy logic algorithm to fuzzify the system parameters, and introduced the fuzzy value into the fitness function to ensure the effective fusion of system parameters. The differential evolution algorithm solved the maximum problem of fitness function, which could select the optimal rules of the environment and improve the adaptability of edge computing to the environment. The algorithm introduced the fitness function into MDP, which improved the comprehensive performance of the system. The scheme took the mobile intelligent device as the initiator of task unloading and the edge server as the object of task unloading. This paper simulated the one -dimensional MDP switching strategy, one-dimensional delay only MDP switching strategy, two-dimensional MDP switching strategy,fuzzy logic MDP switching strategy, minimum distance switching algorithm and minimum delay switching algorithm. The simulation results show that the average task execution time of the edge computing switching strategy of fuzzy logic MDP is 608 . 8 s, which a re 27. 2%,8. 6 %,37 . 1 %,41 % and 22. 3% lower than one -dimensional MDP switching strategy, one-dimensional delay only MDP switching strategy, two-dimensional MDP switching strategy, minimum distance switching algorithm and minimum delay switching algorithm respectively. This scheme not only improves the environmental adaptability of the edge computing switching strategy based on MDP, but also greatly reduces the transmission delay of edge computing. [ABSTRACT FROM AUTHOR]

Indoor localization problems are difficult due to that the information, such as WLAN and GPS, cannot achieve enough precision for indoor issues. This paper presents a novel indoor localization algorithm, GeoLoc, with uncertainty eliminate based on fusion of acceleration, angular rate, and magnetic field sensor data. The algorithm can be deployed in edge devices to overcome the problems of insufficient computing resources and long delay caused by high complexity of location calculation. Firstly, the magnetic map is built and magnetic values are matched. Secondly, orientation updating and position selection are iteratively executed using the fusion data, which gradually reduce uncertainty of orientation. Then, we filter the trajectory from a path set. By gradually reducing uncertainty, GeoLoc can bring a high positioning precision and a smooth trajectory. In addition, this method has an advantage in that it does not rely on any infrastructure such as base stations and beacons. It solves the common problems regarding the non-uniqueness of the geomagnetic fingerprint and the deviation of the sensor measurement. The experimental results show that our algorithm achieves an accuracy of less than 2.5 m in indoor environment, and the positioning results are relatively stable. It meets the basic requirements of indoor location-based services (LBSs). [ABSTRACT FROM AUTHOR]

Cooperative Vehicle-Infrastructure System (CVIS) can provide innovative services for traffic management and enable trips to be safer, more coordinated, and smarter. In the CVIS, the vehicles upload crowd sensing data to the Vehicular Edge Computing (VEC) server for quick data fusion and informed decision-making. However, with the ever-increasing number of vehicles, the VEC server cannot undertake massive computation-intensive tasks due to the limited edge computing capabilities. In this paper, we propose a reverse offloading framework that can fully utilize the vehicular computation resource to relieve the burden of the VEC server and further reduce the system latency. Under the proposed offloading framework, the binary reverse offloading (BRO) and partial reverse offloading (PRO) strategies are designed for two types of tasks, i.e., non-partitioned tasks and partitioned tasks. We formulate the system latency minimization problem by optimizing reverse offloading decisions, and the communication and computation resources allocation. Due to the non-convex and existing variables coupling, the original problem is transformed into the equivalent weighted-sum optimization problem. Based on the alternative optimization, we decouple the weighted-sum optimization problems into the two subproblems, and the closed-form expressions of transmission power and computation frequency of vehicles and RSU are derived. Low complexity greedy based efficient searching (GES) algorithm and joint alternative optimization based bi-section searching (JAOBSS) algorithm are proposed for BRO and PRO strategies, respectively. The algorithm complexity and performance bounds are analyzed. Simulation results show that the proposed GES algorithm can achieve optimal performance with low complexity. Besides, the proposed GES and JAOBSS algorithms can significantly improve the performance compared with other baseline schemes by 6.14% and 13.46% at least. [ABSTRACT FROM AUTHOR]

The synergy of edge computing and Machine Learning (ML) holds immense potential for revolutionizing Internet of Things (IoT) applications, particularly in scenarios characterized by high-speed, continuous data generation. Offline ML algorithms struggle with streaming data as they rely on static datasets for model construction. In contrast, Online Machine Learning (OML) adapts to changing environments by training the model with each new observation in real-time. However, developing OML algorithms introduces complexities such as bias and variance considerations, making the selection of suitable estimators challenging. In this challenging landscape, ensemble learning emerges as a promising approach, offering a strategic framework to navigate the bias-variance tradeoff and enhance prediction accuracy by amalgamating outputs from diverse ML models. This paper introduces a novel ensemble method tailored for edge computing environments, designed to efficiently operate on resource-constrained devices while accommodating various online learning scenarios. The primary objective is to enhance predictive accuracy at the edge, thereby empowering IoT applications with robust decision-making capabilities. Our study addresses the critical challenges of ML in resource-constrained edge computing environments, offering practical insights for enhancing predictive accuracy and scalability in IoT applications. To validate our ensemble's efficacy, we conducted comprehensive experimental evaluations leveraging both synthetic and real-world datasets. The results indicate that our ensemble surpassed state-of-the-art data stream algorithms and ensemble regressors across a range of regression metrics, underlining its superior predictive prowess. Furthermore, we scrutinized the ensemble's performance within the realm of auto-scaling for Virtual Network Function (VNF)-based applications situated at the network's edge, thereby elucidating its applicability and scalability in real-world scenarios. [ABSTRACT FROM AUTHOR]

In the contemporary landscape of edge computing, the deployment of services with stringent real-time requirements on edge devices is increasingly prevalent. However, the challenge of designing an effective service deployment strategy that optimally leverages both cloud and edge resources to deliver high-quality services in production environments persists, primarily due to resource constraints in edge devices. To tackle this issue, we introduce an adaptive service deployment algorithm that utilizes speedup weights for cloud-edge collaborative environments (SWD-AD). First, by comparing the execution and communication times of tasks in the cloud and at the edge, the speedup weights are calculated, and a service deployment algorithm is designed that takes into account both the speedup weights and resource consumption weights. Then, during the cluster operation, information on the task processing for each service is collected and their cumulative speedup weights are calculated. Utilizing a dynamic service adjustment strategy based on these cumulative speedup ratio weights, services are migrated between the cloud and the edge. Our performance evaluation experiments reveal that this strategy notably reduces the average response time of tasks by 29.38 and 25.86% compared to Swarm and Kubernetes (K8s) algorithms, respectively. [ABSTRACT FROM AUTHOR]