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

ATPSO: Adaptive Task Priority scheduling and Offloading Optimization Scheme for vehicles in harsh environments

AD HOC NETWORKS 2025年 175卷

作者： Li, Xiguang Zhao, Yuchen Sun, Yunhe Muthanna, Ammar Hawbani, Ammar Zhao, Liang Shenyang Aerosp Univ Sch Comp Sci Shenyang 110136 Liaoning Peoples R China Peoples Friendship Univ Russia RUDN Univ Moscow 117198 Russia

In harsh environments, vehicle driving risks significantly increase. Safety enhancing applications can mitigate these risks, but can also introduce delay-sensitive and computationally intensive tasks that challenge vehicle data processing and communication. This paper proposes an Adaptive Task Priority scheduling and Offloading Optimization Scheme (ATPSO) based on the Vehicular Edge Computing (VEC) paradigm to improve Quality of Service (QoS) for safety tasks. Firstly, a multifactor prioritization mechanism using environment awareness is developed, leveraging SHapley Additive ExPlanations (SHAP) and XGBoost models to quantify safety priorities from real-time data and assess vehicle risks. A Transformer model dynamically adjusts priority weights to minimize risk. Secondly, the local queue stability problem is addressed as a Lyapunov optimization problem, proposing a multi-queue priority scheduling and distributed resource allocation scheme. Lastly, a Markov Decision Process (MDP) model is constructed to handle dynamic computational offloading, and the Entropy-Enhanced Multi-Agent Soft Actor-Critic (EE-MASAC) algorithm is introduced to optimize offloading strategies and resource allocation. Simulation results demonstrate that ATPSO effectively reduces safety task delays, improves task completion rates, and lowers vehicle risk scores, outperforming existing methods in adaptability and performance, offering a solid foundation for practical deployment of vehicle safety applications.

关键词： Vehicular edge computing Task offloading resource allocation scheduling algorithms Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Real-Complex Hybrid User scheduling Algorithm Under the Delay-Restricted Scenario

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2024年第4期13卷 1163-1167页

作者： Xiong, Xiaoxiong Dong, Chao Bian, Yaohui Niu, Kai Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China

For delay-restricted multi-slot scenarios, this letter proposes a real-complex hybrid user scheduling (RCHS) algorithm. RCHS is designed for real-complex hybrid modulation (RCHM) and widely-linear receivers. The RCHM allows the user equipment devices (UEs) to transmit symbols through the real or imaginary part of the complex channel. It enables RCHS to have finer scheduling granularity than the complex scheduling algorithms. Because of the finer scheduling granularity, RCHS can achieve higher sum capacity through selection. The RCHS proposed in this letter can enable repeated service of those UEs which bring higher sum capacity gain on multiple slots. Meanwhile, RCHS adopts a low-complexity updating method to improve the sum capacity. Simulation results under interference-limited scenarios demonstrate that the sum capacity of RCHS outperforms the comparative algorithms under both fully- and over-loaded scenarios. And RCHS does not exhibit significant sum capacity loss under lightly over-loaded scenarios.

关键词： Modulation Symbols Streams scheduling Correlation scheduling algorithms Simulation Real-complex hybrid modulation widely-linear receiver multi-slot user scheduling delay-restricted scenario

来源：评论

学校读者我要写书评

暂无评论

Large-Scale WSNs Resource scheduling Algorithm in Smart Transportation Monitoring Based on Differential Ion Coevolution and Multi-Objective Decomposition

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2024年第1期25卷 829-838页

作者： Zhang, Lei Liu, Tingting Ding, Xuefeng China Three Gorges Univ Hubei Prov Engn Technol Res Ctr Construct Qual Te Yichang 443002 Peoples R China China Three Gorges Univ Coll Comp & Informat Technol Yichang 443002 Peoples R China China Three Gorges Univ Sch Econ & Management Yichang 443002 Peoples R China

At present, wireless sensor networks (WSNs) play an important role in collecting and processing information in smart transportation monitoring. Inevitably, the performance of the resource scheduling algorithm directly determines the quality of service of WSNs. In this paper, we present a novel large-scale resource scheduling algorithm of WSNs based on differential ion coevolution and multi-objective decomposition (DIC-MOD) to optimize the performance of WSNs. We first introduce a certain number of mobile nodes with higher configuration into WSNs and consider them as relay nodes to strengthen the balance of energy consumption in the entire WSNs. Subsequently, we build a multi-index service quality evaluation model, including coverage, connectivity, energy efficiency and the number of nodes required to work, to characterize the comprehensive performance of WSNs. Afterward, to optimize the above complex model effectively, we propose a multi-objective resource scheduling algorithm, in which a differential ion coevolution strategy and a fast individual selection strategy based on multi-objective decomposition optimization are proposed in specific. Compared with other state-of-the-art algorithms, the experimental results finally show that the performance of WSNs on multiple indicators obtained by the proposed algorithm has been improved considerably.

关键词： Wireless sensor networks Monitoring Wireless communication Smart transportation Optimization scheduling algorithms Relays Multi-objective optimization evolutionary algorithms wireless sensor networks resource scheduling smart transportation

来源：评论

学校读者我要写书评

暂无评论

An improving strategy for LTE downlink scheduling algorithms based on QoS requirement

An improving strategy for LTE downlink scheduling algorithms...

引用

IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR

作者： Zhipeng Jiang Wei Zhang Suixiang Gao Lei Zhou School of Mathematics University of Chinese Academy of Sciences Central Research Institute of Huawei Corporation

ISBN: (纸本)9781467380812

LTE is an all IP network. The scheduling in its downlink channels is a key problem. Although many algorithms have been designed and analyzed, the QoS for the users in poor channel conditions are not enough to be ensured sometimes. We design a method to enhance the capacity of the system, which is a modifying strategy available for most existing algorithms. Our intuition is to allocate more resources to the users in poorer channel conditions without declining the QoS of the users in better channel. Simulations show that our strategy can satisfy the QoS for more users.

关键词： Quality of service Delays Downlink scheduling algorithms Algorithm design and analysis Throughput

来源：评论

学校读者我要写书评

暂无评论

OLMS: A Flexible Online Learning Multi-Path scheduling Framework

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2025年第3期12卷 2277-2291页

作者： Cai, Kechao Chen, Zhuoyue Zhang, Jinbei Lui, John C. S. Shenzhen Campus Sun Yat Sen Univ Sch Elect & Commun Engn Shenzhen Campus Shenzhen 510275 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

Over the past decade, there has been a tremendous surge in the inter-connectivity among hosts in networks. Many multi-path transport protocols, such as MPTCP, MPQUIC, and MPRDMA, have emerged to facilitate multi-path data transmissions between pairs of hosts. However, existing packet schedulers in these protocols are quite limited as they neglect the stochastic nature inherent in heterogeneous paths, such as, round-trip time and available bandwidth. Moreover, users have diverse requirements;for instance, some prioritize low latency, while others consistently seek to achieve high bandwidth. In this paper, we propose a flexible Online Learning Multi-path scheduling (OLMS) framework to schedule packets to multiple paths and meet various user-defined requirements by learning the dynamic characteristics of paths in various applications. Specifically, we consider two types of applications, which are 1) maxRTT constrained and 2) bandwidth constrained, and use OLMS to schedule packets to satisfy the distinct user-defined requirements. Our theoretical analysis demonstrates that OLMS achieves guarantees with sublinear regret and sublinear violation. Furthermore, we implement a prototype of OLMS in MPQUIC and conduct experiments across different scenarios. Our experiments on Mininet show that OLMS enables an 8.42%-18.71% increase in bandwidth utilization in the maxRTT constrained application and negligible violations of user-defined requirements in both applications compared to other schedulers. Additionally, OLMS reduces flow completion times by 4.22%-10.26% compared to other schedulers, all without incurring large overhead.

关键词： scheduling Bandwidth Schedules Transport protocols scheduling algorithms Data communication Receivers Monitoring Estimation Prototypes Dynamic scheduling multi-armed bandit problem multi-path data transmission protocols online learning

来源：评论

学校读者我要写书评

暂无评论

A theoretical comparison of job scheduling algorithms in cloud computing environment

A theoretical comparison of job scheduling algorithms in clo...

引用

International Conference on Next Generation Computing Technologies (NGCT)

作者： Abhishek Gupta H S Bhadauria Annapurna Singh Jagdish Chandra Patni Department of Computer Science and Engineering GBPEC Pauri India Deunspartment of CIT UPES Dehradun India

ISBN: (纸本)9781467368100

Cloud computing is a dynamic, scalable and payper-use distributed computing model empowering designers to convey applications amid job designation and storage distribution. Cloud computing encourages to impart a pool of virtualized computer resource empowering designers to convey applications amid job designation and storage distribution. The cloud computing mainly aims to give proficient access to remote and geographically distributed resources. As cloud technology is evolving day by day and confronts numerous challenges, one of them being uncovered is scheduling. scheduling is basically a set of constructs constructed to have a controlling hand over the order of work to be performed by a computer system. algorithms are vital to schedule the jobs for execution. Job scheduling algorithms is one of the most challenging hypothetical problems in the cloud computing domain area. Numerous deep investigations have been carried out in the domain of job scheduling of cloud computing. This paper intends to present the performance comparison analysis of various pre-existing job scheduling algorithms considering various parameters. This paper discusses about cloud computing and its constructs in section (i). In section (ii) job scheduling concept in cloud computing has been elaborated. In section (iii) existing algorithms for job scheduling are discussed, and are compared in a tabulated form with respect to various parameters and lastly section (iv) concludes the paper giving brief summary of the work.

关键词： Cloud computing scheduling algorithms Computational modeling Heuristic algorithms scheduling Computers

来源：评论

学校读者我要写书评

暂无评论

Study and analysis of task scheduling algorithms in clouds based on artificial bee colony

Study and analysis of task scheduling algorithms in clouds b...

引用

International Congress on Technology, Communication and Knowledge (ICTCK)

作者： Elaheh Hallaj Seyyed Reza Kamel Tabbakh Department of Software Engineering Islamic Azad University Neyshabur Iran Department of Software Engineering Islamic Azad University Mashhad Iran

ISBN: (纸本)9781467397636

Task scheduler plays a significant role in cloud computing, since it has a direct effect on cloud performance. As cloud scheduling is known to be an NP-hard problem, swarm intelligence-based techniques are widely used in this paradigm, due to their ability of searching for large scale problem solutions in an efficient manner. This paper, discusses some scheduling algorithms based on artificial bee colony. These algorithms exploit the smartness of bees' behavior to reach an optimal assignment of tasks to resources. An analytical comparison has also been done to briefly show the characteristics and applications of bee colony technique for scheduling in distributed computing area.

关键词： scheduling Virtual machining Cloud computing Algorithm design and analysis Heuristic algorithms scheduling algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Implementation of three scheduling algorithms in the smart grid communications over 4G networks

Implementation of three scheduling algorithms in the smart g...

引用

International Conference on Space Science and Communication (IconSpace)

作者： Ayman Hajjawi Mahamod Ismail Tito Yuwono Department of Electronic Electrical and System Engineering The National University of Malaysia (UKM) Selangor Malaysia Department of Electrical Engineering Universitas Islam Indonesia Yogyakarta Indonesia

The latest 4G wireless technology, Long Term Evolution (LTE), is expected to be a promising wireless network for smart grid communications due to its high data rate and low delay. The needs of real time communications in the smart grid require reliable, confident and well tested wireless networks. scheduling is one of the mechanisms which has a crucial role on the smart grid performance since it is in charge of the bandwidth resource allocation process. However, due to the fact that LTE has not been intended for smart grid communications, the performance of the scheduling algorithms must be optimized and properly tested. This paper aims at evaluating the performance of three scheduling algorithms, namely Frame Level Scheduler, Exponential Rule and Logarithmic Rule algorithms, in the smart grid communications. The evaluation process is based on their performance in the smart grid for three applications (VoIP, video surveillance and metering data) with specific data rate and delay requirements for each application. The results are evaluated in terms of throughput, delay and packet loss ratio.

关键词： Smart grids Delays Real-time systems scheduling algorithms Throughput Long Term Evolution Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Energy consumption evaluation for LTE scheduling algorithms

Energy consumption evaluation for LTE scheduling algorithms

引用

International Symposium on Networks, Computers and Communications (ISNCC)

作者： Takoua Ghariani Badii Jouaber Institut Mines-Telecom/Telecom SudParis

Reducing energy consumption over mobile networks and devices is an important and challenging issue. On the one hand, power is a limited resource on mobile devices and its usage should be optimized. On the other hand, energy consumption constitutes an important item within operating expenditure (OPEX) for network providers. In the literature, many studies are dedicated to evaluate scheduling mechanisms from the energy consumption perspective. However, most of these only consider few well known schemes such as Proportional Fair, Best-CQI and Round Robin. In the paper, we extend these studies to include new promising scheduling techniques such as PF, EXP-PF and MLWDF algorithm. In addition, we consider multiple metrics related to QoS, energy and fairness. Performance results show that MLWDF is more energy efficient than EXP-PF and PF schemes while providing better QoS for users.

关键词： scheduling algorithms Throughput Quality of service Energy consumption Resource management Delays Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Aspect-Oriented Customization of the scheduling algorithms and the Resource Access Protocols of a Real-Time Operating System Family

Aspect-Oriented Customization of the Scheduling Algorithms a...

引用

IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

作者： Yusuke Harada Kazuki Abe Myungryun Yoo Takanori Yokoyama Tokyo City University Tokyo Japan Presently with PFU Limited

ISBN: (纸本)9781509018949

Various embedded systems are used in a smart city and the required functionalities of real-time operating systems (RTOS) are different depending on applications. Most RTOSs adopt just fixed priority scheduling. Some applications, however, require dynamic scheduling algorithms. The paper presents a method to customize the scheduling algorithm and the resource access protocol of an OSEK OS using aspect-oriented programming (AOP). We define aspects to replace the fixed priority scheduling mechanism of the OSEK OS with an Earliest Deadline First (EDF) scheduling mechanism or a Rate Monotonic Critical Laxity (RMCL) scheduling mechanism. We also define aspects to customize the resource access protocol for EDF scheduling and RMCL scheduling. By using the aspects, we can customize the scheduling algorithm and the resource access protocol without modifying the original source code. This improves the maintainability of the RTOS family. The evaluation results show that the overhead of AOP is small enough.

关键词： scheduling algorithms Access protocols Operating systems Optimal scheduling Dynamic scheduling Real-time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：