Vehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks and represent a relatively new and very active field of research. VANETs will enable in the near future applications that will dramatically improve roadway safety and traffic efficiency. There is a need to increase traffic efficiency as the gap between the traveled and the physical lane miles keeps increasing. The Dynamic Traffic Assignment problem tries to dynamically distribute vehicles efficiently on the road network and in accordance with their origins and destinations. We present a novel dynamic decentralized and infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill the void left by current algorithms which are either static, centralized, or require infrastructure. The algorithm follows an online approach that seeks stochastic user equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic demand or the schedule of the cars that will enter the road network in the future. The Reverse Online Algorithm for the Dynamic Traffic Assignment inspired by Ant Colony Optimization for VANETs follows a metaheuristic approach that uses reports from other vehicles to update the vehicle’s perceived view of the road network and change route if necessary. To alleviate the broadcast storm spontaneous clusters are created around traffic incidents and a threshold system based on the level of congestion is used to limit the number of incidents to be reported. Simulation results for the algorithm show a great improvement on travel time over routing based on shortest distance. As the VANET transceivers have a limited range, that would limit messages to reach at most 1,000 meters, we present a modified version of this algorithm that uses a rebroadcasting scheme. This rebroadcasting scheme has been successfully tested on roadways with segments of up to 4,000 meters. This is accomplished for the case of traffic flowing in a single direction on the roads. It is anticipated that future simulations will show further improvement when traffic in the other direction is introduced and vehicles travelling in that direction are allowed to use a store carry and forward mechanism. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2016. / FAU Electronic Theses and Dissertations Collection

This work presents the development of the Context-Aware Hybrid Data Dissemination protocol for vehicular networks. The importance of developing vehicular networking data dissemination protocols is exemplified by the recent announcement by the U.S. Department of Transportation (DOT) National Highway Traffic Safety Administration (NHTSA) to enable vehicle-to-vehicle (V2V) communication technology. With emphasis on safety, other useful applications of V2V communication include but are not limited to traffic and routing, weather, construction and road hazard alerts, as well as advertisement and entertainment. The core of V2V communication relies on the efficient dispersion of relevant data through wireless broadcast protocols for these varied applications. The challenges of vehicular networks demand an adaptive broadcast protocol capable of handling diverse applications. This research work illustrates the design of a wireless broadcast protocol that is context-aware and adaptive to vehicular environments taking into consideration vehicle density, road topology, and type of data to be disseminated. The context-aware hybrid data dissemination scheme combines store-and-forward and multi-hop broadcasts, capitalizing on the strengths of both these categories and mitigates the weaknesses to deliver data with maximum efficiency to a widest possible reach. This protocol is designed to work in both urban and highway mobility models. The behavior and performance of the hybrid data dissemination scheme is studied by varying the broadcast zone radius, aggregation ratio, data message size and frequency of the broadcast messages. Optimal parameters are determined and the protocol is then formulated to become adaptive to node density by keeping the field size constant and increasing the number of nodes. Adding message priority levels to propagate safety messages faster and farther than non-safety related messages is the next context we add to our adaptive protocol. We dynamically set the broadcast region to use multi-hop which has lower latency to propagate safety-related messages. Extensive simulation results have been obtained using realistic vehicular network scenarios. Results show that Context-Aware Hybrid Data Dissemination Protocol benefits from the low latency characteristics of multi-hop broadcast and low bandwidth consumption of store-and-forward. The protocol is adaptive to both urban and highway mobility models. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2014. / FAU Electronic Theses and Dissertations Collection

In past and recent literature, random access protocols have been investigated with growing interest. In particular, the Slotted ALOHA protocol has been extensively used in satellite communications, and has also attracted considerable attention in many areas of wireless communication systems, especially in the cellular mobile environment. In this thesis, we investigate the performance of Slotted ALOHA, an effective random access protocol, in a Weibull fading environment. We study the performance metrics based on the signal-to-interference-and-noise ratio (SINR) model, in a cellular network system, assuming two captures models. The capture effect, also called co-channel interference tolerance, is the ability to correctly receive a strong signal from one transmitter despite significant interference from other transmitters. We derive closed-formed expressions and numerical evaluations for both the capture probability and the system throughput. he analytical results will be validated with computer simulations. Finally, to mitigate the effects of Weibull fading channel we also consider the effect of dual selection diversity that will increase the capture probability and the system throughput. / by Jean N. Rene. / Thesis (M.S.C.S.)--Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.

Research in the field of random access protocols for narrow-band systems started as early as the 1970s with the introduction of the ALOHA protocol. From the research done in slotted narrow-band systems, it is well known that contention results in all the packets involved in the contention being unsuccessful. However, it has been shown that in the presence of unequal power levels, ore of the contending packets may be successful. Ibis is a phenomenon called capture. Packet capture has been shown to improve the performance of slotted narrow-band systems. Recently, much work has been done in the analysis of spread-spectrum ALOHA type code-division multiple access (CDMA) protocols. The issue of designing power control techniques to improve the performance of CDMA systems by reducing multiple access interference (MAl) has been a subject of much research. It has been shown that in the presence of power control schemes, the performance of spread-ALOHA CDMA systems is improved. However, it is also widely documented that the design of power control schemes capable of the ideal of compensation of radio propagation techniques is not possible for various reasons, and hence the imperfections in power control. None of the research known to the author has looked at capture in spread-ALOHA systems, and to a greater extent, looked at expressions for the performance of spreadALOHA systems in the presence of capture. In this thesis we introduce spread-ALOHA systems with capture as a manifestation of the imperfections in power control. We propose novel expressions for the computation of the perfonnance ofspread-ALOHA systems with capture. / Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, 2005.

Mobile Ad-hoc Network (MANET) is a group of mobile devices that can form a network, interconnect and share resources without the use of any fixed network infrastructure or centralised management. MANET is exposed to security attacks because of its fundamental characteristics such as open medium, dynamic topology and lack of central monitoring. The black hole attack is one example of the attacks MANET is exposed to. In black hole attack, a malicious node misleadingly claims to have an updated route to the destination node, absorbs and drops the packets that are supposed to be forwarded to the destination node. The common MANET reactive routing protocols are Ad-hoc on-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). These protocols are easily attacked by the black hole during the route discovery process. This research therefore studies black hole attack in detail and assesses the performance of AODV and DSR under black hole attack. The work is achieved by simulating the two protocols under regular operation and under black hole attack using Network Simulator 2 (NS-2). The protocols are analysed using packet delivery ratio, throughput and end-to-end delay as performance metrics. The research further compares the black hole attack solutions that have been previously proposed and determines the solution that performs better than others. The simulation results show that MANET under normal operating environment out performs MANET attacked by black hole, and that AODV is more vulnerable to black hole attack than DSR. The comparison study of the existing black hole attack solutions show that SAODV is the best effective black hole attack removal technique. But when considering the solution that brings no negative impact to the normal operation of the network, IDSAODV is the best solution. / Computing / M. Sc. (Computer Science)

Orientadores: Helio Waldman, Moises Renato Nunes Ribeiro / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-12T16:44:15Z (GMT). No. of bitstreams: 1 Fardin_MarconiPereira_M.pdf: 962828 bytes, checksum: b8632419bf2a2ad176b38f5257eceada (MD5) Previous issue date: 2008 / Resumo: A infra-estrutura de transporte da internet está movendo-se para um modelo formado por roteadores de alta velocidade interconectados por um núcleo de redes ópticas inteligentes. A tecnologia WDM (Wavelength Division Multiplex) já está consolidada como meio de incrementar a capacidade de transmissão nessas redes porém, existem poucas propostas de planos de controles distribuídos capazes de lidar dinamicamente com as restrições de Qualidade de Serviço (QoS - Quality of Service) em grandes redes. Neste contexto, informações sobre os estados dos enlaces são constantemente divulgadas pela rede e o mecanismo de inundação se tornou ineficiente para lidar com a disseminação das informações. Este trabalho propõe e analisa uma estrutura sobreposta baseada em tabelas de dispersão distribuídas (DHT - Distributed Hash Table) para dispor informações em um espaço virtual. Uma rede sobreposta virtual endereçada por conteúdo (CAN - Content Addressable Network), com enlaces de longa distância para obter características de mundo pequeno, é utilizada para possibilitar o roteamento com baixa ocupação dos enlaces sem penalizar demasiadamente o atraso inserido. Avaliações analíticas ilustram o ganho de desempenho em grandes redes. / Abstract: The transport layer structure of the Internet is moving towards a model of highspeed routers interconnected by intelligent optical core networks. A consensus has been reached on wavelength division multiplexing (WDM) as the way to increase the transmission capacity. However there are few proposals for distributed control planes under dynamic Quality of Service (QoS) constraints for large networks. In this context, resources availability must be frequently distributed and updated across the network; and flooding may no longer be the best strategy for information dissemination. This work proposes and assesses an overlay structure based on distributed hash tables (DHT) for information indexing over bi-dimensional virtual coordinated spaces. By adding long-distance interconnections to Content-Addressable Networks (CAN), the resulting small-world effect can reduce the number of hops per resource search. Analytical results indicate significant reduction in management traffic over the physical layer of large networks without penalizing to much the inserted delay. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

This work presents the implementations of three adaptive broadcast protocols for vehicular ad hoc networks (VANET) using the Network Simulator 3 (Ns-3). Performing real life tests for VANET protocols is very costly and risky, so simulation becomes a viable alternative technique. Ns-3 is one of the most advanced open source network simulators. Yet Ns-3 lacks implementations of broadcast protocols for VANET. We first implement the Distance to Mean (DTM) protocol, which uses the distance to mean to determine if a node should rebroadcast or not. We then implement the Distribution-Adaptive Distance with Channel Quality (DADCQ) protocol, which uses node distribution, channel quality and distance to determine if a node should favor rebroadcasting. The third protocol, Statistical Location-Assisted Broadcast protocol (SLAB), is an improvement of DADCQ which automates the threshold function design using machine learning. Our NS-3 implementations of the three protocols have been validated against their JiST/SWANS implementations. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2016. / FAU Electronic Theses and Dissertations Collection

A Vehicular Ad-hoc Network (VANET) is a wireless ad-hoc network that provides communications among vehicles with on-board units and between vehicles and nearby roadside units. The success of a VANET relies on the ability of a routing protocol to ful ll the throughput and delivery requirements of any applications operating on the network. Currently, most of the proposed VANET routing protocols focus on urban or highway environments. This dissertation addresses the need for an adaptive routing protocol in VANETs which is able to tolerate low and high-density network tra c with little throughput and delay variation. This dissertation proposes three Geographic Ad-hoc On-Demand Distance Vector (GEOADV) protocols. These three GEOADV routing protocols are designed to address the lack of exibility and adaptability in current VANET routing protocols. The rst protocol, GEOADV, is a hybrid geographic routing protocol. The second protocol, GEOADV-P, enhances GEOADV by introducing predictive features. The third protocol, GEOADV-PF improves optimal route selection by utilizing fuzzy logic in addition to GEOADV-P's predictive capabilities. To prove that GEOADV and GEOADV-P are adaptive their performance is demonstrated by both urban and highway simulations. When compared to existing routing protocols, GEOADV and GEOADV-P lead to less average delay and a higher average delivery ratio in various scenarios. These advantages allow GEOADV- P to outperform other routing protocols in low-density networks and prove itself to be an adaptive routing protocol in a VANET environment. GEOADV-PF is introduced to improve GEOADV and GEOADV-P performance in sparser networks. The introduction of fuzzy systems can help with the intrinsic demands for exibility and adaptability necessary for VANETs. An investigation into the impact adaptive beaconing has on the GEOADV protocol is conducted. GEOADV enhanced with an adaptive beacon method is compared against GEOADV with three xed beacon rates. Our simulation results show that the adaptive beaconing scheme is able to reduce routing overhead, increase the average delivery ratio, and decrease the average delay. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

The convergence of recent technology advances opens the way to new ubiquitous environments, where network-enabled devices collectively form invisible pervasive computing and networking environments around the users. These users increasingly require extensive applications and capabilities from these devices. Recent approaches propose that cooperating service providers, at the edge of the network, offer these required capabilities (i.e services), instead of having them directly provided by the devices. Thus, the network evolves from a plain communication medium into an endless source of services. Such a service, namely an overlay application, is composed of multiple distributed application elements, which cooperate via a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS on the communication paths of the corresponding overlay association. This thesis asserts and shows that it is possible to provide QoS to an overlay application by using alternate Internet paths resulting from the compositions of independent consecutive paths. Moreover, this thesis also demonstrates that it is possible to discover, select and compose these independent paths in a distributed manner within an community comprising a limited large number of autonomous cooperating peers, such as the fore-mentioned service providers. Thus, the main contributions of this thesis are i) a comprehensive description and QoS characteristic analysis of these composite alternate paths, and ii) an original architecture, termed SPAD (Super-Peer based Alternate path Discovery), which allows the discovery and selection of these alternate paths in a distributed manner. SPAD is a fully distributed system with no single point of failure, which can be easily and incrementally deployed on the current Internet. It empowers the end-users at the edge of the network, allowing them to directly discover and utilize alternate paths.

In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms. LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience. With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback. I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.