Cooperative Scheduling Algorithm Research Articles

An Optimized Collaborative Scheduling Algorithm for Prioritized Tasks with Shared Resources in Mobile-Edge and Cloud Computing Systems

Mobile edge computing (MEC) is a promising technology that has the potential to meet the latency requirements of next-generation mobile networks. Since MEC servers have limited resources, an orchestrator utilizes a scheduling algorithm to decide where and when each task should execute so that the quality of service (QoS) of each task is achieved. The scheduling algorithm should use the least possible resources required to meet the service demands. In this paper, we develop a two-level cooperative scheduling algorithm with a centralized orchestrator layer. The first scheduling level is used to schedule tasks locally on MEC servers. In contrast, the second level resides at the orchestrator and assigns tasks to a neighboring base station or the cloud. The tasks serve in accordance with their priority, which is determined by the latency and required throughput. We also present a resource optimization algorithm for determining resource distribution in the system in order to ensure satisfactory service availability at the minimum cost. The resource optimization algorithm contains two variations that can be employed depending on the traffic model. One variant is used when the traffic is uniformly distributed, and the other is used when the traffic load is unbalanced among base stations. Numerical results show that the cooperative model of task scheduling outperforms the non-cooperative model. Furthermore, the results show that the suggested scheduling algorithm performs better than other well-known scheduling algorithms, such as shortest job first scheduling and earliest deadline first scheduling.

An Adaptive Multi-Channel Cooperative Data Transmission Scheduling in VANETs.

The Internet of Vehicle (IoV) technology is one of the most important technologies of modern intelligent transportation. The data transmission scheduling method is a research hotspot in the technology of IoV. It is a challenge to ensure the stability of data transmission due to fast network topology changes, high data transmission delays, and some other reasons. Aiming at the above problems, a multi-channel data transmission cooperative scheduling algorithm is proposed. First, construct a feasible interference map based on the data items sent and received by vehicles in the road scene. Second, assign channels to the nodes in the interference map based on the Signal-to-Interference-Noise-Ratio (SINR). Finally, the optimal multi-channel data transmission cooperative scheduling scheme is achieved through the ISing model. Simulation results show that compared with the traditional algorithm, the network service capacity is increased by about 31% and the service delay is reduced by about 20%. It ensures that emergency data is preferentially transmitted to the target vehicle and the maximum weighted service capacity of the network.

Dynamic Clustering and Cooperative Scheduling for Vehicle-to-Vehicle Communication in Bidirectional Road Scenarios

Efficient data dissemination is critical for enabling emerging applications in vehicular ad hoc networks. As a typical traffic scenario, the bidirectional road scenario of highways bring unique challenges on well exploiting the benefit of vehicle-to-vehicle (V2V) communication for data sharing among vehicles driving in opposite directions. This paper is dedicated to investigating the characteristics of data services in such a scenario and exploring new opportunities for enhancing overall system performance. Specifically, we present a system architecture to enable the road-side unit assisted data scheduling via vehicle-to-infrastructure communication. Then, we give a theoretical analysis on the opportunity of successful data sharing among vehicles driving in opposite directions based on the analysis of signal-to-interference-noise-ratio of V2V communication. On this basis, we propose a clustering mechanism based on the design of a time division policy and the derivation of the optimal cluster length. In addition, a cluster association strategy is designed to enable vehicles to dynamically join or leave a cluster based on their real-time velocities. Furthermore, a two-phase backoff mechanism is designed for distributed data sharing based on V2V communication, and a cooperative scheduling algorithm is proposed for selecting sender vehicles as well as the corresponding data items for broadcasting. Finally, we build the simulation model and give a comprehensive simulation study, which demonstrates that the proposed solutions can effectively improve the overall system performance.

A cooperative waiting strategy based on elliptical areas for the Dynamic Pickup and Delivery Problem with Time Windows

SummaryThe purpose of this paper to present a cooperative scheduling algorithm for solving the Dynamic Pickup and Delivery Problem with Time Windows (DPDPTW). The idea behind cooperative waiting strategies is to calculate simultaneously the waiting times for all nodes in the solution. Classical non‐cooperative scheduling algorithms perform the scheduling for each route independently of the scheduling of the other routes. We present the Cooperative Scheduling Problem (CSP) based on the elliptical areas generated by vehicles waiting at their nodes. The CSP is solved by means of a genetic algorithm and is evaluated by using a set of benchmarks based on real‐life data found in the literature. Initially, two waiting strategies are presented: Wait‐Early‐Time scheduling and Balanced‐Departure scheduling. Extensive empirical simulations have been carried out by analyzing the degree of dynamism and the average waiting time, a new concept defined to take into account the gap between the time windows of pickup and delivery nodes. Copyright © 2016 John Wiley & Sons, Ltd.

간섭채널에서 에너지 효율적인 전송률 스케줄링을 위한 게임이론적 접근

A game theoretic approach is applied for studying the energy efficient rate scheduling. The individual utility function is defined first. Then, a non cooperative rate game is modeled in which each user decides the transmission rate to maximize its own utility. The utility function considered here is the consumed energy for the individual user’s data transmissions. In particular, using the fact that the utility function is convex, we prove the existence of Nash Equilibrium in the energy efficient rate scheduling problem at hand. Accordingly, a non cooperative scheduling algorithm is provided. For better energy efficiency, the sum of the individual user’s utility function is optimized. ∙제1저자 : 오창윤 ∙교신저자 : 오창윤 ∙투고일 : 2014. 5. 16, 심사일 : 2014. 6. 26, 게재확정일 : 2014. 8. 1. * 인하공업전문대학 정보통신과(Dept. of Information and Communication Engineering, Inha Technical College) ※ 이 논문은 2014학년도 인하공업전문대학 교내연구비지원에 의하여 연구되었음. 56 Journal of The Korea Society of Computer and Information August 2014 Finally, the convergence analysis and numerical results to show the energy efficiency of the proposed algorithms are provided. ▸