scholarly journals TLS-VaD: A New Tool for Developing Centralized Link-Scheduling Algorithms on the IEEE802.15.4e TSCH Network

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1555
Author(s):  
Iman Hedi Santoso ◽  
Kalamullah Ramli ◽  
Suryadi M.T.
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Link Scheduling ◽  
Test Results ◽  
Research Support ◽  
Support Tools ◽  
Channel Hopping ◽  
Centralized Scheduling ◽  
Validity Tests ◽  
Support Research

A simulator plays an important role in network protocol research, as it enables researchers to develop protocols more flexibly. Many simulators have been developed to support research in this field, including NS-2, NS-3, OPNET, OMNeT, and Cooja. Although, as a research support tools, NS3 and Cooja have already been equipped with an Internet of things (IoT) module, their support for research on IoT centralized scheduling is still limited. Therefore, this study is aimed to develop a tool for IoT centralized scheduling research, where the IoT technology is based on the IEEE802.15.4e time synchronized channel hopping (TSCH) standard. The tool is called the TSCH Link-Scheduling visualization and data processing (TLS-VaD). The results of validity tests show that TLS-VaD works well; therefore, this tool can be used in the performance measurement of centralized scheduling algorithms on TSCH networks. As an example of the application, this research used TLS-VaD to test the performance of three scheduling algorithms: Iman Ramli Bursty Transmission Scheduling Algorithm (IRByTSA), first top scheduling algorithm (FTSA), and first leaf scheduling algorithm (FLSA). The test results using TLS-VaD shows that IRByTSA had better performance compared to FLSA and FTSA, because it saved more power and was able to generate scheduling decisions relatively quickly.

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

scholarly journals 913. Distribution of Respiratory Viral Pathogens in Infants Across Different Clinical Settings from December 2019 to April 2020

2020 ◽  
Vol 7 (Supplement_1) ◽  
pp. S491-S492
Author(s):  
Zaid Haddadin ◽  
Danielle A Rankin ◽  
loren lipworth ◽  
Jon Fryzek ◽  
Mina Suh ◽  
...  
Keyword(s):  
Clinical Setting ◽  
Respiratory Viruses ◽  
Clinical Settings ◽  
Research Support ◽  
Viral Pathogens ◽  
Abrupt Decrease ◽  
Nasal Swabs ◽  
Viral Testing ◽  
Support Research ◽  
Research Grant

Abstract Background Acute respiratory infections (ARI) are a major cause of morbidity and mortality in young children, with viral pathogens being the most common etiologies. However, due to limited and inconsistent clinical diagnostic viral testing in the outpatient (OP) setting compared to the inpatient (IP) setting, the actual burden and distribution of viral pathogens across these clinical settings remain largely underreported. We aimed to evaluate the frequency of common respiratory viruses in medically attended ARI in infants. Methods We conducted a prospective viral surveillance study in Davidson County, TN. Eligible infants under one year presenting with fever and/or respiratory symptoms were enrolled from OP, emergency department (ED), or IP settings. Nasal swabs were collected and tested for common viral pathogens using Luminex® NxTAG Respiratory Pathogen Panel and for SARS-CoV-2 using Luminex® NxTAG CoV extended panel. Results From 12/16/2019 to 4/30/2020, 364 infants were enrolled, and 361 (99%) had nasal swabs collected and tested. Of those, 295 (82%) had at least one virus detected; rhinovirus/enterovirus (RV/EV) [124 (42%)], respiratory syncytial virus (RSV) [101 (32%)], and influenza (flu) [44 (15%)] were the three most common pathogens detected. No samples tested positive for SARS-CoV-2. Overall, the mean age was 6.1 months, 50% were male, 45% White and 27% Hispanic. Figure 1 shows the total number of PCR viral testing results by month. RSV was the most frequent virus detected in the IP (63%) and ED (37%) settings, while RV/EV was the most common in the OP setting (Figure 2). Figure 3 displays viral seasonality by clinical setting, showing an abrupt decrease in virus-positive cases following the implementation of a stay-at-home order on March 23, 2020 in Nashville, TN. Distribution of Respiratory Viruses in Different Settings Distribution of Respiratory Viruses in Different Settings by Season Conclusion Most medical encounters in infants are due to viral pathogens, with RSV, RV/EV, and flu being the most common. However, distributions differed by clinical setting, with RSV being the most frequently detected in the IP and ED settings, and second to RV/EV in the OP setting. Continued active viral ARI surveillance in various clinical settings is warranted. Preventative measures such as vaccines and infection control measures deserve study to reduce viral ARI burden. Disclosures Zaid Haddadin, MD, CDC (Grant/Research Support, Research Grant or Support)Quidel Corporation (Grant/Research Support, Research Grant or Support)sanofi pasteur (Grant/Research Support, Research Grant or Support) Danielle A. Rankin, MPH, CIC, Sanofi Pasteur (Grant/Research Support, Research Grant or Support) Jon Fryzek, PhD, MPH, EpidStrategies (Employee) Mina Suh, MPH, International Health, EpidStrategies (Employee) Donald S. Shepard, PhD, Sanofi Pasteur (Grant/Research Support) Natasha B. Halasa, MD, MPH, Genentech (Other Financial or Material Support, I receive an honorarium for lectures - it’s a education grant, supported by genetech)Karius (Consultant)Moderna (Consultant)Quidel (Grant/Research Support, Research Grant or Support)Sanofi (Grant/Research Support, Research Grant or Support)

Parallel Scheduling Algorithms Investigation of Support Strict Resource Reservation from Grid

2014 ◽  
Vol 519-520 ◽  
pp. 108-113 ◽  
Author(s):  
Jun Chen ◽  
Bo Li ◽  
Er Fei Wang
Keyword(s):  
Parallel Computing ◽  
Resource Utilization ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Resource Reservation ◽  
Parallel Scheduling ◽  
Scheduling Model ◽  
Computing Grid ◽  
Simulation Results ◽  
Reservation Request

This paper studies resource reservation mechanisms in the strict parallel computing grid,and proposed to support the parallel strict resource reservation request scheduling model and algorithms, FCFS and EASY backfill analysis of two important parallel scheduling algorithm, given four parallel scheduling algorithms supporting resource reservation. Simulation results of four algorithms of resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. The results show that the EASY backfill + firstfit algorithm can ensure QoS of AR jobs while taking into account the performance of good non-AR jobs.

scholarly journals 1507. Clinical Characteristics of Common Respiratory Viruses Detected in Infants Across Different Clinical Settings

2020 ◽  
Vol 7 (Supplement_1) ◽  
pp. S756-S757
Author(s):  
Zaid Haddadin ◽  
Danielle A Rankin ◽  
loren lipworth ◽  
Jon Fryzek ◽  
Mina Suh ◽  
...  
Keyword(s):  
Respiratory Distress ◽  
Disease Severity ◽  
Clinical Characteristics ◽  
Respiratory Viruses ◽  
Control Measures ◽  
Clinical Settings ◽  
Research Support ◽  
Nasal Swabs ◽  
Support Research ◽  
Research Grant

Abstract Background Viral acute respiratory infections (ARI) continues to be a significant cause of healthcare visits in young children. We evaluated the clinical presentation and disease severity of common respiratory viruses associated with medically attended ARI in infants. Methods We conducted a prospective viral surveillance study in Davidson County, TN. Infants under one year with fever and/or respiratory symptoms were enrolled from the outpatient (OP), emergency department (ED), or inpatient (IP) settings from 12/16/2019 through 4/30/2020. Nasal swabs were collected and tested for common viral pathogens using Luminex® NxTAG Respiratory Pathogen Panel. Demographic and clinical characteristics were collected through parent/guardian interviews and medical chart abstractions. Results In total, 364 participants were enrolled, and 361 (99%) had nasal swabs collected and tested. Overall, mean age was 6±3.3 months, 50% were female, 45% White, and 27% Hispanic. Of the 295 (82%) virus-positive specimens; the three most common viruses were rhinovirus/enterovirus (RV/EV), respiratory syncytial virus (RSV), and influenza (flu) [124, 101, and 44, respectively]. Compared to virus-negative infants, virus-positive infants were more likely to have more severe ARI symptoms and to be admitted to the intensive care unit (Table 1). Compared to other virus-positive infants: RV/EV-positive infants were more likely to be White, attend daycare, but less likely to present with respiratory distress, or require oxygen or admission; flu-positive infants were older and more likely to have systemic symptoms rather than ARI symptoms, and RSV-positive infants were more likely to present with respiratory distress, receive oxygen and be hospitalized (Table 1). Table 1. Demographic and Clinical Characteristics of Study Subjects Conclusion The majority of ARI in infants are due to respiratory viruses, with RSV, RV/EV, and flu accounting for over three-quarters of these viruses. The clinical presentations and disease severity differed across the clinical settings and the three main viruses, with RSV being most severe. To decrease the burden of medically attended viral ARI, preventive measures (i.e., developing new vaccines and antivirals), refining current vaccination strategies, and infection control measures are needed. Disclosures Zaid Haddadin, MD, CDC (Grant/Research Support, Research Grant or Support)Quidel Corporation (Grant/Research Support, Research Grant or Support)sanofi pasteur (Grant/Research Support, Research Grant or Support) Danielle A. Rankin, MPH, CIC, Sanofi Pasteur (Grant/Research Support, Research Grant or Support) Jon Fryzek, PhD, MPH, EpidStrategies (Employee) Mina Suh, MPH, International Health, EpidStrategies (Employee) Donald S. Shepard, PhD, Sanofi Pasteur (Grant/Research Support) Natasha B. Halasa, MD, MPH, Genentech (Other Financial or Material Support, I receive an honorarium for lectures - it’s a education grant, supported by genetech)Karius (Consultant)Moderna (Consultant)Quidel (Grant/Research Support, Research Grant or Support)Sanofi (Grant/Research Support, Research Grant or Support)

scholarly journals Multi-Dependency and Time Based Resource Scheduling Algorithm for Scientific Applications in Cloud Computing

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1320
Author(s):  
Vijay Prakash ◽  
Seema Bawa ◽  
Lalit Garg
Keyword(s):  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Scientific Applications ◽  
Virtual Machine Migration ◽  
Simulation Based ◽  
First Come First Serve ◽  
Minimum Completion Time ◽  
Burst Time ◽  
Parent Node

Workflow scheduling is one of the significant issues for scientific applications among virtual machine migration, database management, security, performance, fault tolerance, server consolidation, etc. In this paper, existing time-based scheduling algorithms, such as first come first serve (FCFS), min–min, max–min, and minimum completion time (MCT), along with dependency-based scheduling algorithm MaxChild have been considered. These time-based scheduling algorithms only compare the burst time of tasks. Based on the burst time, these schedulers, schedule the sub-tasks of the application on suitable virtual machines according to the scheduling criteria. During this process, not much attention was given to the proper utilization of the resources. A novel dependency and time-based scheduling algorithm is proposed that considers the parent to child (P2C) node dependencies, child to parent node dependencies, and the time of different tasks in the workflows. The proposed P2C algorithm emphasizes proper utilization of the resources and overcomes the limitations of these time-based schedulers. The scientific applications, such as CyberShake, Montage, Epigenomics, Inspiral, and SIPHT, are represented in terms of the workflow. The tasks can be represented as the nodes, and relationships between the tasks can be represented as the dependencies in the workflows. All the results have been validated by using the simulation-based environment created with the help of the WorkflowSim simulator for the cloud environment. It has been observed that the proposed approach outperforms the mentioned time and dependency-based scheduling algorithms in terms of the total execution time by efficiently utilizing the resources.

I-CSMA: A Link-Scheduling Algorithm for Wireless Networks Based on Ising Model

2018 ◽  
Vol 5 (3) ◽  
pp. 1038-1050 ◽  
Author(s):  
Yi Wang ◽  
Ye Xia
Keyword(s):  
Wireless Networks ◽  
Ising Model ◽  
Scheduling Algorithm ◽  
Link Scheduling

scholarly journals Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

2021 ◽  
Author(s):  
Baogui Huang ◽  
Jiguo Yu ◽  
Chunmei Ma ◽  
Fengyin Li ◽  
Guangshun Li
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Scheduling Algorithm ◽  
Random Variable ◽  
Rayleigh Distribution ◽  
Interference Model ◽  
Link Scheduling ◽  
Signal Power ◽  
Schedule Delay ◽  
Radio Signals

Abstract Many shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with 3 different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

scholarly journals Hardware Implementation Study of the Deficit Table Egress Link Scheduling Algorithm

2009 ◽  
Author(s):  
Raúl Martinez ◽  
José M. Claver ◽  
Francisco J. Alfaro ◽  
José L. Sanchez
Keyword(s):  
Hardware Implementation ◽  
Scheduling Algorithm ◽  
Link Scheduling ◽  
Implementation Study

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
Grid Environment ◽  
Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Sign in / Sign up

Export Citation Format

Share Document