To see the other types of publications on this topic, follow the link: And Vehicular ad hoc network (VANET).
Dissertations / Theses on the topic 'And Vehicular ad hoc network (VANET)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'And Vehicular ad hoc network (VANET).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Giang, Anh Tuan. "Capacity of vehicular Ad-hoc NETwork." Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-00989836.
Full textAbstract:
In recent years, Inter Vehicle Communication (IVC) has become an intensive research area, as part of Intelligent Transportation Systems. It supposes that all, or a subset of the vehicles is equipped with radio devices, enabling communication between them. IEEE 802.11p (standardized for vehicular communication) shows a great deal of promise. By using ad hoc mode, this radio technology allows vehicles to extend their scopes of communication and thus forming a Multi-hop wireless Ad-hoc NETwork, also called Vehicular Ad-hoc NETwork (VANET). This thesis addresses a fundamental problem of VANET: the network capacity. Two simple theoretical models to estimate this capacity have been proposed: a packing model and a Markovian point process model. They offer simple and closed formulae on the maximum number of simultaneous transmitters, and on the distribution of the distance between them. An accurate upper bound on the maximum capacity had been derived. An analytical formula on distribution of the transmitters had been presented. This distribution allows us to optimize Clear Channel Assessment (CCA) parameters that leads to an optimization of the network capacity.In order to validate the approach of this thesis, results from the analytical models are compared to simulations performed with the network simulator NS-3. Simulation parameters was estimated from real experimentation. Impact of different traffic distributions (traffic of vehicles) on the network capacity is also studied. This thesis also focuses on extended perception map applications, which use information from local and distant sensors to offer driving assistance (autonomous driving, collision warning, etc.). Extended perception requires a high bandwidth that might not be available in practice in classical IEEE 802.11p ad hoc networks. Therefore, this thesis proposes an adaptive power control algorithm optimized for this particular application. It shows through an analytical model and a large set of simulations that the network capacity is then significantly increased.
2
Zhang, Qiming. "A pervasive prediction model for Vehicular Ad-hoc NETwork (VANET)." Thesis, Nottingham Trent University, 2017. http://irep.ntu.ac.uk/id/eprint/31951/.
Full textAbstract:
The growth of city traffic has contributed to severe traffic congestion and traffic accidents in the most of the cities in the world. Since people’s travel demand rise at a rate usually greater than the addition of road capacity to lead many other issues, such as environmental problems and the quality of life. Intelligent Transportation System (ITS) is committed to solving the worsening traffic problems. Wide deployment of such ITS can eventually provide more dynamic, real-time and efficient solutions to transportation problems. ITS uses a variety of high technologies, especially electronic information technology and data communications technology to improve road traffic efficiency, road traffic safety and environmental protection. A number of researchers have depended on the wireless mobile communication to improve data collection and utilisation. The data could be used for early warning and forecasting traffic conditions in real-time. The benefit of wireless mobile communication research, especially Car to Car (C2C) communication is to abandon the expensive wireline-deployed and central processing units. Through the interconnection of many personal mobile devices, a low- cost freely extended, high-performance and parallel system can be formed. Car to Car communication can make possible efficient and reliable data transmission by wireless links in a traffic area. It is based on principles of mobile ad-hoc network (MANET) and applies to the domain of vehicles, being Vehicular ad-hoc network (VANET) which is a key component of ITS. The C2C communication system has become essential for driving safety and comfort and also for improving road condition. Also, the traffic prediction system is also an important part of ITS, traffic condition prediction can be regarded as an extension application of VANET. It provides traffic condition in advance via a variety of prediction models and helps the people make better driving safety, travel decisions and route selections regarding departure or driving time. The challenge of wireless traffic prediction technology is the uncertainty of traffic and real-time traffic data collection. It is widely known that urban transport system is a participatory, time-varying and complex nonlinear system. This uncertainty comes not only from the natural causes, such as seasonal and weather factors, but also from human factors, such as traffic accidents, emergencies and driver’s behaviour. In particular, the short-term traffic prediction is more affected by random interference factors. Current wireless traffic prediction research is usually based on a combination of wireless technology and traditional prediction model. The predictable traffic conditions include travel speed, travel time, traffic density, traffic accident, congestion level. However, in a large network environment, as the number of nodes increases, the transmission performance degrades and the prediction accuracy decreases because the prediction model does not obtain enough data. In this thesis, a novel traffic prediction framework (PPM-C2C) is proposed – Pervasive Prediction Model (PPM) based on the C2C communication. The framework utilises ad-hoc data via C2C communications for a short time traffic prediction in each car. This project builds and investigates the behaviour of a pervasive traffic simulation model in Ad-hoc network, with a particular part of it embedded into each vehicle’s equipment. It includes the data collection, aggregation and application aim to be running in all individual cars so that cars have up to date information on the traffic at all times. Moreover, those cars could predict the traffic conditions of a road section in a short time through the proposed prediction framework, especially travel speed prediction. When the car receives the current traffic information about other vehicles, the prediction system will incorporate the information, analyse the data and predict the traffic conditions of this road section for a future time. The design does not depend on any roadside communications infrastructure. It is a simple and flexible car communication and processing technology to collect real-time traffic information. This process will be aided by car to car wireless communication technology available nowadays. To achieve this goal, a mobility model adapted to VANET needs to be generated that a realistic city scenario based on the actual traffic traces is carried out through simulation. Based on this, we investigate the necessary influencing factors for predicted results. The simulation results illustrate that the prediction model can be applied to wireless network environment for a short time prediction, and our results demonstrate the viability and effectiveness of the proposed prediction framework over Car to Car communications. Furthermore, the wireless environment and derived factors can result in decreased application performance.
3
Umer, Tariq. "Connectivity modeling in vehicular ad hoc networks." Thesis, Lancaster University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664458.
Full text
4
Baumann, Rainer. "Vehicular ad hoc networks (VANET) (engineering and simulation of mobile ad hoc routing protocols for VANET on highways and in cities) /." Zürich : ETH, Swiss Federal Institute of Technology Zurich, [Department of Computer Science, Computer Systems Institute], 2004. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=144.
Full text
5
Abumansoor, Osama. "A Design and Evaluation of a Secure Neighborhood Awareness Framework for Vehicular Ad-Hoc Networks." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31171.
Full textAbstract:
Vehicular ad-hoc networks (VANETs) are envisioned to provide many road and safety applications that will improve drivers' awareness and enhance the driving experience. Many of proposed applications are location-based that depend on sharing the location information of vehicles and events among neighboring nodes. The location-based applications should provide vehicle operators with knowledge of the current surrounding conditions to help them make appropriate traveling decisions, such as avoiding traffic congestion. Drivers expect to receive accurate and reliable information from other vehicles. Therefore, securing localization service integrity is important to support a VANET's overall system reliability.
In this thesis, we study the exchanged location information in VANETs and designed a framework to prevent potential security threats that will violate users' privacy and overcome limitations that can impact the exchanged data integrity and reliability. The solution developed a secure neighborhood awareness service and shared localization information management protocol in a VANET. The proposed framework is constructed through several components: (i) a location verification protocol that will secure location information by providing a non-line-of-sight (NLOS) verification protocol to overcome moving obstacle effects; (ii) privacy-preserving location information management to detect data inconsistency and provide a recovery process while preventing attackers from tracking individual vehicles; (iii) a trust model evaluation mechanism based on neighborhood awareness; (iv) an adaptive beacon protocol that will reduce the number of messages and provide quality of service(QoS) control for network managers and authorities. We also propose a security evaluation model that quantifies the security attributes for the localization service in a VANET. The model will help evaluate an integrated security measures that are provided by different components of the network services.
6
Schmidt, David. "Knot Flow Classification and its Applications in Vehicular Ad-Hoc Networks (VANET)." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/etd/3723.
Full textAbstract:
Intrusion detection systems (IDSs) play a crucial role in the identification and mitigation for attacks on host systems. Of these systems, vehicular ad hoc networks (VANETs) are difficult to protect due to the dynamic nature of their clients and their necessity for constant interaction with their respective cyber-physical systems. Currently, there is a need for a VANET-specific IDS that meets this criterion. To this end, a spline-based intrusion detection system has been pioneered as a solution. By combining clustering with spline-based general linear model classification, this knot flow classification method (KFC) allows for robust intrusion detection to occur. Due its design and the manner it is constructed, KFC holds great potential for implementation across a distributed system. The purpose of this thesis was to explain and extrapolate the afore mentioned IDS, highlight its effectiveness, and discuss the conceptual design of the distributed system for use in future research.
7
Aldabbas, Hamza. "Securing data dissemination in vehicular ad hoc networks." Thesis, De Montfort University, 2012. http://hdl.handle.net/2086/7987.
Full textAbstract:
Vehicular ad hoc networks (VANETs) are a subclass of mobile ad hoc networks (MANETs) in which the mobile nodes are vehicles; these vehicles are autonomous systems connected by wireless communication on a peer-to-peer basis. They are self-organized, self-configured and self-controlled infrastructure-less networks. This kind of network has the advantage of being able to be set-up and deployed anywhere and anytime because it has no infrastructure set-up and no central administration. Distributing information between these vehicles over long ranges in such networks, however, is a very challenging task, since sharing information always has a risk attached to it especially when the information is confidential. The disclosure of such information to anyone else other than the intended parties could be extremely damaging, particularly in military applications where controlling the dissemination of messages is essential. This thesis therefore provides a review of the issue of security in VANET and MANET; it also surveys existing solutions for dissemination control. It highlights a particular area not adequately addressed until now: controlling information flow in VANETs. This thesis contributes a policy-based framework to control the dissemination of messages communicated between nodes in order to ensure that message remains confidential not only during transmission, but also after it has been communicated to another peer, and to keep the message contents private to an originator-defined subset of nodes in the VANET. This thesis presents a novel framework to control data dissemination in vehicle ad hoc networks in which policies are attached to messages as they are sent between peers. This is done by automatically attaching policies along with messages to specify how the information can be used by the receiver, so as to prevent disclosure of the messages other than consistent with the requirements of the originator. These requirements are represented as a set of policy rules that explicitly instructs recipients how the information contained in messages can be disseminated to other nodes in order to avoid unintended disclosure. This thesis describes the data dissemination policy language used in this work; and further describes the policy rules in order to be a suitable and understandable language for the framework to ensure the confidentiality requirement of the originator. This thesis also contributes a policy conflict resolution that allows the originator to be asked for up-to-date policies and preferences. The framework was evaluated using the Network Simulator (NS-2) to provide and check whether the privacy and confidentiality of the originators’ messages were met. A policy-based agent protocol and a new packet structure were implemented in this work to manage and enforce the policies attached to packets at every node in the VANET. Some case studies are presented in this thesis to show how data dissemination can be controlled based on the policy of the originator. The results of these case studies show the feasibility of our research to control the data dissemination between nodes in VANETs. NS-2 is also used to test the performance of the proposed policy-based agent protocol and demonstrate its effectiveness using various network performance metrics (average delay and overhead).
8
Stegall, Jabari. "Framework for Anonymous Secure Data Transfer in Vehicular Ad-Hoc Networks." Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-theses/1274.
Full textAbstract:
With the increasing number of Vehicular Autonomous Network (VANET) architectures and applications, user privacy must be addressed and protected. Internet of Things (IoT) and their applications take care of everyday mundane task in order to increase user convenience and productivity. However, studies have shown that IoT architectures can be a weak spot in network security, including data being sent plain text. In this thesis, a VANET architecture is proposed that is capable of securing anonymous data collection from a distributed set of autonomous vehicles. The proposed architecture features a hybrid combination of centralized and decentralized routing concepts. Unlike other VANET implementations, our proposed architecture provides anonymity to users in the network. Lower latency can be achieved by merging data from live short-range ad-hoc routing methods with the data collected from a pseudo-live long range centralized routing methods. The proposed architecture guarantees user anonymity within the VANET framework. Most VANET models assume users do not value the privacy of their identity. We assume that each vehicle is equipped with a VANET computer capable of storing data, performing calculations, and both sending and receiving data wirelessly. Therefore vehicles can communicate directly with each other and exchange data within short distances as well as communicate with long-range wireless infrastructure. Simulation results show the implementation is equipped to handle diverse traffic scenarios as well as deter adversaries to the network from maliciously trying to manipulate collected data.
9
Shah, Niravkumar. "Efficient medium access control protocol for vehicular ad-hoc networks." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2012. https://ro.ecu.edu.au/theses/495.
Full textAbstract:
Intelligent transportation systems (ITS) have enjoyed a tremendous growth in the last decade and the advancement in communication technologies has played a big role behind the success of ITS. Inter-vehicle communication (IVC) is a critical requirement for ITS and due to the nature of communication, vehicular ad-hoc network technology (VANET) is the most suitable communication technology for inter-vehicle communications. In Practice, however, VANET poses some extreme challenges including dropping out of connections as the moving vehicle moves out of the coverage range, joining of new nodes moving at high speeds, dynamic change in topology and connectivity, time variability of signal strength, throughput and time delay. One of the most challenging issues facing vehicular networks lies in the design of efficient resource management schemes, due to the mobile nature of nodes, delay constraints for safety applications and interference. The main application of VANET in ITS lies in the exchange of safety messages between nodes. Moreover, as the wireless access in vehicular environment (WAVE) moves closer to reality, management of these networks is of increasing concern for ITS designers and other stakeholder groups. As such, management of resources plays a significant role in VANET and ITS. For resource management in VANET, a medium access control protocol is used, which makes sure that limited resources are distributed efficiently. In this thesis, an efficient Multichannel Cognitive MAC (MCM) is developed, which assesses the quality of channel prior to transmission. MCM employs dynamic channel allocation and negotiation algorithms to achieve a significant improvement in channel utilisation, system reliability, and delay constraints while simultaneously addressing Quality of Service. Moreover, modified access priority parameters and safety message acknowledgments will be used to improve the reliability of safety messages. The proposed protocols are implemented using network simulation tools. Extensive experiments demonstrated a faster and more efficient reception of safety messages compared to existing VANET technologies. Finally, improvements in delay and packet delivery ratios are presented.
10
Perera, Ovitigalage Prasad Nalaka. "Cooperative diversity for performance enhancement of vehicular ad hoc networks." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/87980/1/Ovitigalage%20Prasad%20Nalaka_Perera_Thesis.pdf.
Full textAbstract:
This project was a step forward in introducing suitable cooperative diversity transmission techniques for vehicle to vehicle communications. The contributions are intended to aid in the successful implementation of future vehicular safety and autonomous controlling systems. Several protocols were introduced for vehicles to communicate effectively without losing connectivity. This study investigated novel protocols in terms of diversity-multiplexing trade-off and outage for a range of potential vehicular safety and infotainment applications.
11
Díez, Rodríguez Víctor, and Jérôme Detournay. "An Approach for Receiver-Side Awareness Control in Vehicular Ad-Hoc Networks." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-32181.
Full textAbstract:
Vehicular Ad-Hoc Network (VANET)s are a key element of Intelligent Transport System (ITS)s. One of the challenges in VANETs is dealing with awareness and congestion due to the high amount of messages received from the vehicles in communication range. As VANETs are used in critical applications, congestion on the receiver side caused by the buffering of the packets is a safety hazard. In this thesis, we propose a stream-wise queuing system on the receiver side and show how it improves the timeliness of the messages received and main- tains the awareness of the system in a congestion situation.
12
Han, Chong. "Analysis and design of efficient medium access control schemes for vehicular ad-hoc networks." Thesis, University of Surrey, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.576087.
Full textAbstract:
In this dissertation, analysis and design of the efficient Medium Access Control (MAC) sub-layer schemes are considered for Vehicular Ad hoc Networks (VANE~s). The contributions of this study are three-fold. First, an analytical model based on Markov chain is developed in order to investigate the performance of the MAC sub-layer of the IEEE 802.11p for vehicular communications. The results indicate that single channel MAC sub-layers may not be adequate for the future Intelligent Transportation Systems (ITS). The analytical model is validated with the results from simulation-based analysis. Performance analysis based on simulations is given on MAC metrics such as throughput, access delay, packet delivery. Second, a multi-channel MAC protocol is proposed and comprehensively analyzed in terms of channel utilizing and Quality of service (QoS) differentiation for dense VANETs. It is demonstrated that the proposed scheme, namely Asynchronous Multichannel MAC with Distributed TDMA (AMCMACD), improves the system performance in terms of throughput, packet delivery rate, collision rate on service channels, load balancing, and service differentiation for dense vehicular networks. Third, to cope with the interference from contention with neighbours within two hops in large-scale networks, a Large-scale Asynchronous Multichannel MAC (LS-AMCMAC) is proposed. The proposed scheme outperforms other benchmark multichannel MAC schemes in large-scale networks, in terms of throughput, channel utilization, dissemination of emergency messages, and the collision rates on control and service channels.
13
Boeira, Felipe Caye Batalha. "Proof of location as a security mechanism for vehicular Ad Hoc networks." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/174536.
Full textAbstract:
O desenvolvimento de redes veiculares possibilita o surgimento de sistemas inteligentes de transporte que podem aumentar a segurança nas vias, aperfeiçoar o controle de tráfego e fornecer entretenimento aos passageiros. O avanço e padronização de tecnologias de comunicação inter-veicular permitem que veículos compartilhem informações de forma colaborativa de maneira a viabilizar o estabelecimento de sistemas de transporte inteligentes cooperativos (C-ITS, Cooperative Intelligent Transportation Systems). Na comunicação veicular, cada nó compartilha periodicamente uma mensagem que contém informações sobre seu estado como posição, velocidade e aceleração. Estas mensagens são denominadas Cooperative Awareness Messages (CAMs) e podem ser utilizadas por veículos vizinhos para a operação de aplicações, sendo a formação de comboios um exemplo. Em um comboio veicular, um grupo de veículos viaja com distância reduzida entre cada membro através da operação de um controlador que utiliza informações compartilhadas por CAMs. O posicionamento compartilhado através de CAMs por cada veículo é crucial para a operação dos controladores de nós vizinhos, dado que este será utilizado para a condução do veículo. Embora os controles criptográficos padronizados para troca de mensagens em VANETs ofereçam contramedidas contra ataques como roubo de identidade e adulteração de pacotes, um atacante interno que possua credenciais válidas do sistema ainda pode mentir sobre as informações que são transmitidas para outros veículos. Em modelos atuais de redes veiculares, cada veículo é responsável por obter sua localização, normalmente através de GPS (Global Positioning System). A dependência de aplicações VANET na posição correta dos nós introduz a necessidade de mecanismos de garantia de localização. Nesta dissertação são identificados os riscos associados com a falsificação de posição em comboios veiculares. Através de simulações utilizando o ambiente de simulação Veins, mostramos que colisões em alta velocidade podem ser causadas por nós que atuam em conluio na falsificação de mensagens para um comboio. Dado que posicionamento legítimo é essencial para o funcionamento adequado das aplicações VANET, investigamos mecanismos de prova de localização propostos na literatura. Então, projetamos um mecanismo de prova de localização adaptado para VANETs usando equipamentos de estrada (RSUs, roadside units), com a capacidade de usar diferentes freqüências de prova de acordo com os requisitos de precisão de detecção e sobrecarga. Através de simulações usando os ataques estudados neste trabalho, mostramos que o mecanismo pode detectar ataques de falsificação de mensagens e Sybil.<br>In vehicular communication, nodes periodically share Cooperative Awareness Messages (CAMs) in order to convey information such as identity, velocity, acceleration and position. The positioning of nodes in a vehicular network is a key factor that directly affects how applications operate, being the formation of platoons a major case. In vehicular platooning, a group of vehicles travels closely together and leverages information shared through CAMs to operate lateral and longitudinal control algorithms. While the standardised cryptographic mechanisms counteract threats such as identity hijacking and packet tampering, an internal member who holds valid credentials may still be able to lie about the data it transmits in CAMs. In current Vehicular ad hoc Network (VANET) models, each vehicle is responsible for determining and informing its own position, generally using a Global Navigation Satellite System (GNSS) such as the Global Positioning System (GPS). This allows malicious actors to lie about their position and therefore cause unwanted effects in vehicular applications. The dependence of VANET applications on correct node localization introduces the need for position assurance mechanisms. In this dissertation, we first identify the risks associated with falsifying the position in vehicular platooning. Through simulations using the Veins framework, we show that collisions at high speed on a platoon may be caused by nodes that collude in falsification attacks. Given that truthful positioning is essential to proper behavior of VANET applications, we investigate proof-of-location schemes proposed in the literature. Then, a proof-of-location mechanism tailored for VANETs is designed using roadside units, with the capability of using different proof frequencies according to detection accuracy and overhead requirements. Through simulations using the studied attacks in this work, we show that the mechanism can counteract Sybil and message falsification attacks.
14
Aswad, Musaab Z. "Context aware pre-crash system for vehicular ad hoc networks using dynamic Bayesian model." Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10240.
Full textAbstract:
Tragically, traffic accidents involving drivers, motorcyclists and pedestrians result in thousands of fatalities worldwide each year. For this reason, making improvements to road safety and saving people's lives is an international priority. In recent years, this aim has been supported by Intelligent Transport Systems, offering safety systems and providing an intelligent driving environment. The development of wireless communications and mobile ad hoc networks has led to improvements in intelligent transportation systems heightening these systems' safety. Vehicular ad hoc Networks comprise an important technology; included within intelligent transportation systems, they use dedicated short-range communications to assist vehicles to communicate with one another, or with those roadside units in range. This form of communication can reduce road accidents and provide a safer driving environment. A major challenge has been to design an ideal system to filter relevant contextual information from the surrounding environment, taking into consideration the contributory factors necessary to predict the likelihood of a crash with different levels of severity. Designing an accurate and effective pre-crash system to avoid front and back crashes or mitigate their severity is the most important goal of intelligent transportation systems, as it can save people's lives. Furthermore, in order to improve crash prediction, context-aware systems can be used to collect and analyse contextual information regarding contributory factors. The crash likelihood in this study is considered to operate within an uncertain context, and is defined according to the dynamic interaction between the driver, the vehicle and the environment, meaning it is affected by contributory factors and develops over time. As a crash likelihood is considered to be an uncertain context and develops over time, any usable technology must overcome this uncertainty in order to accurately predict crashes. This thesis presents a context-aware pre-crash collision prediction system, which captures information from the surrounding environment, the driver and other vehicles on the road. It utilises a Dynamic Bayesian Network as a reasoning model to predict crash likelihood and severity level, whether any crash will be fatal, serious, or slight. This is achieved by combining the above mentioned information and performing probabilistic reasoning over time. The thesis introduces novel context aware on-board unit architecture for crash prediction. The architecture is divided into three phases: the physical, the thinking and the application phase; these which represent the three main subsystems of a context-aware system: sensing, reasoning and acting. In the thinking phase, a novel Dynamic Bayesian Network framework is introduced to predict crash likelihood. The framework is able to perform probabilistic reasoning to predict uncertainty, in order to accurately predict a crash. It divides crash severity levels according to the UK department for transport, into fatal, serious and slight. GeNIe version 2.0 software was used to implement and verify the Dynamic Bayesian Network model. This model has been verified using both syntactical and real data provided by the UK department for transport in order to demonstrate the prediction accuracy of the proposed model and to demonstrate the importance of including a large amount of contextual information in the prediction process. The evaluation of the proposed system delivered high-fidelity results, when predicting crashes and their severity. This was judged by inputting different sensor readings and performing several experiments. The findings of this study has helped to predict the probability of a crash at different severity levels, accounting for factors that may be involved in causing a crash, thereby representing a valuable step towards creating a safer traffic network.
15
Benin, Joseph Thomas. "Unified distribution of pseudonyms in hybrid ephemeral vehicular networks." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45910.
Full textAbstract:
This research devises a unified method for the distribution of pseudonyms in hybrid ephemeral vehicular networks (VNs), which are often referred to as vehicular ad hoc networks (VANETs), for the purposes of refill, intra-regional, and inter-regional movement. This work addresses a significant impediment to the use of pseudonyms, which has been almost universally accepted (and is on the verge of being standardized by the Institute for Electrical and Electronic Engineers (IEEE) and the Society for Automotive Engineers (SAE) as the best means to balance attribution and privacy to maximize the value of infrastructure deployment and citizen acceptability (i.e. use). The results include a pseudonym distribution protocol that maximizes ease of use while not compromising the security or privacy pseudonyms afford. These results contribute to the solution, in a scalable, adaptive, and bandwidth efficient manner, one of the remaining impediments to the adoption of VANETs. The new method shows improved performance compared to a baseline pseudonym distribution method that does not take these factors into consideration.
16
Martínez, Domínguez Francisco José. "Improving Vehicular ad hoc Network Protocols to Support Safety Applications in Realistic Scenarios." Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/9195.
Full textAbstract:
La convergencia de las telecomunicaciones, la informática, la tecnología inalámbrica y los sistemas de transporte, va a facilitar que nuestras carreteras y autopistas nos sirvan tanto como plataforma de transporte, como de comunicaciones. Estos cambios van a revolucionar completamente cómo y cuándo vamos a acceder a determinados servicios, comunicarnos, viajar, entretenernos, y navegar, en un futuro muy cercano. Las redes vehiculares ad hoc (vehicular ad hoc networks VANETs) son redes de comunicación inalámbricas que no requieren de ningún tipo de infraestructura, y que permiten la comunicación y conducción cooperativa entre los vehículos en la carretera. Los vehículos actúan como nodos de comunicación y transmisores, formando redes dinámicas junto a otros vehículos cercanos en entornos urbanos y autopistas.
Las características especiales de las redes vehiculares favorecen el desarrollo de servicios y aplicaciones atractivas y desafiantes. En esta tesis nos centramos en las aplicaciones relacionadas con la seguridad. Específicamente, desarrollamos y evaluamos un novedoso protocol que mejora la seguridad en las carreteras. Nuestra propuesta combina el uso de información de la localización de los vehículos y las características del mapa del escenario, para mejorar la diseminación de los mensajes de alerta. En las aplicaciones de seguridad para redes vehiculares, nuestra propuesta permite reducir el problema de las tormentas de difusión, mientras que se mantiene una alta efectividad en la diseminación de los mensajes hacia los vehículos cercanos.
Debido a que desplegar y evaluar redes VANET supone un gran coste y una tarea dura, la metodología basada en la simulación se muestra como una metodología alternativa a la implementación real. A diferencia de otros trabajos previos, con el fin de evaluar nuestra propuesta en un entorno realista, en nuestras simulaciones tenemos muy en cuenta tanto la movilidad de los vehículos, como la transmisión de radio en entornos urbanos, especialmente cuando los edificios interfieren en la
propagación de la señal de radio. Con este propósito, desarrollamos herramientas
para la simulación de VANETs más precisas y realistas, mejorando tanto la modelización de la propagación de radio, como la movilidad de los vehículos, obteniendo
una solución que permite integrar mapas reales en el entorno de simulación. Finalmente,
evaluamos las prestaciones de nuestro protocolo propuesto haciendo uso
de nuestra plataforma de simulación mejorada, evidenciando la importancia del
uso de un entorno de simulación adecuado para conseguir resultados más realistas
y poder obtener conclusiones más significativas.<br>Martínez Domínguez, FJ. (2010). Improving Vehicular ad hoc Network Protocols to Support Safety Applications in Realistic Scenarios [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/9195<br>Palancia
17
Wang, Yan. "A Secure Gateway Localization and Communication System for Vehicular Ad Hoc Networks." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/24034.
Full textAbstract:
Intelligent Transport System (ITS) has become a hot research topic over the past decades. ITS is a system that applies the following technologies to the whole transportation management system efficiently, including information technique, wireless communication, sensor networks, control technique, and computer engineering. ITS provides an accurate, real time and synthetically efficient transportation management system. Obviously, Vehicular Ad Hoc NETworks (VANETs) attract growing attention from both the research community and industry all over the world. This is because a large amount of applications are enabled by VANETs, such as safety related applications, traffic management, commercial applications and general applications. When connecting to the internet or communicating with different networks in order to access a variety of services using VANETs, drivers and passengers in different cars need to be able to exchange messages with gateways from their vehicles. A secure gateway discovery process is therefore critical, because vehicles should not be subject to security attacks while they are communicating; however, currently there is no existing protocol focusing on secure gateway discovery.
In this thesis, we first analyze and compare current existing secure service discovery protocols and then we propose a Secure Gateway Localization and Communication System for Vehicular Ad Hoc Networks (SEGAL), which concentrates on the security issue in gateway discovery. We focus on the authentication aspect by proposing secure cluster based VANETs, that can ensure the gateway discovery messages exchanged through secure clusters. We present the principle and specific process of our SEGAL protocol and analyze its performance to guarantee its outstanding practical applicability.
18
Sjöberg, Bilstrup Katrin. "Predictable and Scalable Medium Access Control for Vehicular Ad Hoc Networks." Licentiate thesis, Halmstad University, Embedded Systems (CERES), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-5482.
Full textAbstract:
<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>
19
Garbiso, Julian Pedro. "Fair auto-adaptive clustering for hybrid vehicular networks." Thesis, Paris, ENST, 2017. http://www.theses.fr/2017ENST0061/document.
Full textAbstract:
Dans le cadre du développement des innovations dans les Systèmes de Transport Intelligents, les véhicules connectés devront être capables de télécharger des informations basées sur la position sur et depuis des serveurs distants. Ces véhicules seront équipés avec des différentes technologies d’accès radio, telles que les réseaux cellulaires ou les réseaux véhicule-à-véhicule (V2V) comme IEEE 802.11p. Les réseaux cellulaires, avec une couverture presque omniprésente, fournissent un accès à internet avec garanties de qualité de service. Cependant, l’accès à ces réseaux est payant. Dans cette thèse, un algorithme de clustering multi-saut est proposé avec pour objectif de réduire le coût d’accès au réseau cellulaire en agrégeant des données sur le réseau V2V. Pour faire ceci, le leader du cluster (CH, de l’anglais Cluster Head) est utilisé comme passerelle unique vers le réseau cellulaire. Pour le test d’une application d’exemple pour télécharger du Floating Car Data agrégé, les résultats des simulations montrent que cette approche réduit l’utilisation du réseau cellulaire de plus de 80%, en s’attaquant à la redondance typique des données basées sur la position dans les réseaux véhiculaires. Il y a une contribution en trois parties : Premièrement, une approche pour déléguer la sélection du CH à la station de base du réseau cellulaire afin de maximiser la taille des clusters, et par conséquent le taux de compression. Deuxièmement, un algorithme auto-adaptatif qui change dynamiquement le nombre maximum de sauts afin de maintenir un équilibre entre la réduction des coûts d’accès au réseau cellulaire et le taux de perte de paquets dans le réseau V2V. Finalement, l’incorporation d’une théorie de la justice distributive, afin d’améliorer l’équité sur la durée concernant la distribution des coûts auxquels les CH doivent faire face, améliorant ainsi l’acceptabilité sociale de la proposition. Les algorithmes proposés ont été testés via simulation, et les résultats montrent une réduction significative dans l’utilisation du réseau cellulaire, une adaptation réussie du nombre de sauts aux changements de la densité du trafic véhiculaire, et une amélioration dans les métriques d’équité, sans affecter la performance des réseaux<br>For the development of innovative Intelligent Transportation Systems applications, connected vehicles will frequently need to upload and download position-based information to and from servers. These vehicles will be equipped with different Radio Access Technologies (RAT), like cellular and vehicle-to-vehicle (V2V) technologies such as LTE and IEEE 802.11p respectively. Cellular networkscan provide internet access almost anywhere, with QoS guarantees. However, accessing these networks has an economic cost. In this thesis, a multi-hop clustering algorithm is proposed in the aim of reducing the cellular access costs by aggregating information and off-loading data in the V2V network, using the Cluster Head as a single gateway to the cellular network. For the example application of uploading aggregated Floating Car Data, simulation results show that this approach reduce cellular data consumption by more than 80% by reducing the typical redundancy of position-based data in a vehicular network. There is a threefold contribution: First, an approach that delegates the Cluster Head selection to the cellular base station in order to maximize the cluster size, thus maximizing aggregation. Secondly, a self-adaptation algorithm that dynamically changes the maximum number of hops, addressing the trade-off between cellular access reduction and V2V packet loss. Finally, the incorporation of a theory of distributive justice, for improving fairness over time regarding the distribution of the cost in which Cluster Heads have to incur, thus improving the proposal’s social acceptability. The proposed algorithms were tested via simulation, and the results show a significant reduction in cellular network usage, a successful adaptation of the number of hops to changes in the vehicular traffic density, and an improvement in fairness metrics, without affecting network performance
20
Mojela, Lerotholi Solomon. "On the use of WiMAX and Wi-Fi in a VANET to provide in-vehicle connectivity and media distribution." Thesis, Stellenbosch : Stellenbosch University, 2011. http://hdl.handle.net/10019.1/17881.
Full textAbstract:
Thesis (MScEng)--Stellenbosch University, 2011.<br>ENGLISH ABSTRACT: The recent emergence of ubiquitous wireless connectivity and the increasing
computational capacity of modern vehicles have triggered immense interest in the
possibilities of vehicular connectivity. A plethora of potential applications for vehicular
networks have been proposed in the areas of safety, traffic infrastructure management,
information, and entertainment. The broad range of applications requires creative utilisation
of the available wireless medium, using a combination of existing and novel wireless
technologies. In this research the evaluation of one such configuration is performed.
Dedicated short range communication for safety applications is assumed, and the use of Wi-
Fi and WiMAX for non-safety applications is evaluated. Little is known about the media
streaming performance of these wireless technologies in realistic vehicular ad-hoc network
(VANET) scenarios. Due to the extreme mobility and unpredictable environmental aspects in
a real road environment, an empirical evaluation is performed and presented. Evaluation of a
multi-vehicle to infrastructure (V2V2I) VANET, using Wi-Fi for the vehicle-to-vehicle
communication and WiMAX for the vehicle to infrastructure (V2I) communication is
experimented. It is observed that Wi-Fi is unaffected by the vehicle speed; whenever nodes
are within communication range, data gets transferred normally. A detailed characterisation
of the network architecture is presented and the results show that a multitude of applications
can be supported with this proposed network architecture.<br>AFRIKAANSE OPSOMMING: Die toenemende beskikbaarheid en digtheid van koordlose netwerke en die verhoogde
verwerkingsvermoëns van moderne voertuie het die afgelope paar jaar aansienlike
belangstelling gewek in die moontlikhede wat voertuig-kommunikasie bied. ʼn Magdom
moontlike toepassings is voorgestel in ʼn wye verskeidenheid van velde insluitende veiligheid,
verkeersinfrastruktuur, informasie en vermaak. Hierdie voorstelle vereis die kreatiewe
benutting van die beskikbare en nuwe koordlose tegnologieë. Hierdie tesis evalueer een
voorbeeld van so ‘n opstelling. ʼn Toegewyde kortafstand kommunikasie modus vir
veiligheidstoepassings word aangeneem, terwyl Wi-Fi en WiMAX vir ander toepassings
evalueer word. Daar is min navorsing oor die kapasiteit en seinsterkte van hierdie beskikbare
netwerke onder realistiese voertuig netwerk (VANET) scenario‘s. Weens die hoë mobiliteit
van voertuie en ook die onvoorspelbaarheid van hierdie omgewing word ʼn empiriese
evaluasie beskou as die mees gepaste metode. Die navorsing ondersoek ʼn multi-voertuig-totinfrastruktuur-
netwerk wat Wi-Fi gebruik vir voertuig-tot-voertuig (V2V) kommunikasie en
WiMAX vir voertuig-tot-infrastruktuur (V2I) kommunikasie. Die navorsing bevind dat Wi-Fi
nie beïnvloed word deur die spoed van die voertuig nie: wanneer die nodes binne die bereik is
van die netwerk word data normaal oorgedra. ‗n Gedetailleerde karakterisering van dié
netwerk word gedoen en die resultate dui aan dat ‗n groot hoeveelheid toepassings
ondersteun kan word deur dié opstelling.
21
Chetlur, Ravi Vishnu Vardhan. "Stochastic Geometry for Vehicular Networks." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/99954.
Full textAbstract:
Vehicular communication networks are essential to the development of intelligent navigation systems and improvement of road safety. Unlike most terrestrial networks of today, vehicular networks are characterized by stringent reliability and latency requirements. In order to design efficient networks to meet these requirements, it is important to understand the system-level performance of vehicular networks. Stochastic geometry has recently emerged as a powerful tool for the modeling and analysis of wireless communication networks. However, the canonical spatial models such as the 2D Poisson point process (PPP) does not capture the peculiar spatial layout of vehicular networks, where the locations of vehicular nodes are restricted to roadways. Motivated by this, we consider a doubly stochastic spatial model that captures the spatial coupling between the vehicular nodes and the roads and analyze the performance of vehicular communication networks. We model the spatial layout of roads by a Poisson line process (PLP) and the locations of nodes on each line (road) by a 1D PPP, thereby forming a Cox process driven by a PLP or Poisson line Cox process (PLCP). In this dissertation, we develop the theory of the PLCP and apply it to study key performance metrics such as coverage probability and rate coverage for vehicular networks under different scenarios.
First, we compute the signal-to-interference plus noise ratio (SINR)-based success probability of the typical communication link in a vehicular ad hoc network (VANET). Using this result, we also compute the area spectral efficiency (ASE) of the network. Our results show that the optimum transmission probability that maximizes the ASE of the network obtained for the Cox process differs significantly from that of the conventional 1D and 2D PPP models.
Second, we calculate the signal-to-interference ratio (SIR)-based downlink coverage probability of the typical receiver in a vehicular network for the cellular network model in which each receiver node connects to its closest transmitting node in the network. The conditioning on the serving node imposes constraints on the spatial configuration of interfering nodes and also the underlying distribution of lines. We carefully handle these constraints using various fundamental distance properties of the PLCP and derive the exact expression for the coverage probability.
Third, building further on the above mentioned works, we consider a more complex cellular vehicle-to-everything (C-V2X) communication network in which the vehicular nodes are served by roadside units (RSUs) as well as cellular macro base stations (MBSs). For this setup, we present the downlink coverage analysis of the typical receiver in the presence of shadowing effects. We address the technical challenges induced by the inclusion of shadowing effects by leveraging the asymptotic behavior of the Cox process. These results help us gain useful insights into the behavior of the networks as a function of key network parameters, such as the densities of the nodes and selection bias.
Fourth, we characterize the load on the MBSs due to vehicular users, which is defined as the number of vehicular nodes that are served by the MBS. Since the limited network resources are shared by multiple users in the network, the load distribution is a key indicator of the demand of network resources. We first compute the distribution of the load on MBSs due to vehicular users in a single-tier vehicular network. Building on this, we characterize the load on both MBSs and RSUs in a heterogeneous C-V2X network. Using these results, we also compute the rate coverage of the typical receiver in the network.
Fifth and last, we explore the applications of the PLCP that extend beyond vehicular communications. We derive the exact distribution of the shortest path distance between the typical point and its nearest neighbor in the sense of path distance in a Manhattan Poisson line Cox process (MPLCP), which is a special variant of the PLCP. The analytical framework developed in this work allows us to answer several important questions pertaining to transportation networks, urban planning, and personnel deployment.<br>Doctor of Philosophy<br>Vehicular communication networks are essential to the development of intelligent transportation systems (ITS) and improving road safety. As the in-vehicle sensors can assess only their immediate environment, vehicular nodes exchange information about critical events, such as accidents and sudden braking, with other vehicles, pedestrians, roadside infrastructure, and cellular base stations in order to make critical decisions in a timely manner. Considering the time-sensitive nature of this information, it is of paramount importance to design efficient communication networks that can support the exchange of this information with reliable and high-speed wireless links. Typically, prior to actual deployment, any design of a wireless network is subject to extensive analysis under various operational scenarios using computer simulations. However, it is not viable to rely entirely on simulations for the system design of highly complex systems, such as the vehicular networks. Hence, it is necessary to develop analytical methods that can complement simulators and also serve as a benchmark. One of the approaches that has gained popularity in the recent years for the modeling and analysis of large-scale wireless networks is the use of tools from stochastic geometry. In this approach, we endow the locations of wireless nodes with some distribution and analyze various aspects of the network by leveraging the properties of the distribution.
Traditionally, wireless networks have been studied using simple spatial models in which the wireless nodes can lie anywhere on the domain of interest (often a 1D or a 2D plane). However, vehicular networks have a unique spatial geometry because the locations of vehicular nodes are restricted to roadways. Therefore, in order to model the locations of vehicular nodes in the network, we have to first model the underlying road systems. Further, we should also consider the randomness in the locations of vehicles on each road. So, we consider a doubly stochastic model called Poisson line Cox process (PLCP), in which the spatial layout of roads are modeled by random lines and the locations of vehicles on the roads are modeled by random set of points on these lines.
As is usually the case in wireless networks, multiple vehicular nodes and roadside units (RSUs) operate at the same frequency due to the limited availability of radio frequency spectrum, which causes interference. Therefore, any receiver in the network obtains a signal that is a mixture of the desired signal from the intended transmitter and the interfering signals from the other transmitters. The ratio of the power of desired signal to the aggregate power of the interfering signals, which is called as the signal-to-interference ratio (SIR), depends on the locations of the transmitters with respect to the receiver. A receiver in the network is said to be in coverage if the SIR measured at the location of the receiver exceeds the required threshold to successfully decode the message. The probability of occurrence of this event is referred to as the coverage probability and it is one of the fundamental metrics that is used to characterize the performance of a wireless network. In our work, we have analytically characterized the coverage probability of the typical vehicular node in the network. This was the first work to present the coverage analysis of a vehicular network using the aforementioned doubly stochastic model. In addition to coverage probability, we have also explored other performance metrics such as data rate, which is the number of bits that can be successfully communicated per unit time, and spectral efficiency. Our analysis has revealed interesting trends in the coverage probability as a function of key system parameters such as the density of roads in a region (total length of roads per unit area), and the density of vehicles on the roads. We have shown that the vehicular nodes in areas with high density of roads have lower coverage than those in areas with sparsely distributed roads. On the other hand, the coverage probability of a vehicular node improves as the density of vehicles on the roads increases. Such insights are quite useful in the design and deployment of network infrastructure.
While our research was primarily focused on communication networks, the utility of the spatial models considered in these works extends to other areas of engineering. For a special variant of the PLCP, we have derived the distribution of the shortest path distance between an arbitrary point and its nearest neighbor in the sense of path distance. The analytical framework developed in this work allows us to answer several important questions pertaining to infrastructure planning and personnel deployment.
22
Alam, Md Zahangir. "Reliable Cooperative Communications for Highly Mobile Internet-of-Vehicles (IoV) Environments." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/29507.
Full textAbstract:
The ultimate challenge of the network designer is the resource allocation for both vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications due to the dynamic environment. The optimal best path can improve network quality of service (QoS) over the time-varying channel using less transmission power. The joint power allocation of V2V and V2I is the most challenging aspect due to the association of its multi-variables objective function. Alternative optimization can be used to make the global problem into a series of sub-problems. Then a semi-definite programming (SDP)-based iterative gradient descent (SDP-IGD) power allocation can be used to assign power in each relay. In vehicular network systems, end-to-end packet delay increases with the growing number of vehicles associated with that path. In the case of excessive packet delay, information is needed to be enqueued before sending through the fading channel. A new delay-sensitive buffer-aided relay selection has been proposed in literature based on the channel greedy scheduling algorithm (CGSA) to reduce the average delay by selecting a set of alternative paths based on individual node buffer status. The optimal path selection needs to guarantee both the latency and reliability requirements in vehicular communications. In a high mobility environment, deep reinforcement learning (DRL)-based decentralized algorithm may be implemented to obtain an optimal path. The optimal path-finding technique requires very large mathematical calculations. The low-power onboard devices may not be able to perform the large-size computation timely. Task offloading methods can be applied in high mobility networks aiming to guarantee latency, energy consumption, and payment cost requirement. In task offloading for vehicular communications, both park and moving vehicles can be used as computation resources. The traditional offloading may be used to find the best vehicles that may compute the offloaded task timely.
23
Bouraoui, Basma. "Architectures cross-layer PHY/MAC pour réduire l'effet de blocage de réception dans les réseaux véhiculaires ad-hoc." Thesis, Valenciennes, 2017. http://www.theses.fr/2017VALE0006/document.
Full textAbstract:
Le protocole MAC du standard IEEE 802.11p dédié aux réseaux véhiculaires interdit les transmissions simultanées dans une même zone de détection afin d’éviter d’éventuelles interférences entre les véhicules voisins. Cette interdiction entraîne un blocage temporaire de réception de données, ce qui diminue le débit global du réseau. Pour résoudre ce problème, nous proposons dans cette thèse une architecture cross-layer PHY/MAC basée sur un algorithme de sélection d’antennes émettrices et un protocole MAC dédié afin de réduire le blocage. Ce cross-layer permet au récepteur de choisir la meilleure combinaison d’antennes émettrices pour améliorer le débit utile normalisé de chaque lien V2V. L’algorithme est présenté avec une méthode de détection multi-utilisateurs. Cette méthode annule les interférences entre voisins et permet à plusieurs véhicules d’émettre des données simultanément. Le protocole MAC associé assure la coordination entre les véhicules durant les communications. Les résultats de simulation montrent une amélioration du débit utile normalisé du réseau en comparaison au standard actuel. Néanmoins, ces bonnes performances diminuent avec l’augmentation de la densité véhiculaire. Pour pallier à cette baisse, nous proposons de joindre à la première solution une nouvelle architecture crosslayer PHY/MAC. Cette architecture est basée sur un algorithme d’adaptation de la puissance émise en fonction de la densité de voisinage du récepteur. Elle est également accompagnée par un protocole MAC dédié. Les résultats de simulation montrent que cette solution permet à plus de véhicules de communiquer simultanément et ainsi améliore significativement le débit utile normalisé notamment dans les réseaux véhiculaires denses<br>The MAC protocol IEEE 802.11p, dedicated to vehicular ad-hoc networks VANETs, prohibits simultaneous transmissions in the same detection area, in order to avoid interference between neighboring vehicles. This prohibition causes a temporary data reception blocking, which reduces the network throughput. To reduce this adverse impact, we propose in this thesis a cross-layer design PHY/MAC based on a transmit antennas selection algorithm jointly with a dedicated MAC protocol. This design allows receivers to select the best combination of transmit antennas to improve the throughput of each V2V link. The algorithm is presented with a multi-user detection method, which cancels neighbor’s interference and allows vehicles to transmit data simultaneously. The associated MAC protocol ensures the coordination between vehicles during the simultaneous transmission period. The simulation results show a significant network throughput improvement compared to the conventional case. However, this improvement is less important in dense VANETs. For this purpose, we propose to join a cross-layer design PHY/MAC based on a transmit power adaptation algorithm. This design allows transmitters to choice the adequate power level based on corresponding receivers density. The simulation results show that this solution allows more vehicles to communicate simultaneously and thus improves the network throughput, in particular in dense VANETs
24
Sareh, Said Adel Mounir. "Ubiquitous sensor network in the NGN environment." Thesis, Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0016/document.
Full textAbstract:
Ubiquitous Sensor Network (USN) est un réseau conceptuel construit sur des réseaux physiques existantes. Il se sert des données détectées et fournit des services de connaissances à quiconque, n'importe où et à tout moment, et où l'information est générée en utilisant la sensibilité au contexte. Dispositifs et USN portables intelligents émergent rapidement en offrant de nombreux services fiables facilitant la vie des gens. Ces petits terminaux et terminaux très utiles besoin d'un substrat de communication globale pour fournir un service complet de l'utilisateur final global. En 2010, ITU -T a fourni les exigences pour supporter des applications et services USN dans le Next Generation Network (NGN) de l'environnement d'exploiter les avantages du réseau de base. L'un des principaux marchés prometteurs pour l'application et les services USN est la e- santé. Il fournit le suivi des patients en continu et permet une grande amélioration dans les services médicaux. D'autre part, des Véhicules Ad-hoc NETwork (VANET) est une technologie émergente qui permet une communication intelligente entre les véhicules mobiles. Intégrer VANET avec USN a un grand potentiel pour améliorer la sécurité routière et la fluidité du trafic. La plupart des applications VANET sont appliqués en temps réel et ils sont sensibles à retarder, en particulier ceux liés à la sécurité et à la santé. Dans ce travail, nous proposons d'utiliser l'IP Multimédia Subsystem (IMS) comme une sous- couche de contrôle de service dans l'environnement USN fournir un substrat mondiale pour un service complet de bout en bout. De plus, nous vous proposons d'intégrer VANETs avec USN pour des applications et des installations riches plus, ce qui facilitera la vie des humains. Nous avons commencé à étudier les défis sur la route pour atteindre cet objectif<br>Ubiquités Sensor Network (USN) is a conceptual network built over existing physical networks. It makes use of sensed data and provides knowledge services to anyone, anywhere and at anytime, and where the information is generated by using context awareness. Smart wearable devices and USNs are emerging rapidly providing many reliable services facilitating people life. Those very useful small end terminals and devices require a global communication substrate to provide a comprehensive global end user service. In 2010, the ITU-T provided the requirements to support USN applications and services in the Next Génération Network (NGN) environment to exploit the advantages of the core network. One of the main promising markets for the USN application and services is the e-Health. It provides continuous patients’ monitoring and enables a great improvement in medical services. On the other hand, Vehicular Ad-Hoc NETwork (VANET) is an emerging technology, which provides intelligent communication between mobile vehicles. Integrating VANET with USN has a great potential to improve road safety and traffic efficiency. Most VANET applications are applied in real time and they are sensitive to delay, especially those related to safety and health. In this work, we propose to use IP Multimedia Subsystem (IMS) as a service controller sub-layer in the USN environment providing a global substrate for a comprehensive end-to-end service. Moreover, we propose to integrate VANETs with USN for more rich applications and facilities, which will ease the life of humans. We started studying the challenges on the road to achieve this goal
25
Sebastian, Alvin. "Efficient safety message dissemination for cooperative collision warning via context modelling." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/50793/1/Alvin_Sebastian_Thesis.pdf.
Full textAbstract:
A Cooperative Collision Warning System (CCWS) is an active safety techno- logy for road vehicles that can potentially reduce traffic accidents. It provides a driver with situational awareness and early warnings of any possible colli- sions through an on-board unit. CCWS is still under active research, and one of the important technical problems is safety message dissemination. Safety messages are disseminated in a high-speed mobile environment using wireless communication technology such as Dedicated Short Range Communication (DSRC). The wireless communication in CCWS has a limited bandwidth and can become unreliable when used inefficiently, particularly given the dynamic nature of road traffic conditions. Unreliable communication may significantly reduce the performance of CCWS in preventing collisions. There are two types of safety messages: Routine Safety Messages (RSMs) and Event Safety Messages (ESMs). An RSM contains the up-to-date state of a vehicle, and it must be disseminated repeatedly to its neighbouring vehicles. An ESM is a warning message that must be sent to all the endangered vehi- cles. Existing RSM and ESM dissemination schemes are inefficient, unscalable, and unable to give priority to vehicles in the most danger. Thus, this study investigates more efficient and scalable RSM and ESM dissemination schemes that can make use of the context information generated from a particular traffic scenario. Therefore, this study tackles three technical research prob- lems, vehicular traffic scenario modelling and context information generation, context-aware RSM dissemination, and context-aware ESM dissemination. The most relevant context information in CCWS is the information about possible collisions among vehicles given a current vehicular traffic situation. To generate the context information, this study investigates techniques to model interactions among multiple vehicles based on their up-to-date motion state obtained via RSM. To date, there is no existing model that can represent interactions among multiple vehicles in a speciffic region and at a particular time. The major outcome from the first problem is a new interaction graph model that can be used to easily identify the endangered vehicles and their danger severity. By identifying the endangered vehicles, RSM and ESM dis- semination can be optimised while improving safety at the same time. The new model enables the development of context-aware RSM and ESM dissemination schemes. To disseminate RSM efficiently, this study investigates a context-aware dis- semination scheme that can optimise the RSM dissemination rate to improve safety in various vehicle densities. The major outcome from the second problem is a context-aware RSM dissemination protocol. The context-aware protocol can adaptively adjust the dissemination rate based on an estimated channel load and danger severity of vehicle interactions given by the interaction graph model. Unlike existing RSM dissemination schemes, the proposed adaptive scheme can reduce channel congestion and improve safety by prioritising ve- hicles that are most likely to crash with other vehicles. The proposed RSM protocol has been implemented and evaluated by simulation. The simulation results have shown that the proposed RSM protocol outperforms existing pro- tocols in terms of efficiency, scalability and safety. To disseminate ESM efficiently, this study investigates a context-aware ESM dissemination scheme that can reduce unnecessary transmissions and deliver ESMs to endangered vehicles as fast as possible. The major outcome from the third problem is a context-aware ESM dissemination protocol that uses a multicast routing strategy. Existing ESM protocols use broadcast rout- ing, which is not efficient because ESMs may be sent to a large number of ve- hicles in the area. Using multicast routing improves efficiency because ESMs are sent only to the endangered vehicles. The endangered vehicles can be identified using the interaction graph model. The proposed ESM protocol has been implemented and evaluated by simulation. The simulation results have shown that the proposed ESM protocol can prevent potential accidents from occurring better than existing ESM protocols. The context model and the RSM and ESM dissemination protocols can be implemented in any CCWS development to improve the communication and safety performance of CCWS. In effect, the outcomes contribute to the realisation of CCWS that will ultimately improve road safety and save lives.
26
Ben, Jemaa Inès. "Communication multicast pour les systèmes véhiculaires coopératifs." Thesis, Paris, ENMP, 2014. http://www.theses.fr/2014ENMP0065/document.
Full textAbstract:
La communication véhiculaire permet le développement de nouvelles applications multicast émergentes telles que la gestion de la flotte et la distribution des Points d'Intérêt (POI). Ces deux catégories d'applications nécessitent une communication multicast de l'Internet vers les réseaux véhiculaires (VANET). Afin de mettre en place une communication multicast adaptée au contexte de la communication Internet-vers-réseaux véhiculaires, notre travail traite de deux aspects différents. Tout d'abord, l'accessibilité des véhicules en mouvement au service Internet et en deuxième lieu, la dissémination du message dans les VANET. Nous introduisons un schéma d'adressage multicast basé sur les coordonnées géographiques des véhicules qui leur permet de s'auto-configurer d'une façon dynamique sans aucun besoin d'échanger des messages de signalisation avec Internet. Nous proposons aussi une approche simplifiée de gestion de la mobilité des véhicules dans le cadre des architectures Mobile IP et Proxy Mobile IP. Le but de cette approche est d'optimiser l'échange des messages avec les entités responsables de la gestion de la mobilité dans Internet. Afin d'étudier les mécanismes de dissémination appropriés aux applications de gestion de flottes, nous nous proposons de revisiter les techniques de routage multicast traditionnelles basées sur une structure de diffusion en arbre. Pour cela, nous étudions leur application aux réseaux véhiculaires. Nous présentons une étude théorique portant sur la durée de vie des liens entre les véhicules en milieux urbains. Ensuite, en utilisant la simulation, nous étudions l'application de Multicast Adhoc On Demand Vector, MAODV et proposons Motion-MAODV, une version adaptée de MAODV qui a pour objectif d'établir des routes plus robustes Enfin, concernat la dissémination multicast géolocalisée dans les applications POI, nous proposons le protocole de routage Melody qui permet une diffusion geocast en milieu urbain. A partir de simulations, nous constatons que, comparé aux protocoles de géo-brodcasting dans les milieux urbain très denses, Melody assure plus de fiabilité et d'efficacité lors de l'acheminement des données vers les zones géographiques de destination<br>Vehicular communications allow emerging new multicast applications such as fleet management and point of interest (POI). Both applications require Internet-to-vehicle multicasting. These approaches could not be applied to vehicular networks (VANET) due to their dynamic and distributed nature. In order to enable such multicasting, our work deals with two aspects. First, reachability of the moving vehicles to the multicast service and second, multicast message dissemination in VANET. We introduce first a self-configuring multicast addressing scheme that allows the vehicles to auto-configure a dynamic multicast address without a need to exchange signalling messages with the Internet. Second, we propose a simplified approach that extends Mobile IP and Proxy Mobile IP. This approach aims at optimizing message exchange between vehicles and entities responsible for managing their mobility in Internet. To study the dissemination mechanisms that are suitable for fleet management applications, we propose to revisit traditional multicast routing techniques that rely on a tree structure. For this purpose, we study their application to vehicular networks. In particular, as vehicular networks are known to have changing topology, we present a theoretical study of the link lifetime between vehicles in urban environments. Then, using simulations, we study the application of Multicast Adhoc On Demand Vector, MAODV. We propose then Motion-MAODV, an improved version of MAODV that aims at enhancing routes built by MAODV in vehicular networks and guarantee longer route lifetime. Finally, to enable geographic dissemination as required by POI applications, we propose a routing protocol Melody that provides a geocast dissemination in urban environments. Through simulations, Melody ensures more reliable and efficient packet delivery to a given geographic area compared to traditional geo-brodcasting schemes in highly dense scenarios
27
Toufga, Soufian. "Vers des réseaux véhiculaires (VANET) programmables grâce à la technologie SDN (software defined network)." Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30128.
Full textAbstract:
Le concept de réseau véhiculaire qui initialement prônait essentiellement des communications de véhicules à véhicules s'ouvre à d'autres types de communications impliquant véhicules et infrastructure (réseau), cloud ou piétons, etc. afin de pouvoir répondre aux besoins de la grande variété des nouvelles applications envisagées dans le cadre du Système de Transport Intelligent (ITS: Intelligent Transportation System). La multitude des technologies réseau d'accès, la très forte mobilité des véhicules et leur forte densité en milieu urbain ainsi que la prédominance des communications sans-fil en font un réseau hétérogène, avec des caractéristiques très dynamiques, dont certaines peu prévisibles, et sujet à des problèmes d'échelle. Face à ces difficultés, une piste envisagée par la communauté scientifique est d'appliquer le paradigme SDN (Software Defined Network) aux réseaux véhiculaires comme moyen pour, d'une part permettre l'hybridation et l'unification du contrôle des différentes technologies réseaux d'accès et, d'autre part, tirer partie de la vue centralisée du réseau et des données contextuelles venues du cloud pour développer des nouveaux algorithmes de contrôle pouvant potentiellement reposer sur la prédiction/estimation de l'état du réseau et donc anticiper certaines décisions de contrôle. C'est donc dans ce cadre que s'inscrit ce travail de thèse dont les contributions visent à développer le concept de réseaux véhiculaires définis par logiciel SDVN (Software Defined Vehicular Network). Quatre contributions y sont développées. La première précise l'architecture d'un réseau véhiculaire SDN hybride capable de répondre aux défis décrits ci-avant. Cette architecture est complémentée par une solution de placement des contrôleurs SDN. Nous proposons une approche dynamique capable d'ajuster le placement optimal des contrôleurs en fonction des changements de la topologie réseau dues aux fluctuations du trafic routier. Ce travail aborde également le problème de la vision globale du réseau qu'un contrôleur SDN peut se constituer, vision préalable et pierre angulaire à toute fonction de contrôle réseau. A ce problème, nous proposons des amendements et extensions au service de découverte de topologie "de fait" conçu pour les réseaux filaires pour l'adapter au contexte véhiculaire. En complément au service de découverte, nous proposons également un service d'estimation de topologie basé sur des techniques d'apprentissage automatique (Machine Learning) pour offrir aux fonctions de contrôle réseau une vision potentielle de l'état futur du réseau et donc les ouvrir à un contrôle proactif et intelligent du réseau<br>The vehicular network concept, which initially focused on vehicle-to-vehicle communication, is opening up to other types of communications involving vehicles and infrastructure (network), cloud or pedestrians, etc. to meet the needs of the wide variety of new applications envisaged in the framework of the Intelligent Transportation System (ITS). The multitude of network access technologies, the very high mobility of vehicles and their high density in urban areas, and the predominance of wireless communications make it a heterogeneous network, with very dynamic characteristics, some of which are difficult to predict, and subject to scalability problems. Given these issues, one direction, considered by the scientific community, is to apply the SDN (Software Defined Network) paradigm to vehicular networks as a means of, on the one hand, enabling the hybridization and unification of control of different network access technologies and, on the other hand, taking advantage of the centralized view of the network and contextual data from the cloud to develop new control algorithms that can potentially rely on the prediction/estimation of the network state and thus anticipate certain control decisions. Therefore, this thesis is part of this framework. Its contributions aim at developing the concept of SDVN (Software Defined Vehicular Network). Four contributions are developed. The first one specifies the architecture of a hybrid SDN vehicular network capable of meeting the challenges described above. This architecture is complemented by an SDN controller placement solution. We propose a dynamic approach capable of adjusting the optimal placement of controllers according to network topology changes due to road traffic fluctuations. This work also covers the problem of global network vision that an SDN controller can build up, which is a prerequisite and the cornerstone of any network control function. To this problem, we propose amendments and extensions to the "de facto" topology discovery service designed for wired networks to adapt it to the vehicular context. As a complement to the discovery service, we also propose a topology estimation service based on Machine Learning techniques to provide network control functions with a potential vision of the future state of the network and thus open them to proactive and intelligent network control
28
Farahmand, Ashil Sayyed. "Cooperative Decentralized Intersection Collision Avoidance Using Extended Kalman Filtering." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/36276.
Full textAbstract:
Automobile accidents are one of the leading causes of death and claim more than 40,000 lives annually in the US alone. A substantial portion of these accidents occur at road intersections. Stop signs and traffic signals are some of the intersection control devices used to increase safety and prevent collisions. However, these devices themselves can contribute to collisions, are costly, inefficient, and are prone to failure. This thesis proposes an adaptive, decentralized, cooperative collision avoidance (CCA) system that optimizes each vehicle's controls subject to the constraint that no collisions occur. Three major contributions to the field of collision avoidance have resulted from this research. First, a nonlinear 5-state variable vehicle model is expanded from an earlier model developed in [1]. The model accounts for internal engine characteristics and more realistically approximates vehicle behavior in comparison to idealized, linear models. Second, a set of constrained, coupled Extended Kalman Filters (EKF) are used to predict the trajectory of the vehicles approaching an intersection in real-time. The coupled filters support decentralized operation and ensure that the optimization algorithm bases its decisions on good, reliable estimates. Third, a vehicular network based on the new WAVE standard is presented that provides cooperative capabilities by enabling intervehicle communication. The system is simulated against today's common intersection control devices and is shown to be superior in minimizing average vehicle delay.<br>Master of Science
29
Matos, Leila Buarque Couto de. "Análise de desempenho de algoritmos criptográficos assimétricos em uma rede veicular (Vanet)." Pós-Graduação em Ciência da Computação, 2013. https://ri.ufs.br/handle/riufs/3354.
Full textAbstract:
This dissertation describes the impact of using asymmetric encryption algorithms, with emphasis on algorithms RSA, ECC and MQQ in scenarios VANET (Vehicular Ad hoc Network). In the research were investigated some simulators as GrooveNet, VANET / DSRC, VANET / CRL Epidemic, NS-2, trans, NCTUns / EstiNET, SUMO, VanetMobiSim and ns-3, suitable for VANET. The algorithms have been implemented in C and inserted into the ns-3, where the simple scenarios created a network VANET. The results showed that it is possible to add protocol-layer security services of vehicular networks (1609.2), these asymmetric algorithms and obtain secure communication between nodes in the VANET.<br>Esta dissertação de mestrado descreve o impacto de usar algoritmos assimétricos de criptografia, dando ênfase aos algoritmos RSA, ECC e MQQ em cenários de VANET (Vehicular Ad hoc Network). Na pesquisa foram investigados alguns simuladores como GrooveNet, VANET/DSRC, VANET/Epidemic CRL, NS-2, TraNS, NCTUns/EstiNET, SUMO, VanetMobiSim e ns-3, próprio para VANET. Os algoritmos foram implementados em C e inseridos no ns-3, onde se criam cenários simples de uma rede VANET. Os resultados obtidos permitem concluir que é possível agregar ao protocolo, na camada de serviços de segurança das redes veiculares (1609.2), esses algoritmos assimétricos e obter comunicação segura entre os nós da VANET.
30
Bergh, Fredrik, and Johan Andersson. "Channel measurement and communication module for the Grand Cooperative Driving Challenge." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15329.
Full textAbstract:
Vehicular ad hoc networks (VANETs) are a hot topic in the intelligent transport system (ITS) area. The introduction of wireless communications between vehicles will enable many useful applications to enhance road traffic safety as well to increase efficiency. The standardization of IEEE 802.11p, being an amendment to IEEE 802.11 intended for VANETS, faces many challenges. In Europe a 30 MHz spectrum at 5.9 GHz have been dedicated for ITS and this spectrum has to be used to its full potential. For this reason this thesis compares a 20 MHz wide frequency channel with a 10 MHz wide through measurements using 802.11p hardware. The measurements were conducted on a highway with relative speeds of up to 240 km/h. The results from these initial measurements show that a 20 MHz channel does not perform worse than a 10 MHz channel despite the high relative speeds and large metal signs scattering the signals. What enabled this thesis to do the measurements was Halmstad University‟s participation in the Grand Cooperative Driving Challenge (GCDC) 2011. In GCDC nine teams mostly from Europe competed in having the vehicle that had the best behaviour in a platoon of vehicles using cooperative adaptive cruise control (CACC), the CACC algorithm controlled the vehicles‟ acceleration and breaking autonomously based on in-vehicle sensors and communicated messages between the vehicles in the platoon using 802.11p. This thesis implemented the communication part of Halmstad University‟s vehicle. The challenge was held in Helmond, Holland, May 14-15, 2011. Halmstad University‟s team finished in second place.<br>CoAct
31
Bouali, Tarek. "Platform for efficient and secure data collection and exploitation in intelligent vehicular networks." Thesis, Dijon, 2016. http://www.theses.fr/2016DIJOS003/document.
Full textAbstract:
De nos jours, la filiale automobile connait une évolution énorme en raison de la croissance évolutive des technologies de communication, des aptitudes de détection et de perception de l’environnement, et des capacités de stockage et de traitement présentes dans les véhicules. En effet, une voiture est devenue une sorte d'agent mobile capable de percevoir son environnement et d’en collecter des informations, de communiquer avec les autres véhicules ou infrastructures présentes sur la route, et de traiter les données collectées. Ces progrès stimulent le développement de plusieurs types d'applications qui vont permettre d'améliorer la sécurité et l'efficacité de conduite et de rendre le voyage des automobilistes plus confortable. Cependant, ce développement repose beaucoup sur les données collectées et donc ne pourra se faire que via une collecte sécurisée et un traitement efficace de ces données détectées. La collecte de données dans un réseau véhiculaire a toujours été un véritable défi en raison des caractéristiques spécifiques de ces réseaux fortement dynamiques (changement fréquent de topologie, vitesse élevée des véhicules et fragmentation fréquente du réseau), qui conduisent à des communications opportunistes et non durables. L'aspect sécurité, reste un autre maillon faible de ces réseaux sans fils vu qu'ils sont par nature vulnérables à diverses types d'attaques visant à falsifier les données recueillies et affecter leur intégrité. En outre, les données recueillies ne sont pas compréhensibles par eux-mêmes et ne peuvent pas être interprétées et comprises si montrées directement à un conducteur ou envoyées à d'autres nœuds dans le réseau. Elles doivent être traitées et analysées pour extraire les caractéristiques significatives et informations pour développer des applications utiles et fiables. En plus, les applications développées ont toujours des exigences différentes en matière de qualité de service (QdS). Plusieurs travaux de recherche et projets ont été menées pour surmonter les défis susmentionnés. Néanmoins, ils n'ont pas abouti à la perfection et souffrent encore de certaines faiblesses. Pour cette raison, nous focalisons nos efforts durant cette thèse au développement d’une plateforme de collecte efficace et sécurisée de données dans un réseau de véhicules ainsi que l’exploitation de ces données par des applications améliorant le voyage des automobilistes et la connectivité des véhicules. Pour ce faire, nous proposons une première solution visant à déployer de manière optimale des véhicules, qui auront la tâche de recueillir des données, dans une zone urbaine. Ensuite, nous proposons un nouveau protocole de routage sécurisé permettant de relayer les données collectées vers une destination en se basant sur un système de détection et d'expulsion des véhicules malveillants. Ce protocole est par la suite amélioré avec un nouveau mécanisme de prévention d'intrusion permettant de détecter des attaquants au préalable en utilisant les filtres de Kalman. En deuxième partie de thèse, nous nous sommes concentré sur l’exploitation de ces données en développant une première application capable de calculer de manière fine l’itinéraire le plus économique pour les automobilistes ou tout gestionnaire de flottes de véhicules. Cette solution est basée sur les données influents sur la consommation de carburant et collectées à partir des véhicules eux mêmes et aussi d’autres sources d’informations dans l’Internet et accessibles via des API spécifiques. Enfin, un mécanisme spatio-temporel permettant de choisir le meilleur médium de communication disponible a été développé. Ce dernier est basé sur la logique floue et considère les informations recueillies sur les réseaux, les utilisateurs et les applications pour préserver de meilleure qualité de service<br>Nowadays, automotive area is witnessing a tremendous evolution due to the increasing growth in communication technologies, environmental sensing & perception aptitudes, and storage & processing capacities that we can find in recent vehicles. Indeed, a car is being a kind of intelligent mobile agent able to perceive its environment, sense and process data using on-board systems and interact with other vehicles or existing infrastructure. These advancements stimulate the development of several kinds of applications to enhance driving safety and efficiency and make traveling more comfortable. However, developing such advanced applications relies heavily on the quality of the data and therefore can be realized only with the help of a secure data collection and efficient data treatment and analysis. Data collection in a vehicular network has been always a real challenge due to the specific characteristics of these highly dynamic networks (frequent changing topology, vehicles speed and frequent fragmentation), which lead to opportunistic and non long lasting communications. Security, remains another weak aspect in these wireless networks since they are by nature vulnerable to various kinds of attacks aiming to falsify collected data and affect their integrity. Furthermore, collected data are not understandable by themselves and could not be interpreted and understood if directly shown to a driver or sent to other nodes in the network. They should be treated and analyzed to extract meaningful features and information to develop reliable applications. In addition, developed applications always have different requirements regarding quality of service (QoS). Several research investigations and projects have been conducted to overcome the aforementioned challenges. However, they still did not meet perfection and suffer from some weaknesses. For this reason, we focus our efforts during this thesis to develop a platform for a secure and efficient data collection and exploitation to provide vehicular network users with efficient applications to ease their travel with protected and available connectivity. Therefore, we first propose a solution to deploy an optimized number of data harvesters to collect data from an urban area. Then, we propose a new secure intersection based routing protocol to relay data to a destination in a secure manner based on a monitoring architecture able to detect and evict malicious vehicles. This protocol is after that enhanced with a new intrusion detection and prevention mechanism to decrease the vulnerability window and detect attackers before they persist their attacks using Kalman filter. In a second part of this thesis, we concentrate on the exploitation of collected data by developing an application able to calculate the most economic itinerary in a refined manner for drivers and fleet management companies. This solution is based on several information that may affect fuel consumption, which are provided by vehicles and other sources in Internet accessible via specific APIs, and targets to economize money and time. Finally, a spatio-temporal mechanism allowing to choose the best available communication medium is developed. This latter is based on fuzzy logic to assess a smooth and seamless handover, and considers collected information from the network, users and applications to preserve high quality of service
32
Russo, Jean-Nicola. "Evaluation du risque de téléscopage dans un contexte de véhicules communicants par la méthode des réseaux Bayésiens." Thesis, Mulhouse, 2018. http://www.theses.fr/2018MULH2947.
Full textAbstract:
Les progrès technologiques et la mondialisation du transport font que le flux de voyageurs ne cesse d’augmenter. Cependant, dans le domaine de l’automobile, des problèmes techniques ou humains entrainent des accidents causant encore aujourd’hui des milliers de blessés et de décès par an. De ce fait, les instances gouvernementales et les constructeurs automobiles travaillent sur de nouvelles règlementations et des avancées techniques afin de garantir la sécurité́ de chaque usager de la route. Afin de garantir la diminution du nombre de décès, une voie de recherche intéressante consiste à fusionner les informations provenant du véhicule, du conducteur et de l’environnement afin de prévenir le conducteur du risque qu’il prend ou même d’agir directement sur le véhicule. Ainsi, après avoir défini le risque que nous considérons, nous nous intéressons ici à sa modélisation et son estimation en temps réel. Dans ce contexte, le cas d’usage de décélération du véhicule suivi est étudié et nous analysons et traitons les données par un réseau Bayésien afin d’évaluer le risque de télescopage qui sera partagé à travers une communication inter-véhiculaire de type VANet<br>Technological advances and the globalization of transport have led to an increase flow of passengers. However, in the automotive sector, technical or human problems lead to accidents that still cause thousands of injuries and deaths each year. As a result, government authorities and car manufacturers are working on new regulations and technical advances to ensure safety of every road user. To ensure that cut of deaths and injuries, an interesting research approach is to merge information from the vehicle, the driver and the environment in order to warn the driver of the risk he is taking or even to act directly on the vehicle. Thus, after defining the risk we consider, we are interested here in its modelling and estimation in real time. In this context, the deceleration of the leading vehicle is monitored and studied then we analyze and process the data through a Bayesian network in order to evaluate the rear-end risk that will be shared through vehicular communication thanks to VANet
33
Ahmad, Abdel Mehsen. "Techniques de transmission et d'accès sans fil dans les réseaux ad-hoc véhiculaires (VANETS)." Phd thesis, Institut National des Télécommunications, 2012. http://tel.archives-ouvertes.fr/tel-00762633.
Full textAbstract:
Les réseaux véhiculaires font l'objet de recherches actives aussi bien dans le domaine des réseaux que dans celui des transports. Le potentiel des réseaux véhiculaires à fournir des services comme l'information sur le trafic en temps réel ou sur les accidents font de cette technologie un domaine de recherche très important. Ces réseaux peuvent comporter des communications véhicule-à-véhicule (V2V), véhicule-à-infrastructure (V2I), ou une combinaison des deux. La norme IEEE 1609.4 est la spécification multicanal pour l'IEEE802.11p/WAVE des réseaux véhiculaires (VANETs). Elle utilise sept canaux, l'un étant un canal de contrôle (CCH) qui est écouté par les équipements de façon périodique, et les six autres canaux sont utilisés comme canaux de service (SCH). Elle définit également une division du temps en alternance entre les intervalles CCH et les intervalles SCH. L'objet de cette thèse de doctorat est d'évaluer les performances des réseaux VANETs dans le cas des communications véhiculaires sans infrastructure, et au niveau des couches inférieures du standard 802.11p. Dans la première partie, nous proposons une approche MAC d'allocation multicanal opportuniste dans un contexte sans infrastructure. Cette approche est conforme à la norme IEEE1609.4 -2010 de l'architecture WAVE pour un fonctionnement multicanal, et elle est conçue pour des applications de services de données (non urgentes), tout en assurant la transmission des messages de sécurité routière et des paquets de contrôle. Pour maintenir la qualité de service des deux types de messages (urgents et non-urgents) en exploitant la capacité du canal, deux solutions sont proposées. Dans la deuxième partie, lorsque le véhicule sélectionne son canal et contrôle son alternance temporelle entre CCH et SCH, il commence à transmettre ses paquets, en particulier sur le canal CCH, lesquels ont une durée de péremption. Nous présentons une approche visant à minimiser les collisions des émetteurs tout en évitant la contention de début d'intervalle, en particulier dans un contexte de densité élevée de véhicules. Même si les mécanismes proposés ci-dessus diminuent le taux de collision, il n'est pas possible de les supprimer complètement. Dans la troisième partie, nous traitons le problème des collisions entre les paquets diffusés sur le CCH, en particulier quand la charge des messages transmis dépasse la capacité du canal. Pour cela, nous proposons un nouveau mécanisme de codage réseau analogique adapté à la modulation QPSK pour les messages diffusés sur le CCH. Dans cette approche des symboles connus sont envoyés avant d'envoyer les paquets pour estimer les paramètres du canal et une solution explicite est utilisée pour inverser le système de la superposition de deux paquets
34
Yieh, Pierson. "Vehicle Pseudonym Association Attack Model." DigitalCommons@CalPoly, 2018. https://digitalcommons.calpoly.edu/theses/1840.
Full textAbstract:
With recent advances in technology, Vehicular Ad-hoc Networks (VANETs) have grown in application. One of these areas of application is Vehicle Safety Communication (VSC) technology. VSC technology allows for vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications that enhance vehicle safety and driving experience. However, these newly developing technologies bring with them a concern for the vehicular privacy of drivers. Vehicles already employ the use of pseudonyms, unique identifiers used with signal messages for a limited period of time, to prevent long term tracking. But can attackers still attack vehicular privacy even when vehicles employ a pseudonym change strategy? The major contribution of this paper is a new attack model that uses long-distance pseudonym changing and short-distance non-changing protocols to associate vehicles with their respective pseudonyms.
35
Gamati, E. "Information collection algorithm for vehicular ad-hoc networks (application domain: Urban Traffic Wireless Vehicular Ad-Hoc Networks (VANETs))." Thesis, Nottingham Trent University, 2013. http://irep.ntu.ac.uk/id/eprint/4/.
Full textAbstract:
Vehicle to vehicle communication (V2VC) is one of the modern approaches for exchanging and generating traffic information with (yet to be realized) potential to improve road safety, driving comfort and traffic control. In this research, we present a novel algorithm which is based on V2V communication, uses in-vehicle sensor information and in collaboration with the other vehicles' sensor information can detect road conditions and determine the geographical area where this road condition exists – e.g. geographical area where there is traffic density, unusual traffic behaviour, a range of weather conditions (raining), etc. The algorithms' built-in automatic geographical restriction of the data collection, aggregation and dissemination mechanisms allows warning messages to be received by any car, not necessarily sharing the identified road condition, which may then be used to identify the optimum route taken by the vehicle e.g. avoid bottlenecks or dangerous areas including accidents or congestions on their current routes. This research covers the middle ground between MANET [1] and collaborative data generation based on knowledge granularity (aggregation). It investigates the possibility of designing, implementing and modelling of the functionality of an algorithm (as part of the design of an intelligent node in an Intelligent Transportation System - ITS) that ensures active participation in the formation, routing and general network support of MANETs and also helps in-car traffic information and real-time control generation and distribution. The work is natural extension of the efforts of several large EU projects like DRIVE [2], GST [3] and SAFESPOT [4]. The main difference between this research work and the research efforts outlined in these projects and related work is that they focus on V2I (Vehicle to Infrastructure) algorithms and node design, while all work related to ad-hoc wireless communication is mentioned, but not developed fully. In that respect this specific research domain is increasingly under active research consideration – utilizing ad-hoc networks algorithms for creating ad-hoc based wireless architectures and algorithms for building future intelligent information systems. The research challenge is to design, implement and investigate novel algorithms as part of an intelligent wireless information systems node design so that the functionality of the node has all the characteristics of the network node in parallel with all the characteristics of in-car data processing device. The project redefines the base line connectivity of the device and describes to what extend the functionality of the node will depend on external factors: e.g. connectivity based on the underlying wireless technology, support of the ad-hoc networks based on the speed and the type of mobility of the mobile node etc. The big difference between MANET as described so-far in the literature and the one which will be underlined by the functionality of the intelligent node described in this project is in the functionality of the active component of the MANET described here. The MANET designed in the project will be able to more effectively generate data (not network data – but user traffic data) and also will be able to take part in the on street control of the traffic lights. Although much research work worldwide is dedicated to the subject, the fact is that there are none implemented on the road traffic information systems based on ad-hoc networking, which shows that the principles of building such effective networks are yet to be discovered. The achievements of this research include introducing a novel algorithm based on the “Single Ripple” algorithm approach [5], investigating and reporting in papers the parameters transmission delay and number of hops for optimum working mode of the algorithm. The work includes also developing a simulation tool and tool for analyses of the data.
36
Varmus, Pavol. "Analýza vehicular ad hoc sítě." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400927.
Full textAbstract:
This diploma thesis aims to study VANET (vehicular ad hoc network), to describe the theory of this networks and describe attributes of these networks and to set the starting point for practical part. Thesis includes VANETs possibilities, its signal transportation and description of routing protocols. Another goal was to familiarize program NS-3 and set up simulation models in its interface. The main output of the practical part is program which simulates vehicle movement in Brno city and set the communication module which is adapted to fulfill the most realistic transmission capabilities. Practical part is divided to two parts. The goal of the first one was to simulate basic communication in theorized unrealistic scenario and the second part was the more realistic scenario. Overall, throughout the practical part was tested a variety of attributes, such as mobility models, standards, routing protocols and other parameters that provided diversity in final results. All the results, which consisted of summary of basic transmission capabilities and reclassification of the applicability of those technologies in real world, are discussed in the summary of the simulations output.
37
Bou, Farah Mira. "Méthodes utilisant des fonctions de croyance pour la gestion des informations imparfaites dans les réseaux de véhicules." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0208/document.
Full textAbstract:
La popularisation des véhicules a engendré des problèmes de sécurité et d’environnement. Desprojets ont été lancés à travers le monde pour améliorer la sécurité sur la route, réduire l’encombrementdu trafic et apporter plus de confort aux conducteurs. L’environnement des réseaux devéhicules est complexe et dynamique, les sources sont souvent hétérogènes, de ce fait les informationséchangées peuvent souvent être imparfaites. La théorie des fonctions de croyance modélisesouplement les connaissances et fournit des outils riches pour gérer les différents types d’imperfection.Elle est utilisée pour représenter l’incertitude, gérer les différentes informations acquises etles fusionner. Nous nous intéressons à la gestion des informations imparfaites échangées entre lesvéhicules concernant les événements sur la route. Les événements locaux et les événements étendusn’ayant pas les mêmes caractéristiques, les travaux réalisés les distinguent. Dans un environnementsans infrastructure où chaque véhicule a son propre module de fusion, l’objectif est de fournir auxconducteurs la synthèse la plus proche possible de la réalité. Différents modèles fondés sur desfonctions de croyance sont proposés et différentes stratégies sont étudiées : affaiblir ou renforcervers l’absence de l’événement pour prendre en compte le vieillissement des messages, garder lesmessages initiaux ou seulement le résultat de la fusion dans la base des véhicules, considérer la miseà jour du monde, prendre en compte l’influence du voisinage pour gérer la spatialité des embouteillages.Les perspectives restent nombreuses, certaines sont développées dans ce manuscrit commela généralisation des méthodes proposées à tous les événements étendus tels que les brouillards<br>The popularization of vehicles has created safety and environmental problems. Projects havebeen launched worldwide to improve road safety, reduce traffic congestion and bring more comfortto drivers. The vehicle network environment is dynamic and complex, sources are often heterogeneous,and therefore the exchanged information may be imperfect. The theory of belief functionsoffers flexibility in uncertainty modeling and provides rich tools for managing different types of imperfection.It is used to represent uncertainty, manage and fuse the various acquired information.We focus on the management of imperfect information exchanged between vehicles concerningevents on the road. The carried work distinguishes local events and spatial events, which do nothave the same characteristics. In an environment without infrastructure where each vehicle is afusion center and creates its own vision, the goal is to provide to each driver the synthesis of thesituation on the road as close as possible to the reality. Different models using belief functionsare proposed. Different strategies are considered: discount or reinforce towards the absence of theevent to take into account messages ageing, keep the original messages or just the fusion result invehicle database, consider the world update, manage the spatiality of traffic jam events by takinginto account neighborhood. Perspectives remain numerous; some are developed in the manuscriptas the generalization of proposed methods to all spatial events such as fog blankets
38
Ren, Mengying. "Cluster-based Data Dissemination in Vehicular Ad-hoc Networks (VANETs)." Thesis, Troyes, 2018. http://www.theses.fr/2018TROY0007.
Full textAbstract:
En raison de l’essor rapide des technologies de communication sans fil et de la demande croissante de services dans les réseaux ad hoc véhiculaires (VANETs), le besoin d’algorithmes de clustering efficaces est nécessaire pour résoudre le problème de mise à l’échelle et le besoin croissant d'applications dans les VANETs. Cependant, à cause de la nature dynamique des VANETs, les algorithmes de clustering doivent assurer la stabilité du cluster. Pour cela, l’objectif de la thèse est de proposer un cadre générique servant à définir des algorithmes de clustering afin d'améliorer la stabilité du cluster et d'augmenter l'efficacité de la transmission de données. Dans cette thèse, nous introduisons un algorithme de clustering (MoDyC) qui se base sur la métrique de mobilité pour former des clusters. Ensuite, nous proposons un cadre générique servant à définir des algorithmes de clustering appelé UFC. Nous évaluons l’impact des métriques de clustering et des méthodes de fusion de clusters sur le critère de stabilité. Nous proposons une nouvelle méthode de fusion de cluster appelée LCM. Cette méthode basée sur la métrique Leadership permet d’augmenter la stabilité du cluster. Nous analysons les performances des algorithmes de clustering proposés. Dans le but de modéliser le processus de clustering, nous proposons un modèle basé sur les chaînes de Markov. A partir de ce modèle, nous analysons la stabilité du cluster. Cette thèse se termine par l’étude d’un scénario de diffusion de messages d'urgence en utilisant un schéma de diffusion de données en cluster avec cache de contenu<br>Due to the rapid development of wireless communication technologies and the growing demand of services in Vehicular Ad-hoc Networks (VANETs), efficient clustering algorithms are mandatory to solve the network scalability problem and to support more applications in VANETs. However, because of the dynamic network topology of VANETs, clustering algorithms are required to guarantee the cluster's stability. Therefore, this thesis aims to propose a framework for clustering algorithms for VANETs, to improve cluster's stability and to increase the efficiency of data transmission. In this thesis, we firstly investigate a new mobility-based scheme for dynamic clustering (MoDyC) in VANETs using the mobility-based clustering metric to construct clusters. Then, we propose our framework for clustering algorithm named UFC. Based on this framework, we evaluate the impacts of different clustering metrics and cluster merging schemes on cluster's stability. Meanwhile, a leadership-based cluster merging scheme (LCM) is presented to increase the cluster stability. To analyze the cluster stability, we propose a Markov chain model to model the clustering process and to investigate its performance. Finally, this thesis studies a scenario, aiming to disseminate vehicular emergency messages through cluster-based data dissemination scheme
39
Bernsen, James. "A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS." UKnowledge, 2011. http://uknowledge.uky.edu/gradschool_theses/132.
Full textAbstract:
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.
40
Chim, Tat-wing, and 詹達榮. "Secure and privacy-preserving protocols for VANETs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46587755.
Full text
41
Khan, Faisal Ahmad. "Safety-message routing in vehicular ad hoc networks." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47743.
Full textAbstract:
The safety-message dissemination problem for vehicular ad hoc networks (VANETs) was investigated. Four novel techniques were contributed for the efficient and reliable routing of safety messages in the vehicular ad hoc networks. The instant-broadcast technique was proposed to improve the end-to-end dissemination delay. The lane-based sectoring mechanism was presented for the collision mitigation in the dense-urban traffic scenario. The negative acknowledgment with smart neighborhood (NSN) technique was proposed to ensure the reliability of reception through recovering the packet loss caused by interference. Finally, the negative acknowledgment with smart neighborhood - hole recovery (NSN-H) technique was presented to provide guaranteed reception of the safety message at each individual node in the VANET. The investigation of the safety message routing in VANET conducted in this research also revealed the significance of hitherto-neglected factors that influence the vehicular network. Significance of the small payload size of the VANET safety message, the effect of road width on the multi-hop relay, and the attenuation caused by vehicles in the propagation path were among the important revealed factors.
42
Salem, Fatma. "Fiabilité et sécurité des systèmes embarqués communicants pour les transports : modélisation et optimisation." Thesis, Valenciennes, 2018. http://www.theses.fr/2018VALE0034.
Full textAbstract:
Véhicule-à-tous (V2X) se réfère à un Système de Transport Intelligent (ITS) où les véhicules et l'infrastructure sont interconnectés. Cette connectivité permet une connaissance précise des conditions de circulation sur l'ensemble du réseau routier, ce qui contribue à améliorer la sécurité routière, réduire les temps d'encombrement et éviter les pertes économiques. Cette communication permet aussi une variété de nouvelles applications pour la sécurité routière et l'infodivertissement. Bien que la communauté de scientifique ait réalisé de grands progrès dans l'étude sur le V2X, il reste encore des défis à surmonter et des problèmes clés qui doivent être étudiés plus en profondeur. Cette thèse considère deux des questions les plus importantes; fiabilité et sécurité des communications V2X. Du point de vue de la fiabilité, nous proposons d'abord une méthode basée sur la modélisation de l'utilisateur pour évaluer la capacité de la norme DSRC IEEE 802.11p à répondre aux exigences de Qualité De Service (QoS) de la diffusion des messages de sécurité. La nouveauté de la méthode réside dans son application qui élimine le problème de la définition d'un modèle Markovien par la détermination des moments d'équilibre du processus de retard. Cette méthode fournit des informations importantes sur les paramètres de conception IEEE 802.11p et sur ses fonctionnalités, ce qui permet d'améliorer la configuration proposée. De plus, nous proposons un modèle Régénératif pour résoudre le problème de la caractérisation des processus de trafic interconnecté dans les réseaux V2X hybrides à grande échelle. Ce dernier est une préoccupation majeure pour parvenir à une opérabilité efficace et adéquate pour les réseaux de véhicules à grande échelle. Du point de vue de la sécurité, nous introduisons une nouvelle méthodologie d'optimisation. Notre méthodologie lie les exigences de QoS des différentes classes d'application avec le paramètre de conception de base du mécanisme de résolution de contention dans le protocole MAC IEEE 802.11p. En outre, un nouvel algorithme de détection d'attaque de brouillage dans l'environnement véhiculaire est proposé. L'algorithme utilise la méthodologie d'optimisation développée pour définir un seuil de détection et intègre la méthode séquentielle de détection pour détecter les attaques de brouillage à chaque fois que la valeur seuil est franchie. Des expérimentations analytiques et de simulation approfondies ont été effectuées pour chaque contribution afin de montrer la validité des méthodes/modèles proposés et de prouver leur efficacité<br>Vehicle-to-anything (V2X) refers to an Intelligent Transportation System (ITS) where the vehicles and infrastructure systems are all interconnected with each other. This connectivity provides precise knowledge of the traffic situations across the entire road network which in turn helps to enhance traffic safety, reduce congestion time, avoid economic losses, in addition to enable a variety of novel ITS applications for road safety and passenger infotainment. V2X communications is based on two technologies; Dedicated Short-Range Communications (DSRC) which is an essential technology for realizing V2X and cellular networks which provide an o_-the-shelf potential solution for V2X communications. Although the research community has achieved much great progress on V2X study, there are still some challenges that need to be overcome and some key issues that need to be further investigated. This thesis considers two of the most prominent issues; reliability and security of V2X communications. From the reliability perspective, we first propose User Model-based Method to evaluate the capacity of IEEE 802.11p-based DSRC standard to meet the Quality-of-Service (QoS) requirements of safety messages dissemination. The novelty of the method lies in its application which avoids the problem of defining a Markovian model by determining the steady state moments of the induced delay process. This applicability feature provides important insights about IEEE 802.11p design parameters and its functionality leading to proposed reconfigurations for enhanced performance. Moreover, we propose Regenerative model, that we believe to be the first to address the problem of interconnected-traffic process characterization in large-scale hybrid V2X networks. The latter is a primary concern in achieving efficient and adequate operability for large-scale vehicular networks. From the security perspective, we introduce a new optimization methodology which ties the QoS requirements of different application classes with the basic design parameters of the contention resolution mechanism in IEEE 802.11p MAC protocol. In addition, a novel detection algorithm for jamming attacks in the vehicular environment is proposed. The algorithm utilizes the developed optimization methodology to de_ne a detection threshold. By integrating the sequential detection of change method it traces and detects jamming attacks whenever the threshold value is crossed. Analytical and simulation experimentations have been performed for each contribution to show the validity of the proposed methods/models and to prove their efficiency
43
Eze, Elias Chinedum. "Achieving reliable and enhanced communication in vehicular ad hoc networks (VANETs)." Thesis, University of Bedfordshire, 2017. http://hdl.handle.net/10547/622523.
Full textAbstract:
With the envisioned age of Internet of Things (IoTs), different aspects of Intelligent Transportation System (ITS) will be linked so as to advance road transportation safety, ease congestion of road traffic, lessen air pollution, improve passenger transportation comfort and significantly reduce road accidents. In vehicular networks, regular exchange of current position, direction, speed, etc., enable mobile vehicle to foresee an imminent vehicle accident and notify the driver early enough in order to take appropriate action(s) or the vehicle on its own may take adequate preventive measures to avert the looming accident. Actualizing this concept requires use of shared media access protocol that is capable of guaranteeing reliable and timely broadcast of safety messages. This dissertation investigates the use of Network Coding (NC) techniques to enrich the content of each transmission and ensure improved high reliability of the broadcasted safety messages with less number of retransmissions. A Code Aided Retransmission-based Error Recovery (CARER) protocol is proposed. In order to avoid broadcast storm problem, a rebroadcasting vehicle selection metric η, is developed, which is used to select a vehicle that will rebroadcast the received encoded message. Although the proposed CARER protocol demonstrates an impressive performance, the level of incurred overhead is fairly high due to the use of complex rebroadcasting vehicle selection metric. To resolve this issue, a Random Network Coding (RNC) and vehicle clustering based vehicular communication scheme with low algorithmic complexity, named Reliable and Enhanced Cooperative Cross-layer MAC (RECMAC) scheme, is proposed. The use of this clustering technique enables RECMAC to subdivide the vehicular network into small manageable, coordinated clusters which further improve transmission reliability and minimise negative impact of network overhead. Similarly, a Cluster Head (CH) selection metric F(j) is designed, which is used to determine and select the most suitably qualified candidate to become the CH of a particular cluster. Finally, in order to investigate the impact of available radio spectral resource, an in-depth study of the required amount of spectrum sufficient to support high transmission reliability and minimum latency requirements of critical road safety messages in vehicular networks was carried out. The performance of the proposed schemes was clearly shown with detailed theoretical analysis and was further validated with simulation experiments.
44
Zhang, Qi. "An Infrastructure Based Worm Spreading Countermeasure for Vehicular Ad Hoc Networks." Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/35728.
Full textAbstract:
VANETs are the essential component of the intelligent transport system, which attract research and industrial interests increasingly. As the multifunctional mobile nodes integrating transporting, sensing, information processing, and wireless communication capabilities, vehicular nodes are facing remarkable security issues and more vulnerable to malware attack than conventional communication nodes. In this thesis, the behavior and the security issues of the worm spreading on VANETs are studied. The approaches of the worm spreading on VANETs are discussed and an infrastructure based worm containment strategy is proposed. The infrastructure based worm containment problem is modeled as minimum contamination problem by introducing the expected contamination degree. Then the existing greedy method is applied to solve the proposed problem in VANETs scenario. After that, the Grid-shrinking Greedy Method and the Simplified Greedy Method are proposed which incorporate the characteristics of road networks and VANETs respectively. Simulation results show the two proposed methods outperform the existing greedy method and the comparison method from both complexity and solution quality aspects.
45
Shen, Pei Yuan. "An efficient public key management regime for vehicular ad hoc networks (VANETS)." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/46231/1/Pei_Shen_Thesis.pdf.
Full textAbstract:
The primary goal of the Vehicular Ad Hoc Network (VANET) is to provide real-time safety-related messages to motorists to enhance road safety. Accessing and disseminating safety-related information through the use of wireless communications technology in VANETs should be secured, as motorists may make critical decisions in dealing with an emergency situation based on the received information. If security concerns are not addressed in developing VANET systems, an adversary can tamper with, or suppress, the unprotected message to mislead motorists to cause traffic accidents and hazards.
Current research on secure messaging in VANETs focuses on employing the certificate-based Public Key Infrastructure (PKI) scheme to support message encryption and digital signing. The security overhead of such a scheme, however, creates a transmission delay and introduces a time-consuming verification process to VANET communications.
This thesis has proposed a novel public key verification and management approach for VANETs; namely, the Public Key Registry (PKR) regime. Compared to the VANET PKI scheme, this new approach can satisfy necessary security requirements with improved performance and scalability, and at a lower cost by reducing the security overheads of message transmission and eliminating digital certificate deployment and maintenance issues.
The proposed PKR regime consists of the required infrastructure components, rules for public key management and verification, and a set of interactions and associated behaviours to meet these rule requirements. This is achieved through a system design as a logic process model with functional specifications. The PKR regime can be used as development guidelines for conforming implementations.
An analysis and evaluation of the proposed PKR regime includes security features assessment, analysis of the security overhead of message transmission, transmission latency, processing latency, and scalability of the proposed PKR regime. Compared to certificate-based PKI approaches, the proposed PKR regime can maintain the necessary security requirements, significantly reduce the security overhead by approximately 70%, and improve the performance by 98%. Meanwhile, the result of the scalability evaluation shows that the latency of employing the proposed PKR regime stays much lower at approximately 15 milliseconds, whether operating in a huge or small environment. It is therefore believed that this research will create a new dimension to the provision of secure messaging services in VANETs.
46
Rezende, Cristiano. "Video Streaming in Vehicular Ad Hoc Networks: Challenges, Protocols and The Use of Redundancy." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30975.
Full textAbstract:
Vehicular Ad Hoc Networks (VANETs) are no longer a futuristic promise but rather an attainable technology. Vehicles are already equipped with a variety of computational devices that control or assist drivers in many tasks such as localization, safely breaking, parking and passengers entertainment. The majority of services envisioned for VANETs either require the provision of multimedia support or have it as an extremely beneficial additional feature. In particular, video streaming capabilities over VANETs are crucial to the development of interesting and valuable services. However,VANETs’ highly dynamic topology poses as a demanding challenge to the fulfillment of video streaming’s stringent requirements.
The main goal on this thesis is the development of feasible solutions that support the streaming of video content over VANETs. Initially, the main issues of VANETs are explained through both a discussion of its characteristics and the results of some preliminary conclusions. Based on this understanding of VANETs’ peculiarities, three distinguishing solutions are designed REACT-DIS, REDEC and VIRTUS; the two first for video dissemination and the later for video unicast. These solutions offer a great advancement towards the provision of video streaming capabilities but packet loss is still an issue at high data rates.
In order to improve the delivery ratios reached by the previous solutions, redundancy is used as an error correction mechanism. The use of redundancy is ideal for VANETs in handling packet loss as they do not require any interaction between source and receivers nodes. Sophisticated coding techniques were used for an efficient use of the increase on entropy of the information sent by the source node. It was also evaluated the selective use of redundancy solely on packets carrying the crucial information of I-frames. Although this selective approach obtained lower overall delivery ratios than when redundancy is used for all packets, the video quality obtained similar improvements under a much lower cost. The evaluation on the use of redundancy has considered the impact on the rate by which unique video content is received at end-users which is fundamental to understand
the resolution of videos that can be displayed.
This thesis provides several contributions as it advances the knowledge in the peculiarities of VANETs, solutions for video streaming over VANETs and the use of redundancy as an error correction mechanism for video streaming over VANETs.
47
Zhang, Pengfei. "Design and Evaluation of Cooperative Location Verification Protocol for Vehicular Ad-Hoc Networks." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22648.
Full textAbstract:
Vehicular ad hoc networks (VANETs) have attracted much attention over the last few years. VANETs own several significant characteristics, such as the high-rate changing topology led by velocity of vehicles, time-and-location critical safety applications, and Global Positioning System (GPS) devices.
In VANETs, as vehicle movement is usually restricted in just bidirectional movements along the roads and streets, geographical location information becomes very useful. In addition, many studies show that position-based routing protocol is a more promising routing strategy for VANETs; therefore security and verification of location information are necessary to be researched.
In this thesis, a location verification approach, namely the Cooperative Location Verification (CLV) protocol, is proposed, aiming to prevent position-spoofing attacks on VANETs. The CLV basically uses two vehicles, a Verifier and a Cooperator, to verify the claimed position of a vehicle (Prover), according to two challenge-response procedures. Additionally, the security analysis of the CLV is presented.
In order to enhance the CLV by reduce the network overhead, a reputation management system is designed. It utilizes the verification results of the CLV application and maintain every vehicle's reliability in the network. In addition, the solution to sparse networks is briefly discussed.
In the simulation, the results show that the proposed CLV performs better than another location verification algorithm, namely the Secure Location Verification (SLV). And the effectiveness of the reputation management system is also demonstrated.
48
Hashem, Eiza Mahmoud. "Secure multi-constrained QoS reliable routing algorithm for vehicular ad hoc networks (VANETs)." Thesis, Brunel University, 2014. http://bura.brunel.ac.uk/handle/2438/10204.
Full textAbstract:
Vehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guarantees. QoS routing plays an essential role in identifying routes that meet the QoS requirements of the offered service over VANETs. However, searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Moreover, routing reliability needs to be given special attention as communication links frequently break in VANETs. To date, most existing QoS routing algorithms are designed for stable networks without considering the security of the routing process. Therefore, they are not suitable for applications in VANETs. In this thesis, the above issues are addressed firstly by developing a link reliability model based on the topological and mathematical properties of vehicular movements and velocities. Evolving graph theory is then utilised to model the VANET communication graph and integrate the developed link reliability model into it. Based on the resulting extended evolving graph model, the most reliable route in the network is picked. Secondly, the situational awareness model is applied to the developed reliable routing process because picking the most reliable route does not guarantee reliable transmission. Therefore, a situation-aware reliable multipath routing algorithm for VANETs is proposed. Thirdly, the Ant Colony Optimisation (ACO) technique is employed to propose an Ant-based multi-constrained QoS (AMCQ) routing algorithm for VANETs. AMCQ is designed to give significant advantages to the implementation of security mechanisms that are intended to protect the QoS routing process. Finally, a novel set of security procedures is proposed to defend the routing process against external and internal threats. Simulation results demonstrate that high levels of QoS can be still guaranteed by AMCQ even when the security procedures are applied.
49
Hadded, Mohamed. "Design and optimization of access control protocols in Vehicular Ad Hoc Networks (VANETs)." Thesis, Evry, Institut national des télécommunications, 2016. http://www.theses.fr/2016TELE0023/document.
Full textAbstract:
Les accidents routiers et leurs dommages représentent un problème croissant dans le monde entier. Dans ce contexte, les réseaux véhiculaires (VANETs) peuvent être déployés pour réduire les risques et pour améliorer le confort. Ils permettent aux véhicules d'échanger différents types de données qui vont des applications de sécurité et de gestion du trafic aux applications de confort. De nos jours, les applications de sécurité sont l’objet de beaucoup d'attention des chercheurs ainsi que des fabricants d'automobiles. Dans cette thèse, nous étudierons les applications critiques pour la sécurité routière visant à fournir une assistance dans des situations dangereuses ou difficiles. Notre objectif principal sera de proposer de nouveaux protocoles de contrôle d'accès au support de transmission (MAC) et de routage, qui peuvent s’adapter dynamiquement aux changements fréquents de topologies des VANETs. Après un aperçu des protocoles d’accès sans contention dans les VANETs, nous proposons des solutions basées sur la technique de division du temps: Time Division Multiple Access (TDMA). D’abord, nous nous concentrons sur le développement d’un nouveau protocole distribué (DTMAC), qui ne repose pas sur l’utilisation d’infrastructure. DTMAC utilise les informations de localisation et un mécanisme de réutilisation des slots pour assurer que les véhicules accèdent au canal efficacement et sans collision. Les résultats obtenus ont confirmé l’efficacité de notre protocole, DTMAC se comporte très significativement mieux que VeMAC (protocole MAC basé sur TDMA.) Ensuite nous proposons TRPM, un protocole de routage basé sur une approche cross-layer. Dans TRPM, l’ordonnancement des slots TDMA construit par DTMAC et la position de la destination sont utilisés pour choisir le meilleur relais. Les résultats montrent que TRPM offre de meilleures performances, du nombre moyen de relais et de la fiabilité de livraison des messages comparé à d’autres protocoles. Dans la deuxième partie de cette thèse, nous nous focaliserons sur les mécanismes centralisés d’allocation de slots qui utilisent des coordinateurs. D’abord, nous proposons CTMAC, un protocole basé sur TDMA centralisé utilisant les RSUs (RoadSide Units) pour créer et maintenir les ordonnancements. CTMAC met en œuvre un mécanisme qui permet d’empêcher les “Access Collisions” de se produire plus que deux fois entre les véhicules qui tentent d’acquérir un même slot disponible. Les résultats ont montré que CTMAC permet de mieux minimiser les collisions, ainsi que le surcoût généré pour créer et maintenir les ordonnancements par rapport aux protocoles MAC, basés sur TDMA distribué. Cependant, dans CTMAC, les véhicules roulant vite devront acquérir des nouveaux slots après une courte période de temps à chaque fois qu’ils quittent les zones de leurs RSUs courants. Cette situation rend les protocoles centralisés inefficaces et couteux dans les réseaux à grande vitesse. Afin de pallier à ce problème inhérent à l’utilisation des RSUs, nous adaptons un algorithme d’ordonnancement basé sur le clustering dans lequel certains véhicules sont élus pour gérer l'accès au canal. Ceci permet aux véhicules de rester attachés à leurs clusters plus longtemps. Pour ce faire, nous proposons 1- un protocole de clustering nommé AWCP afin de former des clusters stables avec une longue durée de vie. AWCP est basé sur l’algorithme de clustering pour les réseaux mobiles WCA dans lequel les têtes des clusters sont élues en se basant sur une fonction de poids. 2- Nous formulons le réglage des paramètres de protocole AWCP comme un problème d’optimisation multi-objective et nous proposons un outil d’optimisation qui combine la version multi-objective de l’algorithme génétique appelé NSGA-II avec le simulateur de réseau ns-2 pour trouver les meilleurs paramètres du protocole AWCP. 3- Nous proposons ASAS, une stratégie adaptative pour l’attribution des slots temporels basée sur une approche cross-layer entre TDMA et AWCP<br>Road crashes and their damages represent a serious issue and are one of the main causes of people death. In this context, Vehicular Ad hoc NETworks (VANETs) are deployed to reduce the risk of road accident as well as to improve passengers’ comfort by allowing vehicles to exchange different kinds of data which ranges widely from road safety and traffic management to infotainment. Nowadays, safety applications are receiving a great deal of attention from researchers as well as from automobile manufacturers. In this thesis, we particularly focus on safety-critical applications, designed to provide drivers assistance in dangerous situations and to avoid accidents in highway environments. Such applications must guarantee to the vehicles access to the medium and have strict requirements regarding end-to-end delay and packet loss ratio. Therefore, our main goal is to propose new medium access control and routing protocols, which can efficiently adapt to frequent changing VANET network topologies. After a comprehensive overview of free-contention MAC protocols, we propose several solutions, based on Time Division Multiple Access Technique (TDMA). We have designed DTMAC, a fully distributed TDMA-based MAC protocol, which does not rely on an expensive infrastructure. DTMAC uses vehicles’ locations and a slot reuse concept to ensure that vehicles in adjacent areas have collision-free schedule. Using simulations, we prove that DTMAC provides a lower rate of access and merging collisions than VeMAC, a well-known TDMA based MAC protocol in VANET. Then, in order to ensure that event-driven safety messages can be sent over a long distance, we propose TRPM, a TDMA aware Routing Protocol for Multi-hop communication. Our routing scheme is based on a cross layer approach between the MAC and the routing layers, in which the intermediate vehicles are selected using TDMA scheduling information. Simulation results show that TRPM provides better performances in terms of average end-to-end delay, average number of hops and average delivery ratio. In the second part, we focus on coordinator-based TDMA scheduling mechanisms. First, we propose the Centralized TDMA based MAC protocol (CTMAC) which uses Road Side Units (RSUs) as a central coordinator to create and maintain the TDMA schedules. CTMAC implements an Access Collision Avoidance mechanism that can prevent the access collision problem occurring more than twice between the same vehicles that are trying to access the channel at the same time. Using simulation we show an improvement in terms of access and merging collisions as well as the overhead required to create and maintain the TDMA schedules compared to distributed scheduling mechanisms. However, in the CTMAC protocol, fast moving vehicles will need to compete for new slots after a short period of time when they leave their current RSU area, which makes a centralized scheduling approach very expensive. In order to further improve the performance of coordinator-based TDMA scheduling mechanisms, we focus on cluster-based TDMA MAC protocols in which some vehicles in the network are elected to coordinate the channel access, allowing the vehicles to remain connected with their channel coordinator for a longer period of time. To this end, first we propose an adaptive weighted clustering protocol, named AWCP, which is road map dependent and uses road IDs and vehicle directions to make the clusters’ structure as stable as possible. Then, we formulate the AWCP parameter tuning as a multi-objective problem and we propose an optimization tool to find the optimal parameters of AWCP to ensure its QoS. Next, we propose ASAS, an adaptive slot assignment strategy for a cluster-based TDMA MAC protocol. This strategy is based on a cross layer approach involving TDMA and AWCP. The objective is to overcome the inter-cluster interference issue in overlapping areas by taking into account vehicles’ locations and directions when the cluster head assign slots
50
El, Zoghby Nicole. "Fusion distribuée de données échangées dans un réseau de véhicules." Phd thesis, Université de Technologie de Compiègne, 2014. http://tel.archives-ouvertes.fr/tel-01070896.
Full textAbstract:
Cette thèse porte sur l'étude des techniques de fusion de données réparties et incertaines au sein d'un réseau de véhicules pour gérer la confiance dans les autres véhicules ou dans les données reçues. L'algorithme de fusion distribuée proposé est basé sur les fonctions de croyance et est appliqué par chaque nœud à la réception des messages. In se base sur la gestion d'une connaissance directe, locale à chaque nœud et d'une connaissance distribuée diffusée dans le réseau. Cette dernière résulte de la fusion des messages par un opérateur adapté prenant en compte les cycles éventuels et limitant l'effet de "data incest". Chaque nœud peut être autonome pour estimer la confiance mais la coopération entre les véhicules permet d'améliorer et de rendre plus robuste cette estimation. L'algorithme peut être adapté au cas d'étude en considérant un ou plusieurs éléments d'observation et en prenant en compte l'obsolescence des données. Lorsqu'il y a plusieurs éléments d'observation, se pose le problème de l'association de données nécessaire avant l'étape de combinaison. Un nouvel algorithme d'association a été formalisé dans le cadre des fonctions de croyance. Il a été démontré que ce problème est équivalent à un problème d'affectation linéaire, qui peut être résolu en temps polynomial. Cette solution est à la fois optimale et beaucoup plus efficace que d'autres approches développées dans ce formalisme. La gestion de la confiance dans les nœuds et dans les données échangées ont été illustrées par la mise en œuvre de deux applications : la détection de faux nœuds dans une attaque Sybil et la gestion de la confiance dans les cartes dynamiques pour la perception augmentée.