To see the other types of publications on this topic, follow the link: Ad hoc vehicle networks.
Dissertations / Theses on the topic 'Ad hoc vehicle networks'
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 'Ad hoc vehicle networks.'
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
Abdalla, Ghassan Mohammed Taha. "Physical and link layer implications in Vehicle Ad hoc Networks." Thesis, University of Plymouth, 2009. http://hdl.handle.net/10026.1/331.
Full textAbstract:
Vehicle Ad hoc Networks (V ANET) have been proposed to provide safety on the road and deliver road traffic information and route guidance to drivers along with commercial applications. However the challenges facing V ANET are numerous. Nodes move at high speeds, road side units and basestations are scarce, the topology is constrained by the road geometry and changes rapidly, and the number of nodes peaks suddenly in traffic jams. In this thesis we investigate the physical and link layers of V ANET and propose methods to achieve high data rates and high throughput. For the physical layer, we examine the use of Vertical BLAST (VB LAST) systems as they provide higher capacities than single antenna systems in rich fading environments. To study the applicability of VB LAST to VANET, a channel model was developed and verified using measurement data available in the literature. For no to medium line of sight, VBLAST systems provide high data rates. However the performance drops as the line of sight strength increases due to the correlation between the antennas. Moreover, the performance of VBLAST with training based channel estimation drops as the speed increases since the channel response changes rapidly. To update the channel state information matrix at the receiver, a channel tracking algorithm for flat fading channels was developed. The algorithm updates the channel matrix thus reducing the mean square error of the estimation and improving the bit error rate (BER). The analysis of VBLAST-OFDM systems showed they experience an error floor due to inter-carrier interference (lCI) which increases with speed, number of antennas transmitting and number of subcarriers used. The update algorithm was extended to VBLAST -OFDM systems and it showed improvements in BER performance but still experienced an error floor. An algorithm to equalise the ICI contribution of adjacent subcarriers was then developed and evaluated. The ICI equalisation algorithm reduces the error floor in BER as more subcarriers are equalised at the expense of more hardware complexity. The connectivity of V ANET was investigated and it was found that for single lane roads, car densities of 7 cars per communication range are sufficient to achieve high connectivity within the city whereas 12 cars per communication range are required for highways. Multilane roads require higher densities since cars tend to cluster in groups. Junctions and turns have lower connectivity than straight roads due to disconnections at the turns. Although higher densities improve the connectivity and, hence, the performance of the network layer, it leads to poor performance at the link layer. The IEEE 802.11 p MAC layer standard under development for V ANET uses a variant of Carrier Sense Multiple Access (CSMA). 802.11 protocols were analysed mathematically and via simulations and the results prove the saturation throughput of the basic access method drops as the number of nodes increases thus yielding very low throughput in congested areas. RTS/CTS access provides higher throughput but it applies only to unicast transmissions. To overcome the limitations of 802.11 protocols, we designed a protocol known as SOFT MAC which combines Space, Orthogonal Frequency and Time multiple access techniques. In SOFT MAC the road is divided into cells and each cell is allocated a unique group of subcarriers. Within a cell, nodes share the available subcarriers using a combination of TDMA and CSMA. The throughput analysis of SOFT MAC showed it has superior throughput compared to the basic access and similar to the RTS/CTS access of 802.11.
2
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.
3
Almajnooni, Saad M. "Mobile ad hoc network (MANET) for inter-vehicle communications." Thesis, University of Newcastle Upon Tyne, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443104.
Full text
4
Hengheng, Xie. "Cross Layer Peer-to-Peer Video Sharing for Vehicle Ad-Hoc Networks (VANETs)." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32791.
Full textAbstract:
Accompanying the increasing interest on Vehicle Ad-hoc Network (VANET), there is a request for high quality and real-time video streaming on VANET, for safety and infotainment applications. Video Streaming on VANET faces extra issues, comparing to the Mobile Ad-hoc Network (MANET), like the high dynamic topology. However, there are also benefits in VANET, like large buffer and battery capacity, predictable motion of vehicles and powerful CPU and GPU. Video streaming on VANET can be highly improved by these features. However the poor performance of wireless networks is an critical issue for video streaming in VANET. The high packet loss probability of wireless networks significantly reduces the quality of the transmitted video. An error recovery process is proposed in our research for high quality and real-time video streaming in VANET, which is call Multi-path Error Recovery Video Streaming (MERVS). The performance improvement of wireless networks is also considered in our research. The cross layer technique is adopted in our research, in order to increase the accuracy on the network condition monitoring and to guarantee the fairness on network resource distribution. Cross layer protocols on both the Media Access Control (MAC) layer and the Network layer are proposed to improve the performance collaboratively. The contribution of my researches are: 1) I proposed a MERVS, which provides high quality and real-time video streaming; 2) several improvement techniques are also designed to improve the performance of MERVS; 3) simulation results verifies that MERVS can have a higher quality on transmitted video comparing to the existing protocols in an acceptable delay.
5
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.
6
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>
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
Christmann, Hans Claus. "Self-configuring ad-hoc networks for unmanned aerial systems." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22626.
Full text
9
Nguyen-Minh, Huong. "Contribution to the Intelligent Transportation System : security of Safety Applications in Vehicle Ad hoc Networks." Thesis, Avignon, 2016. http://www.theses.fr/2016AVIG0212/document.
Full textAbstract:
Le développement du transport partout dans le monde a fourni un grand nombre d'avantages pour de nombreux aspects de la vie humaine. Les systèmes de transport intelligents (ITS) sont des applications avancées qui visent à rendre les réseaux de transport plus sûrs, plus pratiques et plus intelligents. Selon leurs usages, ils peuvent être classés en deux types d'applications ITS, qui sont des applications de sûreté et des applications non-sûreté. Le réseau de véhicules ad hoc (VANET) est un élément clé des systèmes ITS, car il permet la communication entre les unités de transport. Ces communications prennent en charge différentes applications ITS avec différentes propriétés. Parmi les deux types d'applications, nous nous intéressons aux applications de sûreté qui ont des contraintes de qualité de service et des contraintes de sécurité plus strictes. Selon le scénario considéré et l'application de sûreté donnée, les informations échangées entre les véhicules doivent être diffusé localement dans une communication à un seul saut et / ou également notifiées aux véhicules à large dimension. L'objectif principal de cette thèse est d'améliorer les performances des applications de sûreté en termes de qualité de service et de sécurité, à la fois dans une communication à un saut et dans une communication multi-sauts. Nous nous intéressons à la fiabilité, la connectivité et le déni de service (DoS). Nous étudions et proposons des solutions techniques provenant de couches inférieures (Physique, Liaison et Réseaux) qui jouent un rôle fondamental dans l'atténuation des défis créés par la nature de l'environnement des véhicules. Tout d'abord, nous introduisons une nouvelle méthode efficace pour fiabiliser la radiodiffusion. Dans notre système, les messages de sécurité sont rediffusés lorsque l'expéditeur est sollicité. Cela augmente le pourcentage de véhicules qui reçoivent les messages alors que le nombre de messages dupliqués reste limité. En second lieu, en tenant compte de la fragmentation du réseau, nous étudions des solutions qui permettent de pallier la déconnexion temporaire du réseau pour apporter l'information de sécurité aux destinataires. Basé sur les propriétés sociales des réseaux de véhicules, nous proposons un protocole de transfert basé sur des relations sociales pour relayer la communication entre les véhicules et des points d'intérêt qui fournissent des services de sécurité avec des contraintes de temps plus souples, telles que la recherche et le sauvetage. Troisièmement, nous étudions l'attaque de brouillage, une sorte d'attaques DoS, qui est cruciale pour les applications de sûreté et qui et facilement réalisable au niveau des couches inférieures. Nous modélisons l'attaque de brouillage afin d'étudier la dégradation causée par l'attaque sur les performances du réseau. La dégradation à un certain niveau dans les performances du réseau est une indication de présence d'attaques de brouillage dans le réseau; donc les résultats de cette analyse nous permettent de déterminer les seuils de performance du réseau pour distinguer entre les scénarios normaux et les scénarios attaqués. Toutefois, selon cette analyse, le procédé utilisant la dégradation comme une indication pour détecter une attaque de brouillage est impossible pour des applications temps réel. Par conséquent, nous proposons des nouvelles méthodes afin de détecter les attaques de brouillage temps réel. Nos méthodes permettent la détection en temps réel avec une grande précision, non seulement chez le moniteur central mais aussi au niveau de chaque véhicule. Par conséquent, les véhicules sont avertis sur l'attaque assez tôt pour récupérer la communication et réagir à ces attaques<br>The development of transportation all over the world has been providing a lot of benefits for many aspects of human life. Intelligent Transportation Systems (ITS) are advanced applications that aim to make the transport networks safer, more convenient and smarter. According to their usages, they can be classified into two types of ITS applications, which are safety applications and non-safety applications. Vehicular ad hoc network (VANET) is a key component of ITS since it enables communications among transportation units. These communications support different ITS applications with various properties. Between two types of applications, we are interested in safety applications which have tighter quality and security constraints. Depending on an applied scenario of a given safety application, the exchanged information among vehicles must be broadcast locally within one-hop communication and/or also be notified to vehicles in large range. The main objective of this thesis is to improve the performance of safety applications in term of the quality of service and security, in both one-hop communication and multi-hop communication. We focus on reliability, connectivity and Denial of Services (DoS) attack. We study and propose technical solutions coming from lower layers (Physical, MAC and network layers) which play a fundamental role in mitigation to challenges created by the nature of the vehicular environment. Firstly, we introduce a reliable scheme to achieve the reliability for broadcasting. In our scheme, the safety messages are rebroadcast when the sender is solicited. This increases the percentage of vehicles receiving the messages while duplicated messages are limited. Secondly, with consideration of the fragmentation of the network, we study solutions that overcome the temporary disconnection in the network to bring the safety information to the recipients. Based on the social properties of vehicular networks, we propose a social-based forwarding protocol to support the communication between vehicles to points of interest that provide safety services with looser time constraints, such as search and rescue. Thirdly, we investigate jamming attack, a kind of DoS attacks, which is crucial for safety applications because of the adequate condition of the attack at the lower layers. We model jamming attack on broadcasting in order to study the degradation caused by the attack on network performance. The degradation at a certain level in network performance is an indication of a jamming attack presence in the network; therefore results from this analysis will allow us to determine network performance thresholds to distinguish between normal and attacked scenarios. However, according to our analysis, the method using the degradation as an indication to detect a jamming attack is not feasible for real-time applications. Hence, we propose methods to detect jamming attacks in real-time. Our methods allow real-time detection with high accuracy, not only at the central monitor but also at each vehicle. Therefore, vehicles are noticed about the attack soon enough to recover the communication and react to these attacks
10
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.
11
Guan, Wenyang. "Adaptive QoS control of DSRC vehicle networks for collaborative vehicle safety applications." Thesis, Swansea University, 2013. https://cronfa.swan.ac.uk/Record/cronfa42507.
Full textAbstract:
Road traffic safety has been a subject of worldwide concern. Dedicated short range communications (DSRC) is widely regarded as a promising enabling technology for collaborative safety applications (CSA), which can provide robust communication and affordable performance to build large scale CSA system. The main focus of this thesis is to develop solutions for DSRC QoS control in order to provide robust QoS support for CSA. The first design objective is to ensure robust and reliable message delivery services for safety applications from the DSRC networks. As the spectrum resources allocated to DSRC network are expected to be shared by both safety and non-safety applications, the second design objective is to make QoS control schemes bandwidth-efficient in order to leave as much as possible bandwidth for non-safety applications. The first part of the thesis investigates QoS control in infrastructure based DSRC networks, where roadside access points (AP) are available to control QoS control at road intersections. After analyse DSRC network capabilities on QoS provisioning without congestion control, we propose a two-phases adaptive QoS control method for DSRC vehicle networks. In the first phase an offline simulation based approach is used to and out the best possible system configurations (e.g. message rate and transmit power) with given numbers of vehicles and QoS requirements. It is noted that with different utility functions the values of optimal parameters proposed by the two phases centralized QoS control scheme will be different. The conclusions obtained with the proposed scheme are dependent on the chosen utility functions. But the proposed two phases centralized QoS control scheme is general and is applicable to different utility functions. In the second phase, these configurations are used online by roadside AP adaptively according to dynamic traffic loads. The second part of the thesis is focused on distributed QoS control for DSRC networks. A framework of collaborative QoS control is proposed, following which we utilize the local channel busy time as the indicator of network congestion and adaptively adjust safety message rate by a modified additive increase and multiplicative decrease (AIMD) method in a distributed way. Numerical results demonstrate the effectiveness of the proposed QoS control schemes.
12
Bello, Lawal. "Power conservation and performance analysis of mobile ad hoc wireless networks." Thesis, University of Greenwich, 2013. http://gala.gre.ac.uk/10211/.
Full textAbstract:
Mobile ad-hoc network (MANET) have emerged as a new systems and the most promising fields for research and development of wireless network. As the popularity of mobile device and wireless networks significantly increased over the past years, MANET has now become one of the most vibrant and active field of communication and networks. Due to severe challenges such as the open medium, unpredicted mobility of mobile nodes, distributed and cooperative communication and inherently constrained capabilities, which manifest exhaustible sources of power. Due to the increasing demand for high-speed data services, the limited and high cost of licensed, and the future MANETs are expected to be operating at frequencies greater than 2 GHz and most of the research work in the area has been done in the frequency range of 1-2 GHz. In this thesis, a power conservation model is proposed. The proposed model is based on the conventional on-demand ad hoc routing protocols with the addition of a power model without incurring additional complexity on the existing MANET characteristics. The mobile nodes are able to computes their power their power status adaptively to decide if they are fit for packet forwarding and reception. The research illustrates the power conserving behaviour of the new technique using an analytical approach and also by computer simulations. The results have shown that power savings of more than 15% were achieved with not much delay in the network. The performance of the routing protocols in the presence of ambient noise in the network was analyzed as well as the sensitivity of MAANETs at a carrier frequencies above 2 GHz using the free space and two slope path loss model. Results show that at carrier frequency greater than 2 GHz the break point distance affects the throughput performance of the network, whilst at frequency less than 2 GHz, the throughput performance for the free space and two slope model was the same.
13
Scott, Kevon K. "Occlusion-Aware Sensing and Coverage in Unmanned Aerial Vehicle (UAV) Networks." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479816954496473.
Full text
14
Blackshear, Henry L. "Developing a conceptual unmanned aerial vehicle communications mobile AD Hoc network simulation model." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FBlackshear.pdf.
Full text
15
Garbiso, Julian Pedro. "Fair auto-adaptive clustering for hybrid vehicular networks." Electronic Thesis or Diss., Paris, ENST, 2017. http://www.theses.fr/2017ENST0061.
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
16
Alsubaihi, Badr. "Semantic and Self-Decision Geocast Protocol for Data Dissemination over Vehicle Ad Hoc Network." Thesis, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31783.
Full textAbstract:
In this work, we provide a qualitative comparison between existing geocast protocols and then we present an efficient geocast routing protocol for VANET. This protocol is a semantic and self-decision geocast routing protocol for disseminating safety and non-safety information over VANET (SAS-GP). SAS-PG initially executes an algorithm to locally determine the semantic geocast area. Then, the protocol disseminates the information in three phases: Spread, Preserve, and Assurance, which utilize the traffic information system and the digital map. SAS-GP principally employs timer-based techniques in order to avoid overhead and broadcast storm problems; nonetheless, novel factors are enhanced to calculate the timer’s values in each phase. Simulation results demonstrate effective and reliable dissemination in terms of delivery ratio and number of false warnings compared to existing protocols when evaluated in high scale and realistic scenarios. Also, SAS-GP performs faster in notifying vehicles resulting in a higher geocast distance before approaching the location of the event.
17
Alotaibi, Maryam. "Relay Selection for Heterogeneous Transmission Powers in Connected Vehicles." Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/36087.
Full textAbstract:
It is widely believed that the advances of Vehicle-to-Vehicle (V2V) communications will help to remodel the prospect of road transportation systems. By virtue of V2V communications, information generated by the vehicle control system, on-board sensors or passengers can be effectively disseminated among vehicles in proximity, or to vehicles in multiple hops away in a vehicular ad-hoc network (VANET). Without assistance from any built infrastructure, a variety of active road safety applications (e.g., Vehicle-Based Road Condition Warning, Cooperative Collision Warning, Approaching Emergency Vehicle Warning) and traffic efficiency management applications (e.g., Wrong Way Driver Warning) are enabled by inter-vehicle wireless links. The purpose of connecting vehicle technologies is to improve road safety, awareness, and transportation systems efficiency.
The Wireless Access for Vehicular Environments (WAVE) technology/Dedicated Short-Range Communications (DSRC) is the main enabling wireless technology for both V2V and vehicle-to-Infrastructure (V2I) communications. From USDOT and stakeholders detailed analysis, it is resolved that WAVE is the only viable option for critical safety and other low latency mobility and environmental applications. WAVE technology has reached to a mature stage and a basic V2V system is expected to be deployed in the next few years. In the late part of 2015, USDOT announce that WAVE is sufficiently robust to proceed with the preparation for deployment of connected vehicle environments. The USDOT has created a roadmap with preliminary plans to guide industries and public agencies implementation efforts. However, there are persisting major concerns regarding the V2V initiative needing more analysis and testing. One of the concerns is the channel congestion. Channel congestion may impact WAVE effectiveness, which may in turn impact the effectiveness of supported safety applications. Suggested solutions to mitigate congestion are focused on supporting adaptive control of the message transmission power. The Institute of Electrical and Electronics Engineers (IEEE), and European Telecommunications Standards Institute (ETSI) have included transmit power component per packet to be used for channel congestion control mechanism. The adjustment of transmission powers has created an environment of vehicles with different transmission powers. Such environment will affect the performance of the proposed protocols to disseminate warning messages. It may also affect the performance of periodic beaconing that is required by most of the safety applications. Thus far, several protocols have been proposed to help identify appropriate relay vehicles. However, such approaches neglect the fact that vehicle transmission ranges are typically heterogeneous due to different transmission power values or dynamic adjustment of power to alleviate congestion. The proper selection of relay nodes governs high delivery ratio, acceptable overall end-to-end delay and efficient bandwidth usage. In this work, area-based relay selection protocols that work in heterogeneous transmission powers are introduced. Mathematical functions are developed for a timer and decision probability to be used by each vehicle receiving the message. The values of the two functions allow the vehicle to determine if it is the next to act as relay node or not. Geometric taxonomy for all possible overlap patterns in wireless environment is constructed with the related math calculations. Moreover, an adaptive expiry time for neighbours-table entries that harmonizes with dynamic beacon scheduling is proposed.
18
Peter, Lerchbaumer Alejandro Ochoa. "Test Environment Design for Wireless Vehicle Communications." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-651.
Full textAbstract:
<p>The research in wireless communications and in-vehicle computing systems has opened up new fields of applications for transportation systems. Vehicular ad hoc networks (VANETs) emerge as a contribution to the solution of providing safer and more efficient roads and to increase passenger safety. This thesis treats different issues that influence the performance of wireless vehicle communication systems and it proposes a general design procedure for the construction of a test environment for VANETs.</p><p>A comprehensive survey of the different parameters that affect the system performance in the field of wireless vehicle communications is provided. These parameters are then analysed and quantified to serve as guidelines when identifying and designing the different components of the test environment. One such component is a simulator that enables VANET performance evaluation and allows identification of bottlenecks in the network functionality. In addition, suggestions for a hardware platform and an operating system for the development of a suitable on-board test-bed for performance measurements are presented.</p><p>The design procedure of such a test environment is intended to be used by researchers and engineers working in the field of wireless communications and ad hoc networking with special regard to the automotive sector.</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
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.
21
Gopalaswamy, Sundeep Lim Alvin S. "Dynamic clustering protocol based on relative speed in mobile ad hoc networks for intelligent vehicles." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Theses/GOPALASWAMY_SUNDEEP_4.pdf.
Full text
22
Hajlaoui, Rejab. "Résolution à base d'heuristiques du problème de routage dans les réseaux ad hoc de vehicules." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCD047/document.
Full textAbstract:
Les réseaux ad hoc véhiculaires (VANETs) sont constitués par un ensemble de véhicules qui échangent des données de sécurité et de confort même s’ils ne sont pas toujours directement à portée radio.Les problèmes liés aux réseaux VANETs ne sont pas encore tous résolus. Dans ce contexte, et dans le but de maximiser la stabilité dans ce type de réseaux, nous proposons différentes contributions pour assurer le routage en combinant les métaheuristiques et la technique de clustérisation.Tout d’abord, nous présentons un modèle de routage utilisant l’algorithme de clustérisation le plus efficace k-medoids. Ensuite, nous proposons plusieurs améliorations en utilisant les métaheuristiques, plus précisément les algorithmes génétiques, la recherche tabou et la recherche par dispersion. Enfin, nous proposons une application réelle de communication entre trois robots mobiles dans les zones non couvertes par le réseau VANET.A l’aide de diverses métriques, des simulations extensives montrent que nos contributions donnent de bons résultats par rapport à d’autres modèles conçus dans le même but<br>Vehicular ad hoc networks (VANETs) consist of a set of vehicles trying to exchange security and comfort data even if they are not directly within radio range of each other. The problems related to VANET networks are not yet solved. In this context, and in order to maximize the stability in the VANETs networks, we propose different contributions combining the metaheuristics and the clustering technique. First, we propose a routing model using the most efficient clustering algorithm K-medoids. Then, we propose several improvements using metaheuristics, more precisely the AGs, the RT and the Scatter Search. Finally, we propose a real application that uses the Arduino Uno platform to allow communication between three mobile robots in an areas not covered by the VANET network.Using various metrics, extensive simulations prove that our contributions show good results compared to other models designed for the same purpose
23
Mostafa, Ahmad A. "Packet Delivery Delay and Throughput Optimization for Vehicular Networks." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367924037.
Full text
24
Kuiper, Erik. "Mobility and Routing in a Delay-tolerant Network of Unmanned Aerial Vehicles." Licentiate thesis, Linköping University, Linköping University, RTSLAB - Real-Time Systems Laboratory, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11430.
Full textAbstract:
<p>Technology has reached a point where it has become feasible to develop unmanned aerial vehicles (UAVs), that is aircraft without a human pilot on board. Given that future UAVs can be autonomous and cheap, applications of swarming UAVs are possible. In this thesis we have studied a reconnaissance application using swarming UAVs and how these UAVs can communicate the reconnaissance data. To guide the UAVs in their reconnaissance mission we have proposed a pheromone based mobility model that in a distributed manner guides the UAVs to areas not recently visited. Each UAV has a local pheromone map that it updates based on its reconnaissance scans. The information in the local map is regularly shared with a UAV’s neighbors. Evaluations have shown that the pheromone logic is very good at guiding the UAVs in their cooperative reconnaissance mission in a distributed manner.</p><p>Analyzing the connectivity of the UAVs we found that they were heavily partitioned which meant that contemporaneous communication paths generally were not possible to establish. This means that traditional mobile ad hoc network (MANET) routing protocols like AODV, DSR and GPSR will generally fail. By using node mobility and the store-carry-forward principle of delay-tolerant routing the transfer of messages between nodes is still possible. In this thesis we propose location aware routing for delay-tolerant networks (LAROD). LAROD is a beacon-less geographical routing protocol for intermittently connected mobile ad hoc networks. Using static destinations we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.</p><br>Report code: LiU-Tek-Lic-2008:14
25
Narrainen, Jessen. "Perforance evaluation of vehicle radiofrequency communication systems : contribution to the modelling approach." Thesis, Rennes, INSA, 2017. http://www.theses.fr/2017ISAR0007/document.
Full textAbstract:
Le cadre général de cette thèse porte sur les communications véhicule à véhicule (V2V). L'objectif principal de ce type de communication est d'améliorer la sécurité routière et d'optimiser la fluidité du trafic. Les performances de systèmes de communication embarqués dépendent principalement de la configuration des antennes, du type de récepteurs utilisés (modem) et du canal de propagation. Le sujet de la thèse se concentre précisément sur l'élaboration d'un outil de simulation robuste et fiable pour optimiser les choix technologiques d'antennes et leurs implantations à bord. Il permettra de limiter ainsi le recours aux prototypes et aux essais de roulage. Dans un premier temps, nous avons proposé une méthode de type géométrique-stochastique pour modéliser des canaux de propagation d'un système de communication V2V. Cette méthode permet de définir des scénarios dynamiques et sa flexibilité nous offre l'opportunité de paramétrer les caractéristiques d'un canal de propagation. Nous montrons pour l'essentiel de quelle manière l'agencement et le nombre de diffuseurs de forme simple peuvent contribuer à influencer les statistiques de l'étalement des retards, la distribution des angles d'arrivée et les spectres Doppler. Dans la deuxième partie de ces travaux, nous nous focalisons sur la problématique d'intégration d'antenne. Il a été constaté qu'il est particulièrement utile de simplifier la maquette numérique du véhicule complet lors d'une simulation électromagnétique de l'antenne intégrée à bord de ce véhicule. De plus, dans cette section, nous avons étudié la limite de la validité de substitution d'une antenne intégrée à bord par son seul diagramme de rayonnement dans les modèles de canaux de propagation. A partir de cette étude, nous en avons déduit, que les interactions électromagnétiques avec les éléments se situant dans le champ-proche n'étaient plus valides. Ainsi, une stratégie de correction a été trouvée en considérant l'élément en champ proche dans la simulation initiale de l'antenne intégrée sur le véhicule. L'évaluation des performances d'antennes, en termes de taux d'erreurs paquet, après l'implémentation de la couche physique du standard 802. 11 p, est au cœur de la troisième partie de cette thèse. Des résultats de simulation, pour chaque configuration d'antenne, ont été donnés pour plusieurs combinaisons de paramètres de couche PHY tels que le débit et la longueur de paquet. La dernière partie de ce manuscrit traite de la présentation d'une campagne de mesure qui a été réalisée principalement dans un environnement de type rural. Les essais de roulage avaient pour but de démontrer la capacité des méthodes de simulation à faire un choix approprié d'installation d'antenne. Nous avons constaté que les tendances attendues des performances de communication en termes de PER sont globalement prévisibles à partir de notre modèle bien que nous ayons obtenu des résultats surprenants dans certains cas. Ce qui nécessitera une enquête plus approfondie<br>The general framework of this Ph.D. thesis deals with Vehicle to Vehicle (V2V) communications. This communication is principally dedicated to reinforce security through exchange of information between vehicles in case of unexpected events. The development of V2V solutions requires the understanding and merging of a number of techniques from several communication technology areas. Indeed, the performance of these systems are related to three main blocks: the implementation of the modems, the antenna configuration and the fast varying electromagnetic environment surrounding the transmitter and the receiver. The purpose of this PhD thesis is precisely to elaborate a design strategy to investigate all the different blocks constituting the communication chain. The ultimate goal is to optimize antenna selection and location on board the vehicle. In the first place, we proposed a geometry-based stochastic channel modelling approach to develop virtual dynamic scenarios. It was shown that the most common propagation environments such as rural, highway or urban-like propagation channels are reached through adjustment or numbers and location of simple metallic plates. Using this method, we are able to emulate the characteristics, such as the delay spread, angles of arrival distribution and the Doppler spectrum, of these typical driving scenarios. Moreover, we dealt with antenna integration problems in the second part of this work. A study on the simplification of numerical models of vehicles was carried out. Furthermore in this section, we investigated the limit of validity of representing the integrated antenna on board vehicle solely by its radiation pattern. We deduced from this study that the interactions with the elements present in the near-field is no longer valid. Thus, a strategy to alleviate the degree of error was found upon consideration of the near-field scatter in the a-priori simulation of the antenna integrated on the vehicle. In the third part of this thesis, we evaluated the performance of different antenna configurations in terms of packet error rate after the embodiment of the PHY layer of the LEEE 802.11p standard. Simulation results, for each antenna configurations, was given for several combinations of PHY layer parameters such as data rate and packet length. The last part of this manuscript is dedicated to the presentation of a measurement campaign that was carried out in a rural driving environment. Results obtained from these functional tests were confronted with simulation results to demonstrate the strength of the latter. We found that the expected trends in communication performance in terms of PER are globally predictable from our model though we obtained surprising results in some cases, needing further investigation
26
Bauman, Cheryl Lynn. "Autonomous Navigation of a Ground Vehicle to Optimize Communication Link Quality." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/36302.
Full textAbstract:
The wireless technology of today provides combat systems with the potential to communicate mission critical data to every asset involved in the operation. In such a dynamic environment, the network must be able maintain communication by adapting to subsystems moving relative to each other. A theoretical and experimental foundation is developed that allows an autonomous ground vehicle to serve as an adaptive communication node in a larger network. The vehicle may perform other functions, but its primary role is to constantly reposition itself to maintain optimal link quality for network communication. Experimentation with existing wireless network hardware and software led to the development, implementation, and analysis of two main concepts that provided a signal optimization solution. The first attracts the communication ground vehicle to the network subsystems with weaker links using a vector summation of the signal-to-noise ratio and network subsystem position. This concept continuously generates a desired waypoint for repositioning the ground vehicle. The second concept uses a-priori GIS data to evaluate the desired vehicle waypoint determined by the vector sum. The GIS data is used primarily for evaluating the viewshed, or line-of-sight, between two network subsystems using elevation data. However, infrastructure and ground cover data are also considered in navigation planning. Both concepts prove to be powerful tools for effective autonomous repositioning for maximizing the communication link quality.<br>Master of Science
27
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.
28
Chbib, Fadlallah. "Enhanced Cross Layer and Secure Architecture for Connected Vehicles." Thesis, Troyes, 2021. http://www.theses.fr/2021TROY0038.
Full textAbstract:
Les réseaux ad hoc de véhicules (VANET), sont déployés pour minimiser le risque d'accidents de la route et améliorer le confort des passagers. Cette thèse traite le problème de l'abandon et du retard des paquets dans les VANET en réduisant le temps d'échange des données et en améliorant le taux de livraison des paquets. Elle traite également la problématique de protection de l’architecture véhiculaire. D’abord, nous proposons une méthode pour éviter la congestion sur le canal de contrôle afin de garantir le transfert en temps réel et la fiabilité des messages de sécurité urgents. En outre, nous utilisons un réseau de neurones pour réduire le temps d'échange des données de sécurité. Deuxièmement, nous proposons deux protocoles de routage basés sur le rapport Signal/Interférence (SIR). Dans les deux protocoles, notre objectif est de maximiser le SIR global entre la source et la destination afin de sélectionner le chemin optimal. Dans le premier protocole, nous évaluons le niveau de SIR, tandis que dans le second, nous utilisons une chaîne de Markov pour prédire le niveau de SIR. Enfin, nous protégeons ces protocoles contre diverses attaques grâce à trois algorithmes anti-attaque. Dans le premier algorithme, nous créons une variable clé-valeur pour détecter la fabrication de l'adresse source au niveau du nœud intermédiaire. Dans le deuxième, nous créons un tampon et le vérifions périodiquement afin d'attraper le nœud malveillant dans le champ de destination. Enfin, le but du dernier algorithme est de découvrir l’attaque au niveau du SIR<br>Vehicular Ad hoc NETworks, known as VANETs, are deployed to minimize the risk of road accidents as well as to improve passengers comfort. This thesis deals with the problem of dropping and delaying packets in VANETs by reducing the time of exchanging data, improving the packet delivery ratio, as well as securing the vehicular architecture. First, we propose a novel method to avoid the congestion on the control channel in order to guarantee the real time transfer and the reliability of urgent safety messages. In addition, we extend the proposed method by using a neural network with various parameters such as priority of the message, sensitivity of road, type of vehicle and buffer state to reduce the time of exchanging safety data. Second, we propose two routing protocols based on signal to interference ratio (SIR). Our target in both is to maximize the overall SIR between source and destination with the aim to select the optimal path. In the first one, we evaluate the SIR level, while in the second, we use a Markov chain model to predict the SIR level. Finally, we protect these protocols from various attacks through three anti-attack algorithms. In the first algorithm, we create a key-value variable to detect the fabrication of the source address at the intermediate node. In the second one, we create a buffer and check it periodically in order to catch out the malicious node occurring at the destination field. In the last one, we discover the attack at the SIR level
29
Diallo, El-hacen. "Study and Design of Blockchain-based Decentralized Road Traffic Data Management in VANET (Vehicular Ad hoc NETworks)." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG017.
Full textAbstract:
La prolifération des véhicules autonomes a imposé la nécessité d'une gestion plus sécurisée des données du trafic routier (c'est-à-dire les événements liés aux accidents, l'état de la circulation, le rapport d'attaque, etc.) dans les réseaux Ad hoc pour véhicules (VANET). Les systèmes centralisés traditionnels répondent à ce besoin en exploitant des serveurs distants éloignés des véhicules. Cette solution n’est pas optimale, car les données relatives au trafic routier doivent être distribuées et mises en cache de manière sécurisée à proximité des véhicules. Cela améliore la latence et réduit la surcharge sur la bande passante du réseau de communication.La technologie Blockchain est apparue comme une solution prometteuse grâce à sa propriété de décentralisation. Certaines questions restent néanmoins sans réponse. Comment concevoir une validation appropriée des données du trafic routier par blockchain, qui semble plus complexe qu'une transaction financière ? Quelles sont les performances attendues dans les scénarios VANET ?Cette thèse offre des réponses à ces questions en concevant une gestion des données du trafic routier adaptée aux contraintes imposée par la blockchain. La performance ainsi que la validité des protocoles proposés sont ensuite évaluées à travers diverses simulations de scénarios pris d’un trafic routier réel.Nous proposons d'abord une adaptation du mécanisme de consensus Preuve de Travail (PoW) dans un réseau VANET, où les infrastructures situées aux bords de routes (RSUs) maintiennent une base de données décentralisée des données du trafic routier. Ensuite, une évaluation rigoureuse des performances en présence de véhicules malveillants est réalisée. Les résultats ont montré que le schéma proposé permet de construire une base de données sécurisée et décentralisée des données du trafic routier au niveau des RSUs.Ensuite, motivés par nos résultats, nous utilisons PBFT (Practical Byzantine Fault Tolerance), un mécanisme de consensus établi grâce au vote, pour réduire la latence dans le processus de validation dans une blockchain. Les RSUs validatrices de données de trafic sont sélectionnées dynamiquement en fonction de la localisation des événements du trafic. Nous proposons un nouveau schéma de réplication de la blockchain entre les RSUs. Cette réplication choisit un compromis entre les performances en termes de latence et la fréquence de réplication des blocs de la chaine. Les résultats de simulation montrent de meilleures performances, lorsque les RSUs validatrices, sont réduites au minimum.Dans la dernière partie de la thèse, nous proposons un modèle de confiance pour réduire au minimum le nombre de validatrices sans compromettre la décentralisation et l'équité de la création de blocs. Ce modèle de confiance s'appuie sur la distance géographique et la confiance des RSUs pour former dynamiquement un groupe de validateurs pour chaque bloc de la chaîne. Nous formalisons et évaluons ce modèle de réputation, en considérant divers scénarios avec des RSUs malicieuses. Les résultats démontrent l'efficacité de la proposition pour minimiser le groupe de validateurs tout en isolant les RSUs malicieuses<br>The prominence of autonomous vehicles has imposed the need for more secure road traffic data (i.e., events related to accidents, traffic state, attack report, etc.) management in VANET (Vehicular Ad hoc NETworks). Traditional centralized systems address this need by leveraging remote servers far from the vehicles. That is not an optimal solution as road traffic data must be distributed and securely cached close to cars to enhance performance and reduce bandwidth overhead. Blockchain technology offers a promising solution thanks to its decentralization property. But some questions remain unanswered: how to design blockchain-adapted traffic data validation, which is more complex than an economic transaction? What is the performance in real-world VANET scenarios?This thesis addresses those questions by designing blockchain-adapted traffic data management. The performance analysis and the validation of the proposed schemes are conducted through various simulations of real scenarios.We first adapt the PoW (Proof of Work) consensus mechanism to the VANET context whereby the RSUs (Road Side Units) maintain the decentralized database of road traffic data. After that, the proposed scheme is evaluated in the presence of malicious vehicles. The results show that the proposed approach enables a secure and decentralized database of road traffic data at the RSUs level.Next, motivated by our findings, we adopt PBFT (Practical Byzantine Fault Tolerance), a voting-based consensus mechanism, to reduce the blockchain latency. The traffic data validators are dynamically selected based on traffic event appearance location. Finally, we propose a novel blockchain replication scheme between RSUs. This scheme offers a trade-off between the blockchain latency and replication frequency. Simulation results show better performance when the validators (i.e., RSUs) are minimized.Finally, we propose a trust model to minimize the validators without compromising the decentralization and fairness of block-creation. This trust model leverages the geographical distance and the RSUs trust to dynamically form a group of validators for each block in the blockchain. We formalize and evaluate this trust model, considering various scenarios with malicious RSUs. Results show the efficiency of the proposed model to minimize the validators group while isolating malicious RSUs
30
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.
31
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.
32
Hequn, Zhang, and Wang Rui. "SIMULATION-BASED PERFORMANCE COMPARISONS OF GEOCAST ROUTING PROTOCOLS." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-25768.
Full textAbstract:
Intelligent Transportation System (ITS) is the main research domain for making road transport safer and more comfortable. For the sake of increasing the benefits of ITS, projects about Inter-Vehicle Communication (IVC) system have been proposed to make communications among vehicles possible, to exchange traffic information and avoid accidents. In order to create communication network among vehicles or between vehicles and infrastructure, Vehicular Ad hoc Networks (VANETs) has been proposed. Many applications in VANETs need to send messages to vehicles within a specific geographic region. This behavior is called geocast and this specific geographic region is called the Zone of Relevance (ZOR). Some routing protocols which are related to Geocast have been proposed in literature for VANETs. So it is significant to evaluate and compare the performance of these known Geocast routing protocols. In this thesis, categories of the routing protocols, as well as communication forwarding schemes are introduced. The routing protocols in VANETs are also summarized and compared. In order to evaluate the performance of these protocols, the evaluation methods are proposed and then a Geocast routing simulator is designed and used to simulate the Geocast network environment and several Geocast routing protocols.
33
Scone, Sion. "Opportunistic communication schemes for unmanned vehicles in urban search and rescue." Thesis, Loughborough University, 2010. https://dspace.lboro.ac.uk/2134/7269.
Full textAbstract:
In urban search and rescue (USAR) operations, there is a considerable amount of danger faced by rescuers. The use of mobile robots can alleviate this issue. Coordinating the search effort is made more difficult by the communication issues typically faced in these environments, such that communication is often restricted. With small numbers of robots, it is necessary to break communication links in order to explore the entire environment. The robots can be viewed as a broken ad hoc network, relying on opportunistic contact in order to share data. In order to minimise overheads when exchanging data, a novel algorithm for data exchange has been created which maintains the propagation speed of flooding while reducing overheads. Since the rescue workers outside of the structure need to know the location of any victims, the task of finding their locations is two parted: 1) to locate the victims (Search Time), and 2) to get this data outside the structure (Delay Time). Communication with the outside is assumed to be performed by a static robot designated as the Command Station. Since it is unlikely that there will be sufficient robots to provide full communications coverage of the area, robots that discover victims are faced with the difficult decision of whether they should continue searching or return with the victim data. We investigate a variety of search techniques and see how the application of biological foraging models can help to streamline the search process, while we have also implemented an opportunistic network to ensure that data are shared whenever robots come within line of sight of each other or the Command Station. We examine this trade-off between performing a search and communicating the results.
34
Imadali, Sofiane. "Large scale addressing and routing mechanisms for highly mobile networks of networks." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112049/document.
Full textAbstract:
Cette thèse a pour objectif de faire avancer l'état de l'art des communications basée sur Internet Protocol version 6 (IPv6) dans le domaine des réseaux véhiculaires, et ce dans le cadre des évolutions récentes de IP, notamment l'avènement du Future Internet. Le Future Internet (F.I.) définit un ensemble d'approches pour faire évoluer l'Internet actuel , en particulier l'émergence d'un Internet mobile exigeant en ressources. Les acteurs de ce domaine définissent les contraintes inhérentes aux approches utilisées historiquement dans l'évolution de l'architecture d'Internet et tentent d'y remédier soit de manière évolutive soit par une rupture technologique (révolutionnaire). Un des problèmes au centre de cette nouvelle évolution d'Internet est la question du nommage et de l'adressage dans le réseau. Nous avons entrepris dans cette thèse l'étude de ce problème, dans le cadre restreint des communications véhiculaires Internet.Dans ce contexte, l'état de l'art du Future Internet a mis en avant les distinctions des approches révolutionnaires comparées aux propositions évolutives basées sur IPv6. Les réseaux véhiculaires étant d'ores-et-déjà dotés de piles protocolaires comprenant une extension IPv6, nous avons entamé une approche évolutive visant à intégrer les réseaux véhiculaires au Future Internet. Une première proposition a été de convertir un identifiant présent dans le monde automobile (VIN, Numéro d'Identification de Véhicule) en un lot d'adresses réseau propres à chaque véhicule (qui est donc propriétaire de son adressage issu de son identifiant). Cette proposition étant centrée sur le véhicule, nous avons ensuite intégré ces communications basés dans une architecture globale Future Internet basée sur IPv6 (protocole LISP). En particulier, et avec l'adressage VIN, nous avons défini un espace d'adressage indépendant des fournisseurs d'accès à Internet où le constructeur automobile devient acteur économique fournissant des services IPv6 à sa flotte de véhicules conjointement avec les opérateurs réseau dont il dépend pour transporter son trafic IP. Nous nous sommes ensuite intéressés à l'entourage proche du véhicule afin de définir un nouveau mode de communication inter-véhiculaire à Internet: le V2V2I (Angl. Vehicle-to-Vehicle-to-Infrastructure). Jusqu'à présent, les modes de transmission de données à Internet dans le monde du véhicule consistaient en des topologies V2I, à savoir véhicule à Internet, où le véhicule accède à l'infrastructure directement sans intermédiaire. Dans le cadre des communications véhiculaires à Internet, nous proposons une taxonomie des méthodes existantes dans l'état de l'art. Les techniques du Future Internet étant récentes, nous avons étendu notre taxonomie par une nouvelle approche basée sur la séparation de l'adressage topologique dans le cluster de celui de l'infrastructure. Le leader du cluster s'occupe d'affecter les adresses (de son VIN) et de gérer le routage à l'intérieur de son cluster. La dernière contribution consiste en la comparaison des performances des protocoles de gestion de mobilité, notamment pour les réseaux de véhicules et des communications de type vehicule-à-Internet. Dans ce cadre, nous avons proposé une classification des protocoles de gestion de mobilité selon leur déploiement: centralisé (basé réseau ou host) et distribué. Nous avons ensuite évalué les performances en modélisant les durées de configurations et de reconfigurations des différents protocoles concernés<br>After successfully connecting machines and people later (world wide web), the new era of In-ternet is about connecting things. Due to increasing demands in terms of addresses, mobility, scalability, security and other new unattended challenges, the evolution of current Internet archi-tecture is subject to major debate worldwide. The Internet Architecture Board (IAB) workshop on Routing and Addressing report described the serious scalability problems faced by large backbone operators in terms of routing and addressing, illustrated by the unsustainable growth of the Default Free Zone (DFZ) routing tables. Some proposals tackled the scalability and IP semantics overload issues with two different approaches: evolutionary approach (backward com-patibility) or a revolutionary approach. Several design objectives (technical or high-level) guided researchers in their proposals. Mobility is definitely one of the main challenges.Inter-Vehicle Communication (IVC) attracts considerable attention from the research com-munity and the industry for its potential in providing Intelligent Transportation Systems (ITS) and passengers services. Vehicular Ad-Hoc Networks (VANETs) are emerging as a class of wire-less network, formed between moving vehicles equipped with wireless interfaces (cellular and WiFi) employing heterogeneous communication systems. A VANET is a form of mobile ad-hoc network that provides IVC among nearby vehicles and may involve the use of a nearby fixed equipment on the roadside. The impact of Internet-based vehicular services (infotainment) are quickly developing. Some of these applications, driver assistance services or traffic reports, have been there for a while. But market-enabling applications may also be an argument in favor of a more convenient journey. Such use cases are viewed as a motivation to further adoption of the ITS standards developed within IEEE, ETSI, and ISO.This thesis focuses on applying Future Internet paradigm to vehicle-to-Internet communica-tions in an attempt to define the solution space of Future Vehicular Internet. We first introduce two possible vehicle-to-Internet use cases and great enablers for IP based services : eHealth and Fully-electric Vehicles. We show how to integrate those use cases into IPv6 enabled networks. We further focus on the mobility architectures and determine the fundamental components of a mobility architecture. We then classify those approaches into centralized and distributed to show the current trends in terms of network mobility extension, an essential component to vehicular networking. We eventually analyze the performance of these proposals. In order to define an identifier namespace for vehicular communications, we introduce the Vehicle Identification Numbers are possible candidates. We then propose a conversion algorithm that preserves the VIN characteristics while mapping it onto usable IPv6 networking objects (ad-dresses, prefixes, and Mobile Node Identifiers). We make use of this result to extend LISP-MN protocol with the support of our VIN6 addressing architecture. We also apply those results to group IP-based communications, when the cluster head is in charge of a group of followers
35
Zaouche, Lotfi. "Sécurité et fiabilité des communications dans les réseaux d’essaims." Thesis, Compiègne, 2017. http://www.theses.fr/2017COMP2339/document.
Full textAbstract:
L’émergence de véhicules aériens sans pilote, généralement appelés drones, petits et bon marché favorise leur utilisation dans le domaine des applications civiles. Ces drones sont équipés de différents capteurs et ont la capacité de communiquer via des liaisons sans fil et ont la particularité de se déplacer librement dans l’espace, révolutionnant la gestion des applications de surveillance. Un réseau ad hoc de drones, Flying Ad hoc Networks (FANET) en anglais, est composé d’une flotte de drones autonomes et est utilisé lors de missions dans des environnements hostiles pour la surveillance ou l’inspection de sites dangereux ou inconnus. Les FANETs peuvent être également utilisés pour suivre et filmer des événements spéciaux comme une course de vélos ou un match de football, dans ce cas les liaisons doivent garantir un minimum de qualité. Les FANETs nécessitent une attention particulière en ce qui concerne l’économie d’énergie des UAV dont les ressources en énergie sont limitées, mais aussi d’être immunisés contre des attaques malveillantes. Au cours de cette thèse, nous nous sommes concentrés sur le problème de suivi d’une cible mobile utilisant une flotte de drones pour la filmer. Étant donné que la cible se déplace, les drones doivent la suivre en continu, et une liaison vers la station terrestre doit être disponible. Dans ce contexte, nous proposons une solution qui permet la coordination d’un ensemble de drones afin de maintenir un chemin optimal entre la cible et la station terrestre. Notre solution se révèle efficace en matière de gain en temps et en énergie. Nous avons également proposé une solution basée sur des protocoles hiérarchiques pour économiser plus d’énergie dans le processus de communication avec la station terrestre. Nous avons également développé une autre solution qui permet d’économiser plus d’énergie en forçant les nœuds égoïstes à participer dans le réseau et d’assurer le relais de paquets lorsqu’ils sont sollicités. En effet, si un nœud égoïste refuse de router des paquets d’autres nœuds, cela induit une charge supplémentaire pour le reste des nœuds du réseau. Nous avons validé l’apport de l’ensemble de nos solutions par évaluation de performances à l’aide de simulations<br>The emergence of small and inexpensive Unmanned Aerial Vehicles (UAVs) promotes their use in several applications. UAVs are usually equipped with different sensors and have the ability to communicate via wireless connections. Their capability to fly freely in the space offers new opportunities to monitoring and tracking applications. A Flying Ad hoc Network (FANET) is composed of a fleet of autonomous UAVs and is used for monitoring applications in hostile environments, surveillance or site inspection. FANETs could also be used for filming special events such as bike races or soccer matches, so, the connections must guarantee a minimum of quality of service. In FANETs, saving energy of UAVs that have limited battery is very challenging and protecting the network from malicious attacks is even more difficult. In this thesis, we focus on tracking and filming a moving target using a fleet of UAVs. Since the target is moving, the UAVs have to follow it continuously, and a path to the ground station must be available. In this context, we propose an efficient solution that allows the coordination of the UAVs to maintain an optimal path between the target and the ground station. The proposed solution is time and energy efficient. We also propose a solution based on hierarchical protocols to save more energy in the communication process with the ground station. Another solution that allows energy saving is to force selfish nodes to participate in the network to route received packets towards their destination. Indeed, a selfish node is concerned only about its own welfare, refusing to route packets of other node, causing an extra charge for the rest of nodes in the network. We validate our solutions through simulation campaigns
36
Tian, Bin. "Data dissemination protocols and mobility model for VANETs." Thesis, Clermont-Ferrand 2, 2016. http://www.theses.fr/2016CLF22739/document.
Full textAbstract:
Pendant les deux dernières décennies, les technologies de réseaux ad-hoc de véhicules (VANETs : Vehicular Ad-Hoc Networks) ont été développées sous l’impulsion du monde de la recherche comme de l’industrie, étant donnés les liens des VANETs avec la sécurité routière, l’internet des objets (IoT/WoT : Internet of Things/Web of Things) pour les systèmes de transport intelligents (ITS : Intelligent Transportation Systems), les villes intelligentes et les villes vertes. Composant essentiel des VANETs, les protocoles de communication inter-véhicules (IVC : Inter-Vehicle Communication) font face à des défis techniques, en particulier à cause de la diversité des applications dans lesquelles ils sont impliqués. Dans cette thèse, après une présentation des VANETs et de l’état de l’art des IVC, nous proposons un protocole de dissémination de données, TrAD, conçu pour diffuser de manière efficiente des messages d’une source vers les véhicules présents dans la zone d’intérêt (ROI : Range of Interest). TrAD se base sur les états du trafic routier et du trafic réseau pour adapter localement la stratégie et les paramètres de transmission des données afin d’optimiser les performances des applications qui l’utilisent. De plus, un algorithme de classification des clusters locaux de véhicules est conçu pour permettre l’usage de TrAD sur autoroute aussi bien qu’en ville. Pour éviter l’encombrement des canaux de communication, un mécanisme illustratif de contrôle de la congestion reposant sur une approche distribuée est utilisé. Trois protocoles IVC de l’état de l’art ont été comparés à TrAD dans des scénarios réalistes de simulation, basés sur différentes villes réelles, différents trajets et densités véhiculaires. Les performances de TrAD surpassent celles des protocoles de référence en termes de taux de délivrance des paquets (PDR : Packet Delivery Ratio), nombre de transmissions et latence. De plus, nous montrons que TrAD est tolérant, dans une certaine mesure, aux erreurs sur les données GPS. Pour s’assurer de la qualité des simulations, nous avons étudié le modèle de déplacement employé dans le simulateur de trafic, puis couplé ce dernier au simulateur de réseau, afin que les deux s’échangent des informations en temps-réel. Grâce à la compréhension acquise lors de l’analyse du modèle de déplacement, nous avons pu développer un simulateur de conduite de tramway pour la T2C (Transports en Commun de l’agglomération Clermontoise). Des tests menés sur le matériel roulant nous ont permis d’élaborer des modèles de déplacement fidèles correspondants aux diverses situations rencontrées par le tramway. L’affichage de la simulation est assuré par un flux vidéo ajusté plutôt que des images de synthèse, ce qui permet de limiter le coût de développement tout en garantissant un certain réalisme dans l’affichage. Ce projet est soutenu par la T2C pour une durée de deux ans<br>In the last two decades, Vehicular Ad hoc Network (VANETs) were developed significantly by both academic institute and industries association, since VANETs originate from traffic safety and are also an important application of Internet of Things / Web of Things (IoT/WoT) for Intelligent Transportation System (ITS), Intelligent Vehicles and Smart Cities. As an essential component of VANETs, Inter-Vehicle Communication (IVC) protocols face many critical challenges, in particular, because they relate to various specific applications. In this thesis, after elaborating on related knowledge of VANETs and state-of-the-art of IVC protocols, we propose a data dissemination protocol for vehicular networking, named TrAD, to disseminate efficiently warning messages from a source to vehicles in a range of interest (ROI). TrAD considers the status of road traffic and network traffic to adapt locally the strategy and the parameters of transmissions in order to optimize the global performance of IVC application. Moreover, a local vehicular cluster classification algorithm is designed to support TrAD to be performed in both highway and urban scenarios. In addition, an illustrative congestion control mechanism is used to avoid channel congestion using a distributed approach. Three state-of-the-art IVC protocols have been compared with TrAD by means of realistic simulations. The performance of all those protocols is evaluated quantitatively in various scenarios by taking into account different real road maps, trafic routes and vehicular densities. Compared with the reference protocols, TrAD gains an outstanding overall performance in terms of packet delivery ratio, number of transmissions and delay. Furthermore, TrAD also can tolerate a reasonable degree of GPS drift while achieving efficient data dissemination. In order to ensure the quality of simulations, we deeply investigated the mobility model of road traffic simulator, and then performed the bidirectionally coupled simulation in which the network simulator and the road trafic simulator can exchange information in real-time. Upon understanding of the mobility model, we obtained a chance to develop a low-cost tram simulator for the local public transportation provider, the T2C (Transports en Commun de l’agglomération Clermontoise). We attempt to design accurate mobility models from different scenarios for the specific type of tram used by T2C. Real world trials are carried out to explore the key parameters required by theoretical deduction for our mobility model. Moreover, the display GUI relies on a video stream, rather than 3D graphics, which can reduce the cost while guaranteeing the quality of service. This project was supported for two years by T2C
37
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
38
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
39
Said, Dhaou. "Modèles et protocoles pour les interactions des véhicules électriques mobiles avec la grille." Thèse, Université de Sherbrooke, 2014. http://hdl.handle.net/11143/6055.
Full textAbstract:
Dans de proches années, les véhicules électriques (VEs) vont faire leur apparition massive sur les marchés. Cela peut avoir un impact important sur le fonctionnement des réseaux d’électricité actuels qui devront ajuster leur fonctionnement à la nouvelle demande massive d'électricité provenant des VEs. Par contre, les VEs peuvent aussi être vus comme une nouvelle opportunité dans le futur marché d’électricité. En effet, une décharge/recharge intelligente peut permettre aux VEs d’être un support de stockage d’électricité important, valable, et permanent dont la capacité croit en fonction du nombre des VEs.
Ce projet a comme objectifs de : (1) proposer un schéma d’interaction V2G (Vehicle-to-Grid) intégrant des techniques permettant de : (a) adapter le fonctionnement de la grille aux contraintes temporelles et spatiales relatives au processus de recharge des VEs dans un milieu résidentiel. On cherchera à satisfaire de différentes demandes en puissance des VEs branchés au secteur sans trop stresser la grille intelligente, (b) optimiser les opérations de chargement/déchargement entre les VEs et la grille dans les deux sens. (2) Proposer de nouveaux schémas de communication sans fil, entre les VEs et la grille intelligente loin des bornes de recharge, qui soient basés sur les standards de communications véhiculaires (VANETs) ainsi que sur d’autres standards de communication à grande échelle. On introduira des techniques d’accès à la grille intelligente pour négocier le coût de recharge/décharge des batteries, le temps d’attente du service, les emplacements et aussi pour planifier la motivation du consommateur afin de favoriser la stabilité de la grille.
40
Diao, Xunxing. "A resource-aware embedded commucation system for highly dynamic networks." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00715649.
Full textAbstract:
Chaque année en Europe, 1.300.000 accidents de la route ont comme conséquence 1.700.000 blessés. Le coût financier d'accidents de la route est évalué à 160 milliards d'euros (approximativement le même coût aux Etats-Unis). VANET (Vehicular Ad-hoc NETwork) est une des technologies clés qui peut permettre de réduire d'une façon significative le nombre d'accidents de la route (e.g. message d'urgence signalant la présence d'un obstacle ou d'un véhicule en cas de brouillard). En plus de l'amélioration de la sécurité et du confort des conducteurs et des passagers, VANET peut contribuer à beaucoup d'applications potentielles telles que la prévision et la détection d'embouteillages, la gestion d'infrastructure de système de transport urbain (e.g. système de transport intelligent multimodal) etc. Dans cette thèse, je présenterai un système embarqué dédié à la communication inter-véhicule particulièrement pour les applications sécuritaires de passagers et de conducteurs. Nos efforts de recherche et de développement sont centrés sur deux principaux objectifs : minimiser le temps de latence intra-noeud et le délai de communication inter-véhicule en prenant en compte le changement dynamique du VANET. De ce fait pour atteindre ces objectifs, des nouvelles approches (e.g. inter-couche 'Cross-layering') ont été explorées pour respecter les contraintes de ressource (QoS, mémoire, CPU et énergie de la communication inter-véhicule) d'un système embarqué à faible coût. Le système de communication embarqué proposé comporte deux composants logiciels principaux : un protocole de communication dénommé CIVIC (Communication Inter Véhicule Intelligente et Coopérative) et un système d'exploitation temps réel appelé HEROS (Hybrid Event-driven and Real-time multitasking Operating System). CIVIC est un protocole de communication géographique à faible consommation énergétique et à faible temps de latence (délai de communication). HEROS gère contextuellement l'ensemble du système (matériel et logiciel) en minimisant le temps de latence et la consommation des ressources (CPU et mémoire). En outre, le protocole de communication CIVIC est équipé d'un système de localisation LCD-GPS (Low Cost Differential GPS). Pour tester et valider les différentes techniques et théories, la plateforme matérielle LiveNode (LImos Versatile Embedded wireless sensor NODE) a été utilisée. En effet, la plateforme LiveNode permet de développer et de prototyper rapidement des applications dans différents domaines. Le protocole de communication CIVIC est basé sur la technique de 'broadcast' à un saut ; de ce fait il est indépendant de la spécificité du réseau. Pour les expérimentations, seule la norme d'IEEE 802.15.4 (ZigBee) a été choisie comme médium d'accès sans fil. Il est à noter que le médium d'accès sans fil ZigBee a été adopté comme le médium standard pour les réseaux de capteurs sans fil (RCSFs) et le standard 6LoWPAN ; car il est peu coûteux et peu gourmand en énergie. Bien que le protocole de communication à l'origine soit conçu pour répondre aux exigences de VANET, ses domaines d'application ne sont pas limités à VANET. Par exemple il a été utilisé dans différents projets tels que MOBI+ (système de transport urbain intelligent) et NeT-ADDED (projet européen FP6 : agriculture de précision). Les VANETs et les RCSFs sont les réseaux fortement dynamiques, mais les causes de changement topologique de réseau sont différentes : dans le réseau VANET, il est dû à la mobilité des véhicules, et dans le RCSF, il est dû aux pannes des noeuds sans fil. Il est à noter que le VANET et le RCSF sont généralement considérés comme un sous-ensemble du réseau MANET (réseau ad-hoc mobile). Cependant, ils sont réellement tout à fait différents du MANET classique, et leurs similitudes et différences seront expliquées en détail dans la thèse. La contribution principale de mes travaux est le protocole CIVIC, qui échange des messages en basant sur l'information géographique des noeuds (position). Les travaux relatifs de la thèse se concentreront sur les techniques, les problèmes et les solutions de routage géographique, mais d'autres techniques de routage seront également adressées. Quelques projets relatifs au protocole de communication ont été étudiés mais leur implémentation et les aspects d'expérimentation n'ont pas été détaillés. Enfin la thèse ne présente pas simplement les techniques et concepts adoptés, et les résultats de simulation, mais en outre, elle expliquera les aspects techniques importants pour la réalisation et l'expérimentation des différentes applications ainsi que les résultats concrets obtenus.
41
Suh, Kyungjoo. "CRYPTO-AD-HOC network an ad hoc network protocol embedded cryptography /." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000164.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2002.<br>Title from title page of source document. Document formatted into pages; contains x, 80 p.; also contains graphics. Includes vita. Includes bibliographical references.
42
Bu, Shengrong. "Wireless ad-hoc control networks." Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060316.151756/index.html.
Full text
43
Huang, E. "Rethinking mobile ad hoc networks." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.604708.
Full textAbstract:
This thesis explores the physical layer feasibility, performance and limitations of MANETs through simulation and evaluation of a novel application scenario. The results of the work are intended to help researchers understand how and where MANETs can be used in the future, as well as to better understand physical layer considerations and methods of improving the physical layer performance of large scale, highly mobile MANETs. The thesis also investigates the effect and feasibility of using fixed relay or dispatch points that act as intermediate relays or source/sinks for messages. The results show the relative benefits of using relays vs. dispatch points, as well as the differences owing to the position, configuration and number of fixed points. We are then able to deduce the optimum configuration and type of fixed nodes to use to achieve the best results under various circumstances. Given the limited unlicensed spectrum available and the potentially high number of nodes in a bounded area, it is likely that interference will become a significant limiting factor for performance. The thesis explores this and other related issues to discover the significance of their effects and the necessary bounds for reasonable performance. We also explore the use of various techniques to mitigate these effects. The thesis concludes by investigating the issue of cooperation incentives. Without sufficient nodes cooperating to provide relaying functions, a MANET cannot function properly. Consequently various proposals have been made which provide incentives for individual users of a MANET to cooperate with each other. We examine the drawbacks of currently proposed incentive systems and propose a new solution.
44
Gudapati, Supriya. "Securing mobile ad hoc networks." Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1604882.
Full textAbstract:
<p> Wireless sensor networks has been growing rapidly over the past few decades. Due to their flexibility, wireless sensor networks have been in practice in many areas. Unlike other network architectures, Mobile Ad hoc networks (MANETs) have no central architecture; every node is free to work both as a transmitter and receiver and it depends on neighboring nodes to send relay messages. Due to their advantages, MANETs are used in many different applications like health care and military. However the wide distribution of MANETs makes it vulnerable to malicious attacks. Hence it is necessary to design a secure system for MANETs. In this report, we implement a secure system named Enhanced Adaptive Acknowledgement especially for MANETs. To ensure higher security and reduce the network overhead and delay, we use a different approach called hybrid cryptography in our proposed scheme. Enhanced Adaptive Acknowledgment detects higher malicious attackers without greatly disturbing the network performances. In the simulation we compare the differences within the Enhanced Adaptive Acknowledgment (EAACK) before and after introducing the Hybrid cryptography approach.</p>
45
Panagos, Adam. "Cognitive Ad-hoc Wireless Networks." International Foundation for Telemetering, 2006. http://hdl.handle.net/10150/604141.
Full textAbstract:
ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California<br>Spectrum allocation in wireless communication and telemetry systems of the future may be performed
in a dynamic and distributed manner, as opposed to static centralized regulations currently
in place. This paper surveys a new area of research in the communications field known as cognitive
radio which will allow dynamic sharing of spectral bands. An introduction to cognitive radio, a
review of existing research results, and discussion of open problems in the area is provided.
46
Patibandla, Siva Teja. "Development of Mobile Ad-Hoc Network for Collaborative Unmanned Aerial Vehicles." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3155.
Full textAbstract:
The purpose of this research was to develop a mobile ad-hoc network for collaborative Unmanned Aerial Vehicles (UAVs) based on a mesh networking standard called IEEE 802.11s. A low-cost, small form-factor, IEEE 802.11a based wireless modem was selected and integrated with the existing flight control system developed at Virginia Commonwealth University (VCU) UAV Laboratory. A self-configurable user-space application on the wireless modem was developed to provide functionality to collaborative algorithms, and to monitor the performance of the wireless network. The RAMS simulator, developed at VCU, was upgraded to support the simulation of advanced networking capabilities by integrating with a simulator called ns-3. The reconfigurability and performance of the IEEE 802.11s mesh network was validated and evaluated by conducting real-world flights. The results show that the IEEE 802.11s is a promising solution for collaborative UAV applications.
47
Khan, Mohammad Irfan. "Multi-Service Resource Orchestration for Vehicular Safety Communications." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS639.
Full textAbstract:
Le contrôle de congestion des canaux sans fil pour la communication véhiculaires (V2X) basée sur IEEE 802.11p ont été conçus pour un seul service de sécurité routière notamment ‘Cooperative Awareness’. Les futurs véhicules connectés seront basés sur plusieurs services V2X, avec un besoin de communication hétérogène, auxquels les mécanismes existants ne répondent pas. Dans cette thèse, on analyse plusieurs protocoles de contrôle de congestion et d’allocation de ressources de canaux, normalisés en Europe pour le déploiement V2X initial. Nous présentons des problèmes liés à l’approche existante, notamment l’utilisation inefficace de la capacité des canaux, la coordination dans la pile protocolaire, la gestion des ressources parmi plusieurs services et l’allocation des ressources pour un besoin asymétrique par les véhicules. On propose des améliorations en tenant compte des exigences des futurs scénarios V2X. Nous montrons les limites de la classification statique des services V2X pour la qualité de service et proposons une classification dynamique. Nous concevons un orchestrateur de ressources afin d'améliorer la coordination dans la pile protocolaire et de répartir dynamiquement la ressource de canal parmi plusieurs services d'un véhicule. En outre, on présente un mécanisme permettant d'orchestrer de manière décentralisée les ressources de canal parmi une distribution mixte de véhicules ayant des exigences d'utilisation de canal diverse, dans un canal de communication congestionné. Les résultats analytiques et résultats par simulations montrent la validité de notre approche qui améliore la performance des applications V2X, par rapport aux protocoles standardisés existants<br>Wireless channel congestion control and decentralized resource allocation for 802.11p based V2X communication have been widely investigated for a single Cooperative Awareness service, considering mostly homogenous communication requirement per vehicle. Future connected vehicles will be based on multiple V2X services, with heterogenous number of services and communication needs, which existing resource allocation mechanisms does not address. In this thesis, we analyze several decentralized congestion control and channel resource allocation protocols standardized in Europe for initial V2X deployment. We present issues with the existing approach, in particular the inefficient channel capacity utilization, problematic cross layer coordination, inability to balance resources among multiple V2X safety services and distributed resource allocation for asymmetric number of services per vehicle. We propose improvements to the shortcomings, considering the requirements of future V2X scenarios. We demonstrate the limitations of classifying V2X services using static priority for Quality of Service and propose dynamic prioritization. We design a resource orchestrator at the Service Layer to improve cross layer coordination and dynamically distribute the limited channel resource among multiple services of a vehicle. Furthermore, we present a mechanism to decentrally orchestrate channel resource among a mixed distribution of vehicles with diverse channel usage requirements under channel congestion. Analytical and simulation-based results show the validity of our proposed approach, and the V2X application performance improvement it renders, compared to existing standardized protocols
48
Fokine, Klas. "Key Management in Ad Hoc Networks." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1351.
Full textAbstract:
<p>This thesis covers the issue of securing ad hoc networks. Such networks exhibit a number of characteristics that make such a task challenging. One of the major challenges is that ad hoc networks typically lack a fixed infrastructure both in form of physical infrastructure such as routers, servers and stable communication links and in the form of an organizational or administrative infrastructure. Another difficulty lies in the highly dynamic nature of ad hoc networks since new nodes can join and leave the network at any time. </p><p>The major problem in providing security services in such infrastructure less networks is how to manage the cryptographic keys that are needed. In order to design practical and efficient key management systems it is necessary to understand the characteristics of ad hoc networks and why traditional key management systems cannot be used. These issues are covered and the thesis also provides a summary of those key management solutions that have been proposed in the research literature so far.</p>
49
Johnsen, Lotte. "Content Distribution in Ad Hoc Networks." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9467.
Full textAbstract:
<p>Multicast is used to send data to many receivers simultaneously. Multicast protocols developed for wired networks are not suitable for a Mobile Ad Hoc Network (MANET), mainly because the mobile nodes create a changing topology, and the capacity of the nodes and the links are low compared to a wired network. Hence, it is a challenge to distribute information in an Ad Hoc network. A goal for this Masters thesis work has been to investigate content distribution in mobile ad hoc networks to find possible ways to reduce necessary volume of distribution data. Scaling according to available bandwidth and alternative distribution methods to multicast has been investigated. A test architecture consisting of different components useful for content distribution has been configured and tested. Essential components have been: Multicast OLSR (MOLSR); a multicast plugin for the MANET protocol Optimized Link State Routing Protocol (OLSR), to forward multicast data File Delivery over Unidirectional Transport (FLUTE); a protocol that supports sending multicast data in several layers Linux Fedora Core 5 operating system including IEEE 802.11b Wireless Local Area Network (WLAN) adapters A topology emulator to simulate different topologies The first tests were performed using three nodes. Different bit rates and packet sizes were tested to find the best throughput. After adding two more nodes to the network it became clear that the multicast forwarding did not work properly. Many of the first tests have thus given misleading results. After finding an explanation to the multicast forwarding fault, a modification to the test architecture was done; use an older version of Linux Fedora Core. The new test results then showed that it is possible to forward multicast data using FLUTE on a MANET. As expected, the nodes receive a larger amount of the file sent as the number of hops is decreased; up to 100 percent after one hop, whereas up to 80 percent after four hops. Also, test results showed that low data rates give better throughput than high rates. The best throughput was given after resending the FLUTE session several times. The performance of ad hoc networks is less trustworthy than wired / fixed networks. The amount received varies from 0 to 100 percent. The testing of layering using FLUTE did not give any improvements. However, layered content was not available, so all the channels had the same content. Suggestions to possible ways to provide layered content are described. The concept of layering is still interesting for MANETs since it provides the ability for nodes with low capacity to receive less content than nodes with high capacity in a relatively simple way. Further tests are needed to see the results using layered content. When implementations of codec frameworks become more available, these may be great for scaling in ad hoc networks.</p>
50
Kobosko, Kristoffer, and Henrik Wallentin. "Mobile Groups in Ad-hoc Networks." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-108036.
Full textAbstract:
<p>Most current research on Mobile Ad-hoc NETworks (MANETs) concerns one ad-hocnetwork at a time. A common topic is how to handle the merging of new nodesappearing in range of an existing MANET into a new, larger network. CurrentMANET implementations do not define the handling of policies for controllingmembership or routing messages, neither do they support policy-based inter-MANETrouting.</p><p>In this thesis, we present an implementation of Mobile Group Protocol (MGP) whichenhances the reactive routing protocol AODV with an administrative framework inwhich Mobile Ad-hoc NETwork (MANET) policies are defined. Such policies are usedto control membership and signaling in a MANET. We define new roles for theMANET members such as nodes, leaders and gateways. We discuss the messageexchange taking place during forming of Mobile Groups (MGs) and study the theparticular implementation by simulating a group of simple MGP scenarios usingNetwork Simulator 2 (NS-2).</p><p>We conclude our work by discussing the using of MGP as a base for an inter-MANETrouting protocol providing policy-based routing in MANETs.</p>