Search

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]

In the Internet of Vehicles driven by mobile edge computing, the service requests are offloaded to the roadside units (RSUs) via wireless network, reducing the service latency and enhancing the utilization of resources of RSUs. However, the high mobility of vehicles leads to the frequent switching of services, decreasing the quality of service, which fails to meet the requirements of latency-sensitive vehicular services. In this paper, we proposed a latency-aware service migration method with decision theory, named LSMD. Specifically, we first model the network architecture and introduce the transmission and computation of the service requests in detail. Then, considering the high mobility of vehicles, we analyze the dynamic change of vehicle locations and transform the service migration problem into an uncertain decision optimization problem. Afterward, we find the optimal service migration strategy with the objectives of minimizing the service latency and balancing the workload on RSUs. Finally, numerical experiment results on real-world datasets demonstrate that our method outperforms the other two baselines. [ABSTRACT FROM AUTHOR]

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]

Satellite edge computing (SEC) plays an increasing role in earth observation, due to its global coverage and low-latency computing service. In SEC, it is pivotal to offload diverse observation-data-processing tasks to the appropriate satellites. Nevertheless, due to the sparse intersatellite link (ISL) connections, it is hard to gather complete information from all satellites. Moreover, the dynamic arriving tasks will also influence the obtained offloading assignment. Therefore, one daunting challenge in SEC is achieving optimal offloading assignments with consideration of the dynamic delay-sensitive tasks. In this paper, we formulate task offloading in SEC with delay-sensitive tasks as a mixed-integer linear programming problem, aiming to minimize the weighted sum of deadline violations and energy consumption. Due to the limited ISLs, we propose a fully-decentralized method, called the PI-based task offloading (PITO) algorithm. The PITO operates on each satellite in parallel and only relies on local communication via ISLs. Tasks can be directly offloaded on board without depending on any central server. To further handle the dynamic arriving tasks, we propose a re-offloading mechanism based on the match-up strategy, which reduces the tasks involved and avoids unnecessary insertion attempts by pruning. Finally, extensive experiments demonstrate that PITO outperforms state-of-the-art algorithms when solving task offloading in SEC, and the proposed re-offloading mechanism is significantly more efficient than existing methods. [ABSTRACT FROM AUTHOR]

Edge computing (EC) aided Internet of Things (IoT) based applications require real-time processing as well as high-volume data-intensive services as 5G networks evolve. It is difficult to fit IoT services into available edge nodes (ENs) while maintaining performance measures on quality of service (QoS) because of the heterogeneity, restricted resources, and changing resource demand of IoT applications. This study aims to examine a quantum healthcare model that is built on mobile edge computing networks linked with smart IoT. Serverless computing with edge computing may handle quick or small-scale tasks effectively at edge devices, lowering latency. Moreover, serverless edge computing now faces significant hurdles from security and processing performance. In order to provide trustworthy and secure edge serverless services, it is possible to use blockchain technology to boost processing speed and quantum computing to enhance security. In terms of decreasing dependency on IoT cloud analytics or storage facilities, the test results were promising. Lastly, we cover the many aspects that impact the viability of integrating an edge-IoT ecosystem, such as design, capability requirements, functional challenges, and selection criteria. [ABSTRACT FROM AUTHOR]

Federated learning (FL) in mobile edge computing has emerged as a promising machine-learning paradigm in the Internet of Things, enabling distributed training without exposing private data. It allows multiple mobile devices (MDs) to collaboratively create a global model. FL not only addresses the issue of private data exposure but also alleviates the burden on a centralized server, which is common in conventional centralized learning. However, a critical issue in FL is the imposed computing for local training on multiple MDs, which often have limited computing capabilities. This limitation poses a challenge for MDs to actively contribute to the training process. To tackle this problem, this paper proposes an adaptive dataset management (ADM) scheme, aiming to reduce the burden of local training on MDs. Through an empirical study on the influence of dataset size on accuracy improvement over communication rounds, we confirm that the amount of dataset has a reduced impact on accuracy gain. Based on this finding, we introduce a discount factor that represents the reduced impact of the size of the dataset on the accuracy gain over communication rounds. To address the ADM problem, which involves determining how much the dataset should be reduced over classes while considering both the proposed discounting factor and Kullback–Leibler divergence (KLD), a theoretical framework is presented. The ADM problem is a non-convex optimization problem. To solve it, we propose a greedy-based heuristic algorithm that determines a suboptimal solution with low complexity. Simulation results demonstrate that our proposed scheme effectively alleviates the training burden on MDs while maintaining acceptable training accuracy. [ABSTRACT FROM AUTHOR]

Timely status updating in mobile edge computing (MEC) systems has recently gained the utmost interest in internet of things (IoT) networks, where status updates may need higher computations to be interpreted. Moreover, in real-life situations, the status update streams may also be of different priority classes according to their importance and timeliness constraints. The classical disciplines used for priority service differentiation, preemptive and non-preemptive disciplines, pose a dilemma of information freshness dissatisfaction for the whole priority network. This work proposes a hybrid preemptive/non-preemptive discipline under an M/M/1/2 priority queueing model to regulate the priority-based contention of the status update streams in MEC systems. For this hybrid discipline, a probabilistic discretionary rule for preemption is deployed to govern the server and buffer access independently, introducing distinct probability parameters to control the system performance. The stochastic hybrid system approach is utilized to analyze the average age of information (AoI) along with its higher moments for any number of classes. Then, a numerical study on a three-class network is conducted by evaluating the average AoI performance and the corresponding dispersion. The numerical observations underpin the significance of the hybrid-discipline parameters in ensuring the reliability of the whole priority network. Hence, four different approaches are introduced to demonstrate the setting of these parameters. Under these approaches, some outstanding features are manifested: exploiting the buffering resources efficiently, conserving the aggregate sensing power, and optimizing the whole network satisfaction. For this last feature, a near-optimal low-complex heuristic method is proposed. [ABSTRACT FROM AUTHOR]

In the mobile edge computing (MEC) environment, the edge caching can provide the timely data response service for the intelligent scenarios. However, due to the limited storage capacity of edge nodes and the malicious node behavior, the question of how to select the cached contents and realize the decentralized security data caching faces challenges. In this paper, a blockchain-based decentralized and proactive caching strategy is proposed in an MEC environment to address this problem. The novelty is that the blockchain was adopted in an MEC environment with a proactive caching strategy based on node utility, and the corresponding optimization problem was built. The blockchain was adopted to build a secure and reliable service environment. The employed methodology is that the optimal caching strategy was achieved based on the linear relaxation technology and the interior point method. Additionally, in a content caching system, there is a trade-off between cache space and node utility, and the caching strategy was proposed to solve this problem. There was also a trade-off between the consensus process delay of blockchain and the caching latency of content. An offline consensus authentication method was adopted to reduce the influence of the consensus process delay on the content caching. The key finding was that the proposed algorithm can reduce latency and can ensure the security data caching in an IoT environment. Finally, the simulation experiment showed that the proposed algorithm can achieve up to 49.32%, 43.11%, and 34.85% improvements on the cache hit rate, the average content response latency, and the average system utility, respectively, compared to the random content caching algorithm, and it achieved up to 9.67%, 8.11%, and 5.95% increases, successively, compared to the greedy content caching algorithm. [ABSTRACT FROM AUTHOR]

An optimized container consolidation is a key factor in Mobile Edge Computing. It is a challenging problem as its complexity is NP-hard. In addition to structural properties of a network which reveal nodes features and their connectivity, we believe that the spectral properties of correlation between rows of similarity matrix of the network could be more beneficial in placement algorithm. Most existing literature focus on reducing energy consumption in cloud or edge environments based on structural properties of the given network. However, they undermine the concept of locality which could affect excessive network traffic. Our proposed method utilizes structural and spectral properties of the network to solve the problem. We expected to improve locality factor and link reduction as well as reducing the problem space by utilizing a centroid-based approach and a queue. Our proposed algorithm preserves topology architecture without consuming more energy in comparison to the existing popular algorithms. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is considered one of the key technologies for large-scale network services. Task scheduling helps to improve the task completion rate of MEC, by properly mapping tasks generated by devices onto MEC resources. However, the mobility of devices introduces complexities, potentially resulting in failed task offloading or unavailable task results. To tackle this issue, we propose a mobile-aware task scheduling scheme. We first model the trajectory of mobile devices and introduce a strategy for the fastest task offloading, coupled with an efficient result return method. Subsequently, to improve the task completion rate, we present a task scheduling model based on task migration and formulate the relevant problem as a Mixed Integer Non-linear Programming (MINLP) problem. To achieve a solution within a reasonable time complexity, we propose a Particle Swarm Optimization and Genetic Algorithm with a Rescheduling operator (PSOGAR). In PSOGAR, particles update their positions using a mating operator, while maintaining diversity by a mutation operator. In addition, a rescheduling operator is used to further improve the task completion rate. Finally, through simulation experiments, compare PSOGAR with state-of-the-art and classic algorithms. The experimental results show that PSOGAR can improve the task completion rate by 18–31% and can be applied to scenarios with tight task deadlines. [ABSTRACT FROM AUTHOR]

Mobile edge computing is an energy-efficient paradigm which has great support for resource-limited user devices performing compute-intensive programs and applications. However, limited edge resources, mobility of user equipment, growth of service requirements, and dynamic nature of service types make it a challenging task to configure computing and storage resources for executing various services on edge servers. Therefore, an adaptive joint service placement framework in the edge system with various devices of user and mobile edge servers is proposed in this paper. The proposed framework takes into account the mobility of user devices, the dynamic changes in various types of services, the cost of service placement and service usage, and optimizes the service placement scheme from the perspective of different target groups. Simultaneously, we design a deep deterministic policy gradient based service placement tuning approach in which centralized critic networks and actor networks are jointly used to improve the service placement performance. The relative evaluation results validate the effectiveness of the proposed framework and approach in improving the performance of the edge system. [ABSTRACT FROM AUTHOR]

Offloading strategies in mobile edge computing are hot research, whereas, existing offloading strategies at the edge hard handle the issues of multi-user intensive task scheduling, resulting in the poor utilization of network resource. Therefore, this makes the quality of experience for end users far from satisfactory. To address this, this paper proposes a novel joint offloading strategy consisting of the back propagation neural network and the genetic algorithm. Firstly, using the genetic algorithm optimizes the learning error of the back propagation neural network, and then energy consumption in the system and response delay are jointly optimized by the back propagation neural network. Under long-term total overhead-cost constraints, the joint strategy can achieve the search of the optimal solutions to generate superior calculated offloading results. Unlike those approaches devoting into reducing response delay only for end users, this work takes account into the total overhead-cost in the system thereby affording more efficient for application service providers. Multiple simulation results indicate that the proposed strategy can not only reduce the average response delay of the mobile edge computing system, but also remain a low average energy consumption. [ABSTRACT FROM AUTHOR]

In the field of Internet of Things, mobile communication will be deeply integrated with industrial construction, biomedicine, agricultural production, transportation and other industries to fully realize the "Internet of Everything" and realize smart city and sustainable development. This paper intends to solve problems in increasing latency and consumption of energy and security after deploying Mobile Edge Computing (MEC) servers in single cell multi-user network model, and has advocated a strategy of allocating the resources of 5G communication in regards to the protection mechanism for privacy in the environment of edge computing. First of all, solution model for the problem is characterized as a model with time delay and energy consumption. Second, privacy is used to measure the uncertainty of data in order to quantify privacy data while computing the allocation of tasks and facilitate the design of objective function. Finally, the task migration problem of minimizing energy consumption under the limitation of completion time is constructed as a nonlinear 0–1 programming problem. Besides, we design the optimal resource allocation strategy of discrete algorithm of binary particle swarm optimization (BPSO) for problem solution. Results indicate that while the quantity of users is 100, the total user expenditure of proposed method is 18.3J, which is lower than 20.0J and 30.7J of the compared methods. Moreover, the proposed method has lower latency and energy consumption, which can well balance the load of MEC servers. [ABSTRACT FROM AUTHOR]

Multi-Access Edge Computing (MEC) is known as a promising communication paradigm that enables IoT and 5G scenarios by using edge servers located in the proximity of end users. As an integral part of MEC, edge servers provide virtualized resources and host different MEC applications. Therefore, user equipment and IoT devices can offload tasks to edge servers instead of remote cloud data centers. A proper edge server placement strategy can significantly improve the performance of mobile applications. The optimum number of edge servers and their placement is a problem called edge server placement. This optimization problem is NP-hard. In recent years, the research community has made great efforts to solve this problem. To achieve Quality of Service (QoS), various metrics are considered in different research papers. However, a comprehensive overview of the different aspects of the Edge Server Placement Problem (ESPP) is still missing. This paper first highlights the edge server's importance and gives its applications. Then, it provides a comprehensive summary and taxonomies based on the objectives, applications, datasets, frameworks, and strategies of the different research on the placement of edge servers. Also, this paper summarizes the ESPP and other optimization problems raised as joint optimization problems. Finally, considering the capabilities and features of the MEC environment, some open issues are presented. [ABSTRACT FROM AUTHOR]

With the development of the Internet of Things (IoT) technology, massive amounts of sensor data in applications such as fire monitoring need to be transmitted to edge servers for timely processing. However, there is an energy-hole phenomenon in transmitting data only through terrestrial multi-hop networks. In this study, we focus on the data collection task in an unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) network, where a UAV is deployed as the mobile data collector for the ground sensor nodes (SNs) to ensure high information freshness. Meanwhile, the UAV is equipped with an edge server for data caching. We first establish a rigorous mathematical model in which the age of information (AoI) is used as a measure of information freshness, related to both the data collection time and the UAV's flight time. Then a mixed-integer non-convex optimization problem is formulated to minimize the peak AoI of the collected data. To solve the problem efficiently, we propose an iterative two-step algorithm named the AoI-minimized association and trajectory planning (AoI-MATP) algorithm. In each iteration, the optimal SN–collection point (CP) associations and CP locations for the parameter ε are first obtained by the affinity propagation clustering algorithm. The optimal UAV trajectory is found using an improved elite genetic algorithm. Simulation results show that based on the optimized ε , the AoI-MATP algorithm can achieve a balance between data collection time and flight time, reducing the peak AoI of the collected data. [ABSTRACT FROM AUTHOR]

Vehicular Edge Computing (VEC) is a crucial application of Mobile Edge Computing (MEC) in vehicular networks. In VEC networks, the computation tasks of vehicle terminals (VTs) can be offloaded to nearby MEC servers, overcoming the limitations of VTs' processing power and reducing latency caused by distant cloud communication. However, a mismatch between VTs' demanding tasks and MEC servers' limited resources can overload MEC servers, impacting Quality of Service (QoS) for computationally intensive tasks. Additionally, vehicle mobility can disrupt communication with static MEC servers, further affecting VTs' QoS. To address these challenges, this paper proposes a vehicle collaborative partial computation offloading model. This model allows VTs to offload tasks to two types of service nodes: collaborative vehicles and MEC servers. Factors like a vehicle's mobility, remaining battery power, and available computational power are also considered when evaluating its suitability for collaborative offloading. Furthermore, we design a deep reinforcement learning-based strategy for collaborative partial computation offloading that minimizes overall task delay while meeting individual latency constraints. Experimental results demonstrate that compared to traditional approaches without vehicle collaboration, this scheme significantly reduces latency and achieves a significant reduction (around 2%) in the failure rate under tighter latency constraints. [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]

Compared to cloud computing, mobile edge computing (MEC) is a promising solution for delay-sensitive applications due to its proximity to end users. Because of its ability to offload resource-intensive tasks to nearby edge servers, MEC allows a diverse range of compute- and storage-intensive applications to operate on resource-constrained devices. The optimal utilization of MEC can lead to enhanced responsiveness and quality of service, but it requires careful design from the perspective of user-base station association, virtualized resource provisioning, and task distribution. Also, considering the limited exploration of the federation concept in the existing literature, its impacts on the allocation and management of resources still remain not widely recognized. In this paper, we study the network and MEC resource scheduling problem, where some edge servers are federated, limiting resource expansion within the same federations. The integration of network and MEC is crucial, emphasizing the necessity of a joint approach. In this work, we present NAFEOS, a proposed solution formulated as a two-stage algorithm that can effectively integrate association optimization with vertical and horizontal scaling. The Stage-1 problem optimizes the user-base station association and federation assignment so that the edge servers can be utilized in a balanced manner. The following Stage-2 dynamically schedules both vertical and horizontal scaling so that the fluctuating task-offloading demands from users are fulfilled. The extensive evaluations and comparison results show that the proposed approach can effectively achieve optimal resource utilization. [ABSTRACT FROM AUTHOR]

In recent years, many mobile edge computing network solutions have enhanced data privacy and security and built a trusted network mechanism by introducing blockchain technology. However, this also complicates the task-offloading problem of blockchain-enabled mobile edge computing, and traditional evolutionary learning and single-agent reinforcement learning algorithms are difficult to solve effectively. In this paper, we propose a blockchain-enabled mobile edge computing task-offloading strategy based on multi-agent reinforcement learning. First, we innovatively propose a blockchain-enabled mobile edge computing task-offloading model by comprehensively considering optimization objectives such as task execution energy consumption, processing delay, user privacy metrics, and blockchain incentive rewards. Then, we propose a deep reinforcement learning algorithm based on multiple agents sharing a global memory pool using the actor–critic architecture, which enables each agent to acquire the experience of another agent during the training process to enhance the collaborative capability among agents and overall performance. In addition, we adopt attenuatable Gaussian noise into the action space selection process in the actor network to avoid falling into the local optimum. Finally, experiments show that this scheme's comprehensive cost calculation performance is enhanced by more than 10% compared with other multi-agent reinforcement learning algorithms. In addition, Gaussian random noise-based action space selection and a global memory pool improve the performance by 38.36% and 43.59%, respectively. [ABSTRACT FROM AUTHOR]

To address the current challenge of smart devices in healthcare Internet of things (IoT) struggling to efficiently process intensive applications in real-time, a collaborative cloud-edge offloading model tailored for ultra-dense edge computing (UDEC) networks is developed. While numerous studies have delved into the optimization of offloading in mobile edge computing (MEC), it is imperative to consider non-orthogonal multiple access (NOMA) as a physical technology when addressing the offloading optimization process in MEC. The multiuser sharing of spectrum resources in NOMA can enhance the network spectrum utilization and reduce the computational delay when users transmit computing tasks. Consequently, a model for NOMA-assisted UDEC systems is proposed. The model takes into account joint offloading decisions, computational resources, and sub-channel resources and is modeled as a complex nonlinear mixed-integer programming problem. The aim is to decrease the task execution delay and energy consumption of smart devices while ensuring that users' maximum acceptable delay for processing medical computational tasks is met efficiently and in a timely manner. Deep deterministic policy gradient (DDPG), a deep reinforcement learning method, is employed to solve the joint optimization problem. The final simulation results show that the algorithm converges well. The proposed offloading scheme can reduce the system cost by 54.5 and 69.9% in comparison with scenarios where users solely perform local computations and offload their tasks to the base station (BS). The application of NOMA communication in our offloading scheme boosts network spectrum utilization and trims down the system cost by 87.09% when contrasted with orthogonal multiple access (OMA). [ABSTRACT FROM AUTHOR]

With the evolution of 5G and Internet of Things technologies, Mobile Edge Computing (MEC) has emerged as a major computing paradigm. Compared to cloud computing, MEC integrates network control, computing, and storage to customizable, fast, reliable, and secure distributed services that are closer to the user and data site. Although a popular research topic, MEC resource management comes in many forms due to its emerging nature and there exists little consensus in the community. In this survey, we present a comprehensive review of existing research problems and relevant solutions within MEC resource management. We first describe the major problems in MEC resource allocation when the user applications have diverse performance requirements. We discuss the unique challenges caused by the dynamic nature of the environments and use cases where MEC is adopted. We also explore and categorize existing solutions that address such challenges. We particularly explore traditional optimization-based methods and deep learning-based approaches. In addition, we take a deeper dive into the most popular applications and use cases that adopt MEC paradigm and how MEC provides customized solutions for each use cases, in particular, video analytics applications. Finally, we outline the open research challenges and future directions. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) can enhance the computation capabilities of smart mobile devices for computation-intensive mobile applications via supporting computation offloading efficiently. However, the limitation of wireless resources and computational resources of edge servers often becomes the bottlenecks to realizing the developments of MEC. In order to address the computation offloading problem in the time-varying wireless networks, the offloading decisions and the allocation of radio and computation resources need to be jointly managed. Traditional optimization methods are challenging to deal with the combinatorial optimization problem in complex real-time dynamic network environments. Therefore, we propose a deep reinforcement learning (DRL)-based optimization approach, named DRJOA, which jointly optimizes offloading decisions, computation, and wireless resources allocation. The optimization algorithm based on DRL has the advantages of fast solving speed and strong generalization ability, which makes it possible to solve combinatorial optimization problems online. Simulation results show that our proposed DRJOA in this study dramatically outperforms the benchmark methods for offloading decisions and system utility. [ABSTRACT FROM AUTHOR]

The rapid increase in the number of computing intensive tasks has led to an overload of SMD (Smart Mobile Devices) computing tasks. By using MEC(Mobile Edge Computing Servers) and idle ED (Edge Devices) in the network, SMD with limited computing power can offload computing tasks to MEC and ED collaboration, and enhance system security based on the DPoR (Delegated Proof of Reputation) consensus mechanism. This study proposes a blockchain mobile edge computing offloading model based on BS AFSA (Bird Swarm Artificial Fish Swarm Algorithm), which transforms the task offloading problem into an optimization objective function to reduce the computational overhead. The improved BS AFSA is used to optimize the task delay and energy consumption, and the behavior parameters in the algorithm are constructed and the crowding factor is improved to elevate the local search accuracy in the later iteration. The simulation results show that compared with other benchmark algorithms, the proposed algorithm reduces the possibility of falling into local optimum and effectively reduces the total system cost of the joint offloading scheme. [ABSTRACT FROM AUTHOR]

The emergence of Mobile Edge Computing (MEC) not only provides low-latency computing services for the User Equipment (UE), but also extends the battery life of the UE. However, the computational resources of MEC servers are usually limited, and how to efficiently offload UE's task and allocate the resources of MEC servers has become a research hotspot in MEC. In this paper, we develop an improved arithmetic optimization algorithm (IAOA) to optimize the convergence speed and convergence accuracy of the arithmetic optimization algorithm. Then a task offloading algorithm based on IAOA is designed to reduce the cost of offloading tasks in the framework including a single MEC server and multi-UE. The proposed algorithm jointly optimizes the task offloading strategy of the UEs and the resource allocation of the MEC server, meanwhile, models the weighted sum of delay and energy consumption as the system cost, with the goal of minimizing the system cost while satisfying the delay and energy consumption constraints of the tasks. Simulation results show that the proposed algorithm can effectively reduce the system cost and achieve a performance improvement of up to 20% compared with the benchmark algorithm. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

As the fundamental mechanism in mobile edge computing (MEC), task offloading strategy is of great significance to the quality of computing services provided by MEC systems. When coping with workflow applications, the precedence relations among tasks increase the difficulty in developing task offloading strategies. This paper studies the problem of safety-critical task offloading for workflow applications in a MEC environment. Considering the precedence constraints on workflow tasks and the overhead of security services, we formulate the safety-critical workflow offloading model with the objective of jointly optimizing the total completion time and energy consumption. By using a task sequence to represent a feasible solution to the optimization model, we introduce a family of heuristics to solve the safety-critical workflow offloading problem under precedence constraints upon workflow tasks. Depending on whether the offloading solution satisfies the precedence relations among workflow tasks, task sequences can be classified into two categories, i.e., precedence-aware and precedence-unaware offloading solutions. With the satisfaction of precedence constraints, a family of heuristics by using a precedence-aware strategy and a precedence-unaware strategy is designed to offload safety-critical workflow tasks. Given an offloading sequence and the operating conditions of MEC servers, the heuristic algorithms select the currently best MEC server to offload workflow tasks. Experimental results justify the performance of the proposed algorithms in solving the safety-critical workflow offloading problem under precedence constraints. [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 Internet of Things (IoT) networks comes with many challenges, especially in network architecture designs. IoT is populated by several kinds of devices with different characteristics that are autonomously managed. These devices do not have enough resources and they require to process data in real-time. Hence, there is a need to design suitable architectures for IoT networks that are as efficient as possible. Previously, Cloud Computing (CC) seemed to provide a good solution of processing data from IoT networks. Recently, Mobile Edge Computing (MEC) seems to be offering a better solution than CC by ensuring a better Quality of Services (QoS) provisioning. As a result, many MEC solutions have emerged for QoS improvement in IoT networks. These solutions mainly focus on device resource management without considering data routing from an end-user device to another, especially when the latter are mobile and need to communicate with each other. In this paper, we propose to design an adaptive routing protocol for a MEC-based network to manage efficiently, the end-user devices' energy consumption during data routing. The proposed adaptive Mobile Edge Computing-based protocol consists of two main phases: firstly, we subdivide the network's objects into clusters by exploiting a link quality prediction algorithm. Secondly, we route the data to their destination adaptively by considering the object's movement during the routing process. As presented in the simulation results, our protocol outperforms other existing routing protocols for IoT networks in terms of energy consumption. We then propose the use of our solution for data routing in IoT networks that require huge data processing and forwarding. [ABSTRACT FROM AUTHOR]

Mobile edge computing requires more and more high-performance servers, resulting in increased energy consumption. As an effective means to reduce energy consumption, virtual machine placement (VMP) has been widely studied. In the edge computing environment, as the number of terminal device requests continues to increase, the scale of VMP becomes larger and larger, and existing research algorithms may take a long time to converge. The reason is that as the number of VMs increases, the search space of the policy becomes larger and the agent needs to interact with the environment for a longer time to make the best decision. In addition, existing research methods only consider reducing energy consumption, rarely consider the response latency of virtual machines, and almost ignore the dynamic changes of the edge environment. To overcome these drawbacks, we propose a virtual machine placement algorithm based on meta-reinforcement learning, which consists of an inner and outer loop. The inner loop designs a deep reinforcement learning algorithm combined with the order exchange and migration mechanism to generate the best decision, and the outer loop provides meta-strategy parameters for the inner loop based on meta-learning to accelerate the convergence capability of the inner loop, thereby obtaining efficient virtual machine placement decisions quickly from a new environment. Through simulation experiments, we demonstrate that our approach effectively reduces the energy consumption of the edge server and the response latency of VMs at different problem sizes compared to the three baseline algorithms. At the same time, it quickly adapts to the new environment with only a small number of gradient updates. [ABSTRACT FROM AUTHOR]

At present, the mainstream solution of edge computing offloading is to model it as a multi-objective optimization problem to minimize energy consumption and delay. Different from the existing research, this paper mainly considered that tasks in different unloading areas had certain similarity in edge computing, which could be used to accelerate the convergence speed and solution effect of the algorithm. Based on this, this paper proposed an evolutionary multi-task multi-objective optimization algorithm to solve task offloading problems in different regions based on evolutionary multi-task optimization. This algorithm considered multiple independent regions to be optimized. It modeled the task offloading system model for each region as a multi-objective optimization problem, dynamically adjusting the communication level of the population by learning the user distribution in different regions and the similarity of the tasks to be processed, accelerating convergence speed, and achieving optimization for two different regions through one evolution. The experimental results show that the proposed algorithm has achieved good results in convergence speed and the uniformity of the optimal solution distribution, and can obtain the unloading deployment optimization scheme under edge computing. [ABSTRACT FROM AUTHOR]

Computation-intensive applications offloading is challenging, especially in the designated regions where communication infrastructure is absent or compromised. In this paper, we present a Space–Air–Ground integrated Mobile Edge Computing (SAGiMEC) system for these regions to provide quality computational services, where the unmanned aerial vehicles (UAVs) act as in-fight edge servers to provide low-latency edge computing and the satellite provides resident cloud computing. A joint optimization problem is formulated considering UAV deployment, ground device (GD) access, and computation offloading to minimize the system average response latency. To cope with the problem's complexity, we propose a Particle Swarm Optimization (PSO) and Greedy Strategy (GS)-based algorithm (PSO&GS) to obtain an approximate optimal solution. Extensive simulations validate the convergence of the proposed algorithm. Numerical results show that the proposed approach has excellent convergence, and the system average response latency is about 0.65x–0.85x that of the benchmark algorithm. [ABSTRACT FROM AUTHOR]

The continual development of mobile edge computing efficiently solves the problem that mobile devices are unable to handle computation-intensive tasks due to their computation capacity and battery restrictions. In this paper, we consider mobile awareness and dynamic battery charging in a multi-user and multi-server mobile edge computing system, where various tasks are generated successively on the user devices. Servers act as learning agents and collaborate with user devices to develop task partitioning and computation resource allocation strategies. With the purpose of decreasing task failure rate and improving system utility in the long term, which is closely related to latency, energy consumption, and server cost, optimal strategies are demanded by the system. We model the joint optimization problem as a multi-agent Markov decision process game. And a deep reinforcement learning method based on the multi-agent deep deterministic policy gradient algorithm is proposed, which employs neural networks and works in a centralized training and decentralized execution manner to optimize the strategies. Finally, simulation results demonstrate the effectiveness of our proposed algorithm in terms of reducing task failure rate and improving system utility. [ABSTRACT FROM AUTHOR]

Multi-Access Edge Computing (MEC) attracts much attention from the scientific community due to its scientific, technical, and commercial implications. In particular, the European Telecommunications Standards Institute (ETSI) standard convergence consolidates the discussions around MEC. Still, the existing MEC practical initiatives are incomplete in their majority, hardening or invalidating their effective deployment. To fill this gap, it is essential to understand a series of experimental prototypes, implementations, and deployments. The early implementations can reveal the potential, the limitations, the related technologies, and the development tools for MEC adoption. In this context, this work first brings a discussion on existing MEC initiatives regarding the use cases they target and their vision (i.e., whether they are more network-related or more distributed systems). Second, we survey MEC practical initiatives according to their strategies, including the ETSI MEC standard. Besides, we compare the strategies according to related limitations, impact, and deployment efforts.We also survey the existing tools making MEC systems a reality. Finally, we give hints to issues yet to be addressed in practice. By bringing a better comprehension of MEC initiatives, we believe this survey will help researchers and developers design their own MEC systems or improve and simplify the usability of existing ones. [ABSTRACT FROM AUTHOR]

Summary: Human‐centered systems play an important role in the modern world, for example, driverless car, autonomous and smart vehicles, drones, and robotics. The internet of things environment demands a faster real‐time response depending on the applications processed in a particular duration. Mobile edge computing (MEC) allows a user to get a real‐time response as compared with cloud computing (CC), although ensuring a number of security attributes in MEC environment remains challenging. In this article, a protocol is designed to achieve mutual authentication, anonymous communication, and security against traceability, as these are very crucial factors to ensure the security of data and user's privacy. Moreover, the proposed scheme ensures mutual authentication between a mobile user and an edge server along with the user's anonymity and untraceability. The proof of security and evaluation of performance of the scheme validates that it ensures security attributes and improves efficiency in terms of communication and computation overheads. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) is a pivotal technology in the next generation of communication, allowing for direct task offloading between mobile devices (MDs) to improve the efficient utilization of idle resources. This paper proposes a novel algorithm for dynamic task offloading between the active MDs and the idle MDs in a D2D–MEC (mobile edge computing) system by deploying multi-agent deep reinforcement learning (DRL) to minimize the long-term average delay of delay-sensitive tasks under deadline constraints. Our core innovation is a dynamic partitioning scheme for idle and active devices in the D2D–MEC system, accounting for stochastic task arrivals and multi-time-slot task execution, which has been insufficiently explored in the existing literature. We adopt a queue-based system to formulate a dynamic task offloading optimization problem. To address the challenges of large action space and the coupling of actions across time slots, we model the problem as a Markov decision process (MDP) and perform multi-agent DRL through multi-agent proximal policy optimization (MAPPO). We employ a centralized training with decentralized execution (CTDE) framework to enable each MD to make offloading decisions solely based on its local system state. Extensive simulations demonstrate the efficiency and fast convergence of our algorithm. In comparison to the existing sub-optimal results deploying single-agent DRL, our algorithm reduces the average task completion delay by 11.0% and the ratio of dropped tasks by 17.0%. Our proposed algorithm is particularly pertinent to sensor networks, where mobile devices equipped with sensors generate a substantial volume of data that requires timely processing to ensure quality of experience (QoE) and meet the service-level agreements (SLAs) of delay-sensitive applications. [ABSTRACT FROM AUTHOR]

With the rapid development of innovative applications, lots of computation-intensive and delay-sensitive tasks are emerging. Task offloading, which is regarded as a key technology in the emerging mobile edge computing paradigm, aims at offloading the tasks from mobile devices (MDs) to edge servers or the remote cloud to reduce system delay and energy consumption of MDs. However, most existing task offloading studies either didn't consider the dependencies among tasks or simply designed heuristic schemes to solve dependent task offloading problems. Different from these studies, we propose a deep reinforcement learning (DRL) based task offloading scheme to jointly offload tasks with dependencies. Specifically, we model the dependencies among tasks by directed acyclic graphs and formulate the task offloading problem as minimizing the average cost of energy and time (CET) of users. To solve this NP-hard problem, we propose a deep Q-network learning-based framework that creatively utilizes deep neural networks to extract system features. Simulation results show that our proposed scheme outperforms the existing DRL scheme and heuristic scheme in reducing the average CET of all users and can obtain near-optimal solutions. [ABSTRACT FROM AUTHOR]

Computation-intensive vehicle tasks sharply increase with the rapid growth of intelligent vehicles. The technology of Mobile Edge Computing (MEC) has the possibility of assisting vehicles with computation offloading. To solve the problem of computation resource management and guarantee the security of resource transaction, we jointly combine the MEC network and the blockchain networks to build a blockchain based MEC offloading model. The non-cooperative interactions between MEC server and vehicles formulate a two-stage Stackelberg game in an aim to maximize their benefits and information security. We theoretically demonstrate the unique existence of Nash equilibrium, which enables participants to decide their optimal strategies. Finally, the performance of the proposed model is analyzed by conducting simulation experiments. Our proposed model optimizes resource allocation and also improves the security of the whole network. [ABSTRACT FROM AUTHOR]

In the ultra-reliable, low-latency next-generation mobile network (beyond 5G or 6G), a resource-constrained unmanned aerial vehicle (UAV) user needs continuous energy-providing and mobile edge computing (MEC) facilities. In this study, we deploy the radio frequency (RF) power station to provide energy to the UAV, accompanied by simultaneous transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) to assist a UAV user in offloading its tasks. In particular, this system consists of a power station, a UAV, and two access points, each of which has an MEC server and a STAR RIS installed within the building. The power station can transfer wireless power to the UAV via RF waves. A UAV user can apply the non-orthogonal multiple access (NOMA) schemes to offload its tasks to access points via STAR-RIS. In order to evaluate and optimize the performance, we derive the approximately closed-form expression for successful computation and energy outage probabilities by using the statistical characteristics of channel gains. Moreover, we introduced problem-solving based on a real-coded genetic algorithm (PRGA) to determine the optimal resource parameters and attain the highest system performance. Based on these criteria, we investigate the behaviors of a proposed system according to the system's critical parameters, such as time switching ratio, transmit power, power allocation coefficient, data dividing ratio, number of elements of STAR-RIS, and altitude of the UAV. We also provide computer simulation results to validate our analysis. Finally, the research results have revealed that STAR-RIS can improve the performance of MEC networks by creating a smart communication environment. [ABSTRACT FROM AUTHOR]

As users have higher and higher requirements for the quality of experience, traditional cloud computing is gradually unable to meet the needs of user equipments. Hence mobile edge computing networks mounted by unmanned aerial vehicles are introduced to improve user experience and reduce energy consumption. However, most current work is based on neural networks, which require large amounts of labeled data or long training times. Given these challenges, this paper proposes an energy-efficient multi-stage alternating optimization scheme to reduce the weighted energy consumption of the entire network. We analyze the energy consumption of each device and formulate a non-convex optimization problem. Considering the impact of task offloading, resource allocation, and path planning on network energy consumption, we transform the energy consumption problem into three subproblems. And use the coordinate descent algorithm, interior point method, and successive convex approximation method to optimize them alternately. The simulation results show that the proposed optimization scheme can significantly reduce the network's total energy consumption. [ABSTRACT FROM AUTHOR]

With the development of Mobile Edge Computing, driverless, 5 G, and related techniques, Edge-Cloud based Urban Intelligent Video Systems are extremely promising to support public safety through powerful analysis and timely response. Furtherly, flexible Unmanned Ground Vehicles(UGVs), which are equipped with edge devices, can enhance these edge systems to withstand these abnormalities: natural disasters, abnormal crowd flows, and other emergencies. In this regard, as a critical issue in edge systems, task placement in these systems needs to consider these "mobile" edge nodes: ICVs(UGVs). Therefore, a novel and effective framework named Optimized Centroids K-means based Task Placement framework is proposed: we firstly involve the clustering approach to optimize initial centroids as the positions of ICVs in terms of Edge Nodes, various typical optimization methods can be utilized to place related edge tasks effectively. The experimental results demonstrate that our novel framework has a great improvement over several existing typical strategies and supports multiple optimization methods well in this paper. [ABSTRACT FROM AUTHOR]

With the increasing complexity of autonomous driving tasks, the computational demands on single vehicular computing units have escalated, more and more tasks need to be offloaded to the edge. These tasks vary in latency sensitivity: real-time tasks, critical for passenger safety, require strict deadline adherence, whereas the latency of standard tasks mainly affects the user experience and has more flexible constraints. Addressing the challenge of selecting suitable edge computing nodes to enhance the offloading success rate of real-time tasks amidst a vast and heterogeneous cluster becomes crucial. This paper introduces the adaptive priority-based hierarchical task offloading (APHTO) algorithm, which optimizes task offloading strategies by accounting for the diverse latency constraints of different task types. Experiments demonstrate that under optimal performance conditions, APHTO significantly outperforms existing algorithms such as Min–Min, Max–Min, CUS, and FMS in reducing task latency by 20.31%, increasing offloading success rates by 35.83%, and improving resource utilization by 30.21%, marking a substantial advancement in task offloading strategies for autonomous driving integrated with MEC. [ABSTRACT FROM AUTHOR]

With the drastic development of Internet of things, the number of connected mobile users (MUs) is increasing at an unprecedented speed. The increasing popularity of MUs has triggered more and more new mobile applications. However, these applications are sensitive to latency, which inevitably increases pressure on MUs. Fortunately, computation offloading of mobile edge computing is becoming a promising technology that can improve quality of service for MUs. However, it becomes much difficult when there are multiple edge servers (ESs) near to the MU, even to the multiple MUs. On the other hand, as the resources of ESs are heterogeneous and finite, and thus it is challenge to design effective offloading strategies for multiple MUs. To tackle the above challenges, we firstly establish a multi-objective optimization model concerning time consumption and energy consumption of MUs, and resource utilization of ESs. Moreover, we devise an end-edge-cloud collaborative computing offloading method based on improved Strength Pareto Evolutionary Algorithm 2 for addressing this mode. Finally, compared to benchmark methods, numerous experiments have proved that our proposed method is effective and efficient and can be widely used for the scenario of multiple MUs and multiple heterogeneous ESs. [ABSTRACT FROM AUTHOR]

In the current internet of things era, various devices can provide more services by connecting to the Internet. However, the explosive growth of connected devices will cause cloud core overload and significant network delays. To overcome these overload and delay problems, the mobile edge computing (MEC) network is proposed to provide most of the computing and storage near the radio access network to reduce the traffic of the core cloud network and provide lower latency for the terminal. Mobile edge computing can work with third parties to develop multiple services, such as mobile big data analysis and context-aware services. However, while using the service, it may also encounter a large amount of popular data being accessed in a short period of time. Without proper handling of replica generation and deployment, even in low-latency environments, it can still kill the benefits of MEC due to increased access time. Although many scholars have proposed related issues for copy replication, there are still.parts that can be improved. To avoid the situation of insufficient availability of replicas, replica replication is performed, but infinite replicas may lead to a significant increase in traffic and waste of resources. And when deploying replicas, it is necessary to avoid placing them on congested nodes and consider how to achieve better load balancing. To improve the above problems, we synthesize the advantages of previous algorithms, make up for the shortcomings, and propose an adaptive replica configuration mechanism to predict the popularity of files and replicate replicas to low-blocking nodes. This method spreads the subsequent access workload by copying the popular file in advance to improve the system's overall performance. [ABSTRACT FROM AUTHOR]

The combination of idle computing resources in mobile devices and the computing capacity of mobile edge servers enables all available devices in an edge network to complete all computing tasks in coordination to effectively improve the computing capacity of the edge network. This is a research hotspot for 5G technology applications and integrating collaborative computing techniques into edge computing. Previous research has focused on the minimum energy consumption and/or delay to determine the formulation of the computational offloading strategy but neglected the cost required for the computation of collaborative devices (mobile devices, mobile edge servers, etc.); therefore, we propose a cost-based collaborative computation offloading model. In this model, when a task requests these devices' assistance in computing, it needs to pay the corresponding calculation cost; and on this basis, the task is offloaded and computed. In addition, for the model, we propose an adaptive neighborhood search based on simulated annealing algorithm (ANSSA) to jointly optimize the offloading decision and resource allocation with the goal of minimizing the sum of both the energy consumption and calculation cost. The adaptive mechanism enables different operators to update the probability of selection according to historical experience and environmental perception, which makes the individual evolution have certain autonomy. A large number of experiments conducted on different scales of mobile user instances show that the ANSSA can obtain satisfactory time performance with guaranteed solution quality. The experimental results demonstrate the superiority of the mobile edge computing (MEC) offloading system. It is of great significance to strike a balance between maintaining the life cycle of smart mobile devices and breaking the performance bottleneck of MEC servers. [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]

In this paper, we consider an integrated sensing, communication, and computation (ISCC) system to alleviate the spectrum congestion and computation burden problem. Specifically, while serving communication users, a base station (BS) actively engages in sensing targets and collaborates seamlessly with the edge server to concurrently process the acquired sensing data for efficient target recognition. A significant challenge in edge computing systems arises from the inherent uncertainty in computations, mainly stemming from the unpredictable complexity of tasks. With this consideration, we address the computation uncertainty by formulating a robust communication and computing resource allocation problem in ISCC systems. The primary goal of the system is to minimize total energy consumption while adhering to perception and delay constraints. This is achieved through the optimization of transmit beamforming, offloading ratio, and computing resource allocation, effectively managing the trade-offs between local execution and edge computing. To overcome this challenge, we employ a Markov decision process (MDP) in conjunction with the proximal policy optimization (PPO) algorithm, establishing an adaptive learning strategy. The proposed algorithm stands out for its rapid training speed, ensuring compliance with latency requirements for perception and computation in applications. Simulation results highlight its robustness and effectiveness within ISCC systems compared to baseline approaches. [ABSTRACT FROM AUTHOR]

The development of 5G/6G aims to provide high mobile computing with ultra-reliable low latency. The implementation of latency-sensitive computing applications is causing the overall cost management of the network to be a challenging issue. A Device-to-Device (D2D) underlay mobile edge computation offloading system has been developed to achieve these goals. This work intends to create a mobile edge computing (MEC)-D2D underlay system with cost optimization using the price elasticity log-log model (PEL2M). In this system, the task computation of each device can be partially offloaded to the edge server and nearby mobile helper. This work focuses on minimizing the computation cost of the network with computation and communication constraints. The optimization problem P1 is formulated as a mixed-integer nonlinear programming problem (MINLP). The problem P1 is split up into two sub-problems denoted by P2 and P3, respectively. The solution to P2 optimizes the task division ratio to meet delay tolerance. The solution to P3 minimizes energy consumption by using the price elasticity log-log model (PEL2M). Numerical results show that the proposed PEL2M better than MEC system with binary offloading (MECBO), MEC system with partial offloading (MECPO), Mobile edge computing and device-to-device underlay system with partial offloading (MECD2DUPO), Brute-force algorithm and Hungarian algorithm in terms of reduction in energy consumption by 72.71, 73.24, 66, 70.15, and 66.30%, and the latency is reduced by 88.4, 16.89, 9.5, 11.02, and 9%, respectively. The proposed algorithm may be applied to solve various latency-constrained applications in medical fields, vehicular communication, etc. [ABSTRACT FROM AUTHOR]

Computation offloading has received a significant amount of attention in recent years, with many researchers proposing joint offloading decision and resource allocation schemes. However, although existing delay minimization schemes achieve minimum delay costs, they do so at the cost of losing possible further maximization of the number of serviced requests. Furthermore, the asymmetry between uplink and downlink poses challenges to resource allocation in edge computing. This paper addresses this issue by formulating the joint computation offloading and edge resource allocation problem as a mixed-integer nonlinear programming (MINLP) problem in an edge-enabled asymmetrical network. Leveraging the margin between a delay-minimum scheme and a near-deadline scheme, a water pumping and refilling (WPR) algorithm is proposed to maximize the number of accepted requests. The WPR algorithm can function both as a supplementary algorithm to a given offloading scheme and as a standalone algorithm to obtain a resource allocation scheme following a customizable refilling policy. The simulation results demonstrated that the proposed algorithm outperforms delay-minimum schemes in achieving a high acceptance ratio. [ABSTRACT FROM AUTHOR]

With the rapid development of 5G and the Internet of Things (IoT), the traditional cloud computing architecture struggle to support the booming computation-intensive and latency-sensitive applications. Mobile edge computing (MEC) has emerged as a solution which enables abundant IoT tasks to be offloaded to edge services. However, task offloading and resource allocation remain challenges in MEC framework. In this paper, we add the total number of offloaded tasks to the optimization objective and apply algorithm called Deep Learning Trained by Genetic Algorithm (DL-GA) to maximize the value function, which is defined as a weighted sum of energy consumption, latency, and the number of offloaded tasks. First, we use GA to optimize the task offloading scheme and store the states and labels of scenario. Each state consists of five parameters: the IDs of all tasks generated in this scenario, the cost of each task, whether the task is offloaded, bandwidth occupied by offloaded task and remaining bandwidth of edge server. The labels are the tasks that are currently selected for offloading. Then, these states and labels will be used to train neural network. Finally, the trained neural network can quickly give optimization solutions. Simulation results show that DL-GA can execute 75 to 450 times faster than GA without losing much optimization power. At the same time, DL-GA has stronger optimization capability compared to Deep Q-Learning Network (DQN). [ABSTRACT FROM AUTHOR]