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

scheduling algorithm for Power Wireless Sensor Networks Considering Service Priority and Delay Constraints

IET SCIENCE MEASUREMENT & TECHNOLOGY 2025年第1期19卷

作者： Wen, Kaiyun Zhao, Hongshan North China Elect Power Univ Sch Elect & Elect Engn Baoding Peoples R China

The power wireless sensor network integrates wireless communication and intelligent sensing technology to monitor the operating status of power equipment in real-time, thereby improving the stability and safety of the power system. However, numerous sensor data flows may lead to network congestion and end-to-end delays. In addition, in the power system, monitoring data has different delay constraints and reliability requirements, and it is necessary to divide the flow into different priorities for transmission. Therefore, this paper proposes a scheduling algorithm for power wireless sensor networks that considers service priority. We construct a power wireless sensor network model that includes network topology, queue length and problem definition. Data flow priority and delay constraints are met by introducing queue weight factors and virtual queues. The Lyapunov optimisation method maximises the throughput of the priority classification-based power wireless sensor network. Moreover, the queue stability of the scheduling algorithm is theoretically proved. The simulation results show that the proposed algorithm can ensure the stability of all queues and strictly meet the priority and delay constraints of various data flows in the network.

关键词： condition monitoring wireless sensor networks prioritised QoS scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for Workflow-Based Applications in Optical Grid

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2008年第17-20期26卷 3011-3020页

作者： Sun, Zhenyu Guo, Wei Wang, Zhengyu Jin, Yaohui Sun, Weiqiang Hu, Weisheng Qiao, Chunming Shanghai Jiao Tong Univ State Key Lab Fiber Opt Local Area Networks & Adv Shanghai Peoples R China SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA

Grid is evolving to a more efficient global computing infrastructure by introducing optical network technology to support the advanced data-intensive distributed applications. scheduling such data-intensive applications includes assigning tasks on computational resources, routing lightpaths, and assigning wavelength channels for data communication. The scheduling problem is NP-hard in the traditional grid system, and in optical grids, it is more complicated due to the character of optical networks. In this paper, we formulate the scheduling problem in optical grids and propose a novel scheduling algorithm which modifies the scheduling order according to actual importance of each task to search for a better solution. We call it the scheduled critical path (SCP) algorithm. We compare the scheduling results obtained by the SCP algorithm with the optimal results calculated by OPL studio software on a 3-node optical grid. To evaluate the performance of the proposed algorithm on more complicated systems, we construct a simulator which is able to schedule the application to the optical grid according to a certain scheduling algorithm. The simulation results prove the efficiency of the SCP algorithm.

关键词： Grid computing optical network scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm FOR CONDITIONAL RESOURCE SHARING - A HIERARCHICAL REDUCTION APPROACH

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第4期13卷 425-438页

作者： KIM, TW YONEZAWA, N LIU, JWS LIU, CL NEC CORP LTD ULSI SYST DEV LABSKAWASAKIKANAGAWA 211JAPAN UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801

A new scheduling algorithm for dataflow graphs with nested conditional branches is presented. The algorithm employs a bottom-up approach to transform a dataflow graph with conditional branches into an ''equivalent'' one that has no conditional branches. A schedule is then obtained for the latter, using a conventional scheduling algorithm, from which a schedule for the former is derived. Our approach is particularly effective when there is a large number of nested conditional branches in a dataflow graph.

关键词： scheduling algorithm Resource management Processor scheduling Hardware Costs Adders Concurrent computing Very large scale integration Time factors Arithmetic

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm based on preemptive priority and hybrid data structure for cognitive radio technology with vehicular ad hoc network

引用

IET COMMUNICATIONS 2019年第20期13卷 3443-3451页

作者： Pal, Raghavendra Prakash, Arun Tripathi, Rajeev Naik, Kshirasagar Motilal Nehru Natl Inst Technol Allahabad Dept Elect & Commun Engn Prayagraj 211004 UP India Univ Waterloo Elect & Comp Engn Waterloo ON Canada

There are different types of messages containing different priorities in vehicular ad hoc networks. Hence, queue rescheduling is required according to priorities of arrived messages. In this study, a data structure with less computational complexity is proposed to minimise queuing delay. Further, to maintain quality of service, preemptive priority is applied to time-bound safety messages by transferring non-safety messages to other bands using the concept of cognitive radio technology. The time-bound messages are transmitted using the dedicated short-range communication spectrum without the need for spectrum sensing by vehicles. The other messages with no deadline constraint are switched to other bands near-dedicated short-range communication spectrum. The results show that 6.25% improvement in packet delivery ratio of cognitive radio-enabled preemptive priority is achieved in comparison to existing cognitive radio protocol. The delay shows a slight increment of 1.1%. The packet delivery ratio of cognitive radio-enabled non-preemptive priority is improved by 3.24% while the delay is improved by 3.17%. The data storage required for storing sensing data of 50 channels for 10 days is only 45 Mb.

关键词： queueing theory computational complexity wireless channels cognitive radio telecommunication network reliability scheduling protocols scheduling algorithm hybrid data structure cognitive radio technology ad hoc network queue rescheduling arrived messages computational complexity queuing delay quality of service time-bound safety messages nonsafety messages time-bound messages short-range communication spectrum spectrum sensing packet delivery ratio cognitive radio-enabled preemptive priority existing cognitive radio protocol cognitive radio-enabled nonpreemptive priority data storage storing sensing data time 10 0 d

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for Multimedia Services in IEEE 802.16e OFDM System

引用

Transactions of Tianjin University 2008年第1期14卷 31-36页

作者：董国军戴居丰 School of Electronic Information Engineering Tianjin University

Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.

关键词： IEEE 802.16e scheduling algorithm subchannel efficiency fairness complexity

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm OF DATA SAMPLING TIMES IN THE INTEGRATED COMMUNICATION AND CONTROL-SYSTEMS

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 1995年第2期3卷 225-230页

作者： HONG, SH Department of Control and Instrumentation Engineering Hanyang University Ansan South Korea

Integrated communication and control systems (ICCS) consist of several distributed control processes which share a network medium, Performance of several feedback control loops in the ICCS is subject to the network-induced delays from sensor to controller and from controller to actuator. The network-induced delays are directly dependent upon the data sampling times of the control components which share a network medium. In this study, a scheduling algorithm of determining data sampling times is developed using the window concept, where the sampled data from the control components in the ICCS share a limited number of windows, so that the performance requirement of each control loop is satisfied as well as the utilization of network resources is considerably increased. The scheduling algorithm is verified by discrete-event/continuous-time simulation model of an example of ICCS.

关键词： scheduling algorithm Sampling methods Communication system control Control systems Processor scheduling Job shop scheduling Distributed control Automatic control Real time systems Centralized control

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm of update transactions and quality of service management based on derived data in real-time and mobile database systems

Scheduling algorithm of update transactions and quality of s...

引用

Japan-China Joint Wokshop on Frontier of Computer Science and Technology

作者： Li Guohui Xiang Jun Yang Bing Chen Hui Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769530369

The demand on mobile and real-time database application and service in distributed environment is becoming increasingly extensive, since the workload cannot be precisely predicted so that they can become overloaded possibly. Low bandwidth in mobile environment will lead to aborting or restarting for transactions because of competing for the limited system resources severely. In this paper, we propose a novel performance metric for example deadline miss ratio of transactions and data freshness based on the relationship of data items in the DAG (Directed Acyclic Graph) to ensure the QoS (Quality of Service) in mobile and real-time database systems. Feedback control architecture and MODDFT (Modifying On-Demand Breath-First Traversal algorithm) are proposed in our system to decrease miss ratio of transactions and improve data freshness. The MODDFT algorithm can guarantee the QoS performance will not be beyond the reference by database administrator through simulation experiments.

关键词： scheduling algorithm Quality of service Quality management Real time systems Database systems Transaction databases Distributed databases Bandwidth Measurement Feedback control

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for UTRA TDD mode

Scheduling algorithm for UTRA TDD mode

引用

IEEE/AFCEA EUROCOMM 2000 on Information Systems for Enhanced Public Safety and Security

作者： Ostermayer, G Slanina, P Hölzl, C Mecklenbräuker, C Raji, F Stadler, T Siemens AG PSE TN MNR A-1101 Vienna Austria

ISBN: (纸本)078036323X

In this paper a method of assigning resources to different non real time (NRT) bearers within a cell of UMTS Terrestrial Radio Access / Time Division Duplex (UTRA/TDD) system is discussed. A very important measure of the quality of such a scheduling algorithm is the ratio of satisfied users at a certain system load. Different criterions for a satisfied user requires different scheduling methods. We propose an adaptive algorithm that can deal with different satisfied user criterions by simply adjusting a single parameter. Simulations have been performed for downlink traffic for various data rates. The available results include ratio of satisfied users, data throughput and block delay. Considering these results we can conclude that the proposed algorithm works quite well due to the possibility of optimizing different output parameters (ratio of satisfied users, data throughput, block delay) by adjusting a single scheduling parameter.

关键词： 3G mobile communication Adaptive algorithm Delay Downlink Frequency Real time systems Resource management scheduling algorithm Throughput Web pages

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm based on PID Controller for OFDM Wireless Networks 12

Scheduling Algorithm based on PID Controller for OFDM Wirele...

引用

12th International Wireless Communications & Mobile Computing Conference (IWCMC)

作者： Rachedi, Abderrezak Gueguen, Cedric Université Paris-Est LIGM (UMR 8049) CNRS ENPC ESIEE Paris UPEM Marne-la-Vallée F-77454 France University of Rennes 1 IRISA (UMR 6074) Campus Universitaire de Beaulieu Rennes 35042 France

ISBN: (纸本)9781509003044

In this paper, we focus on the resource allocation based on scheduling algorithms. Unlike the existing solutions, we introduce the concept of Proportional-Integral-Derivative (PID) controller in the scheduling algorithm called PID-Scheduler in order to reach the system stability. The stability is considered in terms of throughput and delay which meet the nodes needs. In order to allocate the resources to the mobile nodes while meeting their needs in terms of throughput and delay, the proposed PID-Scheduler is not only based on the network parameters obtained in the present time, but also from the past and those which may be obtained in the future. The PID-Scheduler reacts immediately to deviation from the QoS required by the mobile. Moreover, it remembers and integrates the deviation history and corrects slowly. The prediction of the future deviation is taken into account in order to make a fast correction. The simulation results show that the proposed solution PID-Scheduler gives better results than the well-known scheduling algorithms like MaxSNR and WFO.

关键词： scheduling algorithm Resource allocation PID controller Quality of Service Stability

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for digital systems to optimize dynamic power 15

Scheduling algorithm for digital systems to optimize dynamic...

引用

15th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA)

作者： Hassine, Siwar Ben haj Jemai, Mehdi Ouni, Bouraoui Univ Monastir Lab Elect & Microelect Monsatir 5000 Tunisia

ISBN: (纸本)9781479959075

In this paper we have developed a new scheduling algorithm that provides a decrease in dynamic power consumption through achieving components scheduling. The major idea of that algorithm is to amplify the latency of some components whenever it is feasible without negatively influencing the dependency constraints. For that purpose, we have decreased the frequency of the components clocks. Since frequency and power are inter-related, a decrease in frequency value will be followed by a decrease in power consumption. Our algorithm has been tested and has given an interesting gain in dynamic power.

关键词： digital system dynamic power optimization scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：