检索结果-内蒙古大学图书馆

Periodic Deterministic Sampling and scheduling algorithms for Minimum Age of Information in Time-Slotted Multihop Networks

引用

IEEE Internet of Things Journal 2025年第9期12卷 12958-12974页

作者： Raj, Nibin Vineeth, B.S. Sharma, Pratik Indian Institute of Space Science and Technology Department of Avionics Thiruvananthapuram695547 India

We consider a time-slotted multihop wireless sensor network used for a remote estimation application. Sensor nodes sample processes of interest and convergecast the sampled data to a sink over the multihop wireless network. The processes are remotely estimated at the sink. For such applications, the Age of Information (AoI) is a relevant performance metric. Motivated by real-world protocols, such as 802.15.4e TSCH, we design novel periodic deterministic sampling and scheduling algorithms for minimizing the average AoI (AAoI) for convergecast in tree network topologies with K-hop interference constraints. We obtain an analytical characterization of the AAoI in terms of the period of the policy as well as hop distances of the source nodes to the sink. For periodic deterministic policies, the AAoI minimization problem is formulated as an integer programming problem which is relaxed to a linear programming problem to obtain numerical lower bounds. Novel analytical lower bounds on the AAoI for periodic deterministic policies in tree networks with K-hop interference constraints are obtained. We simulate and compare the AAoI performance of our periodic deterministic policies and show that they have an AAoI close to the lower bounds for that period. Through simulations, we also show that the AAoI of the proposed policies is smaller compared to other multihop AoI-minimizing policies in prior work, such as Age-Difference and Age-Debt. We also discuss extensions to the case of general functions of the AoI. © 2014 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy and Security-Aware Task scheduling in Fog Computing: A Comparative Analysis of scheduling algorithms using IoT 4

Energy and Security-Aware Task Scheduling in Fog Computing: ...

引用

4th International Conference on Evolutionary Computing and Mobile Sustainable Networks, ICECMSN 2024

作者： Sehgal, Nikita Bansal, Savina Bansal, R.K. Department of Electronics & Communication Engineering Maharaja Ranjit Singh Punjab Technical University Punjab Bathinda151001 India GianiZail Singh Campus College of Engineering & Technology Maharaja Ranjit Singh Punjab Technical University Punjab Bathinda151001 India

Efficient task scheduling in fog-cloud computing environments is essential for optimizing critical parameters such as energy efficiency, security, and real-time performance. Existing scheduling algorithms like Pure Random (PR) and Earliest Deadline First Random (EDF_R) often lack in generalization as its focus is primarily on individual aspects such as task deadlines or random task assignments, leading to inefficiencies in load balancing, resource utilization, and security management. The Security Aware scheduling (SAS) algorithm introduces a security-centric approach, prioritizing task assignment based on security requirements, thus ensuring tasks are allocated to nodes that meet or exceed their security needs. The Minimum Energy Security-Aware scheduling (MESA) algorithm addresses the energy constraints by minimizing energy consumption during task scheduling while maintaining security compliance. Furthermore, the Minimum Response Time Security-Aware scheduling (MRSA) algorithm aims to reduce response times by optimizing node selection based on both minimum response time and security requirements. Despite these advancements, there is a need for a more comprehensive solution that simultaneously addresses the challenges of energy efficiency, security, and real-time task execution. This research proposes the Optimal Energy-Security Aware scheduling (OESAS) framework, which integrates these critical factors, providing an adaptive and efficient scheduling solution for heterogeneous fog-cloud systems. © 2025 The Authors. Published by Elsevier B.V.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Task scheduling algorithms for Optical and SAR Satellite Collaboration in Wildfire Detection 10

Task scheduling Algorithms for Optical and SAR Satellite Col...

引用

10th Symposium on Novel Optoelectronic Detection Technology and Applications

作者： Wen, Zhijiang Wang, Chen Cai, Jingying Liu, Yan Zhang, Shengyu Hu, Haiying Innovation Academy for Microsatellites of Chinese Academy of Sciences China Shanghai Engineering Center for Microsatellites China University of Chinese Academy of Sciences China

ISBN: (数字)9781510688155

ISBN: (纸本)9781510688148

Wildfires are a significant environmental challenge, particularly during wildfire seasons when the frequency of incidents dramatically increases. Continuous monitoring of wildfires is essential for early detection, and remote sensing satellites offer a powerful tool for this purpose. However, as the number of wildfire targets rises during peak seasons, tasking of remote sensing satellite constellations becomes increasingly difficult. This complexity is further compounded by the growing number and type of satellites in modern constellations, each equipped with different payloads, such as optical and synthetic aperture radar (SAR) sensors. The need for coordinated observation between these heterogeneous satellite types poses significant challenges for task scheduling. In this context, developing effective collaborative tasking algorithms for satellite constellations becomes critical. This paper presents a novel approach to satellite collaborative tasking for wildfire detection by introducing a clustering algorithm based on a sliding window and a target window assignment method using a greedy strategy. First, the sliding window clustering algorithm dynamically adjusts the window position to identify the optimal clustering results, factoring in key satellite parameters such as the side-slant angle and field of view. Following this, the target window assignment method, driven by a greedy strategy, allocates observation tasks based on an optimized scoring mechanism. The method also incorporates a conflict detection mechanism to resolve task scheduling conflicts, ensuring the efficient utilization of satellite resources. This approach addresses the complex scheduling problems inherent in coordinating observations among heterogeneous multi-satellite constellations. The proposed algorithms effectively enhance the collaborative observation capabilities of both optical and SAR satellites, providing a robust solution for wildfire monitoring and response. © 2025 SPIE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time scheduling algorithms for Improved Mobile Device Energy Efficiency

Real-Time Scheduling Algorithms for Improved Mobile Device E...

引用

2025 International Conference on Computer, Electrical and Communication Engineering, ICCECE 2025

作者： Panchani, Ajaykumar Devrajbhai EBay Inc. Selling Department Liberty HillTX United States

ISBN: (纸本)9798331513894

In the era of real-time applications dominating mobile devices, balancing enhanced performance with prolonged battery life has become a significant challenge. This paper explores the complexities of real-time scheduling algorithms, focusing on Earliest Deadline First (EDF) and Rate Monotonic (RM) algorithms, and their impact on energy consumption. Additionally, variations of these algorithms are introduced in the context of Dynamic Voltage Scaling (DVS), a technique crucial for achieving optimal performance with improved battery efficiency. Through an in-depth analysis of various conditions, including task numbers and worst-case processor utilization, the study demonstrates the effectiveness of these algorithms, making them indispensable in scenarios where energy efficiency is paramount. © 2025 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Job Generator for Evaluating and Comparing scheduling algorithms for Modern GPU Clouds 15

Job Generator for Evaluating and Comparing Scheduling Algori...

引用

15th International Conference on Cloud Computing and Services Science, CLOSER 2025

作者： Konopa, Michal Fesl, Jan Beránek, Ladislav Department of Data Science and Computing Systems Faculty of Agriculture and Technology University of South Bohemia České Budějovice Czech Republic

ISBN: (纸本)9789897587474

The steep technological and performance advances in GPU cards have led to their increasing use in data centers in the recent years, especially in machine learning jobs. However, high hardware performance alone does not guarantee (sub) optimal utilization of computing resources, especially when the cost associated with power consumption also needs to be increasingly considered. As consequence of these realities, various job scheduling algorithms have been and are being developed to optimize the power consumption in data centers with respect to defined constraints. Unfortunately, there is still no known, widely used, parametrizable dataset that serves as a de facto standard for simulating scheduling algorithms and the resulting ability to compare their performance against each other. The goal of this paper is to describe a simple job set generator designed to run on modern GPU architectures and to introduce the newly created data set suitable for evaluation the scheduling algorithms. Copyright © 2025 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Analytical Overview Of Virtual Machine Load Balancing scheduling algorithms with their Comparative Case Study

arXiv

引用

arXiv 2025年

作者： Vaidya, Priyank Sharma, Abhinav Patel, Murli Doshi, Nishant Department of Computer Science and Engineering Pandit Deendayal Energy University India

This paper contains the analysis of VM load balancing scheduling algorithms discussing its advantages, disadvantages along with applications. As the Industry shifts towards adapting cloud technologies, it is important to optimally load balance the client requests to the servers. It becomes important to the cloud providers to adapt technology so that its customers don’t fall behind of latency issues. The algorithm which is more often used in the load balancers are analytically discussed. The fundamentals regarding virtualisation & VM allocation concepts are also covered. © 2025, CC BY-NC-SA.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time scheduling algorithms for Improved Mobile Device Energy Efficiency

Real-Time Scheduling Algorithms for Improved Mobile Device E...

引用

International Conference on Computer, Electrical & Communication Engineering (ICCECE)

作者： Ajaykumar Devrajbhai Panchani Selling Department eBay Inc. Liberty Hill Texas USA

ISBN: (数字)9798331513894

ISBN: (纸本)9798331513900

关键词： Performance evaluation Context scheduling algorithms Heuristic algorithms Real-time systems Energy efficiency Mobile handsets Dynamic voltage scaling Batteries Voltage control

来源：评论

学校读者我要写书评

暂无评论

Unifying scheduling algorithms for Group Completion Time

arXiv

引用

arXiv 2025年

作者： Lindermayr, Alexander Liu, Zhenwei Megow, Nicole University of Bremen Germany Zhejiang University China

We propose new abstract problems that unify a collection of scheduling and graph coloring problems with general min-sum objectives. Specifically, we consider the weighted sum of completion times over groups of entities (jobs, vertices, or edges), which generalizes two important objectives in scheduling: makespan and sum of weighted completion times. We study these problems in both online and offline settings. In the non-clairvoyant online setting, we give a novel O(log g)-competitive algorithm, where g is the size of the largest group. This is the first non-trivial competitive bound for many problems with group completion time objective, and it is an exponential improvement over previous results for non-clairvoyant coflow scheduling. Notably, this bound is asymptotically best-possible. For offline scheduling, we provide powerful meta-frameworks that lead to new or stronger approximation algorithms for our new abstract problems and for previously well-studied special cases. In particular, we improve the approximation ratio from 13.5 to 10.874 for non-preemptive related machine scheduling and from 4 + Ε to 2 + Ε for preemptive unrelated machine scheduling (MOR 2012), and we improve the approximation ratio for sum coloring problems from 10.874 to 5.437 for perfect graphs and from 11.273 to 10.874 for interval graphs (TALG 2008). © 2025, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithms for converged ring-based WDM-PON for mobile backhaul traffic

引用

OPTICAL SWITCHING AND NETWORKING 2020年 36卷

作者： Christodoulou, C. Manousakis, K. Ellinas, G. Univ Cyprus KIOS Res & Innovat Ctr Excellence Dept Elect & Comp Engn Nicosia Cyprus

In this work, different heuristic and optimization algorithms are proposed for downstream wavelength scheduling in ring-based WDM-PON mobile backhaul networks, where optical networking units (ONUs) are integrated with base stations (BSs). The main objective of this work is to improve the time delay of the packet delivery from the infrastructure to the end-users for both fixed and wireless traffic. This is achieved through dynamic wavelength scheduling and sharing techniques in a converged ring-based WDM-PON access architecture by taking into account the priorities of the data sent and also the cooperation area for mobile users between adjacent ONUs/BSs. Further, an integer linear program (ILP) was developed for wavelength selection, to be used as a benchmark when comparing with the two proposed algorithms. All heuristic algorithms and the optimization algorithm are examined under different traffic load and queue size scenarios to ascertain the network's performance in terms of maximum packet delivery delay.

关键词： Converged fiber-wireless Access networks Passive optical networks scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2020年第12期19卷 2903-2915页

作者： Hsu, Yu-Pin Modiano, Eytan Duan, Lingjie Natl Taipei Univ Dept Commun Engn New Taipei 23741 Taiwan MIT Informat & Decis Syst Lab Cambridge MA 02139 USA Singapore Univ Technol & Design Engn Syst & Design Pillar Singapore Singapore

Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a basestation (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for restless bandits. By exploring optimal structural results, we not only reduce the computational complexity of the MDP-based algorithm, but also simplify deriving a closed form of the Whittle index. Moreover, for the online case, we develop an MDP-based online scheduling algorithm and an index-based online scheduling algorithm. Both the structural MDP scheduling algorithm and the MDP-based online scheduling algorithm asymptotically minimize the average age, while the index scheduling algorithm minimizes the average age when the information arrival rates for all users are the same. Finally, the algorithms are validated via extensive numerical studies.

关键词： Age of information scheduling algorithms Markov decision processes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：