Distributed real-time system consists of many tasks on different processors communicating with each other. The communication between these tasks must occur in bounded time. In our thesis we are considering a holistic approach to estimate the end-to-end delays between two processors communicating with each other. For both tasks scheduled by fixed priority and dynamic priority, the system model considered is time token passing ring. The method is described to calculate worst-case communication delay of the message sent by certain tasks over the network. Once the worst-case communication delay of the message is obtained, and all required parameters are provided i.e. deadline of the message, transmission time of the packet etc, one can figure out how many messages will successfully meet their deadline. Thus this will enable us to select appropriate algorithm according to system requirement.

Wireless Internet has become increasingly popular due to anywhere anytime access feature. The Internet architecture was designed underlying the existing of the end-to-end path connection. The promise of wireless Internet networks is to provide roaming users connectivity anywhere anytime. However, quality of service (QoS) is still an open issue in wireless networks, which are characterized by possible intermittent connectivity and large transmission delays, due to user mobility, sparse mobile node distribution, link failures (because of hostile propagation medium), and/or other high-priority traffc. In this thesis, a credit-based user authentication scheme is proposed for delay tolerant mobile wireless networks. The proposed authentication scheme isolates the uncertain network condition in the high delay wireless backhaul with high error rate, and accelerates the overall authentication process when the mobile terminal roams in the visited network. Furthermore, an analytical study of overall network performance is presented for the authentication scheme in terms of authentication cost and delay. Simulation results demonstrate that the proposed credit-based authentication scheme reduces the overall real time transaction cost and delay for delay tolerant mobile wireless networks.

Like many other transportation agencies, the Ministry of Transportation Ontario (MTO) is also using the same work zone closure strategies and standards that it has used for decades. However, the lane closure strategies should incorporate the impacts of construction duration and inconvenience to the road users and find the balance where users face minimal inconvenience while contractors have the appropriate amount of time to finish the work and produce a high quality product. In-order to evaluate and assess the appropriate time for lane closures, it is important to estimate the capacity of the lanes. The capacity estimates can help in determining the optimized time for lane closures to minimize the user delays while providing sufficient time for contractors to achieve the desired productivity and quality of work. There are different models, computer Software and wide variety of studies to evaluate and estimate the Workzone Capacity and associated User Delay Costs at workzones. These costs are primarily affected by traffic flows, vehicle speeds, and work zone capacities. In-view of the above, this study is designed to estimate freeway capacity of construction workzones and discuss the associated user delay costs and economic issues. For this study, the capacity at the work zones was measured as the mean queue discharge flow rate during forced-flow conditions. Forced-flow conditions were defined as congested conditions during which a sustained queue formed. There are several studies and approaches for collecting traffic volume data for estimating workzone capacity. For this study, it was decided to utilize a manual counting method for volume data. This would help provide the visual confirmation of queuing and intensity of work activity at workzones. Six sites located in Southern Ontario, were selected for this study. The data from these sites is used to develop a mathematical model for estimating workzone capacity for Ontario.

Delay- and Disruption-tolerant wireless networks (DTN), or opportunistic networks, represent a class of networks where continuous end-to-end connectivity may not be possible. DTN is a well recognized area in networking research and has attracted extensive attentions from both network designers and application developers. Applications of this emergent communication paradigm are wide ranging and include sensor networks using scheduled intermittent connectivity, vehicular DTNs for dissemination of location-dependent information (e.g., local ads, traffic reports, parking information, etc.), pocket-switched networks to allow humans to communicate without network infrastructure, and underwater acoustic networks with moderate delays and frequent interruptions due to environmental factors, etc. Security is one of the main barriers to wide-scale deployment of DTNs, but has gained little attention so far. On the one hand, similar to traditional mobile ad hoc networks, the open channel and multi-hop transmission have made DTNs vulnerable to various security threats, such as message modification/injection attack or unauthorized access and utilization of DTN resources. On the other hand, the unique security characteristics of DTNs including: long round-trip delay, frequent disconnectivity, fragmentation, opportunistic routing as well as limited computational and storage capability, make the existing security protocols designed for the conventional ad hoc networks unsuitable for DTNs. Therefore, a series of new security protocols are highly desired to meet stringent security and efficiency requirements for securing DTNs. In this research, we focus on three fundamental security issues in DTNs: efficient DTN message (or bundle) authentication, which is a critical security service for DTN security; incentive issue, which targets at stimulating selfish nodes to forward data for others; and certificate revocation issue, which is an important part of public key management and serves the foundation of any DTN security protocols. We have made the following contributions: First of all, the unique ``store-carry-and-forward'' transmission characteristic of DTNs implies that bundles from distinct/common senders may opportunistically be buffered at some common intermediate nodes. Such a ``buffering'' characteristic distinguishes DTN from any other traditional wireless networks, for which intermediate cache is not supported. To exploit such buffering opportunities, we propose an Opportunistic Batch Bundle Authentication Scheme (OBBA) to dramatically reduce the bundle authentication cost by seamlessly integrating identity-based batch signatures and Merkle tree techniques. Secondly, we propose a secure multi-layer credit based incentive scheme to stimulate bundle forwarding cooperation among DTNs nodes. The proposed scheme can be implemented in a fully distributed manner to thwart various attacks without relying on any tamper-proof hardware. In addition, we introduce several efficiency-optimization techniques to improve the overall efficiency by exploiting the unique characteristics of DTNs. Lastly, we propose a storage-efficient public key certificate validation method. Our proposed scheme exploits the opportunistic propagation to transmit Certificate Revocation List (CRL) list while taking advantage of bloom filter technique to reduce the required buffer size. We also discuss how to take advantage of cooperative checking to minimize false positive rate and storage consumption. For each research issue, detailed simulation results in terms of computational time, transmission overhead and power consumption, are given to validate the efficiency and effectiveness of the proposed security solutions.

Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power sources, and limited data storage space of some or all of its nodes. Applications of DTNs include vehicular networks and sensor networks in suburban and rural areas. The intermittent connection in DTNs creates a new and challenging environment that has not been tackled before in wireless and wired networks. Traditional routing protocols fail to deliver data packets because they assume the existence of continuous end-to-end connections. To overcome the frequent disconnections, a DTN node is required to store data packets for long periods of time until it becomes in the communication range of other nodes. In addition, to increase the delivery probability, a DTN node spreads multiple copies of the same packet on the network so that one of the copies reaches the destination. Given the limited storage and energy resources of DTN nodes, there is a trade off between maximizing delivery and minimizing storage and energy consumption. DTN routing protocols can be classified as either blind routing, in which no information is provided to select the next node in the path, or guided routing, in which some network information is used to guide data packets to their destinations. In addition they differ in the amount of overhead they impose on the network and its nodes. The objective of DTN routing protocols is to deliver as many packets as possible. Acquiring network information helps in maximizing packet delivery probability and minimizing the network overhead resulting from replicating many packet copies. Network information could be node contact times and durations, node buffer capacities, packet lifetimes, and many others. The more information acquired, the higher performance could be achieved. However, the cost of acquiring the network information in terms of delay and storage could be high to the degree that render the protocol impractical. In designing a DTN routing protocol, the trade-off between the benefits of acquiring information and its costs should be considered. In this thesis, we study the routing problem in DTN with limited resources. Our objective is to design and implement routing protocols that effectively handles the intermittent connection in DTNs to achieve high packet delivery ratios with lower delivery cost. Delivery cost is represented in terms of number of transmissions per delivered packet. Decreasing the delivery cost means less network overhead and less energy consumption per node. In order to achieve that objective, we first target the optimal results that could be achieved in an ideal scenario. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. The optimal results provide us with bounds on the performance metrics, and show the room for improvement that should be worked on. However, optimal routing with a global observer is just a theoretical model, and cannot be implemented practically. In DTNs, there is a need for a distributed routing protocol which utilizes local and easily-collectable data. Therefore, We investigate the different types of heuristic (non-optimal) distributed routing protocols, showing their strengths and weaknesses. Out of the large collection of protocols, we select four protocols that represent different routing classes and are well-known and highly referred by others working in the same area. We implement the protocols using a DTN simulator, and compare their performance under different network and node conditions. We study the impact of changing the node buffer capacities, packet lifetimes, number of nodes, and traffic load on their performance metrics, which are the delivery ratio, delivery cost, and packet average delay. Based on these comparisons, we draw conclusions and guidelines to design an efficient DTN routing protocol. Given the protocol design guidelines, we develop our first DTN routing protocol, Eco-Friendly Routing for DTN (EFR-DTN), which combines the strengths of two of the previously proposed protocols to provide better delivery ratio with low network overhead (less power consumption). The protocol utilizes node encounters to estimate the route to destination, while minimizing the number of packet copies throughout the network. All current DTN routing protocols strive to estimate the route from source to destination, which requires collecting information about node encounters. In addition to the overhead it imposes on the network to collect this information, the time to collect this information could render the data worthless to propagate through the network. Our next proposal is a routing protocol, Social Groups Based Routing (SGBR), which uses social relations among network nodes to exclude the nodes that are not expected to significantly increase the probability of delivering the packet to its destination. Using social relations among nodes, detected from node encounters, every group of nodes can form a social group. Nodes belonging to the same social group are expected to meet each other frequently, and meet nodes from other groups less frequently. Spreading packet copies inside the same social group is found to be of low-added value to the carrying node in delivering a packet to its destination. Therefore, our proposed routing protocol spreads the packet copies to other social groups, which decreases the number of copies throughout the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real-life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead. Finally, we discuss the willingness of DTN nodes to cooperate in routing services. From a network perspective, all nodes are required to participate in delivering packets of each other. From a node perspective, minimizing resource consumption is a critical requirement. We investigate the degree of fair cooperation where all nodes are satisfied with their participation in the network routing services. A new credit-based system is implemented to keep track of and reward node participation in packet routing. Results show that the proposed system improves the fairness among nodes and increases their satisfaction.

Orthogonal Frequency Division Multiplexing, so called OFDM, has found a prominent place in various wireless systems and networks as a method of encoding data over multiple carrier frequencies. OFDM-based communication systems, however, lacking inherent diversity, are capable of benefiting from different spatial diversity schemes. One such scheme, Cyclic Delay Diversity (CDD) is a method to provide spatial diversity which can be also interpreted as a Space-Time Block Coding (STBC) step. The main idea is to add more transmit antennas at the transmitter side sending the same streams of data, though with differing time delays. In [1], the capacity of a point-to-point OFDM-based channel with CDD is derived for inputs with Gaussian and discrete constellations. In this dissertation, we use the same approach for an OFDM-based single-input single-output (SISO) two-user interference channel (IC). In our model, at the receiver side, the interference is treated as noise. Moreover, since the channel is time-varying (slow-fading), the Shannon capacity in the strict sense is not well-defined, so the expected value of the instantaneous capacity is calculated instead. Furthermore, the channel coefficients are unknown to the transmitters. Thus, in this setting, the probability of outage emerges as a reasonable performance measure. Adding an extra antenna in the transmitters, the SISO IC turns into an MISO IC, which results in increasing the diversity. Both the continuous and discrete inputs are studied and it turns out that decoding interference is helpful in some cases. The results of the simulations for discrete inputs indicate that there are improvements in terms of outage capacity compared to the ICs with single-antenna transmitters.

This project focusses on the design of a high speed passive delay line for use in a Feed Forward Equalizer (FFE). The FFE is used to equalize a 20 Gbp/s throughput PAM-4 signal after transmission through a 20-inch FR4 backplane channel. Inductor electromagnetic simulations are used to design an inductor for use in the passive delay line and a lumped element inductor model is presented. Measurement results show performance of the delay line at 10 GSym/s.

Many real-time systems demand effective and efficient delay-guaranteed services to meet timing requirements of their applications. We note that a system provides a delay-guaranteed service if the system can ensure that each task will meet its predefined end-to-end deadline. Admission control plays a critical role in providing delayguaranteed services. The major function of admission control is to determine admissibility of a new task. A new task will be admitted into the system if the deadline of all existing tasks and the new task can be met. Admission control has to be efficient and efficient, meaning that a decision should be made quickly while admitting the maximum number of tasks. In this dissertation, we study a utilization-based admission control mechanism. Utilization-based admission control makes an admission decision based on a simple resource utilization test: A task will be admitted if the resource utilization is lower than a pre-derived safe resource utilization bound. The challenge of obtaining a safe resource utilization bound is how to perform delay analysis offline, which is the main focus of this dissertation. For this, we develop utilization-based delay guarantee techniques to render utilization-based admission control both efficient and effective, which is further confirmed with our data. We develop techniques for several systems that are of practical importance. We first consider wired networks with the Differentiated Services model, which is wellknown as its supporting scalable services in computer networks. We consider both cases of providing deterministic and statistical delay-guaranteed services in wired networks with the Differentiated Services model. We will then extend our work to wireless networks, which have become popular for both civilian and mission critical applications. The variable service capacity of a wireless link presents more of a challenge in providing delay-guaranteed services in wireless networks. Finally, we study ways to provide delayguaranteed services in component-based systems, which now serve as an important platform for developing a new generation of computer software. We show that with our utilization-based delay guarantee technique, component-based systems can provide efficient and effective delay-guaranteed services while maintaining such advantages as the reusability of components.

This thesis evaluates the Value of Delay (VOD) to commercial vehicle operators due to highway congestions. The VOD for congestion is a fundamental parameter driving the private sectors’ response to public freight projects and policies such as corridor construction and tolling. Factors affecting the commercial VOD include direct operational cost, travel length, travel time variation, inventory holding, and warehouse management. To approach the VOD, two methods are adopted in this thesis. One is the Stated Preference (SP) survey. The other is carrier fleet operational simulation. The simulation framework uses ArcGIS, and C . ArcGIS is used to generate a freight network based on the Houston, TX highway system. A set of customers are randomly generated, each having a random demand for service, which is associated with time windows for delivery and pickup. A heuristic algorithm is proposed to dispatch vehicles for truckload service on a continuous time horizon. The average VOD is then obtained through the ratio between additional operational cost and the delay caused by the congestion. This ratio is assessed in two scenarios: single depot and two cooperating depots. Different tests based on demand size, demand distribution pattern, time window and location of congestion are conducted. Simulation shows a range of VOD from $93.99/hr to $120.89/hr for the case of a central depot and $79.81/hr to $83.81/hr for the case of two depots. In addition, a SP survey is conducted for truckers and carriers in two scenarios. The first scenario assumes a driver running late by 30 minutes on a congested road, while the second scenario assumes an on-time delivery or pickup. Several tolling alternatives are assumed to test the driver’s willingness to pay for using a hypothetical toll road. The data is then regressed with the logit model using maximum likelihood estimation to obtain perspective value of delay. A generic utility function is adopted, which results in a VOD range from $24.72/hr to $64.99/hr. A comparison between the survey and the simulation results shows that drivers perceive a significantly lower VOD than the simulated VOD in freight operation.

Traffic platoons created by traffic signals may have impacts on the operations of downstream intersections because they change the arrival pattern and gap distribution of upstream traffic. There’s been a lot of research dealing with platoon effects on operations at signalized intersections, while very limited research has been done for that of unsignalized intersections. This research aims to develop a methodology for analyzing the platoon impacts on major-street left-turn (MSLT) delay at two-way stop-controlled (TWSC) intersections. The main idea is using a microscopic simulation tool to simulate different platoon scenarios in opposing through traffic, then applying regression models to capture the impacts of platoons on the delay of MSLT. Two platoon variables were adopted as a simplification of the complex platoon scenarios, making it practical to analyze the platoon effects on MSLT delay. The first two steps were to build simulation models for real-world unsignalized intersections and simulate scenarios with a combination of various factors related to platoons in VISSIM simulation. Calibrations of these simulation models based on field data were performed before simulation started. The next step was to define, derive and calibrate two platoon variables for describing the duration and intensity of platoon arrivals in the opposing through traffic, which effectively simplified the large combination of various factors. At last, the two platoon variables and their relationship with MSLT delay change factor were modeled with regression tools. A relationship between the two variables and the delay change factor was established, which indicated a positive effect by upstream platoons on MSLT delay and made it possible to quantify the impacts. The findings in this research could also be used for future research on left turn treatment regarding platoon or signal impacts.