关键词： Mobile edge computing   vehicular application   analytical modelling   bursty arrivals   performance analysis  

摘要： The quantitative performance analysis plays a critical role in assessing the capability of vehicular edge computing (VEC) systems to meet the requirements of vehicular applications. However, developing accurate analytical models for VEC systems is extremely challenging due to the unique features of intelligent vehicular applications. Specifically, recent work revealed that the tasks generated by intelligent vehicular applications exhibit a high degree of burstiness, rendering the existing models that were designed based on the assumption of the non-bursty Poisson process unsuitable for VEC systems. To fill this gap, we developed an original analytical model to investigate the performance of VEC systems with bursty task arrivals. To facilitate vehicle cooperation, a new priority-based resource allocation scheme is exploited to schedule the tasks of vehicular applications, which are modelled by a Markov Modulated Poisson Process (MMPP). Next, a multi-state Markov chain is established to investigate the impact of load sharing strategy on the performance of VEC systems. Then, the end-to-end transmission latency is derived based on the proposed model. Comprehensive experiments are conducted to validate the accuracy of this analytical model under various system configurations. Furthermore, the developed model is used as a cost-effective tool to investigate the performance bottleneck of VEC systems.

关键词： Sensors   Intelligent sensors   Roads   Cloud computing   Servers   Sensor systems   Monitoring   Context-aware   edge intelligence   mobile edge computing   road monitoring system (RMS)   sensors   task offloading  

摘要： Smart vehicles equipped with onboard sensors can detect the surrounding cars, cycles, pedestrians, and other objects in real time and can make control decisions to achieve road safety. The high dynamism of vehicular mobility switches base stations in their trajectory, and at an instant, one edge server services one base station only. So, making control decisions by processing and transmitting vehicular data in real time is challenging. In this article, we propose a road monitoring system (RMS) in which moving vehicles collect road data and offload collected data to the paired edge server. The edge devices and connected vehicular networks receive road-hindering alerts. It comes up with Road Ambient Intelligence that supports ubiquitous computing and generates context-aware alerts with low latency. It uses a deep learning model for the decision-making about road-hindering alerts and a K-nearest neighbor algorithm to form clusters for the distribution of alert messages. For intense occurrences, the data are sent to the cloud server for further notifications to remote-control offices. The proposed study is compared with social vehicle route selection (SVRS) and delay tolerant processing (DTP) schemes. The performance analysis shows that rms presents 12%-44% better performance compared to the SVRS scheme and 15%-53% better compared to the DTP scheme in terms of delay. The energy requirement analysis shows that compared to SVRS, RMS involves 50% less energy when processed at edge clouds, and DTP involves 51%-65% more energy requirements compared to the RMS scheme.

关键词： mobile edge computing   sequential tasks   computation offloading   dependency  

摘要： Mobile edge computing has shown its potential in serving emerging latency-sensitive mobile applications in ultra-dense 5G networks via offloading computation workloads from the remote cloud data center to the nearby network ***,current computation offloading studies in the heterogeneous edge environment face multifaceted challenges:Dependencies among computational tasks,resource competition among multiple users,and diverse long-term *** applications typically consist of several functionalities,and one huge category of the applications can be viewed as a series of sequential *** this study,we first proposed a novel multiuser computation offloading framework for long-term sequential ***,we presented a comprehensive analysis of the task offloading process in the framework and formally defined the multiuser sequential task offloading ***,we decoupled the long-term offloading problem into multiple single time slot offloading problems and proposed a novel adaptive method to solve *** further showed the substantial performance advantage of our proposed method on the basis of extensive experiments.

关键词： Task analysis   Distributed computing   Computational modeling   Security   Resilience   Bayes methods   Privacy   Auction theory   Bayesian methods   coded distributed computing   data privacy   deep learning   game theory   incomplete information   Internet of Things   machine learning   Markov processes   mobile edge computing   pricing   reinforcement learning   resiliency   resource allocation   security  

摘要： We design a novel encoding model based on Lagrange coded computing (LCC) for private, secure, and resilient distributed mobile edge computing (MEC) systems, where multiple base stations (BSs) act as "masters" offloading their computations to edge nodes acting as "workers". A two-fold objective of the scheme is: i) efficient allocation of computing tasks to the workers;ii) providing the workers with appropriate incentives to complete their tasks. As such, each master must decide on its offloading requests to the workers including the allocated tasks and service fees to be paid. This problem is complex due to the following reasons: i) masters can be privately-owned or managed by different operators, i.e., there is no communication and no coordination among them;ii) workers are heterogeneous non-dedicated nodes with limited and nondeterministic transmission and computing resources. As a result, the masters must compete for constrained resources of workers in a stochastic partially-observable environment. To address this problem, we define the interactions between masters and workers as a direct stochastic first-price-sealed-bid (FPSB) auction. To analyze the auction, we represent it as a stochastic Bayesian game and develop a Bayesian learning framework to perfect the auction solution.

关键词： Computation offloading   MEC-enabled vehicular networks   Mobile edge computing   Task scheduling  

摘要： With the development of the mobile communication technology,a wide variety of envisioned intelligent transportation systems have emerged and put forward more stringent requirements for vehicular *** of computation-intensive and power-hungry applications result in a large amount of energy consumption and computation costs,which bring great challenges to the on-board *** is necessary to exploit traffic offloading and scheduling in vehicular networks to ensure the Quality of Experience(QoE).In this paper,a joint offloading strategy based on quantum particle swarm optimization for the Mobile Edge Computing(MEC)enabled vehicular networks is *** minimize the delay cost and energy consumption,a task execution optimization model is formulated to assign the task to the available service nodes,which includes the service vehicles and the nearby Road Side Units(RSUs).For the task offloading process via Vehicle to Vehicle(V2V)communication,a vehicle selection algorithm is introduced to obtain an optimal offloading decision ***,an improved quantum particle swarm optimization algorithm for joint offloading is proposed to optimize the task delay and energy *** maintain the diversity of the population,the crossover operator is introduced to exchange information among ***,the crossover probability is defined to improve the search ability and convergence speed of the ***,an adaptive shrinkage expansion factor is designed to improve the local search accuracy in the later *** results show that the proposed joint offloading strategy can effectively reduce the system overhead and the task completion delay under different system parameters.

关键词： Mobile edge computing   fused-layer   DNN inference   partial offloading   model parallelism  

摘要： With the rapid development of Internet-of-Things (IoT) and the explosive advance of deep learning, there is an urgent need to enable deep learning inference on IoT devices in Mobile Edge Computing (MEC). To address the computation limitation of IoT devices in processing complex Deep Neural Networks (DNNs), computation offloading is proposed as a promising approach. Recently, partial computation offloading is developed to dynamically adjust task assignment strategy in different channel conditions for better performance. In this paper, we take advantage of intrinsic DNN computation characteristics and propose a novel Fused-Layer-based (FL-based) DNN model parallelism method to accelerate inference. The key idea is that a DNN layer can be converted to several smaller layers in order to increase partial computation offloading flexibility, and thus further create the better computation offloading solution. However, there is a trade-off between computation offloading flexibility as well as model parallelism overhead. Then, we investigate the optimal DNN model parallelism and the corresponding scheduling and offloading strategies in partial computation offloading. In particular, we propose a Particle Swarm Optimization with Minimizing Waiting (PSOMW) method, which explores and updates the FL strategy, path scheduling strategy, and path offloading strategy to reduce time complexity and avoid invalid solutions. Finally, we validate the effectiveness of the proposed method in commonly used DNNs. The results show that the proposed method can reduce the DNN inference time by an average of 12.75 times compared to the legacy No FL (NFL) algorithm, and is very close to the optimal solution achieved by the Brute Force (BF) algorithm with the difference of less than 0.04%.

关键词： Resource management   Computational modeling   Servers   Numerical models   Microprocessors   Computer architecture   Task analysis   Network slicing   mobile edge computing   resource allocation   market model   game theory  

摘要： Edge computing has been recently introduced to bring computational capabilities closer to end-users of modern network-based services, supporting existing and future delay-sensitive applications by effectively addressing the high propagation delay issue that affects cloud computing. However, the problem of efficiently and fairly managing the system resources presents particular challenges due to the limited capacity of both edge nodes and wireless access networks and the heterogeneity of resources and services' requirements. To this end, we propose a techno-economic market where service providers act as buyers, securing both radio and computing resources to execute their associated end-users' jobs while being constrained by a budget limit. We design an allocation mechanism that employs convex programming to find the unique market equilibrium point that maximizes fairness while ensuring that all buyers receive their preferred resource bundle. Additionally, we derive theoretical properties that confirm how the market equilibrium approach strikes a balance between fairness and efficiency. We also propose alternative allocation mechanisms and give a comparison with the market-based mechanism. Finally, we conduct simulations to numerically analyze and compare the performance of the mechanisms and confirm the market model's theoretical properties.

关键词： Computation offloading   Dynamic game   5G networks   Mobile edge computing   Non-cooperative game  

摘要： Mobile Edge Computing (MEC) has become a promising technology for 5G networks. Computation offloading is an essential issue of MEC, which enables mobile User Equipment (UE) to enjoy rich wireless resources and huge computing power anywhere. This paper considers the Quality-of-Experience (QoE) of UEs in 5G MEC systems and presents a dynamic non-cooperative game (QCOG-DG) algorithm and a static non-cooperative game (QCOG-SG) algorithm for computation offloading of MEC applications. We establish an MEC computation offloading model by considering the QoE requirements of UEs, and discuss the communication overheads, computation cost, and energy consumption models to minimize the energy consumption and time delay of each UE. Considering that there are multiple UEs who want to offload their computation tasks to a resource-constrained MEC server, and each UE is selfish and competitive, we formulate the problem of computation offloading decision as a non-cooperative game model. We prove the existence of a Nash Equilibrium (NE) solution for the proposed game model. In addition, we propose an algorithm that jointly optimizes energy consumption and time delay under QoE preferences to achieve optimal offloading benefits for each UE. Moreover, we respectively propose a dynamic non-cooperative game (QCOG-DG) algorithm and a static non-cooperative game (QCOG-SG) algorithm to efficiently find the NE solution. Extensive simulation experiments are conducted to verify the effectiveness of the proposed MEC computation offloading model and the QCOG-DG and QCOG-SG algorithms. Simulation results show that the proposed QCOG-DG algorithm can efficiently find the NE solutions in the MEC scenarios with UEs of different sizes. (c) 2022 Elsevier Inc. All rights reserved.

关键词： Priority-based task scheduling   Resource allocation   Mobile edge computing   Cloud computing   Smart hospitals   Healthcare monitoring system  

摘要： New and innovative wearable IoT devices for health monitoring systems (HMS) have been invented one after another. However, most of these devices are resource-constrained with restricted energy and computation power. The HMS data need to be processed via mobile edge computing (MEC) to improve the response time to fulfill the latency-sensitive and computation-intensive applications and to reduce bandwidth consumption. This paper presents an efficient task scheduling and resource allocation mechanism in MEC to meet these demands in contemplating emergency conditions under HMS. We propose a priority-based task-scheduling and resource-allocation (PTS-RA) mechanism that can assign different priorities to different tasks by considering the tasks' emergency levels computed with respect to the data aggregated from a patient's smart wearable devices. The mechanism can optimally determine whether a task should be processed locally at the hospital workstations (HW) or in the cloud. This is aimed to reduce the total task processing time and the bandwidth cost as much as possible. The proposed approach is to ensure that tasks related to the emergency are given higher priorities and to run first. After the tasks' computations, results are sent to the doctor to response promptly with quick decisions. The proposed PTS-RA was benchmarked against state-of-the-art algorithms concerning average latency, task scheduling efficiency, task execution time, network usage, CPU utilization, and energy consumption. The bench marking results are promising as PTS-RA is capable to manage the emergency conditions and is meeting the latency-sensitive tasks' requirements with reduced bandwidth cost.& COPY;2023 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： mobile edge computing   computation offloading strategy   multi-agent system   deep reinforcement learning   federated learning  

摘要： With the rise of latency-sensitive and computationally intensive applications in mobile edge computing (MEC) environments, the computation offloading strategy has been widely studied to meet the low-latency demands of these applications. However, the uncertainty of various tasks and the time-varying conditions of wireless networks make it difficult for mobile devices to make efficient decisions. The existing methods also face the problems of long-delay decisions and user data privacy disclosures. In this paper, we present the FDRT, a federated learning and deep reinforcement learning-based method with two types of agents for computation offload, to minimize the system latency. FDRT uses a multi-agent collaborative computation offloading strategy, namely, DRT. DRT divides the offloading decision into whether to compute tasks locally and whether to offload tasks to MEC servers. The designed DDQN agent considers the task information, its own resources, and the network status conditions of mobile devices, and the designed D3QN agent considers these conditions of all MEC servers in the collaborative cloud-side end MEC system;both jointly learn the optimal decision. FDRT also applies federated learning to reduce communication overhead and optimize the model training of DRT by designing a new parameter aggregation method, while protecting user data privacy. The simulation results showed that DRT effectively reduced the average task execution delay by up to 50% compared with several baselines and state-of-the-art offloading strategies. FRDT also accelerates the convergence rate of multi-agent training and reduces the training time of DRT by 61.7%.