Search

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

The stochastic geometry modeling and analysis of mobile edge computing (MEC) networks contribute to the effective network configuration. Most prior works investigate the MEC network performance by spatial averaging the topological randomness, which can hide the differences among users and result in inaccurate analytical results. To address this limitation, an analytical framework is developed to study the meta distribution of the task offloading performance. We consider the Poisson MEC network where the users with dynamic task requests offload the tasks to the MEC server. Given the model, the $b$ -th moment and the meta distribution of the success task offloading probability are first analyzed. Further, the exact yet convenient approximation of the MEC computing load is derived, based on which the edge computing delay is obtained. Our results demonstrate that the proposed meta-analytical framework allows tractable yet accurate analytical results, and provides additional fine-grained information about MEC-network planning. [ABSTRACT FROM AUTHOR]

The number of individuals and groups of users offloading independent and inter-related computational tasks to mobile edge computing (MEC) servers is rapidly increasing, thus overloading them and raising the risk of service interruptions. Hence, reactive service replication has been suggested to enable individuals and groups of users to access services from remote edge servers, thus guaranteeing system scalability. This paper proposes a task offloading and service replication scheme on local and remote MEC servers. The scheme minimizes the response time of all users while satisfying the delay requirements of user groups in traffic-heavy and multimedia-intense applications (e.g., online gaming, multimedia conferencing, augmenting reality). We formulate an integer linear problem that minimizes the average response time of all users while satisfying the time and time difference constraints of the user groups running the same applications. We then use linear relaxation programming using Lagrangian analysis and solve the problem using a numerical solver. In addition, we compare the optimal solution to distance-based and resource-based greedy approaches. The results demonstrate the merits of our proposed optimized decision scheme compared to these two greedy approaches. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) and millimeter wave (mmWave) communications are capable of significantly reducing the network's delay and enhancing its capacity. In this paper we investigate a mmWave and device-to-device (D2D) assisted MEC system, in which user A carries out some computational tasks and shares the results with user B with the aid of a base station (BS). We assume partial offloading model and the task can be partitioned into two portions: the first part is computed locally at user A, while the second part is transmitted to the BS and computed by the MEC server. The computational results are then sent to user B through a D2D link and via the link from the BS to user B, respectively. To support computation offloading, both the users and the BS are equipped with multiple antennas and employ analog and digital (A/D) hybrid beamforming. Moreover, we propose a novel two-timescale joint hybrid beamforming and task allocation algorithm to reduce the system latency whilst cut down the required signaling overhead. Specifically, the high-dimensional analog beamforming matrices are updated in a frame-based manner based on the channel state information (CSI) samples, where each frame consists of a number of time slots, while the low-dimensional digital beamforming matrices and the offloading ratio are optimized more frequently relied on the low-dimensional effective channel matrices in each time slot. A stochastic successive convex approximation (SSCA) based algorithm is developed to design the long-term analog beamforming matrices. As for the short-term variables, the digital beamforming matrices are optimized relying on the innovative penalty-concave convex procedure (penalty-CCCP) for handling the mmWave non-linear transmit power constraint, and the offloading ratio can be obtained via the derived closed-form solution. Simulation results verify the effectiveness of the proposed algorithm by comparing the benchmarks. [ABSTRACT FROM AUTHOR]

In the Internet of Vehicles (IoV) scenarios, vehicles are equipped with computing resources to support vehicle-oriented IoV applications. Meanwhile, these computing resources can be also leveraged to enhance the task processing performance for the devices in Multi-access Edge Computing (MEC) scenarios, and alleviate the load of edge servers. Existing research works rarely consider the resource utilization of moving vehicles, which can be an important complement to the MEC schemes with the assistance of parked vehicles. In this paper, a joint task offloading and resource allocation scheme is proposed for a parked-and-moving-vehicles-assisted MEC scenario consisting of multiple devices, parked vehicles, and moving vehicles covered by a Base Station (BS) equipped with an edge server. The tasks of the devices can be either offloaded to the BS or further offloaded from the BS to the vehicles. The service time that a moving vehicle can provide its task offloading service before it moves out of the coverage of the BS, are taken into account of our system model. The aim of our scheme it to minimize the total priority-weighted task processing delay for all the devices through offloading the tasks to the edge server or to the vehicles, allocating the wireless channels of the BS, and allocating the computing resource of the edge server and the vehicles. A generalized benders decomposition and reformulation linearization-based iterative algorithm is designed to obtain the optimal solution to the optimization problem, and a two-stage heuristic algorithm is also given to provide near-optimal solutions with low computational complexity. The simulation results demonstrate the superiority of our scheme in seven different scenarios by comparing it with three other schemes. [ABSTRACT FROM AUTHOR]

A secure mobile edge computing (MEC) framework, which leverages free space optics (FSO) to provision backhauling from drone-mounted base stations (DBSs) to a macro base station (MBS), is proposed. DBSs can work as computing nodes to provide computing services to user equipments (UEs) as well as relays to forward the tasks to the MBS at the same time. Both DBSs and MBS are provisioned with servers. UEs can offload their tasks to the MBS directly, DBSs directly, or the MBS via a DBS. The DBSs are to be placed at the optimal locations to provide computing services and uplink communications for the ground UEs. We then formulate the joinT bandwidth and computation rEsource assignment, DBS traNsmisSion power contrOl, UE power contRol, UE association and DBS placement (TENSOR) problem to jointly maximize the average secrecy rate and minimize the task completion time. Since TENSOR is a mixed-integer nonlinear problem, we decompose it into four sub-problems: resource (bandwidth and computation) assignment and DBS transmission power control problem, UE power control problem, UE association problem, and DBS placement problem. Successive convex approximation and an iterative algorithm are leveraged to solve the four sub-problems separately. In each iteration, we use the output of the first three as the input for the fourth. The performance of our algorithm is superior to the greedy algorithm, block search placement algorithm, and equally shared resource allocation algorithm upon which the average secrecy rate is improved by at least 19%. [ABSTRACT FROM AUTHOR]

Edge computing-based framework is capable of improving users’ quality of experience in cognitive Internet of Things (IoT) networks. To explore the advantages of this edge computing-based framework, possible offloading and processing delay resulting from computation bottlenecks, and the offloading latency caused due to inter-cell interference must be properly considered. This paper thus considered a multi-class channel access mechanism for cognitive edge computing-based IoT networks where IoT users were categorized based on their quality of experience requirements. Essential IoT devices are permitted to offload to the edge server at any time following the hybrid channel access model, while delay-tolerant IoT devices are only permitted to offload to the server when the channel is idle following the overlay channel access model. Analyses were obtained for transmission rate and offloading delay to demonstrate the performance of the proposed mechanism, while important metrics such as total offloading latency and total offloading cost were investigated. The total offloading costs were formulated through the mixed strategy Nash equilibrium method. The proposed mechanism achieves lower offloading latencies and costs for both type 1 and type 2 CUs when compared with existing methods. The obtained results showed that multi-class channel access mechanisms can reduce packet offloading delay in cognitive edge computing-based IoT networks. [ABSTRACT FROM AUTHOR]

High-level autonomous decision making system is one of the key technologies in intelligent transportation networks, it requires the traffic information within a certain range of vehicles in real time. When the traffic roads become congested or the roadside units (RSUs) are unaccessed beyond the communication range, the unmanned aerial vehicle (UAV)-assisted vehicular edge computing network (VECN) is considered as a potential solution. In this paper, we propose a learning based channel allocation and task offloading strategy in temporary UAV-assisted VECNs from a user perspective, in which the UAV passing temporarily can serve as the relay and edge computing node to support the decision making system. However, the limited available computation resources and time-varying communication channel states make it critical to process the received computing tasks. To address the above mentioned challenges, we design an efficient data transmission strategy combined the long-term evolution vehicle-to-everything (LTE-V2X) and time-division multiple access (TDMA) technologies firstly, then, we propose a multi-option task processing scheme, a service cost minimization problem is proposed where the integral decisions of channel allocation and task processing mode selection are jointly optimized. Under dynamic computing resources and the current data transmission conditions, the UAV selects an optimal task processing service model based on deep reinforcement learning (DRL) algorithm. Simulation results show the proposed strategy greatly improves the data transmission efficiency. [ABSTRACT FROM AUTHOR]

Edge computing has been regarded as an enabling technology for supporting future smart applications, such as industrial Internet of Things. In this paper, a novel computation offloading framework for edge computing is proposed. Unlike existing studies, this work considers that end users can intentionally reserve some time for local pre-processing before requesting the computation offloading service (instead of always declaring their offloading requests immediately when heavy-duty tasks are generated). By doing so, each task’s offloading cost may decrease because of less edge resource demand, while the delay cost may increase due to the later report of its offloading request. Furthermore, end users can select their preferred priority levels in the offloading scheduling by paying premium service charges. To maximize the individual utility, each end user may strategically and jointly determine its local pre-processing time-length and priority selection in computation offloading. For characterizing strategic interactions among end users and the quality-of-service (QoS) of the scheduling system with congested nature, a computation offloading game built upon a queueing model is formulated. On top of this, a revenue maximization problem for the interest of edge operator is also investigated. Simulations evaluate the performance of the proposed solution, and shows its superiority over counterparts. [ABSTRACT FROM AUTHOR]

Extensive delay-sensitive and computation-intensive tasks are involved in emerging vehicular applications. These tasks can hardly be all processed by the resource constrained vehicle alone, nor fully offloaded to edge facilities (like road side units) due to their incomplete coverage. To this end, we refer to the new paradigm of vehicular collaborative edge computing (VCEC) and make the best use of vehicles’ idle and redundant resources for energy consumption reduction within the VCEC system. To realize this target, we are faced with several nontrivial challenges, including short-term decision making coupled with long-term queue delay constraints, information uncertainty, and task offloading conflicts. Accordingly, we apply Lyapunov optimization to decouple the original problem into three sub-problems and then tackle them one by one: the first sub-problem is resolved by Lagrange multiplier method; the second is handled by UCB learning-matching approach; the third is addressed by a carefully designed greedy method. Scenarios without volatility and real-world road topology with realistic vehicular traffics are utilized to evaluate the proposed solution. Results from extensive numerical simulations demonstrate that our solution can achieve superior performances compared with the benchmark methods, in terms of energy consumption, learning regret, task backlog, and end-to-end delay. [ABSTRACT FROM AUTHOR]

Mobile vehicles have been considered as potential edge servers to provide computation resources for the emerging Intelligent Transportation System (ITS) applications. However, how to fully utilize the mobile computation resources to satisfy the real-time arrived computation requests has not been explored yet. This work will address the critical challenges of limited computation resources, stringent computation delay and unknown requirement statistics of real-time tasks in realistic vehicular edge computing scenarios. Specifically, we design a distributed clustering strategy to classify vehicles into multiple cooperative edge servers according to the available computation resources, effective connection time and the distribution of tasks’ expected deadlines. Then, a ‘Less than or Equal to’ Generalized Assignment Problem (i.e., LEGAP) is formulated to maximize the system service revenue, and on this basis, we propose an offline Bound-and-Bound based Optimal (BBO) algorithm to make periodical scheduling with a global view of tasks’ requirement statistics. The quick branching is conducted by following a greedy solution and the upper bound at each branch is derived by solving a multiple-choice knapsack problem. In addition, we present an online heuristic algorithm which makes real-time offloading decision with the guarantees that the resource capacities of all the computing servers are never exceeded with new tasks arriving. Through comparing with the other four online algorithms, the BBO algorithm achieves the highest service revenues by offloading tasks with shorter delays, and the online heuristic algorithm has the best performance in improving the service ratios. [ABSTRACT FROM AUTHOR]

Parked vehicle-assisted multi-access edge computing (PVMEC) is a paradigm that exploits the under-utilized resources of parked vehicles (PVs) to assist MEC servers for offloaded task execution. This article investigates a partial offloading strategy for multi-user PVMEC, where each mobile device (MD)’s task can be partially offloaded to the MEC server or a nearby PV. We formulate the system utility maximization problem with joint consideration of offloading decisions, offloading ratio, and resource allocation. Considering the complexity and privacy issues of centralized scheme as well as the inherent resource contention among MDs, we adopt game-theoretic approach to devise a low-complexity distributed offloading scheme, in which the offloading decision-making problem is modeled as an exact potential game, and the optimal offloading ratio and resource allocation are determined using a subgradient method. Finally, simulation results show that our proposed approach can significantly improve the system utility over traditional baselines. [ABSTRACT FROM AUTHOR]

In this paper, a new game-theoretic multi-layer computing resource and network resource allocation algorithm is proposed for computation offloading in Multi-access Edge Computing (MEC) networks. We establish a new multi-layer system model for Data Center Operators and develop resource allocation relation between the MEC data center operators and users. We also investigate the matching relationship between the cloudlets and users. Based on the proposed multi-layer allocation algorithm, a joint optimization framework is delivered to realize the allocation of computing resources and communication channels in MEC. Simulation results show that the proposed algorithm provides effective solution for the problem of cloudlets allocation in MEC networks, and can significantly improve the computing and communication capabilities in the presence of user heterogeneity. [ABSTRACT FROM AUTHOR]

The evolution of telecommunication networks toward the fifth generation of mobile services (5G), along with the increasing presence of cloud-native applications, and the development of Cloud and Mobile Edge Computing (MEC) paradigms, have opened up new opportunities for the monitoring and management of logistics and transportation. We address the case of distributed streaming platforms with multiple message brokers to develop an optimisation model for the real-time assignment and load balancing of event streaming generated data traffic among Edge Computing facilities. The performance indicator function to be optimised is derived by adopting queuing models with different granularity (packet- and flow-level) that are suitably combined. A specific use case concerning a logistics application is considered and numerical results are provided to show the effectiveness of the optimisation procedure, also in comparison to a “static” assignment proportional to the processing speed of the brokers. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a mobile edge computing (MEC) network, where the user has some computational tasks to be assisted by multiple computational access points (CAPs) through offloading. We consider practical communication scenarios with limited spectrum resources, and the cochannel interference arising from the aggressive reuse of frequency severely degrades the system offloading performance. To enhance the system performance, we provide three CAP selection criteria to choose one best CAP among multiple ones. Specifically, criterion I maximizes the computational capability at the CAP, criterion II minimizes the interfering power, while criterion III maximizes the instantaneous channel gain of data link. In time-varying channel environments, the CAP selection may be outdated, which deteriorates the system performance. For the three criteria, we evaluate the system outage probability in the outdated channel state information (CSI) by taking into account the latency, energy consumption and data rate, and provide the analytical and asymptotic expressions of outage probability, from which we obtain some critical insights on the system design. Simulation results are finally demonstrated to verify the proposed studies. In particular, criterion III under the perfect CSI can achieve the system whole diversity order coming from multiple CAPs. [ABSTRACT FROM AUTHOR]

As mobile edge computing (MEC) emerges as a paradigm to meet the ever-increasing computation demands from real-time Internet of Things (IoT) applications in 5 G era, the development trends of which are mainly divided into two, with one being MEC with advanced computing architectures, and the other being MEC with high efficiency for sustainable operations. We are committed to taking advantage of these two trends to explore a novel multi-tier edge computing scenario with hierarchical task offloading and green energy provisioning via leveraging the energy harvesting (EH) technique. Specifically, we focus on the key problem of joint task offloading and energy scheduling in such green multi-tier edge computing systems. We aim to minimize the task execution cost by jointly considering the system cost that covers latency, energy consumption, and cloud rental fees. By formulating the problem as a stochastic optimization problem, we invoke the Lyapunov technique to decompose the long-term optimization problem into a series of one-slot optimization problems which only use the current system information. To solve the one-slot optimization problem which is a mixed-integer linear problem (MILP) proved to be NP-hard, we first relax the integer variables into real ones to obtain the optimal fractional solutions. Considering the capacity of the physical resources of each edge server, we propose a resource-constrained randomized dependent rounding algorithm to properly round up or down the fractional variables to get a feasible yet near-optimal solution. We conduct rigorous theoretical analysis and extensive simulations to verify the superior performance of the proposed schemes. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI)-powered autonomous vehicles (AVs) can integrate different machine learning (ML) techniques to build up a complex autonomous driving system. However, single AV intelligence is not enough to cope with ever-changing driving environments. The underlying reason is that, with current neural network design and training algorithms, it is challenging for the driving model to generalize to diverse driving environments all at once due to sample inefficiency and the curse of dimensionality. Powerful computing resources and massive amount of data can be used to train a good driving model offline. However, the driving model obtained offline might fail in corner case scenarios. In this paper, we propose an intelligence networking framework among AVs assisted by multi-access edge computing (MEC) with end-to-end learning for demonstration. In this framework, driving road is divided into segments and data is collected for each road segment separately. Assisted by MEC networks, a continuously updated driving model is produced in near real-time for each road segment when the environment changes. By dividing the road into segments, we aim to reduce the burden of generalization since a single model only needs to adapt to a specific road segment. Simulation results show that our solutions can produce updated driving model for each road segment to adapt to environmental changes better than the existing scheme. Upcoming AVs can then adapt to changing environments by downloading the updated driving model. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) which enables communication, computation and storage capabilities at the network edge, is an emerging paradigm for 5G and beyond 5G networks. Resource-limited mobile devices can offload their tasks to the MEC server to reduce computation latency and save energy consumption. However, limited wireless spectrum resources make it hard for MEC to guarantee low latency when a large number of users offload the computation tasks or download the computed results. Full-duplex (FD) communication that allows simultaneous transmission and reception of signals over the same frequency band is a promising solution to the shortage of spectrum resources. In this paper, we study a multi-user FD-MEC system involving all the phases of uploading, computing, and downloading. With the help of an FD-capable base station (BS), two half-duplex (HD) users can form an FD pair and share the same time-frequency resource for task uploading and result downloading. We formulate a latency minimization problem considering power control, time scheduling, offloading decision, and user pairing strategy, which is a mixed-integer non-linear programming (MINLP) problem. The problem can be decomposed into two subproblems. The first subproblem is delay minimization for each possible FD pair, and the second one is to decide the offloading and user pairing strategy, and the user scheduling order. We analyze the problem in two cases: (1) the computing delay at the edge server is negligible and (2) the computing delay at the edge server is non-negligible. For both cases, the first subproblem is solved using a bisection algorithm. Then, we solve the second subproblem in the two cases by a relaxing-based algorithm and a concave-convex procedure (CCCP)-based algorithm, respectively. Finally, numerical results demonstrate that with our proposed strategies, the overall latency can be significantly reduced by integrating FD communication with the MEC system. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) has been recognized as a viable technology to satisfy low-delay computation requirements for resource-constrained Internet of things (IoT) devices. Nevertheless, the broadcast feature of wireless electromagnetic communications may lead to the security threats to IoT devices. In order to enhance the task offloading security, this paper proposes a reconfigurable intelligent surface (RIS)-assisted secure MEC network framework. Furthermore, we investigate the max-min computation efficiency problem under the secure computation rate requirements, by jointly optimizing the local computing frequencies and transmission power of IoT devices, time-slot assignment, and phase beamforming of the RIS. To solve the formulated non-convex problem, we further develop an iterative algorithm, in which the Dinkelbach-type method and block coordinate descent (BCD) technique are utilized to tackle the fractional objective function and coupled optimization variables, respectively. In particular, the successive convex approximation (SCA) and penalty function-based methods are exploited to solve the transmit power control and reflecting beamforming optimization subproblems, respectively, and the closed-form expression for local computing frequencies optimization subproblem is derived. Numerical results quantify the performance gain achieved by the proposed RIS-assisted secure MEC networks, when compared to existing benchmark methods. [ABSTRACT FROM AUTHOR]

In wireless communication networks, traffics of base stations (BS) can be effectively offloaded by sharing the cached content between mobile devices through wireless device-to-device (D2D) communication. To encourage the content caching of D2D users, a blockchain incentive scheme is proposed; the game theory is introduced to optimize the benefits for both the edge computing server (ECS) and D2D users in the blockchain network. In Stackelberg game, D2D users act as followers. After the successful implementation of the cache strategy, D2D users are rewarded by the system, which is a new block mining process. In this process, the required computing power is provided by the ECS. Therefore, D2D cache users need to pay the cost to purchase computing power from the ECS. As the game leader, the ECS prices the computing resources, and D2D users adjust their caching strategies based on the price. In this paper, we propose four algorithms based on different pricing methods and different cache reward methods. Simulations are performed to compare the cache quality and cache content dispersion of the four algorithms. The results show that the uniform pricing scheme with a linear reward relationship is more suitable for the scenarios that require higher cache quality, and the discriminatory pricing scheme with a nonlinear reward relationship is more suitable for the scenarios that require more evenly cache content distribution. [ABSTRACT FROM AUTHOR]

With the development of 6G wireless communication technologies, various resource-intensive and delay-sensitive vehicle application tasks are generated. These application tasks can be offloaded to Mobile Edge Computing (MEC) which deploys computing resources at the edge of networks. Besides, the recent proposed Cybertwin, as the digital representation of the complicated physical end-systems, can help the terminals obtain the required services from networks. Vehicles enabled by Cybertwin can offload their tasks to MEC and achieve better performance. In this paper, we focus on the study of a hybrid energy-powered multi-server MEC system with Cybertwin. Vehicles enabled by Cybertwin and edge servers send the current network status and unprocessed vehicle application tasks to the macro base station (MBS) to achieve the better allocation of resources. Energy harvesting (EH) devices are deployed on edge servers to form a “green energy-grid” hybrid energy supply model. We formulate a stochastic offloading optimization problem, and the goal is to minimize the system cost. The stochastic optimization problem is decomposed into three sub-problems. Then, we design an efficient multi-vehicle task offloading (EMT) algorithm to achieve the trade-off between system cost and task queue length. Theoretical analysis shows that EMT algorithm can optimize the total cost of the MEC system and guarantee the system performance. According to experimental evaluation, we verify the performance of the EMT algorithm. [ABSTRACT FROM AUTHOR]

Multi-access edge computing (MEC) systems where the base station (BS) is equipped with multiple antennas are basic application systems in the future. Moreover, unmanned aerial vehicles (UAVs) can be used as relays for responding to emergency service situations in the systems above. Thus, in this work, we investigate a UAV-relaying-assisted MEC system with multi-antenna BS. The optimization for offloading and scheduling strategies should be considered for the energy consumption minimization. First, a circular deployment scheme is adopted to overcome the difficulty of UAVs’ location optimizations. Then, the original problem is established, which aims to minimize the weighted sum of transmission and hovering energy consumptions by jointly optimizing offloading and scheduling strategies. Moreover, the non-convex original problem is transformed into four sub-problems and their optimal solutions are obtained by proposed algorithms. Finally, an iterative algorithm is proposed to obtain a sub-optimal solution of the original problem. Simulation results show that the proposed algorithm outperforms the three benchmark algorithms in terms of the weighted sum and approaches the performance of the relaxed lower bound algorithm. Furthermore, simulation results demonstrate that appropriate number of UAVs and BS's antennas can achieve better energy-saving performance. [ABSTRACT FROM AUTHOR]

This paper investigates a wireless powered mobile edge computing (MEC) network where a hybrid access point (H-AP) serves energy-constrained devices. For such a wireless powered MEC network, the H-AP first transmits wireless information and energy simultaneously in the downlink. Then, by utilizing the harvested energy, the device processes both its local data and the received data from the H-AP. In this system, we minimize the latency by jointly optimizing the power splitting ratio of rectifiers, the data offloading power, the local computing frequency, and the data offloading ratio at the device. By applying a polyblock outer approximation procedure, we propose an algorithm which guarantees the optimal solution. Simulation results verify the efficiency of the proposed algorithm compared to conventional schemes. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is a promising solution to support emerging delay-sensitive mobile applications, such as self-driving, augment/virtual reality, and various Internet of Things (IoT) applications. By deploying MEC servers at network edge, e.g., close to cellular base stations (BSs), the computational tasks generated by these applications can be offloaded to edge nodes (ENs) and be quickly executed there. At the same time, with the projected large number of IoT devices, the communication and computational resources allocated to each user can be quite limited, making it challenging to provide low-latency MEC services. In this paper, we investigate the problem of task partitioning and user association in an MEC system, aiming to minimize the average latency of all users. We assume that each task can be partitioned into multiple subtasks that can be executed on local devices (e.g., vehicles), MEC servers, and/or cloud servers; each user can be associated with one of the nearby ENs. The subtasks can be independent of or dependent on each other. For each case, we formulate the joint optimization of task partitioning ratios and user association as a mixed integer programming problem. Each problem is solved by decomposing it into two subproblems. The lower-level subproblem is task partitioning under a given user association, which can be solved optimally. The higher-level subproblem is user association, we propose a dual decomposition-based approach and a matching-based approach to derive near-optimal solutions. Simulation results show that compared to benchmark schemes, the proposed schemes reduce the average latency by about 50% and 40% for the cases of independent and dependent subtasks, respectively. [ABSTRACT FROM AUTHOR]

The fifth generation (5G) cellular networks aim to deliver data with low/ultra-low latency to users and support diverse services which require two main types of resources: communication and computing resources. These motivated the development of the Multi-access Edge Computing (MEC) paradigm because it can execute tasks’ computation closer to users to reduce latency. To satisfy quality of services (QoS) requirements of different applications, both communication and computing resources in 5G MEC systems can be hard partitioned or soft partitioned among multiple network slices where each slice supports one or more services. A typical soft partition approach is using scheduling. Furthermore, packets in the multi-resource system can either be scheduled individually for each resource using a discrete resource scheduling approach or scheduled collectively only once by combined resource scheduling. In this paper, we propose a combined resource scheduler, called Extended Weighted Fair Queueing with Latency Constraint (EWFQ/LC), to schedule packets among network slices subject to system fairness and their latency constraints. By exploiting the virtual finish time feature inherent in weight fair queueing, EWFQ/LC schedules packets according to the fairness when their latency constraints can be met while according to these latency constraints when they are possibly violated. Based on simulations of realistic heterogeneous traffic scenarios, we show that EWFQ/LC reduces latency by as much as 73% compared to scheduling each resource discretely and maintains latency satisfaction ratio above 90%. More importantly, EWFQ/LC is able to accomplish these improvements with greater fairness in resource consumption especially under heavy traffic conditions, i.e., traffic with stricter latency constraints do not excessively over-consume resources of other traffic classes. [ABSTRACT FROM AUTHOR]

In this paper, collaborative task offloading in edge computing is studied, where computation requesters can offload tasks to not only the edge server, but also nearby smartphone users. By considering the fact that smartphone users may not always be willing to provide such computation service because of the consumption of their own energy and resources, a truthful mechanism is designed to provide incentive to smartphone users. The design aims to maximize the net revenue of the service provider and addresses more practical, but more complicated, scenarios of unknown a prior distribution information on smartphone users’ private information. To tackle this high computational complexity, which makes the traditional mechanism design methods infeasible, a new approach, called truthful deep mechanism, is proposed by leveraging a multi-task machine learning model, where inherently inter-connected collaborator selection and pricing policy determination are decided by designing two deep neural networks. The numerical results show that the proposed deep truthful mechanism can ensure a convergence to a stable state and can satisfy all required economical properties, including individual rationality, incentive compatibility, and budget balance. [ABSTRACT FROM AUTHOR]

By integrating Mobile Edge Computing (MEC) into vehicular networks, vehicular edge computing extends computing capability to the vehicular network edge and hosts services in close proximity of connected vehicles. Parked Vehicles (PVs) occupy a large portion of the global vehicle and have idle states and resources. They collaborate with the MEC servers for cooperative task processing. This gives rise to a new computing paradigm, called by Collaborative Vehicular Edge Computing (CVEC). In CVEC, we introduce an offloading service provider that deploys an MEC server and schedules PVs on demand to handle offloading tasks. Efficient workload allocation and user-centric utility maximization are studied to optimize the network-wide task scheduling. In dynamic environment, offloading destination of each task is determined in a probabilistic manner. When necessary, the offloading service provider represents an offloading user to design a contract based incentive mechanism for the PVs. Based on contract theory and prospect theory, we model the offloading user's subjective evaluations on the utility in computation offloading, and derive an optimal contract to maximize the subjective utility under information asymmetry. Finally, numerical results are provided to demonstrate the effectiveness and efficiency of our scheme. [ABSTRACT FROM AUTHOR]

Emerging virtual reality (VR) applications require high data rate transmission and low end-to-end latency, which has become one of the main challenges for future wireless networks. Unmanned aerial vehicle (UAV) mounted base stations and computing facilities can be used to provide better wireless connectivity and computing services to edge VR users to meet their computing needs and reduce the end-to-end latency. We propose a novel UAV assisted mobile edge computing (MEC) network to enable high-quality mobile 360-degree video VR applications by leveraging UAVs to provide the required communication and computing needs. Then, we formulate the joint UAV placement, MEC and radio resource allocation, and 360-degree video content layer assignment (UAV-MV) problem, which aims to select the allocation of computing and communications resources and the location of the UAVs such that the delivered quality of experience (QoE) is maximized across the mobile VR users, given various system constraints. We show that the problem is NP-hard, and decompose it into three lower-complexity subproblems that we solve sequentially. We design an approximation algorithm with performance guarantees that solves the UAV-MV problem based on the solutions to the three subproblems. Our simulation results show that the average QoE enabled by the proposed algorithm is 15% and 90% greater relative to two competitive reference methods. [ABSTRACT FROM AUTHOR]

This paper presents a new stochastic optimization framework for user association and task offloading in mobile edge computing (MEC) networks with spatial and temporal variations of computing power, channel quality and connection capacity between different MEC servers. The new framework minimizes a quadratic penalty function which balances the energy consumption and fairness of the devices. Lyapunov optimization is first applied to eliminate the time coupling of the framework, leading to a mixed-integer program (MIP) of user association and offloading scheduling at every time slot. While solving the scheduling using linear programming, we convert the user association to a minimum cost maximum flow problem by interpreting edge servers and devices as two disjoint vertexes. We solve the minimum-cost maximum flow problem efficiently by using the Ford-Fulkerson algorithm. Corroborated by simulations, the proposed approach is asymptotically optimal and outperforms alternative approaches in terms of energy saving and fairness. [ABSTRACT FROM AUTHOR]

The development of smart vehicles and rich cloud services have led to the emergence of vehicular edge computing. To perform the distributed computation tasks efficiently, Coded Distributed Computing (CDC) was proposed to reduce communication costs and mitigate the straggler effects through the use of coding techniques. In this paper, we propose a double auction mechanism to allocate the resources of the edge servers to the vehicles in order to complete the CDC tasks. Specifically, the vehicles use the PolyDot codes to manage the tradeoff between communication costs and recovery threshold. Given the requirements of various vehicles, the double auction mechanism matches the edge servers with the required resources to the vehicles. Besides, the double auction mechanism also determines the prices that the vehicles need to pay for the resources of the edge servers. The analyses show that the double auction mechanism satisfies the properties of individual rationality, incentive compatibility and budget-balance. From the simulation, the utility of auctioneer increases when the number of vehicles and edge servers increases. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) has been considered as a promising paradigm to support the growing popularity of mobile devices (MDs) with similar capabilities as cloud computing. Most existing research focuses on MEC enabled by terrestrial base stations (BSs), which is unable to work in certain scenarios, e.g., disaster rescue and field operation. Some researchers have been making efforts on studying MEC assisted by unmanned-aerial-vehicles (UAVs) and developed lots of efficient scheduling algorithms. However, MEC assisted only by UAVs has limited capability and is unsuitable for heavy-computation applications. To address the issue, this paper proposes a novel UAV-and-BS hybrid enabled MEC system, where multiple UAVs and one BS are deployed to facilitate the provisioning of MEC services either directly from UAVs or indirectly from the BS. Considering maximizing the lifetime of all MDs, the energy-efficient scheduling problem is formulated as minimizing the energy consumption of all MDs by jointly optimizing UAV trajectories, task associations, computing-and-transmitting resource allocations. The optimization problem is further decomposed into three sub-problems and solved by the proposed hybrid heuristic and learning based scheduling algorithms to reduce the complexity. Experimental results show that the proposed algorithm can achieve promising performance improvements over baseline algorithms, including local-computing, random-offloading and greedy-offloading. [ABSTRACT FROM AUTHOR]

Deploying a drone-mounted base-station (DBS) to assist mobile edge computing can empower 5 G and beyond networks with additional flexibility and maneuverability, and laser charging can potentially extend the DBS's service time. A laser charging DBS framework is proposed in which a DBS is provisioning services for user equipments (UEs) on the ground and harvesting energy transmitted from the laser charging station mounted on the macro base station (MBS). Both MBS and DBS are equipped with servers. UEs can offload their tasks to either the MBS or the DBS. The DBS is to be placed at the optimal location to provide uplink communications and computing services for the ground UEs in each time slot. We thus formulate the joint user AssoCiation bandwidth and Computation ResoUrce Assignment Laser charing (ACCRUAL) problem to jointly maximize the DBS service time and minimize the task completion time for all UEs. Since ACCRUAL is a mixed integer nonlinear problem, we decompose it into two sub-problems: the joint UE association computing REsource And bandwidth allocation Problem (REAP) and the DBS placement problem. An iterative algorithm is employed to solve the REAP problem and a placement algorithm based on counting sort is used to tackle the DBS placement problem. The performance of our algorithm is superior to the greedy algorithm and equally shared resource allocation algorithm upon which the total UE task offloading completion time is improved by more than 9% as compared to the greedy algorithm and the total DBS service time is improved by 20% when the laser power is 200 w and 40% of the DBS service time is improved when the laser power is 400 w. [ABSTRACT FROM AUTHOR]

In this paper, we explore the feasibility of solar-powered road-side unit (SRSU)-assisted vehicular edge computing (VEC) system, where SRSU is equipped with small cell base station (SBS) and VEC server, both of which are powered solely by solar energy. However, the limited capacity of solar energy, VEC server's computing, and SBS's bandwidth resources may prohibit vehicle users (VUs) from offloading their vehicular applications to VEC server for better service quality. We address this challenge by dynamically determining vehicular task partitioning and offloading, VEC server's system configuration, and vehicular application level adjustment decisions. We aim at minimizing the end-to-end delay of vehicular applications while maximizing their application level performance (e.g., accuracy). We also implement an object detection vehicular application on an edge computing platform and measure the corresponding energy consumption, computation delay, and detection accuracy performance to establish empirical models for the SRSU-assisted VEC system. We then propose a dynamic programming-based heuristic algorithm which jointly makes the task partitioning and offloading, as well as system and application-level adaption decisions in real-time. We build a simulation framework with the above empirical models to evaluate the proposed algorithm. The simulation results show that our proposed approach can significantly reduce the end-to-end delay while maximizing the detection accuracy compared to existing techniques. [ABSTRACT FROM AUTHOR]

The combination of wireless energy transfer (WET) and mobile edge computing (MEC) has been proposed to satisfy the energy supply and computation requirements of resource-constrained Internet of Things (IoT) devices. However, the energy transfer efficiency and task offloading rate cannot be guaranteed when wireless links between the hybrid access point (HAP) and IoT devices are hostile. To address this problem, this paper aims at utilizing the intelligent reflecting surfaces (IRS) technique to improve the efficiency of WET and task offloading. In particular, we investigate the total computation bits maximization problem for IRS-enhanced wireless powered MEC networks, by jointly optimizing the downlink/uplink phase beamforming of IRS, transmission power and time slot assignment used for WET and task offloading, and local computing frequencies of IoT devices. Furthermore, an iterative algorithm is presented to solve the non-convex non-linear optimization problem, while the optimal transmission power and time allocation, uplink phase beamforming matrixes and local computing frequencies are derived in closed-form expressions. Finally, extensive simulation results validate that our proposed IRS-enhanced wireless powered MEC strategy can achieve higher total computation rate as compared to existing baseline schemes. [ABSTRACT FROM AUTHOR]

With the advent of smart vehicles, several new latency-critical and data-intensive applications are emerged in Vehicular Networks (VNs). Computation offloading has emerged as a viable option allowing to resort to the nearby edge servers for remote processing within a requested service latency requirement. Despite several advantages, computation offloading over resource-limited edge servers, together with vehicular mobility, is still a challenging problem to be solved. In particular, in order to avoid additional latency due to out-of-coverage operations, Vehicular Users (VUs) mobility introduces a bound on the amount of data to be offloaded towards nearby edge servers. Therefore, several approaches have been used for finding the correct amount of data to be offloaded. Among others, Federated Learning (FL) has been highlighted as one of the most promising solving techniques, given the data privacy concerns in VNs and limited communication resources. However, FL consumes resources during its operation and therefore incurs an additional burden on resource-constrained VUs. In this work, we aim to optimize the VN performance in terms of latency and energy consumption by considering both the FL and the computation offloading processes while selecting the proper number of FL iterations to be implemented. To this end, we first propose an FL-inspired distributed learning framework for computation offloading in VNs, and then develop a constrained optimization problem to jointly minimize the overall latency and the energy consumed. An evolutionary Genetic Algorithm is proposed for solving the problem in-hand and compared with some benchmarks. The simulation results show the effectiveness of the proposed approach in terms of latency and energy consumption. [ABSTRACT FROM AUTHOR]

Mobile edge computing has been an important supplement for traditional cloud computing architecture to offer low-delay computing services to mobile users. However, it is in general impossible for edge service providers to overdeploy so much edge resources to satisfy the rapidly increasing while diverse user demands. In this paper, we study a mobile edge computing system consisting of a service platform, cloudlets joining the system, and mobile users. In this study, we focus on a profit-driven perspective such that the service platform purchases computation resource from the resource-rich cloudlets and makes profit by processing tasks from user side. The design objective is to maximize the platform profit subject to budget constraint and stringent delay requirements for task processing. We formulate this problem as a mixed integer programming problem. Due to the NP-hardness of the problem, we design a logic based Benders decomposition algorithm as the offline solution. We further study the scenario where the task arrivals from user side and resource availability at the cloudlets are both stochastic and unknown in advance. We accordingly propose a Multi-Armed Bandit learning based resource purchasing and greedy task scheduling algorithm for the online scenario. Simulations results show the high performance of our proposed algorithms. [ABSTRACT FROM AUTHOR]

With the recent advancement of vehicular ad-hoc networks (VANETs) or the internet of vehicles (IoVs), vehicles are getting more powerful and generating huge amount of traffic data, including computation-intensive and delay-sensitive applications in the vehicular edge computing (VEC) networks, which are difficult to be processed by an individual vehicular node. These resource-demanding tasks can be transferred to another vehicular node with idle computing resources for processing. Due to high mobility and limited resources of vehicular nodes, it is challenging to execute lengthy computation-intensive tasks until completion within the delay constraint. There is a need to provide an efficient task offloading strategies to support these applications. In this paper, an efficient distributed task offloading scheme is proposed to select nearby vehicles with idle computing resources, to process the tasks in parallel by considering some vital metrics, including link reliability, distance, available computing resources, and relative velocity. In order to complete the lengthy computation-intensive tasks in vehicular edge computing networks, a task is divided into several subtasks before offloading. The performance of the proposed scheme is evaluated in several VEC network conditions. Results show that the proposed computation task offloading scheme achieves better performance in latency, throughput, resource utilization and packet delivery ratio than the existing schemes. [ABSTRACT FROM AUTHOR]

In this correspondence, we study a tethered unmanned aerial vehicle (TUAV)-assisted mobile edge computing (MEC) system, in which tasks of several ground mobile users (MUs) are served by ground edge cloud (GEC) with superior computing capability and poor communication links and TUAV-mounted cloudlet with lower computing capability and better communication links. We aim to minimize weighted-sum system delay of MUs by jointly optimizing TUAV position, time slot allocation, and task splitting ratio. We first decompose the optimization problem into three subproblems, and then to solve non-convex subproblem related to TUAV position, we reformulate it by the first-order Taylor series approximation and apply the successive convex approximation (SCA) method. Then, we tackle the overall problem by applying the alternative optimization algorithm. Numerical results verify that our proposed cooperative sky-ground mobile edge computing system (CoSMoS) algorithm can achieve a better performance than other benchmark schemes. [ABSTRACT FROM AUTHOR]

With Mobile Edge Computing (MEC), computational intensive applications can be offloaded to the nearby edge servers to support latency-sensitive applications on mobile devices. Different from the cloud, edge servers usually have limited resources, and then selecting which edge server to run the offloaded computation becomes an important issue. Although server selection has received considerable attention, not much work has been done to consider the limited coverage of the edge server and the frequent user movement, which introduce many dynamic changing factors affecting the workload of the edge server and making it hard to achieve long-term optimum in the edge server selection. To deal with these challenges, we model the problem of continuous server selection as a Markov Decision Process (MDP). The difficulty of this problem is that achieving long-term optimum requires future knowledge, such as user mobility, server workload, etc, which is not known a priori. We do not have such knowledge and thus cannot find the optimal policy through traditional methods. To address this problem, we propose a Deep Reinforcement Learning (DRL) based algorithm to learn the selection policy based on the observed performance of past server selections. Specifically, a Long Short-Term Memory (LSTM) based neural network is exploited to encode the historical information which helps infer future knowledge of the dynamically changing factors. Then the DRL model selects the optimal server automatically based on the extracted system states. Extensive trace-driven evaluations demonstrate that the proposed DRL-based algorithm has the lowest overall cost compared to existing solutions. [ABSTRACT FROM AUTHOR]

With powerful storage and computation capability, vehicular edge computing is considered as a promising paradigm to enhance the safety and quality-of-service of vehicles in intelligent transportation systems. In this work, we investigate a joint road side units (RSUs) selection and resource allocation problem, with the objective of minimizing the total task offloading delay subject to the bandwidth and computation resources constraints, in non-collaborative and collaborative RSU scenarios. For the former, as the formulated problem is a mixed-integer nonlinear programming problem, we re-formulate the original problem into a convex one and then decompose it into a distributed manner. By utilizing the alternating direction method of multipliers, we propose a joint RSUs selection and resource allocation (JRSRA) algorithm. For the collaborative RSU scenarios, we transform the problem into a convex optimization problem by linearization, and propose a joint resource allocation based branch and bound (JRABB) algorithm to solve the total task offloading delay minimization problem. Simulation results show that the proposed JRSRA and JRABB algorithms can reduce the total task offloading delay compared with other benchmark methods. [ABSTRACT FROM AUTHOR]

In this correspondence, we investigate the joint relay and server selection problem for a novel vehicle-assisted multi-access edge computing (MEC) system, where vehicles on the road relay data from an end device to appropriate MEC servers for computing in a store-carry-forward manner. To harness the stochastic nature of task arrivals, vehicle availability, and resource availability at MEC servers, we design a relaying scheme to minimize the average task latency based on a Markov decision process. Our study shows that our proposed scheme is highly effective in balancing the communications and computing while minimizing the end-to-end latency for task completion. [ABSTRACT FROM AUTHOR]

Mobile Edge Computing (MEC) is a promising architecture to reduce the energy consumption of mobile devices and provide satisfactory quality-of-service to time-sensitive services. How to jointly optimize task offloading and resource allocation to minimize the energy consumption subject to the latency requirement remains an open problem, which motivates this paper. When the latency constraint is taken into account, the optimization variables, including offloading ratio, transmission power, and subcarrier and computing resource allocation, are strongly coupled. To address this issue, we first decompose the original problem into three subproblems named as offloading ratio selection, transmission power optimization, and subcarrier and computing resource allocation. Then, we propose an iterative algorithm to deal with them in a sequence. To be specific, we derive the closed-form solution of offloading ratios, employ the equivalent parametric convex programming to obtain the optimal power allocation policy, and deal with subcarrier and computing resource allocation by the primal-dual method. Simulation results demonstrate that the proposed algorithm can save 20%–40% energy compared with the reference schemes, and can converge to local optimal solutions. [ABSTRACT FROM AUTHOR]

With the development of high-speed railways (HSRs), people's lives have become more convenient. At the same time, people are demanding more data services on trains in terms of wireless communications and mobile computation. Recently, Multi-access Edge Computing (MEC), a new computing paradigm, has the great potential to improve the user experience of computing services by placing the cloud infrastructures closer to end-users so that users can offload their computation-intensive and delay-sensitive tasks to the edge servers. In this paper, we concentrate on finding proper data routing paths for each offloaded task and each process result, with the objective of maximizing the network throughput by serving as many tasks as possible while meeting the MEC network resource constraints and the user demand constraints within a finite time horizon of equal time slots. It is challenging because of the unspecific data volume of an offloaded task and handovers of task offloading procedures that may frequently occur. Thus, we first investigate the impact of handovers in uplinks and downlinks. Then we propose a graph-based model to portray the resource availability in the network. Furthermore, a heuristic algorithm is devised, which finds a set of single-source-single-destination delay-constrained shortest paths in a series of auxiliary graphs. Finally, we perform an empirical evaluation of the proposed algorithm by simulations. The simulation results show that the proposed algorithm could achieve a higher network throughput than the other two benchmark heuristics. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) can use wireless access network (RAN) to provide the services required by user's information technology (IT) and cloud computing functions nearby, which can create a high-performance and low latency service environment. Performing task offloading and data caching at access points (APs) in a cooperative manner can reduce the heavy backhaul load and the retransmission of content downloading. However, in edge networks (ENs), how to maximize storage utilization while reducing service latency and energy consumption is still a key issue, because the heterogeneity of ENs and the uneven distribution of users make it difficult to determine which MEC server and what data should be cached. In this paper, we study a two-tier MEC system, which enables data caching and computing offloading policy to minimize the network cost at the user equipment (UE) side, while satisfying the constraints of task offloading deadline, the cache capacity at APs and the computing capability of MEC servers. The optimization problem is formulated as a mixed integer nonlinear program (MINLP) problem. In order to solve the problem, we transform it into an equivalent task offloading convex optimization problem by fixing an optimization variable. Furthermore, we solve a cache placement problem by dynamic programming (DP) algorithm. Then we propose a distributed collaborative data caching and computing offloading (CDCCO) iterative algorithm. Simulation results demonstrate that our proposed CDCCO algorithm can significantly reduce the network cost and achieve better performance than other existing schemes. [ABSTRACT FROM AUTHOR]

As a distributed learning approach, federated learning trains a shared learning model over distributed datasets while preserving the training data privacy. We extend the application of federated learning to parking management and introduce FedParking in which Parking Lot Operators (PLOs) collaborate to train a long short-term memory model for parking space estimation without exchanging the raw data. Furthermore, we investigate the management of Parked Vehicle assisted Edge Computing (PVEC) by FedParking. In PVEC, different PLOs recruit PVs as edge computing nodes for offloading services through an incentive mechanism, which is designed according to the computation demand and parking capacity constraints derived from FedParking. We formulate the interactions among the PLOs and vehicles as a multi-lead multi-follower Stackelberg game. Considering the dynamic arrivals of the vehicles and time-varying parking capacity constraints, we present a multi-agent deep reinforcement learning approach to gradually reach the Stackelberg equilibrium in a distributed yet privacy-preserving manner. Finally, numerical results are provided to demonstrate the effectiveness and efficiency of our scheme. [ABSTRACT FROM AUTHOR]

Edge computing is able to provide proximity solutions for the future wireless network to accommodate different types of devices with various computing service demands. Meanwhile, in order to provide ubiquitous connectivities to massive devices over a relatively large area, densely deploying remote radio head (RRH) is considered as a cost-efficient solution. In this work, we consider a vertical and heterogeneous multi-access edge computing system. In the system, the RRHs are deployed for providing wireless access for the users and the edge node with computing capability can process the computation requests from the users. With the objective to minimize the total energy consumption for processing the computation task, a joint radio resource allocation and offloading decision optimization problem is presented under the explicit consideration of capacity constraints of fronthaul and backhaul links. Due to the non-convexity of the formulated problem, we divide the original problem into several sub-problems and address them accordingly to find the optimal solution. Extensive simulation studies are conducted and illustrated to evaluate the advantages of the proposed scheme. [ABSTRACT FROM AUTHOR]

As a key smart transportation service, public vehicle systems are intended to improve traffic efficiency and vehicle occupancy ratios, and to reduce the number of vehicles on roads, by inducing travelers to share rides with others. Despite the clear logic behind this service, achieving a viable model for matching multiple riders to vehicles with low latency and high satisfaction remains an open issue. In this paper, we propose an Edge Computing based Public Vehicle (ECPV) system to improve traffic efficiency and vehicle occupancy ratios by scheduling ridesharing among travelers and reduce the delay of decision making by leveraging edge computing. Particularly, by introducing a metric of traveler satisfaction jointly considering travel time, distance, and costs (i.e., charge), we formalize public vehicle scheduling problem as an optimization problem with maximizing traveler satisfaction as objective to reduce travel time and improve traffic efficiency. Further, as achieving globally optimal matching of rides and travelers is time consuming, to reduce the delay of decision making (i.e., response to ride-traveler pairs matching) and improve real time ridesharing service and traveler satisfaction, an edge computing based ride request transmission mechanism and a tree based heuristic matching mechanism are proposed to effectively exchange ride requests and select appropriate vehicles for mostof ride requests on edge devices. Also, our ECPV system considers driverless cars as public vehicles to remove the subjective influence of drivers and improve the efficiency of vehicle scheduling, and introduces a graph partition based depot placement mechanism to determine vehicleparking locations and balance vehicle distribution across system. Through extensive performance evaluations, our experimental results show that our proposed ECPV system can effectively match ride requests to public vehicles, reduce travel times and distances for all trips, reducecharges to travelers, and improve vehicle occupancy. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is leveraged to reduce the latency for the computation-intensive and latency-critical tasks offloaded from wireless devices and Internet of Things Devices (IoTDs). Unmanned aerial vehicles (UAVs) have attracted much attention from both academia and industry attributed to high mobility, high flexibility, and high maneuverability of UAVs. In this article, a novel UAV-assisted MEC architecture is proposed to provision services to IoTDs, where a UAV provides both communication and computing services or works as a relay node. We then formulate the joint computation offloading, spectrum resource allocation, computation resource allocation, and UAV placement (Joint-CAP) problem in the UAV-MEC network to minimize the operation cost of provisioning IoTDs. Since the Joint-CAP problem is a mixed integer non-linear programming problem and NP-hard, we decompose it into two sub-problems and solve the sub-problems sequentially. Then, we propose a (1 + ε)-approximation algorithm, named AA-CAP, to solve the Joint-CAP problem, and the performance of the AA-CAP algorithm is demonstrated to be superior to the baseline algorithms via simulations. [ABSTRACT FROM AUTHOR]

In this paper, we study an energy-efficient computation offloading for vehicular edge computing systems, where multiple roadside units assist vehicular users to offload computation tasks to edge servers. Our goal is to minimize the users’ energy consumption by optimizing user association, data partition, transmit power, and computation resources, subject to the constraints of partial tasks offloading, user latency, maximum transmit power, outage performance, and computation capacity of edge servers. We utilize deep learning for user association to avoid combinatorial complexity, and develop an efficient optimization algorithm to optimize other variables. The resulting algorithm has scalable complexity with convergence guarantee, as confirmed by our theoretical analysis. Simulation results demonstrate that the introduced resource allocation algorithm can significantly reduce the total energy consumption of users. [ABSTRACT FROM AUTHOR]

We study a parallel multi-access edge computing (MEC) system in this work and investigate its energy-efficient resources management. Particularly, the MEC system consists of an edge node and a number of mobile users, where each user has an inelastic computing task with nonnegligible duration of task execution and nonnegligible size of task result. In addition, the MEC system operates in orthogonal frequency division multiple access (OFDMA) wireless networks and can support the transmission as well as the execution of different tasks in parallel. On this basis, we build a nonconvex mixed-integer nonlinear programming (MINLP) problem aiming to minimize the energy consumed by the system. By using the McCormick method and exploring the problem's structural properties, we first equivalently transform it to a manageable convex MINLP problem, and then devise two low-complexity suboptimal algorithms. Finally, numerical results are presented to show the effectiveness of our proposed algorithms. [ABSTRACT FROM AUTHOR]