Vehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guarantees. QoS routing plays an essential role in identifying routes that meet the QoS requirements of the offered service over VANETs. However, searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Moreover, routing reliability needs to be given special attention as communication links frequently break in VANETs. To date, most existing QoS routing algorithms are designed for stable networks without considering the security of the routing process. Therefore, they are not suitable for applications in VANETs. In this thesis, the above issues are addressed firstly by developing a link reliability model based on the topological and mathematical properties of vehicular movements and velocities. Evolving graph theory is then utilised to model the VANET communication graph and integrate the developed link reliability model into it. Based on the resulting extended evolving graph model, the most reliable route in the network is picked. Secondly, the situational awareness model is applied to the developed reliable routing process because picking the most reliable route does not guarantee reliable transmission. Therefore, a situation-aware reliable multipath routing algorithm for VANETs is proposed. Thirdly, the Ant Colony Optimisation (ACO) technique is employed to propose an Ant-based multi-constrained QoS (AMCQ) routing algorithm for VANETs. AMCQ is designed to give significant advantages to the implementation of security mechanisms that are intended to protect the QoS routing process. Finally, a novel set of security procedures is proposed to defend the routing process against external and internal threats. Simulation results demonstrate that high levels of QoS can be still guaranteed by AMCQ even when the security procedures are applied.

Master of Science / Department of Computing and Information Sciences / Gurdip Singh / As the network bandwidth and delay increase, TCP becomes inefficient. Data intensive applications over high-speed networks need new transport protocol to support them. This project describes a general purpose high performance data transfer protocol as an application level solution. The protocol Reliable UDP-based data transfer works above UDP with reliability. Reliable Data Transfer protocol provides reliability to applications using the Sliding Window protocol (Selective Repeat). UDP uses a simple transmission model without implicit handshaking techniques for providing reliability and ordering of packets. Thus, UDP provides an unreliable service and datagrams may arrive out of order, appear duplicated, or go missing without notice. Reliable UDP uses both positive acknowledgements and negative acknowledgements to guarantee data reliability. Both simulation and implementation results have shown that Reliable UDP provides reliable data transfer. This report will describe the details of Reliable UDP protocol with simulation and implementation results and analysis.

Network-on-Chips (NoCs) have become the standard communication platform for future massively parallel systems due to their performance, flexibility and scalability advantages. However, reliability issues brought about by scaling in the sub-20nm era threaten to undermine the benefits offered by NoCs. This dissertation demonstrates design techniques that address both reliability and security issues facing modern NoC architectures. The reliability and security problem is tackled at different abstraction levels using a series of schemes that combine information from the architecture-level as well as hardware-level in order to combat aging effects and meet secure design stipulations while maintaining modest power-performance overheads.

<p>Many efforts have been carried out to provide transmission reliability in the history of communication systems. As the demand for real-time applications increased, providing a reliable communication in a timely manner for such applications is strongly desired. Considering timing constraints makes the issue of achieving reliability more difficult. This thesis concentrates on providing reliability for real-time communication in embedded networks by achieving a timing analysis and using the ARQ concept. What is carried out in this thesis is providing retransmission in a real-time manner for embedded networks according to application request. The thesis work focuses on one packet retransmission over a point to point link, but the concept is rich and can be extended to cover application request in real-time embedded networks. Two methods have been fulfilled, and a simulation has been done on the timing analysis focusing on the performance in accepting real-time traffic in the form of separate channels for each application request. The protocol combines ARQ and a scheduling algorithm as a base to support retransmission for hard real-time applications in embedded networks.</p>

This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort when no dynamic errors occur. Various properties of end-to-end protocols are presented. The unique token protocol solves the associated problems. It eliminates source buffering by maintaining in the network at least two copies of a message. A token is used to decide if a message was delivered to the destination exactly once. This technical report also presents a possible implementation of the protocol in a worm-hole routed, 3-D mesh network.

The question of how honesty is maintained in animal communication is a perplexing one, especially in the context of aggressive communication, in which the interests of signalers and receivers are opposed. Relevant information for receivers in aggressive interactions includes the fighting ability of the signaler and its likelihood of attack. Signalers may, however, benefit from manipulation of signals to exaggerate this information. To address questions of signal honesty, this dissertation investigates the use of a performance signal in the song of swamp sparrows (Melospiza georgiana). Performance signals are ones that are physically demanding to perform and that therefore reveal the signaler’s physical ability. The particular measure of vocal performance examined here is vocal deviation, which refers to the ability of birds to produce trilled songs approaching a performance boundary defined by the tradeoff between song trill rate (the rate at which elements of a song are repeated) and frequency bandwidth (the range of frequencies encompassed in a song). Three questions regarding the adaptive significance of vocal performance were investigated in the swamp sparrow 1) whether vocal performance is used as a signal in male-male communication, 2) whether vocal performance should be classified as an index signal of male quality, and 3) whether vocal deviation serves as a signal of aggressive intent. Results from four studies indicate that vocal performance plays a role in male-male signaling. Signalers appear to use vocal performance as a signal and receivers attend to differences in vocal performance. Evidence also indicates that vocal performance can be classified as an index signal, because males are constrained in their ability to produce high performance song and high vocal performance is correlated with aspects of male quality, such as age and size. Finally, this dissertation does not support classification of vocal performance as a signal of aggressive intent, because vocal performance fails to predict aggressive escalation.

Wireless communication in industrial, scientific and medical applications have several benefits. The main benefits when using wireless technologies include ease-of-deployment, the simplicity to introduce new units into the network and mobility. However it also put higher demands on the communication, including reliability and predictability compared to wired communication. The reliability issues correlate to the radio communication and the possibility to ensure that the user data is received, and within the time frame of the system requirements. This doctoral thesis presents an empirical measurement approach to investigate and model the behaviour linked to reliability and predictability. The focus of the work presented is energy consumption, packet-error-rate and latency studies. This is performed for various radio technologies and standards in (radio?) harsh environments. The main contributions of this thesis are the measurements platforms and procedures that have been developed to meet the requirements to investigate modern radio technologies in terms of predictability and reliability. This thesis show that it is possible to predict wireless communication in radio harsh environments. However it is necessary to determine the characteristics of the environment to be able to choose a suitable radio technology. The measurement procedures presented in this thesis alongside the platform developed enable these types of investigations. In this thesis a model of the energy consumption for a Bluetooth radio in low-duty-cycle applications with point-to-multipoint communication is presented. The measurements show that distance and transmission power will not effect the energy consumption for a Bluetooth nor ZigBee module. However the packet-error-rate and number of retransmissions will affect the overall energy consumption, and these parameters can be correlated to distance and foremost the environmental characteristics. This thesis also presents two application-based solutions, a time synchronized ECG network with reliable data communication as well as a low-latency wireless I/O for a hydro plant. / Tesla / Gauss

Wireless sensor networks (WSN) have generated tremendous interest among researchers these years because of their potential usage in a wide variety of applications.<p> Sensor nodes are inexpensive portable devices with limited processing power and energy resources. Sensor nodes can be used to collect information from the environment, locally process this data and transmit the sensed data back to the user.<p> This thesis proposes a new reliable data delivery protocol for general point-to-point data delivery (unicasting) in wireless sensor networks. The new protocol is designed that aims at providing 100% reliability when possible as well as minimizing overhead and network delay. The design of the new protocol includes three components. The new protocol adopts a NACK-based hop-by-hop loss detection and recovery scheme using end-to-end sequence numbers. In order to solve the single/last packet problem in the NACK-based approach, a hybrid ACK/NACK scheme is proposed where an ACK-based approach is used as a supplement to the NACK-based approach to solve the single/last packet problem. The proposed protocol also has a new queue management scheme that gives priority to new data. By introducing the idea of a Ready_Bit and newer packet first rule in the transmission queue, nodes can detect and recover lost packets in parallel with the normal data transmission process. The performance of the new protocol is tested in a Crossbow MicaZ testbed. Experimental results show that the new protocol performs well under various system and protocol parameter settings.

Many efforts have been carried out to provide transmission reliability in the history of communication systems. As the demand for real-time applications increased, providing a reliable communication in a timely manner for such applications is strongly desired. Considering timing constraints makes the issue of achieving reliability more difficult. This thesis concentrates on providing reliability for real-time communication in embedded networks by achieving a timing analysis and using the ARQ concept. What is carried out in this thesis is providing retransmission in a real-time manner for embedded networks according to application request. The thesis work focuses on one packet retransmission over a point to point link, but the concept is rich and can be extended to cover application request in real-time embedded networks. Two methods have been fulfilled, and a simulation has been done on the timing analysis focusing on the performance in accepting real-time traffic in the form of separate channels for each application request. The protocol combines ARQ and a scheduling algorithm as a base to support retransmission for hard real-time applications in embedded networks.

Wireless sensor networks (WSN) have generated tremendous interest among researchers these years because of their potential usage in a wide variety of applications.<p> Sensor nodes are inexpensive portable devices with limited processing power and energy resources. Sensor nodes can be used to collect information from the environment, locally process this data and transmit the sensed data back to the user.<p> This thesis proposes a new reliable data delivery protocol for general point-to-point data delivery (unicasting) in wireless sensor networks. The new protocol is designed that aims at providing 100% reliability when possible as well as minimizing overhead and network delay. The design of the new protocol includes three components. The new protocol adopts a NACK-based hop-by-hop loss detection and recovery scheme using end-to-end sequence numbers. In order to solve the single/last packet problem in the NACK-based approach, a hybrid ACK/NACK scheme is proposed where an ACK-based approach is used as a supplement to the NACK-based approach to solve the single/last packet problem. The proposed protocol also has a new queue management scheme that gives priority to new data. By introducing the idea of a Ready_Bit and newer packet first rule in the transmission queue, nodes can detect and recover lost packets in parallel with the normal data transmission process. The performance of the new protocol is tested in a Crossbow MicaZ testbed. Experimental results show that the new protocol performs well under various system and protocol parameter settings.