Scholarlink

In the preceding section, we introduced a preemptive scheduling strategy utilizing dual thresholds. Here, we present a Temporal and Distantial Priority (TADP) charging scheduling algorithm, which considers both the separation between nodes and the mobile charger as well as the arrival times of charging requests. TADP systematically assigns weights to these two factors, creating a mixed priority queue that guides the mobile charger in recharging the nodes. We conduct extensive simulations to validate the advantages of TADP. The results reveal that TADP enhances scheduling performance by ensuring the success of high-priority task scheduling and boosting the system’s overall stability.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Priority-Based Scheduling

  • 章节

  • 发表日期：

    2025年

查看全文
  • Chi Lin,
  • Yu Sun,
  • Wei Yang

摘要

In the preceding section, we introduced a preemptive scheduling strategy utilizing dual thresholds. Here, we present a Temporal and Distantial Priority (TADP) charging scheduling algorithm, which considers both the separation between nodes and the mobile charger as well as the arrival times of charging requests. TADP systematically assigns weights to these two factors, creating a mixed priority queue that guides the mobile charger in recharging the nodes. We conduct extensive simulations to validate the advantages of TADP. The results reveal that TADP enhances scheduling performance by ensuring the success of high-priority task scheduling and boosting the system’s overall stability.