Video dissemination over Vehicular Ad Hoc Networks (VANETs) is an attractive technology which supports many novel applications. Hence, the merit of this thesis has twofold. Firstly, we evaluate and compare three routing techniques and two error resilience techniques. We select a sender-based routing technique called SUV and compare it with the other two selected receiver-based routing techniques named REACT-DIS and CDS. The results, more specifically, show that the receiver-based solutions outperform the sender-based solution. In addition, only CDS method fulfils the general quality requirements as it is the best that reduces redundancy packets and covers the whole topology. The results also indicate that the video coding scheme, Interleaving, can fix the multiple consecutive packet losses and guarantee reliable video qualities over VANETs. Network Coding, however, fails to provide satisfactory video quality for urban scenarios. This study next combines the selected receiver based routing techniques and the two error resilience techniques. We find the best combination is Interleaving over CDS. Secondly, we design a quality guaranteed video dissemination protocol for urban VANETs scenarios. Based on our comparison result, our protocol selects the CDS and Interleaving as the routing and error resilient techniques. To fix the single packet loses caused by the topology’s intermittent disconnection and collisions, we propose a store-carry-broadcast scheme for the nodes to re-transmit the local buffer saved packets. The results, when compared to the selected techniques and combinations, show that our proposed protocol is the most efficient one in terms of packet delivery, delay, overhead and video quality.

Relays in communication networks is a well-researched topic. Historically, relays were used in analog radio and television to extend the coverage. Using relays in wireless data networking applications is a more recent problem. In the early 2000s, relays were introduced for Micro-cellular and Wi-Fi deployments. Recently it has been considered for sensor networks and Vehicular Ad-hoc Networks (VANETs) applications. In this dissertation we present a novel approach to determine the optimal bounds for the Medium Access Control (MAC) throughput at the target receiver in a multi-hop multirate wireless data network. For a given relationship between the throughput and the distance, and a given distance between the access point and the target receiver, there is a minimum number of nodes that provides the maximum throughput to the target receiver. It is always desirable to optimize the deployment from various aspects. These aspects are application dependent and they range from energy conservation in sensor networks to throughput and coverage maximization in data networks. We apply this novel approach to vehicular ad-hoc network (VANET) scenarios. Using multi-hop relays, we show how to determine the optimum throughput for communciation between two vehicles. The optimal number of relays is chosen to maximize the throughput for point-to-point communication between a source and a destination as well as broadcast among all vehicles in the coverage area of the source. Additionally, in the physical layer, performance issues arise from the effects of interference and fading. The physical layer performance will in turn impact medium access control performance, effectively reducing the network throughput. We evaluate the ii performance of dense small cells for wireless local area networks (WLAN) and femto cells for data applications under the effects of interference and fading. We assume the network is fully saturated. We use the throughput-distance relationship to take into consideration the effects of interference, fading as well as the medium access control overheads. Using this model, we show that under certain conditions, the medium access control throughput for WLANs can outperform that of femto cells.

Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc.have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs are constrained to roads and the number of nodes in VANETs is large and covers typically large area. The following are the contributions of the thesis. Secure, authenticated, privacy preserving message dissemination in VANETs: When vehicles in VANET observe phenomena such as accidents, icy road condition, etc., they need to disseminate this information to vehicles in appropriate areas so the drivers of those vehicles can take appropriate action. When such messages are disseminated, the authenticity of the vehicles disseminating such messages should be verified while at the same time the anonymity of the vehicles should be preserved. Moreover, to punish the vehicles spreading malicious messages, authorities should be able to trace such messages to their senders when necessary. For this, we present an efficient protocol for the dissemination of authenticated messages. Incentive-based architecture for vehicular cloud: Due to the advantages such as exibility and availability, interest in cloud computing has gained lot of attention in recent years. Allowing vehicles in VANETs to store the collected information in the cloud would facilitate other vehicles to retrieve this information when they need. In this thesis, we present a secure incentive-based architecture for vehicular cloud. Our architecture allows vehicles to collect and store information in the cloud; it also provides a mechanism for rewarding vehicles that contributing to the cloud. Privacy preserving message dissemination in VANETs: Sometimes, it is sufficient to ensure the anonymity of the vehicles disseminating messages in VANETs. We present a privacy preserving message dissemination protocol for VANETs.

No description available.

Vehicular Ad hoc Networks (VANET) is a wireless ad-hoc network that includes two types of communications, Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). In VANET there are two types of messages. The first type is the event-driven messages that are only triggered in case of emergency. The second type is the periodical messages named beacons that are exchanged frequently between vehicles. A beacon message contains basic information about the sending vehicle such as id, location and velocity. Beacons are frequently exchanged to increase the cooperative awareness between vehicles. Increasing beacon frequency helps increasing neighborhood awareness and improving information accuracy. However, this causes more congestion in the network, specially when the number of vehicles increases. On the other hand, reducing beacon frequency alleviates network congestion, but results in out-dated information. In this dissertation, we address the aforementioned challenges and propose a number of smart beaconing protocols and evaluate their performance in di↵erent environments and network densities. The four adaptive beaconing protocols are designed to increase the cooperative awareness and information freshness, while alleviating the network congestion. All the proposed protocols take into account the most important aspects, which are critical to beaconing rate adaptation. These aspects include channel status, traffic conditions and link quality. The proposed protocols employ fuzzy logic-based techniques to determine the congestion rank, which is used to adjust beacon frequency. The first protocol considers signal to interference-noise ratio (SINR), number of neighboring nodes and mobility to determine the congestion rank and adjust the beacon rate accordingly. This protocol works well in sparse conditions and highway environments. The second protocol works well in sparse conditions and urban environments. It uses channel busy time (CBT), mobility and packet delivery ratio (PDR) to determine the congestion rank and adjust the beacon rate. The third protocol utilizes CBT, SINR, PDR, number of neighbors and mobility as inputs for the fuzzy logic system to determine the congestion rank and adjust the beacon rate. This protocol works well in dense conditions in both highway and urban environments. Through extensive simulation experiments, we established that certain input parameters are more e↵ective in beacon rate adaptation for certain environments and conditions. Based on this, we propose a high awareness and channel efficient scheme that adapts to di↵erent environments and conditions. First, the protocol estimates the network density using adaptive threshold function. Then, it looks at the spatial distribution of nodes using the quadrat method to determine whether the environment is highway or urban. Based on the density conditions and nodes distribution, the protocol utilizes the appropriate fuzzy input parameters to adapt the beaconing rate. In addition, the protocol optimizes the performance by adapting the transmission power based on network density and nodes distribution. Finally, an investigation of the impact of adaptive beaconing on broadcasting is conducted. The simulation results confirm that our adaptive beaconing scheme can improve performance of the broadcast protocols in terms of reachability and bandwidth consumption when compared to a fixed rate scheme. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

The United States has been going through a road accident crisis for many years. The National Safety Council estimates 40,000 people were killed and 4.57 million injured on U.S. roads in 2017. Direct and indirect loss from tra c congestion only is more than $140 billion every year. Vehicular Ad-hoc Networks (VANETs) are envisioned as the future of Intelligent Transportation Systems (ITSs). They have a great potential to enable all kinds of applications that will enhance road safety and transportation efficiency. In this dissertation, we have aggregated seven years of real-life tra c and incidents data, obtained from the Florida Department of Transportation District 4. We have studied and investigated the causes of road incidents by applying machine learning approaches to this aggregated big dataset. A scalable, reliable, and automatic system for predicting road incidents is an integral part of any e ective ITS. For this purpose, we propose a cloud-based system for VANET that aims at preventing or at least decreasing tra c congestions as well as crashes in real-time. We have created, tested, and validated a VANET traffic dataset by applying the connected vehicle behavioral changes to our aggregated dataset. To achieve the scalability, speed, and fault-tolerance in our developed system, we built our system in a lambda architecture fashion using Apache Spark and Spark Streaming with Kafka. We used our system in creating optimal and safe trajectories for autonomous vehicles based on the user preferences. We extended the use of our developed system in predicting the clearance time on the highway in real-time, as an important component of the traffic incident management system. We implemented the time series analysis and forecasting in our real-time system as a component for predicting traffic flow. Our system can be applied to use dedicated short communication (DSRC), cellular, or hybrid communication schema to receive streaming data and send back the safety messages. The performance of the proposed system has been extensively tested on the FAUs High Performance Computing Cluster (HPCC), as well as on a single node virtual machine. Results and findings confirm the applicability of the proposed system in predicting traffic incidents with low processing latency. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

Vehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require uni-cast routing, which remains a significant challenge due to VANETs characteristics. Given VANET dynamic topology, geographic routing protocols are considered the most suitable for such network due to their scalability and low overhead. However, the optimal selection of next-hop nodes in geographic routing is a challenging problem where the routing performance is highly affected by the variable link quality and bandwidth availability. In this dissertation, a number of enhancements to improve geographic routing reliability in VANETs are proposed. To minimize packet losses, the direction and link quality of next-hop nodes using the Expected Transmission Count (ETX) are considered to select links with low loss ratios. To consider the available bandwidth, a cross-layer enchantment of geographic routing, which can select more reliable links and quickly react to varying nodes load and channel conditions, is proposed. We present a novel model of the dynamic behavior of a wireless link. It considers the loss ratio on a link, in addition to transmission and queuing delays, and it takes into account the physical interference e ect on the link. Then, a novel geographic routing protocol based on fuzzy logic systems, which help in coordinating di erent contradicting metrics, is proposed. Multiple metrics related to vehicles' position, direction, link quality and achievable throughput are combined using fuzzy rules in order to select the more reliable next-hop nodes for packet forwarding. Finally, we propose a novel link utility aware geographic routing protocol, which extends the local view of the network topology using two-hop neighbor information. We present our model of link utility, which measures the usefulness of a two-hop neighbor link by considering its minimum residual bandwidth and packet loss rate. The proposed protocol can react appropriately to increased network tra c and to frequent topology dis-connectivity in VANETs. To evaluate the performance of the proposed protocols, extensive simulation experiments are performed using network and urban mobility simulation tools. Results confirm the advantages of the proposed schemes in increased traffic loads and network density. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

Abstract Vehicular Ad Hoc Networks (VANET) can provide strong safety for vehicles by taking the advantages of the information which are interchanged among themselves and some infrastructures. Due to this significant application of VANET, message authentication and privacy in VANET is quite critical. Pseudonym PKI technology is a practical solution to ensure the above two properties. However, the performance of the previous works cannot satisfy the requirement for the applications in VANET, such as efficiency and management cost. Most of all pseudonym PKI technologies are comprehensive schemes, like group key and ID-based public key cryptosystem. This also increases the implementation complexity of VANET security. Therefore, we will propose an efficient pseudonym PKI mechanism based on bilinear mapping to improve the performance of the message authentication protocol, certificate tracing and certificate revocation, implementation cost, and management cost.

Vehicular Ad hoc Networks (VANET) exhibit highly dynamic behavior with high mobility and random network topologies. The performance of Transmission Control Protocols in such wireless ad hoc networks is plagued by a number of problems: frequent link failures, scalability, multi-hop data transmission and data loss. To address these VANET routing issues, I have used the ideas from swarm intelligence. The Ant Colony Optimization (ACO), which is a branch of swarm intelligence, is the main source of my inspiration. I have designed an ant-based routing algorithm which addresses routing issues prevalent in VANETs: adaptivity, robustness and scalability. One attractive feature of ACO is that they provide multiple routes from source to destination, resulting in more robust network. In this work, together with ACO, I have used the ideas from zone routing protocols to develop my algorithm: Mobility Aware Zone based Ant Colony Optimization Routing for VANET that exhibits locality and scalability.

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this thesis, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses this data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes.