Search

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]

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]

The computing power of mobile devices is too limited to execute computation tasks fast. Mobile edge computing (MEC) allows mobile devices to offload tasks to near servers to reduce the completion time of the tasks (a.k.a makespan). The input data of some critical tasks should be encrypted before the offloading. Aiming at the security critical tasks in the MEC composed of multiple servers, this paper addresses to minimize the makespan by scheduling security-critical tasks. We provide the formulation of the problem which is generally an integer programming problem, and three effective composite heuristics CH1–CH3 are proposed to solve the problem. Task permutations are considered as solutions. We construct a greedy heuristic algorithm to calculate the value of the objective. These three composite heuristics consist of two phases: solution initialization and solution improvement. In the first phase, the solutions of all the proposed algorithms are generated by a task arrangement rule called Biggest data Task First (BTF), and then in the second phase, improved by three searching methods based on different neighborhoods including a insertion neighborhood, a swap neighborhood and a hybrid neighborhood, respectively. Experimental results show that CH1–CH3 outperform the well-known RoundRobin algorithm. Particularly, BTF is demonstrated to initialize highly qualified solutions, making contributions to the high effectiveness. Meanwhile, all the improvement methods are justified to be effective and the method based on the hybrid neighborhood achieves the best effectiveness. [ABSTRACT FROM AUTHOR]

In recent years, virtual reality (VR) has gradually entered the daily education and teaching activities from pure scientific research. In the area of assistance teaching, some typical computer softwares still play some important roles. This makes remote teaching activities can just learn voice, yet cannot possess the feeling of realistic existence. Especially in scenario of COVID-19, remote teaching activities with proper perceptibility are in urgent demand. To deal with the current challenge, this paper proposes a wireless VR-based multimedia-assisted teaching system framework under mobile edge computing networks. In this framework, cooperative edge caching and adaptive streaming based on viewport prediction are adopted to jointly improve the quality of experience (QoE) of VR users. First, we investigated the resource management problem of caching and adaptive streaming in this framework. Considering the complexity of the formulated problem, a distributed learning scheme is proposed to solve the problem. The experimental data are verified and the experimental results prove that the studied methods improve the performance of user QoE. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) provides users with low-latency, high-bandwidth, and high-reliability services by migrating the computing power of the cloud computing center to the edge of the network. It is thus being considered an effective solution for the contradiction between the limited computing capabilities of Internet of Things (IoT) devices and the rapid development of delay-sensitive real-time applications. In this study, we propose and design a container union file system based on the differencing hard disk and dynamic loading strategy to address the excessively long migration time caused by the bundling transmission of the file system and container images during container-based service migration. The proposed method involves designing a mechanism based on a remote dynamic loading strategy to avoid the downloading of all container images, thereby reducing the long preparation time before which stateless migration can begin. Furthermore, in view of the excessive latency of the edge service during the stateful migration process, a strategy for avoiding the transmission of the underlying file system and container images is designed to optimize the service interruption time and service quality degradation time. Experiments show that the proposed method and strategy can effectively reduce the migration time of container-based services. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC)-oriented solutions are essential for various 5G wireless communication systems. It is considered a key technology for future communication systems because of its capability for fulfilling a broad variety of necessities of the developing wireless terminals in the form of Intelligent Vehicles, augmented reality and virtual reality devices like huge computation, low latency and high data rate. Further, the resource package has made the research on mobile data offloading. One probable novel spectrum in the subsequent generation networks is the millimetre wave (mmWave) communication systems. It attains important attention because of its high rate. This research work, this area focuses on the delay of minimisation strategy in mmWave MEC by jointly optimising the hybrid beam-forming and also resource allocation. Here, the utilisation of a well-performing Red Deer Algorithm (RDA) is the ultimate aim of the suggested model that intends to optimise the analogue beam-forming vectors at the users, the analogue and digital beam-forming matrices at the Base Station (BS), the computation task offloading ratios and resource allocation at the MEC server. Here, the minimisation of the delay or latency is attained. The comparative analysis of the proposed model over the other models demonstrates the superiority of the proposed algorithm in assisting the mmWave MEC system. [ABSTRACT FROM AUTHOR]

This paper proposes a new metaheuristic algorithm for scheduling BoT applications, consisting of many independent tasks that can be processed in parallel, in a mobile edge computing environment under mobile device's energy constraint. We formulate this energy-constrained BoT scheduling problem as an integer program. To solve the formulated optimization problem, we propose an efficient scheduling metaheuristic that employs the whale optimization algorithm (WOA) framework to determine the most appropriate task offloading solution. We use a task sequence to represent the offloading solution. The proposed algorithm starts with using the small-size-first policy to generate the initial solution, which is identified as the best individual in the initial whale population. We develop a cost-effective mapping operator to map each whale individual onto a feasible task sequence. We further design a greedy search-based task assignment strategy to determine the assignment of BoT tasks onto MEC servers under the energy constraint, such that the completion time of BoT applications can be determined and used as the fitness value of the corresponding whale individual. Built upon the WOA framework and DM operator, we develop the metaheuristic algorithm to iteratively update the population and explore better solutions. Experimental results show that the proposed scheduling algorithm outperforms the baseline algorithm in terms of both computational efficiency and scheduling performance when scheduling BoT applications in a MEC environment. [ABSTRACT FROM AUTHOR]

In mobile edge computing environment, intelligent inference services driven by DNN are highly sensitive to latency. Recently, collaborative inference between User Devices and Edge Servers (ESs) based on Deep Neural Networks (DNN) partition has achieved success in service acceleration. However, most of the existing collaborative acceleration schemes are partitioned for a single DNN inference task, which cannot quickly make partition decisions for a set of concurrent inference tasks, and often sacrifice inference accuracy. In addition, due to the limited resources of ESs, there is resource competition among concurrent requests, which makes the partitioned tasks cannot be offloaded to ESs in time for processing. Therefore, designing an efficient offloading scheme becomes essential. The task offloading schemes based on deep reinforcement learning can solve complex decision-making problems in high-dimensional state space, but they have problems such as insufficient sample diversity and easily falling into local optimum. In this paper, a Collaborative Inference Acceleration Scheme integrating DNN Partitioning and Task Offloading (CIAS-PnO) is proposed. First, while ensuring inference accuracy, the Collaborative DNN Layer Partitioning (CDLP) algorithm is designed with the goal of optimal latency. CDLP can reduce the problem scale of concurrent inference tasks partition by pruning operation and determine the partition decisions in time. Then, the Distributed Soft Actor-Critic (SAC)-based Partition Task Offloading algorithm (DSACO) is designed. DSACO supports SAC Agents to explore samples in parallel and share learning experiences, and uses the automatic entropy adjustment mechanism to improve the exploration efficiency of Agents, so as to avoid falling into local optimum and achieve efficient offloading of partition tasks. Experimental results on DNN benchmarks show that compared with the baseline acceleration schemes, CIAS-PnO achieves more than 19.8% acceleration performance improvement, and has higher convergence performance and task success rate. [ABSTRACT FROM AUTHOR]

Aiming at the problem of long task calculation delay of traditional edge computing offloading strategy (COS), a joint caching and COS for power supply chain services under cloud edge collaborative computing environment is proposed by introducing the master-slave game model. First, for the network of information interaction between power grid system and electrical equipment suppliers, the corresponding overall model of cloud edge collaborative network is constructed by combining cloud computing, edge computing, supplier terminal communication and remote cloud. Then, the cloud-side collaborative network model is analyzed and solved by building the service function cache model, task unloading and data transmission model and power business data calculation model, respectively. Finally, by introducing the master-slave game model, the whole system is divided into three different interests of power service providers, communication providers and communication network terminal providers and the joint caching and COS for power supply chain services is given. Through simulation experiments, the proposed computing unloading strategy and the other three methods are compared and analyzed under the same experimental conditions. The results show that the service cache hit rate of the proposed method is the highest, reaching 96.35%. Compared with the other three comparison methods, it increased by 14.96%, 11.24% and 4.85%, respectively. In addition, its task computing delay is the least affected by agent computing power and agent computing resources, and its performance is better than the other three comparison methods. [ABSTRACT FROM AUTHOR]

With the rapid development of smart mobile devices, mobile applications are becoming more and more popular. Since mobile devices usually have constrained computing capacity, computation offloading to mobile edge computing (MEC) to achieve a lower latency is a promising paradigm. In this paper, we focus on the optimal offloading problem for streaming applications in MEC. We present solutions to find offloading policies of streaming applications to achieve an optimal latency. Streaming applications are modeled with synchronous data flow graphs. Two architecture assumptions are considered — with sufficient processors on both the local device and the MEC server, and with a limited number of processors on both sides. The problem is generally NP-complete. We present an exact algorithm and a heuristic algorithm for the former architecture assumption and a heuristic method for the latter. We carry out our experiments on a practical application and thousands of synthetic graphs to comprehensively evaluate our methods. The experimental results show that our methods are effective and computationally efficient. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT) and Internet technology, the product of the combination of the two, the Industrial Internet, has also received extensive attention and there are more and more research achievements related to the Industrial Internet. In the industrial Internet system, the communication network system composed of sensors, communication nodes, controllers and other intelligent devices can realize efficient and convenient data interaction between people and machines, providing an important infrastructure and technical support for industrial big data analysis and intelligent production. However, in the current industrial Internet system, industrial equipment users generally have the problem of low computing energy efficiency, and the collected industrial data has a high-security risk in the transmission, processing and other processes. At the same time, the size and scale of the industrial Internet equipment group is huge, and the lack of rational resource allocation leads to excessive waste of computing resources in the system, which is also a prominent problem of the current industrial Internet system. In response to the above questions, this paper, on the basis of reading a large number of documents, integrates the improved DRL algorithm, End-Edge-Cloud architecture and blockchain to form a new industrial Internet architecture. The architecture realizes computing offload through the three-tier structure of terminal layer, edge layer and cloud layer, and guarantees the security of industrial data through the decentralized feature of blockchain, ultimately achieving the goal of reducing energy consumption, computing overhead and trusted computing. In the architecture proposed in this paper, the dynamic unloading of industrial data and computing tasks is achieved through a three-tier architecture. The MDP is used to build an optimization problem model, and the improved DRL algorithm is used to iteratively solve the optimal computing resource scheduling strategy. The main research contents of this paper include (1) Using MDP to model optimization problems; (2) Propose an industrial Internet system architecture that integrates and improves DRL, "end edge cloud" and blockchain; (3) The MDP problem is solved iteratively based on deep reinforcement learning. The simulation results show that the proposed architecture has more advantages than the existing six architectures in terms of computing cost, equipment energy consumption and total working time. [ABSTRACT FROM AUTHOR]