Search

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. Ministry of Education (MOE) National Research Foundation (NRF) This work was supported in part by the Programme DesCartes, in part by the National Research Foundation, Prime Minister’s Office, Singapore, under its Campus for Research Excellence and Technological Enterprise Programme, in part by Alibaba Group through Alibaba Innovative Research Program and Alibaba-NTU Singapore Joint Research Institute, in part by the National Research Foundation, Singapore, under the AI Singapore Programme under Grant AISG2-RP-2020-019, in part by WASP/NTU under Grant M4082187 (4080), in part by the Singapore Ministry of Education under Grant Tier 1 (RG16/20), in part by the SUTD SRG-ISTD-2021-165, and in part by the SUTD-ZJU IDEA under Grant (SUTD-ZJU (VP) 202102).

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. peerReviewed

The explosive computation demands in the Internet of Things (IoT) have triggered the research interests on unmanned aerial vehicle (UAV) assisted mobile-edge computing (MEC) systems even though there are still many challenges, such as computing delay requirement, multi-UAV cooperation, and resource management. This letter focuses on the computing delay issue in MEC systems assisted by multiple UAVs with the goal of task completion time minimization. In particular, both the partial offloading and binary offloading modes are considered by jointly optimizing time slot size, terminal devices scheduling, computation resource allocation, and UAVs’ trajectories. Particularly, an non-LoS channel model is adopted for UAV-ground communication. To handle the formulated problems, we develop alternating optimization algorithms by invoking the successive convex approximation method, Karush-Kuhn-Tucker conditions and penalized method. Numerical results show that the completion time is significantly decreased by the proposed algorithms.

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.

Caching and transcoding at multi-access edge computing (MEC) server and wireless resource allocation in eNodeB interact with each other and together determine the quality of experience (QoE) of dynamic adaptive streaming over HTTP (DASH) clients. However, the relationship among the three factors has not been explored, which has led to limited improvement in clients’ QoE. Therefore, we propose a joint optimization framework of video segment caching and transcoding in MEC servers and resource allocation to improve the QoE of DASH clients. Based on the established framework, we develop an MEC caching management mechanism that consists of the MEC caching partition, video segment deletion, and MEC caching space transfer. Then, a joint optimization algorithm that combines the video segment caching and transcoding in the MEC server and resource allocation is proposed. In the algorithm, the clients’ channel state and the playback status and cooperation among MEC servers are employed to estimate the client's priority, video segment representation switch and continuous playback time. Considering the above four factors, we develop a utility function model of clients’ QoE. Then, we formulate a mixed-integer nonlinear programming mathematical model to maximize the total utility of DASH clients, where the video segment caching and transcoding strategy and resource allocation strategy are jointly optimized. To solve this problem, we propose a low-complexity heuristic algorithm that decomposes the original problem into multiple subproblems. The simulation results show that our proposed algorithms efficiently improve client's throughput, received video quality and hit ratio of video segments while decreasing the playback rebuffering time, video segment representation switch and system backhaul traffic.

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.

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 ( UAV s) 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 c omputation offloading, spectrum resource a llocation, computation resource allocation, and UAV p lacement ( 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+\epsilon)$ -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.

As an emerging technique, unmanned aerial vehicle (UAV) aided multi-access edge computing (MEC) network has been improving the performance of the communication network. The novel architecture is beneficial for coverage, flexibility, and reliability. However, reducing network latency is a critical issue. In this paper, we design a UAV-aided network with a millimeter wave (mmWave) backhaul to achieve the multi-access edge computing. The routing problem is formulated and solved first to obtain the optimal routes through the ad hoc link for all users. Then, we formulate the joint trajectory design and resource allocation problem, which is a mixed-integer nonconvex programming, to minimize the network latency. Furthermore, we design a novel iterative algorithm framework to handle this challenging problem. In the outer loop, the proposed problem is separated into the primal problems and master problems by adopting generalized benders decomposition (GBD). In the inner loop, we design the algorithm to solve the continuous nonconvex primal problem by combining the alternating direction method of multipliers (ADMM), Dinkelbach algorithm, and successive convex approximation (SCA) algorithm. The simulation results demonstrate that our proposed algorithm framework is effective and feasible.

To sustainably provide low-latency communication and edge computing for connected vehicles, a promising solution is using Solar-powered Roadside Units (SRSUs), which consist of small cell base stations and Mobile Edge Computing servers. However, due to the intermittent nature of solar power, SRSUs may suffer from a high risk of power deficiency, which will lead to severe disruption of vehicular edge computing applications. In this paper, we aim to address this challenge of Quality of Service (QoS) loss (i.e., edge computing service outage for vehicle users (VUs)). We formulate a QoS optimization problem for VUs and solve it in two phases: an offline solar energy scheduling phase, and an online user association and SRSU resource allocation phase. We simulate our proposed technique in a dense SRSU network environment with real-world urban vehicular traffic data and solar generation profile. The simulation results show that our proposed approach can significantly reduce QoS loss of vehicular edge computing applications using SRSUs, compared to existing techniques. Further, the results are beneficial to service providers and city planners to identify adequate SRSU configurations for expected solar energy generation and edge computing service demands.

Peer-to-Peer (P2P) resource sharing promotes local resource-hungry task offloading to other mobile devices and balances the resource consumption between mobile devices. Most of existing P2P task offloading systems aims to solve the resource sharing between one pair exclusively without considering the cost of resource supply and the strategic behaviors of mobile users. In this paper, we propose two user models for the P2P task offloading system: honest user model and strategy user model. For the honest user model, we formulate the resource allocation maximization problem with latency and energy consumption constraints as an Integer Linear Programming. We show that the solution for honest user model can output 189% resource transactions of that for the strategic users. For the strategy user model, we propose a double auction-based P2P task offloading system, and design a truthful multi-resource transaction mechanism to maximize the number of resource transactions. We first group the mobile users based on the connected components to improve the efficiency of double auction. Then we utilize the McAfee Double Auction to price the resource transactions. Finally, we split each winning mobile user of double auction into multiple virtual mobile users, and use the matching approach to calculate the resource allocation. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the designed multi-resource transaction mechanism satisfies the desirable properties of computational efficiency, individual rationality, budget balance, truthfulness for resource request/supply, and general truthfulness for bid/ask price.

Vehicular edge computing is viewed as a promising technique for relieving the overload of base station (BS) on roadside, via leveraging the computation resources of vehicles on road. However, the computing capacity of a single vehicle is limited. For the fast velocity and distribution characteristics of vehicles, when a vehicle performs task offloading to a set of neighbor vehicles, longer sensing/accessing time durations are needed. Vehicle platoon driving as an emerging technique is proposed to strengthen vehicle fuel efficiency and the freeway safety and capacity. The distributed computation resources can be centrally controlled in the vehicle platoon. In this paper, we investigate the resource allocation scheme for edge computing-based vehicle platoon on freeway to maximize the utilities of vehicles surrounding the platoon via a contract-optimization approach. Combining with BS, the vehicle platoon performs as an edge node to provide the delay-sensitive computation service for the vehicles on road. First, we design a contract-based incentive mechanism to motivate vehicles to form a vehicle platoon and share their computation resources. Then, based on the proposed vehicle platoon, a joint optimization problem is formulated to maximize the utilities of vehicles, the task offloading decision, communication and computation resource allocation schemes in both the platoon and BS are jointly optimized. Numerical results reveal that the designed contracts can incentivize vehicle's participation, and the proposed resource allocation schemes are effective.

Mobile edge computing has emerged as a promising technology to augment the computational capabilities of mobile devices. For a multi-user network in which its users periodically compute their tasks with the help of an edge cloud, we investigate the network lifetime maximization problem based on present user task information. We pursue this objective via a minimum energy efficiency maximization (MEEM) strategy that jointly optimizes the fraction of user task computations offloaded to the cloud and the respective allocation of edge computing and network communication resources across the users. We also investigate the network lifetime maximization problem for the case when the user task information is available for all future time slots, as well. This setting represents an upper bound for the MEEM strategy. Optimal solutions for both investigated strategies are formulated via feasibility testing and geometric programming. We show that MEEM can achieve a 70% lifetime improvement over the state-of-the-art and 460% lifetime improvement over the case of local user task computation only. We also show that for a high value of the maximum tolerable delay for completing the computation tasks of the users, MEEM achieves the globally optimal network lifetime performance. Finally, we show that MEEM achieves a significant reduction (3X) in variation of enabled network lifetime over diverse network topologies, relative to the state-of-the-art.

Mobile edge computing (MEC) has been regarded as a promising technology to improve the quality of service (QoS) of users by offloading their computation-intensive and delay-sensitive tasks to the wireless network edge. Furthermore, applying non-orthogonal multiple access (NOMA) technology in heterogeneous networks (HetNets) has become a trend to improve system throughput and spectrum efficiency. Exploiting these benefits, we investigate the joint task offloading and resource allocation problem for MEC in NOMA-based HetNets. To minimize the energyconsumption of all users, we jointly consider task offloading decision, local CPU frequency scheduling, power control, computation resource and subchannel resource allocation. The optimization problem is challenging due to the combinatorial nature of the offloading decision and its strong coupling with the resource allocation. We thus decouple the problem into two sub-problems of offloading decision and resource allocation, and propose an efficient approach to find the joint solution by solving these two sub-problems iteratively. Simulation results show that the proposed approach can achieve a near optimal performance, and outperform other benchmark approaches in terms of saving energy consumption of all users with an acceptable complexity.

In order to improve resource utilization and network capacity, we propose the Device-to-Device (D2D) enabled Mobile Edge Computing (MEC) system, where multiple Smart Devices (SDs) transmit the offloading data to the MEC server with the help of wireless access point (WAP) selected from multiple WAPs. The SD uses the chosen WAP as the communication relay between the MEC server and itself. Aimed to minimize the total energy consumption of the system and satisfy the SDs demand on delay, we jointly optimize relay selection and resource allocation in D2D-enabled MEC system. The problem is formulated as an integer-mixed non-convex optimization problem which is a NP-hard problem. We thus propose a two-phase optimization algorithm that jointly optimizes relay selection policy and resource allocation strategy. In first phase, the original problem is converted into a convex optimization problem by using convex optimization techniques, and the optimal relay selection policy can be achieved by solving the relay selection problem. After obtaining the relay selection policy, the original problem is transformed into a resource allocation problem solved by leveraging the Lagrange Method in the second phase. Furthermore, the proposed algorithm is a low-complexity algorithm which is associated with the root finding method. The optimal relay selection policy and resource allocation strategy can be found in polynomial time. The extensive simulation results are provided to indicate that the D2D-enabled MEC system achieves remarkable results in energy saving. Compared with other baseline methods, our proposed algorithm can not only achieve the optimal solution with less time cost, but also improve the energy efficiency and network capacity.

Multi-access edge computing (MEC) has emerged as a promising paradigm because of its good performance for computation-intensive and latency-critical applications. However, the enormous computing requests from computation service subscribers (CSSs) still cannot be satisfied by pre-existing edge computation nodes (ECNs). To fully utilize the advantage of the MEC network, a hierarchical computation offloading framework is developed under network virtualization (NV) scenario. Accordingly, a two-step sequential process is designed to stimulate the proposed framework. In the first step, an incentive mechanism is proposed in which more temporary ECNs can be motivated by MEC operator and then join the MEC network. Without perfect ECN information, the optimal contract items (the ECN's CPU contribution and reward) between the MEC operator and ECNs can be achieved by taking account of individual rationality (IR) and incentive compatible (IC) constraints. After acquiring the ECNs’ CPU contributions, the computing resource allocation problem between the ECNs and CSSs is then considered in the second step. Since the CSSs have private information, a Bayesian matching game with externality is leveraged to model the problem. Whereas, the conventional resident-oriented Gale-Shapley (RGS) algorithm cannot ensure the stability. Hence, an iterative matching algorithm that can always converge to stable results is developed. Finally, simulation results demonstrate that our proposed two-step sequential decision process can significantly improve social welfare considering the practical scenarios, with reasonable computational complexity.

In this correspondence, we jointly optimize the caching decision and radio and computation resource allocation for video service in mobile edge computing (MEC) enabled network to maximize the system revenue. To tolerate the uncertainty in the network traffic and avoid “hard constraint” based on constant content request rate, we employ robust optimization to obtain optimal caching decisions, and then accordingly allocate the radio and computation resources for video transcoding. Simulation results demonstrate the effectiveness of the proposed scheme.

We consider Device-to-Device (D2D)-enabled mobile edge computing offloading scenario, where a device can partially offload its computation task to the edge server or exploit the computation resources of proximal devices. Keeping in view the millisecond-scale latency requirement in 5G service scenarios and the spectrum scarcity, we focus on minimizing the sum of task execution latency of all the devices in a shared spectrum with interference. In particular, we provide an integrated framework for partial offloading and interference management using orthogonal frequency-division multiple access (OFDMA) scheme. Accordingly, we formulate total latency minimization as a mixed integer nonlinear programming (MINLP) problem by considering desired energy consumption, partial offloading, and resource allocation constraints. We use decomposition approach to solve our problem and propose a novel scheme named Joint Partial Offloading and Resource Allocation (JPORA). With aim to reduce the task execution latency, JPORA iteratively adjusts data segmentation and solves the underlying problem of quality of service (QoS)-aware communication resource allocation to the cellular links, and interference-aware communication resource allocation to D2D links. Extensive evaluation results demonstrate that JPORA achieves the lowest latency as compared to the other baseline schemes, meanwhile limiting the local energy consumption of user devices.

The blockchain-based video systems are designed to build a decentralized and flexible video ecosystem by enabling a direct interaction among users, video providers (VPs), and service providers. In blockchain-based video systems, the heterogeneous qualities and formats of the video streams usually require massive computational resources to transcode them into different versions and formats to meet distinct requirements of users. However, current blockchains cannot handle massive and heterogeneous video streaming due to limited computing capacity and long transaction times. To deal with this issue, in this paper, leveraging mobile edge computing (MEC) technology, we propose a blockchain-based MEC architecture, where small base stations (SBSs) allocate their computation as well as communication resources for providing video streaming in a distributed and secure manner. Moreover, to improve the operation efficiency, we use a series of smart contracts to enable a self-organized video transcoding and delivery service without a centralized controller. Then, users, SBSs, and VP could adjust their strategies according to the transactional information on blockchain. Moreover, we formulate the video transcoding and delivery problem as a three-stage Stackelberg game. We analyze the sub-game equilibrium in each stage and the interplays of the three-stage game. Last, we propose an iterative algorithm to solve the problem. Simulation results show that the proposed approach could obtain the good performance in terms of average time to finality (TTF), average access delay, and network cost.

In order to help user terminal devices (UTDs) efficiently handle computation-intensive and time-delay sensitive computing task, multi-access edge computing (MEC) has been proposed. However, due to the differences among the performance of UTDs, and the resource limitation of MEC servers, the joint optimization between the offloading decisions of UTDs and the allocation of resources in network is still a focus of the research. This paper studies the joint computation offloading and resource allocation strategy in multi-user and multi-server scenarios. Firstly, we formulate the joint optimization problem of computation offloading and resource allocation as a mixed integer nonlinear programming (MINP) problem to minimize the energy consumption of UTDs, by constraining the offloading decision, channel selection, power allocation and resource allocation. Secondly, we propose a two-stage heuristic optimization algorithm based on genetic algorithms, which divides the joint optimization problem of computation offloading and resource allocation in two stages. Based on the coupling relationship between the offloading decision and the resource allocation scheme, we iteratively update the solution of the problem, and finally obtain the stable convergence solution of the optimization problem. Finally, the proposed algorithm is compared with other classical methods to prove the effectiveness.

The application of network slicing to mobile edge computing (MEC) systems has aroused great interests from both academia and industry. However, the optimization of network slicing and MEC in most existing research works only focuses on resource slicing, energy scheduling, and power allocation from the perspective of mobile devices, without considering the operator's revenue. In this paper, we propose a novel framework for network slicing in MEC systems, including slice request admission and a revenue model, to investigate the operator's revenue escalation problem while considering traffic variations. The revenue model is mainly composed of the longer-term revenue and short-term revenue. Particularly, we jointly optimize slice request admission in the long-term and resource allocation in the short-term to maximize the operator's average revenue. By employing the Lyapunov optimization technique, we develop an algorithm without requiring any prior-knowledge of traffic distributions, referred to as the DNSRA, to solve the problem. To reduce the computational complexity of directly solving the DNSRA, we decouple the optimization variables for efficient algorithm design. By this, the strategies for user association and CPU-cycle frequency are obtained in closed forms, respectively. Power allocation and subcarriers assignment are obtained by employing the successive convex approximation approach. Meanwhile, we develop a heuristic algorithm to obtain the dynamic slice request admission decision. Simulation results show that the proposed DNSRA can strike a flexible balance between the average revenue and the average delay, and can significantly increase the operator's revenue against existing schemes.

In this paper, we study unmanned aerial vehicle (UAV) assisted mobile edge computing (MEC) with the objective to optimize computation offloading with minimum UAV energy consumption. In the considered scenario, a UAV plays the role of an aerial cloudlet to collect and process the computation tasks offloaded by ground users. Given the service requirements of users, we aim to maximize UAV energy efficiency by jointly optimizing the UAV trajectory, the user transmit power, and computation load allocation. The resulting optimization problem corresponds to nonconvex fractional programming, and the Dinkelbach algorithm and the successive convex approximation (SCA) technique are adopted to solve it. Furthermore, we decompose the problem into multiple subproblems for distributed and parallel problem solving. To cope with the case when the knowledge of user mobility is limited, we adopt a spatial distribution estimation technique to predict the location of ground users so that the proposed approach can still be applied. Simulation results demonstrate the effectiveness of the proposed approach for maximizing the energy efficiency of UAV., 33 pages, 7 figures, IEEE single-column journal

Mobile Edge Computing (MEC) is a new computing paradigm with great potential to enhance the performance of user equipment (UE) by offloading resource-hungry computation tasks to lightweight and ubiquitously deployed MEC servers. In this paper, we investigate the problem of offloading decision and resource allocation among multiple users served by one base station to achieve the optimal system-wide user utility, which is defined as a trade-off between task latency and energy consumption. Mobility in the process of task offloading is considered in the optimization. We prove that the problem is NP-hard and propose a heuristic mobility-aware offloading algorithm (HMAOA) to obtain the approximate optimal offloading scheme. The original global optimization problem is converted into multiple local optimization problems. Each local optimization problem is then decomposed into two subproblems: a convex computation allocation subproblem and a non-linear integer programming (NLIP) offloading decision subproblem. The convex subproblem is solved with a numerical method to obtain the optimal computation allocation among multiple offloading users, and a partial order based heuristic approach is designed for the NLIP subproblem to determine the approximate optimal offloading decision. The proposed HMAOA is with polynomial complexity. Extensive simulation experiments and comprehensive comparison with six baseline algorithms demonstrate its excellent performance.

Vehicular edge computing (VEC) is considered as a novel paradigm to enhance the safety of automated vehicles and intelligent transportation systems (ITS). The computation offloading strategies are the key point of VEC, and the effect of time-varying channels cannot be ignored during the task transmission period. This paper investigates the utility maximization problem with task delay requirement constraints, in which the influence of time-varying channel on the task offloading strategies during the task offloading period is considered. The time-varying fading channel leads to the time-varying spectrum efficiency (SE), so the previous offloading strategies are questionable when the additional uncertain allocated bandwidth is taken into account. To deal with it, we first propose a linearization based Branch and Bound (LBB) algorithm to solve the fixed SE problem without considering the time-varying channel characteristics. Considering the complexity of the LBB algorithm, a closest rounding integer (CRI) algorithm is proposed to solve the fixed SE problem. Then, based on the resource allocation strategies of the fixed SE problem, we propose the LBB based computation offloading (LBBCO) algorithm and the CRI based computation offloading (CRICO) algorithm to solve the original problem for both the static tasks and dynamic tasks. The proposed LBBCO/CRICO algorithms are also applicable to multi-vehicle and multi-task scenarios. Furthermore, we analyze the effect of small-scale fading on the proposed offloading strategies. The simulation results show that the average utilities of LBBCO and CRICO algorithms have a small gap by 3.93% and 6.13% only to the upper bound, respectively. Meanwhile, the proposed LBBCO and CRICO algorithms can outperform the previous state-of-the-art solution by 4.52% and 2.38%, respectively.

Blockchain technology is developing rapidly and has been applied in various aspects, among which there are broad prospects in Internet of Things (IoT). However, IoT mobile devices are restricted in communication and computation due to mobility and portability, so that they can’t afford the high computing cost for blockchain mining process. To solve it, the free resources displayed on non-mining-devices and edge cloud are selected to construct collaborative mining network(CMN) to execute mining tasks for mobile blockchain. Miners can offload their mining tasks to non-mining-devices within a CMN or the edge cloud when there are insufficient resources. Considering competition for resource of non-mining-devices, resource allocation problem in a CMN is formulated as a double auction game, among which Bayes-Nash Equilibrium (BNE) is analyzed to figure out the optimal auction price. When offloading to edge cloud, Stackelberg game is adopted to model interactions between edge cloud operator and different CMNs to obtain the optimal resource price and devices’ resource demands. The mechanism realizes improving the mining utility in mining networks while ensuring the maximum profit of edge cloud operator. Finally, profits of mining networks are compared with an existing mode which only considers offloading to edge cloud. Under the proposed mechanism, mining networks obtain 6.86% more profits on average.

By performing data processing at the network edge, mobile edge computing can effectively overcome the deficiencies of network congestion and long latency in cloud computing systems. To improve edge cloud efficiency with limited communication and computation capacities, we investigate the collaboration between cloud computing and edge computing, where the tasks of mobile devices can be partially processed at the edge node and at the cloud server. First, a joint communication and computation resource allocation problem is formulated to minimize the weighted-sum latency of all mobile devices. Then, the closed-form optimal task splitting strategy is derived as a function of the normalized backhaul communication capacity and the normalized cloud computation capacity. Some interesting and useful insights for the optimal task splitting strategy are also highlighted by analyzing four special scenarios. Based on this, we further transform the original joint communication and computation resource allocation problem into an equivalent convex optimization problem and obtain the closed-form computation resource allocation strategy by leveraging the convex optimization theory. Moreover, a necessary condition is also developed to judge whether a task should be processed at the corresponding edge node only, without offloading to the cloud server. Finally, simulation results confirm our theoretical analysis and demonstrate that the proposed collaborative cloud and edge computing scheme can evidently achieve a better delay performance than the conventional schemes.