Task-scheduling scheme based on greedy algorithm in integrated radar and communication systems

Integrated radar and communication system can significantly enhance the work efficiency and considerably occupy less hardware resources. However, the integrated systems have limited supply resources, where a proper scheduling scheme is needed to meet the requirement of systems. Here, the authors propose a task-scheduling scheme based on the greedy algorithm, where each arrangement is the result of selecting the minimum shift time compared with the expected time. By guaranteeing the best result of each task, the minimum average time shift ratio (ATSR) of the whole tasks is obtained. Simulation results show that when the number of the tasks is quite large, the proposed scheme has more advantages than the traditional scheme based on time pointer algorithm. Authors’ proposed scheme can significantly reduce the average offset time of tasks while maintaining a satisfactory successful scheduling rate (SSR), which shows more advantages in the integrated systems.

Abstract licence: CC BY-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.