A sensor node scheduling algorithm for heterogeneous wireless sensor networks by Zhangquan Wang, Yourong Chen, Banteng Liu, Haibo Yang, Ziyi Su, Yunkai Zhu

“…In sensor node scheduling algorithm, heterogeneous perception radius of sensor node is considered. …”
Get full text

EPRSA: interference resource scheduling algorithms for air-ground communication networks by Wenpeng Wu, Zhenhua Wei, Haiyang You, Xiaoqing Li, Jianwei Zhan, Zhaoguang Zhang

Get full text

Data aggregation scheduling algorithm based on twice maximum independent set by Jian XU, Geng YANG, Zheng-yu CHEN, Hai-yong WANG, Zhen YANG

Subjects: Get full text

Joint scheduling algorithm for correlative tasks in multi-access edge computing by Weifeng LU, Ning LI, Jia XU, Lijie XU, Jian XU

“…Multi-access edge computing (MEC) has emerged as a promising computing paradigm for resource-intensive applications.However, most of the previous research work has not considered correlative tasks, which may lead to infeasible scheduling decisions.Considering that some tasks on the application must be completed locally and another non-negligible energy consumption problem in the multi-access edge computing offloading scenario, the joint scheduling algorithm of correlative tasks on the local and edge sides was studied.The problem was formalized as minimizing the energy consumption in the system while satisfying the application’s completion deadline constraints, and the joint scheduling (JS) algorithm was proposed to solve the problem.Finally, the performance of the JS algorithm in the application completion rate and system energy consumption were analyzed through simulation experiments.The simulation results show that the JS algorithm is superior to other comparison algorithms in the application completion rate and can save at least 43% of the system energy consumption.…”
Get full text

CSA: Utility Optimization Scheduling Algorithm for IoT Blockchain Sharding Committees by Xin Cong, Qi Jing, Lingling Zi, Changjiang Lin

“…In this paper, we propose a Committee Scheduling Algorithm (CSA), which employs an iterative optimization framework based on the Markov chain to balance transaction throughput, cumulative latency, and transaction fees. …”
Get full text

EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks by Chuanhuang LI, Junhu LIAO, Jiadong XUAN, Qi XU, Huifeng ZHANG, Jun ZHU, Tao ZOU, Ruyun ZHANG

“…With the rapid integration and development of industrial control and information networks, time-sensitive networks based on ethernet have received widespread attention.In these networks, time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However, existing scheduling algorithms have struggled to rapidly calculate the scheduling tables for large-scale periodic traffic.Therefore, a heuristic scheduling algorithm based on the earliest deadline with weight first-maximum transfer time first was designed.This algorithm, by flexibly adapting traffic sorting weights and enhancing backtracking methods, could resolve the scheduling issues of large-scale traffic in industrial automation scenarios in a relatively short time.Experimental results show that compared to the classic integer linear programming method, the earliest deadline with weight first-maximum transfer time first heuristic scheduling algorithm is able to calculate a more optimal solution for the scheduling table of large-scale periodic traffic more swiftly.…”
Get full text

A pair-based task scheduling algorithm for cloud computing environment by Sanjaya Kumar Panda, Shradha Surachita Nanda, Sourav Kumar Bhoi

“…In the cloud computing environment, scheduling algorithms show the vital role of finding a possible schedule of the tasks. …”
Get full text

TOPSIS inspired cost-efficient concurrent workflow scheduling algorithm in cloud by K. Kalyan Chakravarthi, L. Shyamala, V. Vaidehi

“…The performance of the proposed work is compared with the state-of-the-art algorithms such as Cloud-based Workflow Scheduling Algorithm (CWSA), Earliest Finish Time-Maximum Effective Reduction (EFT-MER) and Heterogeneous Earliest-Finish-Time (HEFT) algorithms based on deadline constraint and resource utilization. …”
Get full text

An Improved Coral Reef Optimization-Based Scheduling Algorithm for Cloud Computing by Shuzhen Wan, Lixin Qi

“…In this paper, we establish a resource allocation framework and propose a novel task scheduling algorithm. An improved coral reef optimization (ICRO) is proposed to deal with this task scheduling problem. …”
Get full text

Multi-objective cloud workflow scheduling algorithm based on grid variance by Xiaoan BAO, Yundi CAO, Na ZHANG, Junyan QIAN, Jianwen CAO

“…Multi-objective cloud workflow scheduling algorithm based on grid variance and the strategy of bad particles self-learning were presented.Firstly,the characteristics of task scheduling was token into consideration,and particle encoding was discredited.Secondly,the strategy of mapping Pareto optimal workflow scheduling set to self-adaptive grid coordinate system,and calculating the grid distribution value of each Pareto optimal solution was used.Thirdly,grid variance was adopted to evaluate the diversity of current Pareto front and dynamically adjust evolution strategies.Finally,the concept of being dominated times was introduced into bad particles self-learning strategy for filtering out bad particles in population.The simulation experiment shows that workflow scheduling solution set by this algorithm is better than the MOPSO algorithm on both IGD and S performance indexes,and the optimal value is superior to the ε-FDPSO and NSGA-Ⅱ algorithm.…”
Get full text

Transmission power control and scheduling algorithm in wireless body area networks by Zhi-jun WANG, Feng-ye HU, Ying-qi YIN, Xiao-lan LIU

Subjects: “…wireless body area networks;lifetime;fairness;power control;scheduling algorithm…”
Get full text

Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm by Zafar Iqbal Khan, Muzafar Khan, Syed Nasir Mehmood Shah

Subjects: “…CPU scheduling algorithms…”
Get full text

Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues by Jianzhi Deng, Shuilian Lv, Yun Li, Liping Luo, Yishan Su, Xiaolin Wang, Xinzhi Liu

“…To solve the above problems, this paper constructs a ship scheduling algorithm based on a Markov-modulated fluid priority queue, which describes the stochastic evolution of the anchorage operation state via a continuous-time Markov chain and abstracts the arrival and service processes of ships into a continuous fluid input and output mechanism modulated by the state. …”
Get full text

Contention graph based concurrent scheduling algorithm in millimeter wave WPAN by Yibing WANG, Yong NIU, Weiguang DING, Hao WU

“…The directional antennas and beamforming techniques in millimeter wave (mmWave) bands are used to make concurrent transmission between multiple flows become possible.However,higher mutual interference may be caused by concurrent transmission.Therefore,when the time slots were limited and the number of data flows was large,how to schedule the concurrent flows efficiently was solved by proposed algorithm.The contention graph based spatial-time division multiple access (CB-STDMA) concurrent scheduling algorithm guaranteed the quality of service (QoS) of users,and aimed at maximizing the number of flows with their QoS requirements satisfied.It considered the interference between different flows,and a higher priority was given to the flow with fewer time slots requirement.Extensive simulations demonstrated that the proposed CB-STDMA algorithm increased the number of flows with their QoS requirements satisfied and the network throughput by 50% and 20% respectively compared with the existing algorithms.…”
Get full text

Contention graph based concurrent scheduling algorithm in millimeter wave WPAN by Yibing WANG, Yong NIU, Weiguang DING, Hao WU

“…The directional antennas and beamforming techniques in millimeter wave (mmWave) bands are used to make concurrent transmission between multiple flows become possible.However,higher mutual interference may be caused by concurrent transmission.Therefore,when the time slots were limited and the number of data flows was large,how to schedule the concurrent flows efficiently was solved by proposed algorithm.The contention graph based spatial-time division multiple access (CB-STDMA) concurrent scheduling algorithm guaranteed the quality of service (QoS) of users,and aimed at maximizing the number of flows with their QoS requirements satisfied.It considered the interference between different flows,and a higher priority was given to the flow with fewer time slots requirement.Extensive simulations demonstrated that the proposed CB-STDMA algorithm increased the number of flows with their QoS requirements satisfied and the network throughput by 50% and 20% respectively compared with the existing algorithms.…”
Get full text

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance by P. Keerthika, P. Suresh

“…A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. …”
Get full text

Scheduling algorithm for stochastic job stream cipher service based on load balancing by Li LI, Guozhen SHI, Kui GENG, Xiuze DONG, Fenghua LI

“…Business stream parallel processing system face the situation of the diversity of cipher service requests,the cross of serial mode and parallel mode,the intercross of different business data flow,and the demand of high speed and high reliability in security field.In order to improve the parallel processing efficiency of multi-cryptographic algorithm,load balancing was used as scheduling objective.Based on hierarchical hardware scheduling method (HHS-ACDID),considering the processing node’s storage capacity and processing speed,a load balancing scheduling algorithm was approved to support non related tasks and related tasks at the same time,which achieves the high speed cipher processing throughput.Simulation results show that the algorithm can complete dynamic scheduling of data stream system and get better load balancing effect.Compared with HHS-ACDID,the efficiency of the algorithm is improved by about 12%.…”
Get full text

Forwarding efficiency aware traffic scheduling algorithm based on deep reinforcement learning by Zongxuan SHA, Ru HUO, Chuang SUN, Shuo WANG, Tao HUANG

“…The software defined network separates the control plane from the data plane to achieve flexible traffic scheduling, which can use network resources more efficiently.However, with the increase of the number of flow entries, load rate, the number of connected hosts, and other factors, the forwarding efficiency of the SDN switch will be reduced, which will affect the end-to-end transmission delay.To solve the above problems, the forwarding efficiency aware traffic scheduling algorithm based on deep reinforcement learning was proposed.First, the switch state was integrated into the perception model, and the mapping relationship between switch state information and forwarding efficiency was established based on neural network.Then, combined with network state and traffic information, traffic scheduling policy was generated through deep reinforcement learning.Finally, the expert samples generated by the shortest path and load balance algorithms could guide the model training, which enabled the model to learn knowledge from expert samples to improve performance and accelerated the training process.The experimental results show that the proposed algorithm not only reduces the average end-to-end transmission delay by 15.31%, but also ensures the overall load balance of the network, compared with other algorithms.…”
Get full text

Research on multi-objective grid task scheduling algorithms based on survivability and Makespan by WANG Shu-peng, YUN Xiao-chun, YU Xiang-zhan

“…In the complex and dynamic Grid system,failure of resources was very common.And the failure of Grid re-sources can halt the execution of tasks on them.To mitigate this problem,the concept of tasks survivability was pro-posed,a local objective function which can be adjusted was proposed by incorporating the makespan and survivability of tasks and maximizing the survivability of tasks was devised.The simulation results confirm that the scheduling algorithm can trade off these two objectives,and can satisfy different demand by adjusting the weight parameter in the objective function.So it can be applied in the complex Grid computing environment well.…”
Get full text

Research on multi-objective grid task scheduling algorithms based on survivability and Makespan by WANG Shu-peng, YUN Xiao-chun, YU Xiang-zhan

“…In the complex and dynamic Grid system,failure of resources was very common.And the failure of Grid re-sources can halt the execution of tasks on them.To mitigate this problem,the concept of tasks survivability was pro-posed,a local objective function which can be adjusted was proposed by incorporating the makespan and survivability of tasks and maximizing the survivability of tasks was devised.The simulation results confirm that the scheduling algorithm can trade off these two objectives,and can satisfy different demand by adjusting the weight parameter in the objective function.So it can be applied in the complex Grid computing environment well.…”
Get full text