Remote attacks on vehicles have become alarmingly more common over the past decade. Attackers often can compromise a single Electronic Control Unit (ECU) in the In-Vehicle Network (IVN) and then use it to send malicious messages that can cause a vehicle to stop, turn, or even crash. It is critical that we find a way to block or discard these messages. However, current IVNs contain few measures to prevent such threats. Most research in this area focuses on cryptography-based approaches that are too slow or too expensive for vehicle applications. In this thesis, we explore how we can stop many of these remote attacks without cryptography. We define a `security policy' that describes what messages are allowed in an IVN and then create a system of distributed firewalls to enforce it, blocking many remote attacks. Using newer, switched IVN topologies, we can authenticate messages with nearly zero additional overhead and implement our system with minimal changes to each ECU. This places the security responsibility on a few centralized network devices that automakers can more easily control and update, even after a vehicle is sold. We evaluate our firewall design using a network simulator and find that our approach is significantly faster than state-of-the-art cryptographic approaches. / Master of Science / Over the past decade, hackers and security researchers have found many ways to remotely take control of a vehicle. Most modern vehicles contain numerous Electronic Control Units (ECUs) that each control some aspect of the vehicle, such as the brakes or engine. It is difficult to design all ECUs perfectly, however, and attackers are often able to remotely hack into one of them. From there, attackers can send malicious messages throughout the In-Vehicle Network (IVN) that connects ECUs. These messages can cause the car to stop, turn, or even crash. Thus, we must find a way to block or discard these messages. Most current research uses cryptography to accomplish this, which is a computationally expensive technique that uses math to determine if messages are legitimate. In this thesis, we examine how we can stop these malicious messages without cryptography. We introduce an approach based on firewalls, which are devices in the network that inspect messages and block them if they do not pass a set of rules. Our approach, which leverages new trends in IVN architectures, allows us to stop many of these malicious messages in the network with nearly zero additional overhead. In addition, our system of firewalls is much easier for an automaker to manage and update than previous approaches. We simulate our idea and find that it is significantly faster than previous state-of-the-art techniques.

While the demand for video streaming services has risen rapidly in recent years, supporting video streaming service to a large number of receivers still remains a challenging task. Issues of video streaming in the Internet, such as scalability, and reliability are still under extensive research. Recently proposed network contexts such as overlay networks, and mobile ad hoc networks pose even tougher challenges. This thesis focuses on supporting scalable video streaming applications under various network environments. More specifically, this thesis investigates the following problems: i) Server selection in replicated batching video on demand (VoD) systems: we find out that, to optimize the user perceived latency, it is vital to consider the server state information and channel allocation schemes when making server selection decisions. We develop and evaluate a set of server selection algorithms that use increasingly more information. ii) Scalable live video streaming with time shifting and video patching: we consider the problem of how to enable continuous live video streaming to a large group of clients in cooperative but unreliable overlay networks. We design a server-based architecture which uses a combined technique of time-shifting video server and P2P video patching. iii) A Cooperative patching architecture in overlay networks: We design a cooperative patching architecture which shifts video patching responsibility completely to the client side. An end-host retrieves lost data from other end-hosts within the same multicast group. iv) V3: a vehicle to vehicle video streaming architecture: We propose V3, an architecture to provide live video streaming service to driving vehicles through vehicle-to-vehicle (V2V) networks. V3 incorporates a novel signaling mechanism to continuously trigger video sources to send video data back to the receiver. It also adopts a store-carry-and-forward approach to transmit video data in a partitioned network environment. We also develop a multicasting framework that enables live video streaming applications from multiple sources to multiple receivers in V2V networks. A message integration scheme is used to suppress the signaling overhead, and a two-level tree-based routing approach is adopted to forward the video data.

Power allocation algorithms that determine how much power should be allocated to pilot and data symbols play an important role in addressing the trade-off between accurate channel estimation and high high spectral efficiency for data symbols in the presence of time-varying fading channels. Dealing with this trade-off is highly non-trivial when the channel changes or ages rapidly in time. Specifically, channel aging renders the often used assumption that the channel parameters can be regarded constant between channel estimation instances invalid. Previous works have addressed the problem of the pilot spacing problem for Rayleigh fading channels. In this work, a power control algorithm is developed for both Rayleigh fading and Rician fading channels to deal with the above trade-off. Specifically, in this report, the uplink channel of a multi-user multiple input multiple output system is investigated. The fading channel is estimated by a suitable auto-regressive model using the associated auto-correlation function. Then the signal-to-interference-plus-noise ratio and spectral efficiency are calculated as a function of the power allocation ratio and other parameters of the communication network. The proposed power control algorithm is designed to find the upper bound of the spectral efficiency. As application examples, two uncrewed aerial vehicle networks are also modeled, in which the performance of the proposed power control algorithm is simulated to find how the parameters of the network will influence the algorithm results. Our investigation shows that the proposed power control algorithm performs well in the presence of fading communication channels and outperforms the benchmark case of equal power allocation between pilot and data symbols. / Effektallokeringsalgoritmen som bestämmer hur mycket effekt som ska allokeras till pilotsymboler och datasymboler är mycket viktig för att fånga avvägningen mellan korrekt kanaluppskattning och ett högt signal till störnings plus brusförhållande för en tidsvarierande fädning kanal. Tidigare arbete har löst problemet med pilotavstånds-problemet för Rayleigh fädning kanaler. I detta arbete genereras effektstyrnings-algoritmen för både Rayleigh fading och Rician fädning kanaler för att hantera avvägningen. I denna rapport genereras först en upplänkskanal för ett fleranvändarsystem med flera ingångar med flera utdata. Fädningskanalen uppskattas av den autoregressiva modellen med hjälp av autokorrelations funktionen. Sedan beräknas signal till interferens plus brusförhållandet och spektral effektivitet som en funktion av effekttilldelnings förhållandet och andra parametrar för kommunikationsnätverket. Effektstyrnings algoritmen är att hitta den övre gränsen för den spektrala effektiviteten. I detta arbete modelleras också två obemannade flygfordonsnätverk och prestanda för effektstyrningsalgoritmen simuleras också på dessa två modeller för att hitta hur nätverkets parametrar kommer att påverka algoritmresultaten.