An Efficient Mobile Server Task Scheduling Algorithm in D2D Environment In the fifth generation mobile networks(5G), D2D (devicetodevice) communication technology is introduced to provide services to users by utilizing the resources of idle mobile devices, and users can schedule computing tasks to be executed on mobile servers (MSs). This paper aims at reducing overall time delay and energy consumption by taking into account MSs mobility, task attributes, resource status for D2D scenario. We formulate the matching problem as a onetoone matching game and propose a scheduling strategy based on binary graph matching algorithm. Simulations show that the strategy proposed in this paper can comprehensively reduce the task execution delay and energy consumption, and improve the success rate of task execution.

A performance comparison of heuristics for scheduling jobs in hybrid mobile topologies Hardware improvements of mobile devices have allowed them to be considered as firstclass resources at the edge, which has led to the need to propose new techniques and scheduling heuristics to make efficient usage of these devices. Current scheduling heuristics available in the literature do not take into account mobile grid nodes that do not rely on batteries to work, a factor that is of great importance in the advent of mobileedge computing. In this paper we propose a simple algorithm that incorporates a more advanced awareness of a mobile deviceu0027s power supply and we show that incorporating this characteristic can enable these heuristics to manage edge resources in a more efficient way.