A Simple and Robust Dissemination Protocol for VANETs

Several promising applications for Vehicular Ad-hoc Networks (VANETs) exist. For most of these applications, the communication among vehicles is envisioned to be based on the broadcasting of messages. This is due to the inherent highly mobile environment and importance of these messages to vehicles nearby. To deal with broadcast communication, dissemination protocols must be defined in such a way as to (i) prevent the so-called broadcast storm problem in dense networks and (ii) deal with disconnected networks in sparse topologies. In this paper, we present a Simple and Robust Dissemination (SRD) protocol that deals with these requirements in both sparse and dense networks. Its novelty lies in its simplicity and robustness. Simplicity is achieved by considering only two states (cluster tail and non- tail) for a vehicle. Robustness is achieved by assigning message delivery responsibility to multiple vehicles in sparse networks. Our simulation results show that SRD achieves high delivery ratio and low end-to-end delay under diverse traffic conditions

A Black Hole Attack Model for Reactive Ad-Hoc Protocols

Net-Centric Warfare places the network in the center of all operations, making it a critical resource to attack and defend during wartime. This thesis examines one particular network attack, the Black Hole attack, to determine if an analytical model can be used to predict the impact of this attack on ad-hoc networks. An analytical Black Hole attack model is developed for reactive ad-hoc network protocols DSR and AODV. To simplify topology analysis, a hypercube topology is used to approximate ad-hoc topologies that have the same average node degree. An experiment is conducted to compare the predicted results of the analytical model against simulated Black Hole attacks on a variety of ad-hoc networks. The results show that the model describes the general order of growth in Black Hole attacks as a function of the number of Black Holes in a given network. The model accuracy maximizes when both the hypercube approximation matches the average degree and number of nodes of the ad-hoc topology. For this case, the model falls within the 95% confidence intervals of the estimated network performance loss for 17 out of 20 measured scenarios for AODV and 7 out of 20 for DSR

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows insights into how the number of hops and other network parameters affect spatial throughput in the non-asymptotic regime. The outage probability analysis is then extended to account for retransmissions with a maximum number of allowed attempts. In contrast to prevailing wisdom, we show that predetermined routing (such as nearest-neighbor) is suboptimal, since more hops are not useful once the network is interference-limited. Our results also make clear that randomness in the location of relay sets and dynamically varying channel states is helpful in obtaining higher aggregate throughput, and that dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information Theory, 201

A Measurement Based Shadow Fading Model for Vehicle-to-Vehicle Network Simulations

The vehicle-to-vehicle (V2V) propagation channel has significant implications on the design and performance of novel communication protocols for vehicular ad hoc networks (VANETs). Extensive research efforts have been made to develop V2V channel models to be implemented in advanced VANET system simulators for performance evaluation. The impact of shadowing caused by other vehicles has, however, largely been neglected in most of the models, as well as in the system simulations. In this paper we present a shadow fading model targeting system simulations based on real measurements performed in urban and highway scenarios. The measurement data is separated into three categories, line-of-sight (LOS), obstructed line-of-sight (OLOS) by vehicles, and non line-of-sight due to buildings, with the help of video information recorded during the measurements. It is observed that vehicles obstructing the LOS induce an additional average attenuation of about 10 dB in the received signal power. An approach to incorporate the LOS/OLOS model into existing VANET simulators is also provided. Finally, system level VANET simulation results are presented, showing the difference between the LOS/OLOS model and a channel model based on Nakagami-m fading.Comment: 10 pages, 12 figures, submitted to Hindawi International Journal of Antennas and Propagatio

Context Aware Routing Management Architecture for Airborne Networks

This thesis advocates the use of Kalman filters in conjunction with network topology information derived from the Air Tasking Order (ATO) during the planning phase for military missions. This approach is the basis for an algorithm that implements network controls that optimize network performance for Mobile Ad hoc Networks (MANET). The trajectories of relevant nodes (airborne platforms) participating in the MANET can be forecasted by parsing key information contained in the ATO. This information is used to develop optimum network routes that can significantly improve MANET performance. Improved MANET performance in the battlefield enables decision makers to access information from several sensors that can summarize mission execution status real-time. In one simulated test case there was a 25% percent improvement of network throughput, and 23% reduction on dropped packets. Using this technique we can selectively preserve the Quality of Service (QoS) by establishing network controls that drops low priority packets when necessary. The algorithm improves the overall MANET throughput while minimizing the packets dropped due to network congestion