Distributed Matching Theory-Based Task Re-Allocating for Heterogeneous Multi-UAV Edge Computing

Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not been fully considered yet.Moreover,most existing works neglect the fact that a task can only be executed on the UAV equipped with its desired service function(SF).In this backdrop,this paper formulates the task scheduling problem as a multi-objective task scheduling problem,which aims at maximizing the task execution success ratio while minimizing the average weighted sum of all tasks’completion time and energy consumption.Optimizing three coupled goals in a realtime manner with the dynamic arrival of tasks hinders us from adopting existing methods,like machine learning-based solutions that require a long training time and tremendous pre-knowledge about the task arrival process,or heuristic-based ones that usually incur a long decision-making time.To tackle this problem in a distributed manner,we establish a matching theory framework,in which three conflicting goals are treated as the preferences of tasks,SFs and UAVs.Then,a Distributed Matching Theory-based Re-allocating(DiMaToRe)algorithm is put forward.We formally proved that a stable matching can be achieved by our proposal.Extensive simulation results show that Di Ma To Re algorithm outperforms benchmark algorithms under diverse parameter settings and has good robustness.

Matching theory based user-grouping for indoor non-orthogonal multiple access visible light communication heterogeneous networks

This Letter proposes a model of indoor visible light communication(VLC)heterogeneous networks entirely based on LEDs with different specifications and applies non-orthogonal multiple access(NOMA)to it because of the narrow modulation bandwidth of LEDs.Moreover,a user-grouping scheme that is based on matching theory is proposed to improve the network achievable sum rate.Simulation results indicate that when each NOMA cluster contains 6 users,the proposed scheme has a 49.54%sum-rate enhancement compared with the traditional user-grouping scheme.As the number of users in each NOMA cluster increases,the proposed scheme performs better at the cost of computational complexity.

Thermoelastic Analysis of Non-uniform Pressurized Functionally Graded Cylinder with Variable Thickness Using First Order Shear Deformation Theory(FSDT) and Perturbation Method

Recently application of functionally graded materials（FGMs） have attracted a great deal of interest. These materials are composed of various materials with different micro-structures which can vary spatially in FGMs. Such composites with varying thickness and non-uniform pressure can be used in the aerospace engineering. Therefore, analysis of such composite is of high importance in engineering problems. Thermoelastic analysis of functionally graded cylinder with variable thickness under non-uniform pressure is considered. First order shear deformation theory and total potential energy approach is applied to obtain the governing equations of non-homogeneous cylinder. Considering the inner and outer solutions, perturbation series are applied to solve the governing equations. Outer solution for out of boundaries and more sensitive variable in inner solution at the boundaries are considered. Combining of inner and outer solution for near and far points from boundaries leads to high accurate displacement field distribution. The main aim of this paper is to show the capability of matched asymptotic solution for different non-homogeneous cylinders with different shapes and different non-uniform pressures. The results can be used to design the optimum thickness of the cylinder and also some properties such as high temperature residence by applying non-homogeneous material.

Joint computation offloading and resource allocation in vehicular edge computing networks

Vehicular Edge Computing(VEC)is a promising technique to accommodate the computation-intensive and delaysensitive tasks through offloading the tasks to the RoadSide-Unit(RSU)equipped with edge computing servers or neighboring vehicles.Nevertheless,the limited computation resources of edge computing servers and the mobility of vehicles make the offloading policy design very challenging.In this context,through considering the potential transmission gains brought by the mobility of vehicles,we propose an efficient computation offloading and resource allocation scheme in VEC networks with two kinds of offloading modes,i.e.,Vehicle to Vehicle(V2V)and Vehicle to RSU(V2R).We define a new cost function for vehicular users by incorporating the vehicles’offloading delay,energy consumption,and expenses with a differentiated pricing strategy,as well as the transmission gain.An optimization problem is formulated to minimize the average cost of all the task vehicles under the latency and computation capacity constraints.A distributed iterative algorithm is proposed by decoupling the problem into two subproblems for the offloading mode selection and the resource allocation.Matching theorybased and Lagrangian-based algorithms are proposed to solve the two subproblems,respectively.Simulation results show the proposed algorithm achieves low complexity and significantly improves the system performance compared with three benchmark schemes.

Joint Computing and Communication Resource Allocation for Satellite Communication Networks with Edge Computing

Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.