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

Dans le cadre des systèmes de transport intelligents (STI), les véhicules peuvent avoir beaucoup de capteurs (caméras, lidars, radars, etc.) et d’applications (évitement des collisions, surveillance du trafic, etc.) générant des données. Ils représentent alors une source d’information importante. Les applications locales peuvent augmenter considérablement leur efficacité en partageant une telle information au sein du réseau. La précision des données, la confiance et la pertinence peuvent être vérifiées lors de la réception de données provenant d’autres nœuds. Par conséquent, nous croyons qu’une question importante à répondre dans ce contexte est: “Comment partager efficacement les données dans un tel environnement?” Le partage de données est une tâche complexe dans les réseaux dynamiques. De nombreuses problèmes telles que les connexions intermittentes, la variation de la densité du réseau et la congestion du médium de communication se posent. Une approche habituelle pour gérer ces problèmes est basée sur des processus périodiques. En effet, un message envoyé plusieurs fois peut atteindre sa destination même avec des connexions intermittentes et des réseaux à faible densité. Néanmoins, dans les réseaux à haute densité, ils peuvent entraîner une congestion du médium de communication. Dans cette thèse, nous abordons le problème du partage de données dans des réseaux dynamiques en nous appuyant sur des horizons de pertinence. Un horizon est défini comme une zone dans laquelle une information devrait être reçue. Nous commençons par nous concentrer sur le partage de données au sein des voisins directs (à 1 saut de distance). Ensuite, nous proposons une solution pour construire une carte des voisins, centrée sur le nœud ego, dans un horizon à n sauts. Enfin, nous relâchons la définition de l’horizon pour la définir de façon dynamique, où différents éléments de données peuvent atteindre des distances différentes (sauts). En ce qui concerne la solution pour les horizons à 1 saut, notre technique adaptative prend en compte la dynamique des nœuds et la charge du réseau. Afin d’assurer une diffusion efficace des données dans différents scénarios, la fréquence d’envoi des messages est définie en fonction des mouvements des véhicules et d’une estimation du taux de perte du réseau. Après, nous nous concentrons sur la carte des voisins jusqu’à n sauts de distance. Comme la communication avec des nœuds éloignés apporte des problèmes supplémentaires (actions de transfert, retards plus importants, informations périmées), une évaluation de confiance des nœuds identifiés et une estimation de fiabilité du chemin vers chaque voisin sont ajoutées à la carte. Au lieu d’exécuter des processus de diffusion séparés, notre troisième contribution porte sur une stratégie de coopération dont l’objectif principal est de diffuser des données tout en satisfaisant la plupart des nœuds. À cette fin, une trame unique est transmise de nœud en nœud. Sa charge utile est mise à jour localement afin qu’elle contienne les éléments de données les plus pertinents en fonction de certains critères (par exemple, urgence, pertinence). Une telle stratégie définit ainsi un horizon centré sur les données. Nous validons nos propositions au moyen d’émulations de réseaux réalistes. De toutes nos études et des résultats obtenus, nous pouvons affirmer que notre approche apporte des perspectives intéressantes pour le partage de données dans des réseaux dynamiques comme les VANET. / In the context of Intelligent Transportation Systems - ITS, vehicles may have a lot of sensors (e.g. cameras, lidars, radars) and applications (collision avoidance, traffic monitoring, etc.) generating data. They represent then an important source of information. Local applications can significantly increase their effectiveness by sharing such an information within the network. Data accuracy, confidence and pertinence can be verified when receiving data from other nodes. Therefore, we believe that an important question to answer in this context is: “How to efficiently share data within such an environment?” Data sharing is a complex task in dynamic networks. Many concerns like intermittent connections, network density variation and communication spectrum congestion arise. A usual approach to handle these problems is based on periodic processes. Indeed, a message sent many times can reach its destination even with intermittent connections and low density networks. Nevertheless, within high density networks, they may lead to communication spectrum scarcity. In this thesis we address the problem of data sharing in dynamic networks by relying in so-called horizons of pertinence. A horizon is defined as an area within which an information is expected to be received. We start focusing on data sharing within direct neighbors (at 1-hop of distance). Then we propose a solution to construct a map of neighbors, centered in the ego-node, within a horizon of n-hops. Finally, we relax the horizon definition to a dynamic defined one where different data items may reach different distances (hops). Regarding the solution for 1-hop horizons, our adaptive technique takes into account nodes’ dynamics and network load. In order to ensure an effective data dissemination in different scenarios, the sending messages frequency is defined according to vehicles movements and an estimation of the network loss rate. Following, we focus on the map of neighbors up to n-hops of distance. As communicationwith distant nodes brings additional concerns (forwarding actions, larger delays, out-of-date information), a trust evaluation of identified nodes and a reliability estimation of the multi-hop path to each neighbor is added to the map. Instead of running separated disseminating processes, our third contribution deals with a cooperative strategy with the main goal of disseminating data while satisfying most of the nodes. For this purpose a unique frame is forwarded from node to node. Its payload is locally updated so that it contains the most relevant data items according to some criteria (e.g. urgency, relevance). Such a strategy defines thus a data-centered horizon. We validate our proposals by means of realistic network emulations. From all our studies and achieved results we can state that our approach brings interesting insights for data sharing in dynamic networks like VANETs.

A evolução tecnológica das redes de telecomunicações sem fio permite que organizações de redes mais inteligentes sejam vislumbradas. É possível imaginar um sistema de telefonia formado por dispositivos móveis autônomos que não necessite de nenhuma infraestrutura pré-estabelecida para trocar informações com seus vizinhos, de acordo com o alcance do raio de transmissão. Assim, as informações poderiam ser repassadas de nó em nó, formando uma rede de múltiplos saltos. A ausência de uma entidade central também poderia melhorar a tolerância a falhas do sistema, principalmente por gerar uma redundância de caminhos possíveis entre os nós. Analisamos o desempenho desse sistema em diferentes cenários e a sensibilidade à variação de parâmetros como o raio de transmissão, interferências, a quantidade de nós e número de saltos máximo permitido (TTL), e testamos estratégias de comunicação com raio fixo, raio variável, número de vizinhos mínimo e etc., através de modelagem e simulação baseada em agentes. De maneira geral, a estratégia de transmissão com raio variável apresentou a melhor taxa de mensagens recebidas e a menor média de saltos até o destino, porém com maior nível de energia do sistema. A estratégia de raio fixo apresentou a menor energia total gasta pelo sistema para enviar as mensagens, porém, com uma taxa menor de mensagens recebidas. Além disso, avaliamos que as principais causas de perdas de pacotes estão associadas com o aumento da mobilidade, a redução do TTL e as interferências, sendo que cada uma contribui mais ou menos de acordo com o cenário estudado. / The technological development of Wireless Networks leads to more intelligent networks structures. One can imagine a mobile data system consisting of autonomous mobile devices that do not require any pre-established infrastructure to exchange information one with another, limited mainly by the transmission radius. Thus, data could be forwarded from node to node, forming a multihop network. The absence of a central entity could also improve fault tolerance by allowing redundant paths for nodes to communicate. We analyzed the performance of the system in different scenarios and system behavior regarding parameters variations such as transmission radius, interferences, the number of nodes and maximum allowed number of hops (TTL), and tested communication strategies with fixed radius, variable radius, minimum number of neighbors to transmit, etc., through modeling and simulation-based agents. In general, variable radius strategy had the best rate of incoming messages and the lowest average number of hops to the destination. However it presented the higher level of system energy. In one hand, fixed radius strategy presented the lowest total energy expended by the system to send messages, but, in the other hand, the rate of incoming messages was lower. Furthermore, we discovered the main causes of packet losses are associated with increased mobility, reducing the TTL and interference, each of which contributes more or less in accordance with the scenario.

Les réseaux véhiculaires sont des réseaux émergents qui permettent de connecter des véhicules entre eux et avec les infrastructures routières. Ils permettent de mettre en œuvre des applications de sécurité (évitement des collisions, prévention des travaux, etc.), des applications temps-réel (aide à la conduite automatisée), des applications des systèmes de transport intelligents (gestion du trafic, proposition de détours, etc.), des applications de confort (péage automatique des autoroutes, connexion à du contenu multimédia en ligne, etc.). Pour fonctionner pleinement, le véhicule a besoin d’une puissance de calcul de plus en plus grande et d’une connexion quasi-continue. Afin de garantir cette contrainte, les réseaux véhiculaires font de plus en plus appel au Cloud. Cette thèse vise à explorer les différentes interactions entre les réseaux véhiculaire et Cloud. / Vehicular Ad-hoc Networks (VANETs) are a new kind of networks which allow to connect vehicles between them and with the road infrastructures. It make possible to deploy safety applications (colision avoidance, roadworks advertisement, etc.), real time application (driver assistance, automated driving, etc.), comfort application (automatic toll payment, access to multimedia contents via internet, etc.). In order to be functioning completely, the vehicle needs more and more computing power and a connection with almost no interruption. To guarantee this constraints, VANETs are using more and more often the Cloud Computing. This thesis aims to explore the differents intereactions between VANETs and the Cloud

No description available.

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. Unlike previous research, where the mobility metrics were mostly studied by simulations, we derive the analytical expressions of mobility metrics, including link persistence, link duration, link availability, link residual time, link change rate and their path equivalents. We also show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. ¶ We further validate our analysis framework in Random Walk Mobility model (RWMM). Regarding constant or random variable node velocity, we construct the transition matrix of Markov Chain Model through the analysis of the PDF of node separation after one epoch. In addition, we present intuitive and simple expressions for the link residual time and link duration, for the RWMM, which relate them directly to the ratio between transmission range and node speed. We also illustrate the relationship between link change rate and link duration. Finally, simulation results for all mentioned mobility metrics are reported which match well the proposed analytical framework. ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. When on-demand routing employed, stale route cache information and frequent new-route discovery in processes in MANETs generate considerable routing delay and overhead. This thesis proposes a practical route caching strategy to minimize routing delay and/or overhead by setting route cache timeout to a mobility metric, the expected path residual time. The strategy is independent of network traffic load and adapts to various non-identical link duration distributions, so it is feasible to implement in a real-time route caching scheme. Calculated results show that the routing delay achieved by the route caching scheme is only marginally more than the theoretically determined minimum. Simulation in NS-2 demonstrates that the end-to-end delay from DSR routing can be remarkably reduced by our caching scheme. By using overhead analysis model, we demonstrate that the minimum routing overhead can be achieved by increasing timeout to around twice the expected path residual time, without significant increase in routing delay. ¶ Apart from route cache, this thesis also addresses link cache strategy which has the potential to utilize route information more efficiently than a route cache scheme. Unlike some previous link cache schemes delete links at some fixed time after they enter the cache, we proposes using either the expected path duration or the link residual time as the link cache timeout. Simulation results in NS-2 show that both of the proposed link caching schemes can improve network performance in the DSR by reducing dropped data packets, latency and routing overhead, with the link residual time scheme out-performing the path duration scheme. ¶ To deal with large-scale MANETs, this thesis presents an adaptive k-hop clustering algorithm (AdpKHop), which selects clusterhead (CH) by our CH selection metrics. The proposed CH selection criteria enable that the chosen CHs are closer to the cluster centroid and more stable than other cluster members with respect to node mobility. By using merging threshold which is based on the CH selection metric, 1-hop clusters can merge to k-hop clusters, where the size of each k-hop cluster adapts to the node mobility of the chosen CH. Moreover, we propose a routing overhead analysis model for k-hop clustering algorithm, which is determined by a range of network parameters, such as link change rate (related to node mobility), node degree and cluster density. Through the overhead analysis, we show that an optimal k-hop cluster density does exist, which is independent of node mobility. Therefore, the corresponding optimal cluster merging threshold can be employed to efficiently organise k-hop clusters to achieve minimum routing overhead, which is highly desirable in large-scale networks. ¶ The work presented in this thesis provides a sound basis for future research on mobility analysis for mobile ad hoc networks, in aspects such as mobility metrics, caching strategies and k-hop clustering routing protocols.

<p>This licentiate thesis work investigates two medium access control (MAC) methods, when used in traffic safety applications over vehicular <em>ad hoc</em> networks (VANETs). The MAC methods are carrier sense multiple access (CSMA), as specified by the leading standard for VANETs IEEE 802.11p, and self-organizing time-division multiple access (STDMA) as used by the leading standard for transponders on ships. All vehicles in traffic safety applications periodically broadcast cooperative awareness messages (CAMs). The CAM based data traffic implies requirements on a predictable, fair and scalable medium access mechanism. The investigated performance measures are <em>channel access delay</em>, <em>number of consecutive packet drops</em> and the <em>distance between concurrently transmitting nodes</em>. Performance is evaluated by computer simulations of a highway scenario in which all vehicles broadcast CAMs with different update rates and packet lengths. The obtained results show that nodes in a CSMA system can experience <em>unbounded channel access delays</em> and further that there is a significant difference between the best case and worst case channel access delay that a node could experience. In addition, with CSMA there is a very high probability that several <em>concurrently transmitting nodes are located close to each other</em>. This occurs when nodes start their listening periods at the same time or when nodes choose the same backoff value, which results in nodes starting to transmit at the same time instant. The CSMA algorithm is therefore both <em>unpredictable</em> and <em>unfair</em> besides the fact that it <em>scales badly</em> for broadcasted CAMs. STDMA, on the other hand, will always grant channel access for all packets before a predetermined time, regardless of the number of competing nodes. Therefore, the STDMA algorithm is <em>predictable</em> and <em>fair</em>. STDMA, using parameter settings that have been adapted to the vehicular environment, is shown to outperform CSMA when considering the performance measure <em>distance between concurrently transmitting nodes</em>. In CSMA the distance between concurrent transmissions is random, whereas STDMA uses the side information from the CAMs to properly schedule concurrent transmissions in space. The price paid for the superior performance of STDMA is the required network synchronization through a global navigation satellite system, e.g., GPS. That aside since STDMA was shown to be scalable, predictable and fair; it is an excellent candidate for use in VANETs when complex communication requirements from traffic safety applications should be met.</p>

The super collision between the Internet phenomenon and the wireless communication revolution gives birth to a wealth of novel research problems, design challenges and standardization activities. Within this domain, spontaneous wireless IP networking are probably the most extreme example of new ''particles'' born from the collision. Indeed, these particles defy the laws of the Internet in many ways. The absorption of such peculiar particles in the global IP network has already started thanks to pioneering algorithmic and protocol work -- for instance OLSR -- and through the deployment of wireless mesh networks around the world, such as urban community wireless networks. With the recent revolutions in North Africa, and movements such as Occupy Wall Street, the prospect of spontaneous wireless IP networking has become even more attractive on social and political grounds. Dedicated conferences have recently been organized, and as a result, ambitious, multi-million dollar initiatives have been launched (e.g. the US Government-funded project Commotion Wireless, or the EU-funded initiative CONFINE). However, spontaneous IP wireless networks are not yet widely deployed because pioneer work such as OLSR is vastly insufficient to fully bridge the gap between the Internet and these new networks. This thesis presents work that analyzes this gap and proposes some solutions as to how to bridge it. The focus is put on three domains: a first part presents work in the domain of wireless mesh and ad hoc networks. A second part presents work on sensor networks and in the Internet of Things. And the last part presents work in the domain of delay tolerant networking and vehicular networks.

Vehicular networking is envisioned to be a key technology area for significant growth in the coming years. Although the expectations for this emerging technology are set very high, many practical aspects remain still unsolved for a vast deployment of vehicular networks. This dissertation addresses the enabling physical layer techniques to meet the challenges in vehicular networks operating in mobile wireless environments. Considering the infrastructure-less nature of vehicular networks, we envision cooperative diversity well positioned to meet the demanding requirements of vehicular networks with their underlying distributed structure. Cooperative diversity has been proposed as a powerful means to enhance the performance of high-rate communications over wireless fading channels. It realizes spatial diversity advantages in a distributed manner where a node uses others antennas to relay its message creating a virtual antenna array. Although cooperative diversity has garnered much attention recently, it has not yet been fully explored in the context of vehicular networks considering the unique characteristics of vehicular networks, this dissertation provides an error performance analysis study of cooperative transmission schemes for various deployment and traffic scenarios. In the first part of this dissertation, we investigate the performance of a cooperative vehicle-to-vehicle (V2V) system with amplify-and-forward relaying for typical traffic scenarios under city/urban settings and a highway area. We derive pairwise error probability (PEP) expressions and demonstrate the achievable diversity gains. The effect of imperfect channel state information (CSI) is also studied through an asymptotical PEP analysis. We present Monte-Carlo simulations to confirm the analytical derivations and present the error rate performance of the vehicular scheme with perfect and imperfect-CSI. In the second part, we consider road-to-vehicle (R2V) communications in which roadside access points use cooperating vehicles as relaying terminals. Under the assumption of decode-and-forward relaying, we derive PEP expressions for single-relay and multi-relay scenarios. In the third part, we consider a cooperative multi-hop V2V system in which direct transmission is not possible and investigate its performance through the PEP derivation and diversity gain analysis. Monte-Carlo simulations are further provided to con firm the analytical derivations and provide insight into the error rate performance improvement.

Peer-to-peer networks and mobile ad hoc networks are emerging distributed networks that share several similarities. Fundamental among these similarities is the decentralized role of each participating node to route messages on behalf of other nodes, and thereby, collectively realizing communication between any pair of nodes. Messages are routed on a topology graph that is determined by the peer relationship between nodes. Although routing is fairly straightforward when the topology graph is static, dynamic variations in the peer relationship that often occur in peer-to-peer and mobile ad hoc networks present challenges to routing. In this thesis, we examine the interplay between routing messages and network topology design in two classes of these networks -- unstructured peer-to-peer networks and sparsely-connected mobile ad hoc networks. In unstructured peer-to-peer networks, we add structure to overlay topologies to support file sharing. Specifically, we investigate the advantages of designing overlay topologies with small-world properties to improve (a) search protocol performance and (b) network utilization. We show, using simulation, that "small-world-like" overlay topologies where every node has many close neighbors and few random neighbors exhibit high chances of locating files close to the source of file search query. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. In the context of sparsely-connected mobile ad hoc networks where nodes provide connectivity via mobility, we present a protocol for routing in space and time where the message forwarding decision involves not only where to forward (space), but also when to forward (time). We introduce space-time routing tables and develop methods to compute these routing tables for those instances of ad hoc networks where node mobility is predictable over either a finite horizon or indefinitely due to periodicity in node motion. Furthermore, when the node mobility is unpredictable, we investigate several forwarding heuristics to address the scarcity in transmission opportunities in these sparsely-connected ad hoc networks. In particular, we present the advantages of fragmenting messages and augmenting them with erasure codes to improve the end-to-end message delivery performance.