计算机科学
背包问题
调度(生产过程)
物联网
优先次序
分布式计算
计算机网络
信息时代
数学优化
计算机安全
算法
数学
经济
经济
管理科学
作者
Oğuzhan Sayınbaş,Alper Köse,Mutlu Koca,Emin Anarım
标识
DOI:10.1109/lcomm.2023.3340863
摘要
We propose a novel scheduling strategy for prioritization-critical time-sensitive Internet of things (IoT) networks. The goal is to decrease the number of sensors with outdated information and minimize the difference between their age of information (AoI) and the specified limit, within a resource-constrained environment. The proposed approach relies on reformulating the original problem as a knapsack problem. This novel method is shown to outperform benchmarks to satisfy the needs of priority-aware IoT networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI