An efficient proactive route maintenance process for reliable data transmissions in sensor networks

For industrial wireless sensor networks, maintaining the routing path for a high packet delivery ratio is one of the key objectives in network operations. It is important to both provide the high data delivery rate at the sink node and guarantee a timely delivery of the data packet at the sink node. Most proactive routing protocols for sensor networks are based on simple periodic updates to distribute the routing information. A faulty link causes packet loss and retransmission at the source until periodic route update packets are issued and the link has been identified as broken. We propose a new proactive route maintenance process where periodic update is backed-up with a secondary layer of local updates repeating with shorter periods for timely discovery of broken links. Proposed route maintenance scheme improves reliability of the network by decreasing the packet loss due to delayed identification of broken links. We show by simulation that proposed mechanism behaves better than the existing popular routing protocols (AODV, AOMDV and DSDV) in terms of end-to-end delay, routing overhead, packet reception ratio.

Effective routing with utilisation of cross-layer information for industrial wireless sensor networks

This thesis focuses on providing reliable data transmissions in large-scale industrial wireless sensor networks through improving network layer protocols. It addresses three major problems: scalability, dynamic industrial environments and coexistence of multiple types of data traffic in a network. Theoretical developments are conducted, followed by simulation studies for verification of theoretic results. The approach proposed in this thesis has been shown to be effective for large-scale network implementation and to provide improved data transmission reliability for both periodic and sporadic traffic.

Efficient route update and maintenance processes for multipath routing in large-scale industrial wireless sensor networks

Reliable communications is one of the major concerns in wireless sensor networks (WSNs). Multipath routing is an effective way to improve communication reliability in WSNs. However, most of existing multipath routing protocols for sensor networks are reactive and require dynamic route discovery. If there are many sensor nodes from a source to a destination, the route discovery process will create a long end-to-end transmission delay, which causes difficulties in some time-critical applications. To overcome this difficulty, the efficient route update and maintenance processes are proposed in this paper. It aims to limit the amount of routing overhead with two-tier routing architecture and introduce the combination of piggyback and trigger update to replace the periodic update process, which is the main source of unnecessary routing overhead. Simulations are carried out to demonstrate the effectiveness of the proposed processes in improvement of total amount of routing overhead over existing popular routing protocols.

Channel-aware routing in MANETs with route handoff

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad-hoc On-Demand Multipath Distance Vector routing protocol (AOMDV) to accommodate channel fading. Specifically, the proposed Channel Aware AOMDV (CA-AOMDV) uses the channel average non-fading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. We provide new theoretical results for the downtime and lifetime of a live-die-live multiple path system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV.

Stochastic analysis of transit route segments' passenger load variation for capacity and quality of service assessment

This paper investigates stochastic analysis of transit segment hourly passenger load factor variation for transit capacity and quality of service (QoS) analysis using Automatic Fare Collection data for a premium radial bus route in Brisbane, Australia. It compares stochastic analysis to traditional peak hour factor (PHF) analysis to gain further insight into variability of transit route segments’ passenger loading during a study hour. It demonstrates that hourly design load factor is a useful method of modeling a route segment’s capacity and QoS time history across the study weekday. This analysis method is readily adaptable to different passenger load standards by adjusting design percentile, reflecting either a more relaxed or more stringent condition. This paper also considers hourly coefficient of variation of load factor as a capacity and QoS assessment measure, in particular through its relationships with hourly average and design load factors. Smaller value reflects uniform passenger loading, which is generally indicative of well dispersed passenger boarding demands and good schedule maintenance. Conversely, higher value may be indicative of pulsed or uneven passenger boarding demands, poor schedule maintenance, and/or bus bunching. An assessment table based on hourly coefficient of variation of load factor is developed and applied to this case study. Inferences are drawn for a selection of study hours across the weekday studied.

A new low temperature synthesis route of fraipontite (Zn,Al)3(Si,Al)2O5(OH)4

A low temperature synthesis method based on the decomposition of urea at 90°C in water has been developed to synthesise fraipontite. This material is characterised by a basal reflection 001 at 7.44 Å. The trioctahedral nature of the fraipontite is shown by the presence of a 06l band around 1.54 Å, while a minor band around 1.51 Å indicates some cation ordering between Zn and Al resulting in Al-rich areas with a more dioctahedral nature. TEM and IR indicate that no separate kaolinite phase is present. An increase in the Al content however, did result in the formation of some SiO2 in the form of quartz. Minor impurities of carbonate salts were observed during the synthesis caused by to the formation of CO32- during the decomposition of urea.

Determination of preventive maintenance lead time using hybrid analysis

The time for conducting Preventive Maintenance (PM) on an asset is often determined using a predefined alarm limit based on trends of a hazard function. In this paper, the authors propose using both hazard and reliability functions to improve the accuracy of the prediction particularly when the failure characteristic of the asset whole life is modelled using different failure distributions for the different stages of the life of the asset. The proposed method is validated using simulations and case studies.

Using coloured petri nets to simulate DoS-resistant protocols

In this work, we examine unbalanced computation between an initiator and a responder that leads to resource exhaustion attacks in key exchange protocols. We construct models for two cryp-tographic protocols; one is the well-known Internet protocol named Secure Socket Layer (SSL) protocol, and the other one is the Host Identity Protocol (HIP) which has built-in DoS-resistant mechanisms. To examine such protocols, we develop a formal framework based on Timed Coloured Petri Nets (Timed CPNs) and use a simulation approach provided in CPN Tools to achieve a formal analysis. By adopting the key idea of Meadows' cost-based framework and re¯ning the de¯nition of operational costs during the protocol execution, our simulation provides an accurate cost estimate of protocol execution compar- ing among principals, as well as the percentage of successful connections from legitimate users, under four di®erent strategies of DoS attack.