The purpose of this thesis was to perform microsimulation analyses on intersections near Highway-Railroad Grade Crossings (HRGCs) to determine if controlling mean train speed and train speed variability would improve safety and reduce delays. This research focused on three specific areas. First, average vehicle delay was examined, and this delay was compared for seven specific train speed distributions, including existing conditions. Furthermore, each distribution was associated with train detectors that were placed at the distance the fastest train could travel during the given warning time. Second, pedestrian cutoffs were investigated. These cutoffs represented an occasion when the pedestrian phases were truncated or shortened due to railroad signal preemption. Finally, vehicle emissions were analyzed using a modal emissions model. A microscopic simulation model of the Wellborn Corridor in College Station, Texas was created using VISSIM. The model was run twenty times in each train speed distribution for each of three train lengths. Average vehicle delay was collected for three intersections, and delays were compared using the Pooled t-test with a 95% confidence interval. Comparisons were made between the distributions, and generally, distributions with higher mean train speeds were associated with lower average delay, and train length was not a significant factor. Unfortunately, pedestrian cutoffs were not specifically controlled in this project; therefore, no statistical conclusions can be made with respect to the pedestrian cutoff problem. However, example cases were devised to demonstrate how these cutoffs could be avoided. In addition, vehicle emissions were examined using the vehicle data from VISSIM as inputs for CMEM (Comprehensive Modal Emissions Model). For individual vehicles, as power (defined as the product of velocity and acceleration) increased, emissions increased. When comparing emissions from different train speed distributions, few significant differences were found. However, a scenario with no train was tested, and it was shown to have significantly higher emissions than three of the distributions with trains. Ultimately, this thesis shows that average vehicle delay and vehicle emissions could be lowered by specific train speed distributions. Also, work could be done to investigate the pedestrian cutoff problem.

The promising development of wireless technologies has brought in an increasing demand of multimedia traffic. Since various types of traffic are inherently distinct in bandwidth requirements, delay sensitivities, and error tolerances, an adequate bandwidth allocation scheme is essential for the limited radio resource to fulfill different QoS (quality of service) requirements in mobile wireless networks. In this dissertation, we present a generalized channel preemption scheme (the GCPM) and a jamming-based medium access control with dynamic priority adjustment (the JMDPA) for the two different medium access models of a mobile wireless network, grant/request-based and contention-based, respectively. In the proposed GCPM, a mobile call is identified by four parameters, call type, traffic class, channel requirement, and preemption ratio. To effectively reduce dropping probability, high-priority handoff calls are allowed to fully or partially preempt low-priority ongoing calls when the mobile network becomes congested. An analytical model with multi-dimensional Markov chains is introduced to simultaneously investigate the effect of full and partial preemptions on the performance of a mobile wireless network. On the other hand, the proposed JMDPA scheme prioritizes a mobile node with two priorities, local and global; both of the local and global priorities can be dynamically changed based on the outcome in every contention round. Thus, any possible starvation of low-priority traffic or any ineffective contention of high-priority traffic can be avoided. A multi-dimensional Markov model, together with the scalability analysis, is introduced to evaluate the performance of the proposed JMDPA. The analytical results provide very useful guidelines to tune the QoS parameters for supporting prioritized multimedia traffic.

The purpose of this thesis was to perform microsimulation analyses on intersections near Highway-Railroad Grade Crossings (HRGCs) to determine if controlling mean train speed and train speed variability would improve safety and reduce delays. This research focused on three specific areas. First, average vehicle delay was examined, and this delay was compared for seven specific train speed distributions, including existing conditions. Furthermore, each distribution was associated with train detectors that were placed at the distance the fastest train could travel during the given warning time. Second, pedestrian cutoffs were investigated. These cutoffs represented an occasion when the pedestrian phases were truncated or shortened due to railroad signal preemption. Finally, vehicle emissions were analyzed using a modal emissions model. A microscopic simulation model of the Wellborn Corridor in College Station, Texas was created using VISSIM. The model was run twenty times in each train speed distribution for each of three train lengths. Average vehicle delay was collected for three intersections, and delays were compared using the Pooled t-test with a 95% confidence interval. Comparisons were made between the distributions, and generally, distributions with higher mean train speeds were associated with lower average delay, and train length was not a significant factor. Unfortunately, pedestrian cutoffs were not specifically controlled in this project; therefore, no statistical conclusions can be made with respect to the pedestrian cutoff problem. However, example cases were devised to demonstrate how these cutoffs could be avoided. In addition, vehicle emissions were examined using the vehicle data from VISSIM as inputs for CMEM (Comprehensive Modal Emissions Model). For individual vehicles, as power (defined as the product of velocity and acceleration) increased, emissions increased. When comparing emissions from different train speed distributions, few significant differences were found. However, a scenario with no train was tested, and it was shown to have significantly higher emissions than three of the distributions with trains. Ultimately, this thesis shows that average vehicle delay and vehicle emissions could be lowered by specific train speed distributions. Also, work could be done to investigate the pedestrian cutoff problem.

Thesis (Ph. D.)--Michigan State University. Dept. of Civil Engineering, 2008. / Title from PDF t.p. (viewed on July 7, 2009) Includes bibliographical references (p. 196-201). Also issued in print.

Abstract. The thesis is devoted to the problem of online preemptive scheduling of mul- tiprocessor jobs. It gives a summary of previous work on this problem. For some special variants of the problem, especially if we restrict the sizes of jobs to one and two, new results are given, both in the terms of lower bounds and in the terms of competitive al- gorithms. A previously published lower bound is showed to be computed incorrectly and it is replaced by a correct lower bound in this thesis. An algorithm is presented for the special case of four processors and sizes of jobs one and two that is conjectured to achieve the best possible competitive ratio.

This thesis deals with network substandards from the TSN group (IEEE 802.1Q), which deal with prioritization of network traffic in TSN networks. These sub-standards include 802.1QBV and 802.1QBU, which have been described in more detail and compared in terms of network permeability and latency. Substandard 802.1QBU was chosen for the design implementation in FPGA. The design was described in VHDL. The designed design was verified by simulations, using self-tests. The work includes synthesis and time analysis.

This thesis deals with network substandards from the TSN group (IEEE 802.1Q), which deal with prioritization of network traffic in TSN networks. These sub-standards include 802.1QBV and 802.1QBU, which have been described in more detail and compared in terms of network permeability and latency. Substandard 802.1QBU was chosen for the design implementation in FPGA. The design was described in VHDL. The devloped design was verified by simulations, using self-tests. The work includes synthesis and time analysis.

Ethernet-based real-time network communication technologies are nowadays a promising communication technology for industrial applications. It offers high bandwidth, scalability and performance compared to the existing real-time networks. Time-Sensitive Networking is an enhancement for the existing Ethernet standards thus offers compatibility, cost efficiency and simplified infrastructure, like previous prioritization and bridging standards. Time-Sensitive Networking is suitable for networks with both time-critical and non-time-critical traffic. The timing requirements of time-critical traffic are undisturbed by the less-critical traffic due to TSN features like the Time-Aware Scheduler. It is a time-triggered scheduling mechanism that guarantees the fulfilment of temporal requirements of highly time-critical traffic. Features like the Credit-Based Shapers and preemption result in a more efficiently utilized network. This thesis focuses on the effects that the preemption mechanism has on network performance. Simulation-based performance analysis of a singe-node and singe-egress port model for different configuration patterns is conducted. The simulation tool used is a custom developed simulator called TSNS. The configuration patterns include having multiple express traffic classes. In a single-egress port model, the most significant performance contributor is the response time and this is one of the simulation measurements obtained from the TSNS network simulator. The comparison between the results of these different network configurations, using realistic traffic patterns, provides a quantitative evaluation of the network performance when the network is configured in various ways, including multiple preemption scenarios.

Bottom-up processes, starting at the local government level, are valuable for more-stringent tobacco control measures. The existence of industry-backed state-level tobacco control preemption in states has impeded policy progress within the state and localities/communities. A national public health goal under Healthy People 2020 is to eliminate state-level preemption across the United States. This study explored individual-level perceptions of the impact of state-level preemption in Appalachian Tennessee—a high-smoking, low-income region. During 2015–2016, a community-engagement project to develop a Population Health Improvement Plan (PHIP) involving over 200 stakeholders and 90 organizations was conducted in Appalachian Tennessee to identify policies/programs to address tobacco use. Using a multifaceted framework approach that focused on prevention, protection, and cessation, interviews and meeting discussions were audio-recorded and transcribed. Content analysis using NVivo 11 was conducted to generate themes. Although the central focus of the PHIP was not preemption, the issue emerged naturally in the discussions as a major concern among participants. Cultural and normative factors in Appalachian Tennessee were identified as key rationales for participants’ aversion to state preemption. Thus, repealing preemption would facilitate culturally tailored and region-specific policies/programs to the high tobacco use among Appalachian Tennessee communities where statewide/nationwide policies/programs have not had the intended impacts.

The use of graphical processing units (GPUs) for autonomous robots has grown recently due to their efficiency and suitability for data intensive computation. However, the current embedded GPU platforms may lack sufficient real-time capabilities for safety-critical autonomous systems. The GPU driver provides little to no control over the execution of the computational kernels and does not allow multiple kernels to execute concurrently for integrated GPUs. With the development of modern embedded platforms with integrated GPU, many embedded applications are accelerated using GPU. These applications are very computationally intensive, and they often have different criticality levels. In this thesis, we provide a software-based approach to schedule the real-world robotics application with two different scheduling policies: Fixed Priority FIFO Scheduling and Earliest Deadline First Scheduling. We implement several commonly used applications in autonomous mobile robots, such as Path Planning, Object Detection, and Depth Estimation, and improve the response time of these applications. We test our framework on NVIDIA AGX Xavier, which provides high computing power and supports eight different power modes. We measure the response times of all three applications with and without the scheduler on the NVIDIA AGX Xavier platform on different power modes, to evaluate the effectiveness of the scheduler. / Master of Science / Autonomous mobile robots for general human services have increased significantly due to ever-growing technology. The common applications of these robots include delivery services, search and rescue, hotel services, and so on. This thesis focuses on implementing the computational tasks performed by these robots as well as designing the task scheduler, to improve the overall performance of these tasks. The embedded hardware is resource-constrained with limited memory, power, and operating frequency. The use of a graphical processing unit (GPU) for executing the tasks to speed up the operation has increased with the development of the GPU programming framework. We propose a software-based GPU scheduler to execute the functions on GPU and get the best possible performance from the embedded hardware.