Recently a number of communications schemes have been proposed for Vehicular Ad hoc Networks (VANETs). One of these, the Universal Geocast Scheme (UGS) proposed by Hossein Pishro-Nik and Mohammad Nekoui, provides for a diverse variety of VANET-specific characteristics such as time-varying topology, protocol variation based on road congestion, and support for non line-of-sight communication. In this research, the UGS protocol is extended to consider inter-vehicle multi-hop connections in intersections with surrounding obstructions along with single-hop communications in an open road scenario. Since UGS is a probabilistic, repetition-based scheme, it supports the capacity-delay tradeoffs crucial for periodic safety message exchange. The approach is shown to support both vehicle-to-vehicle and vehicle-to-infrastructure communication. This research accurately evaluates this scheme using network (NS-2) and mobility (SUMO) simulators, verifying two crucial elements of successful VANETs, received packet ratio and message delay. A contemporary wireless radio propagation model is used to augment accuracy. Results show a 6% improvement in received packet ratio in intersection simulations combined with a decrease in average packet delay versus a previous, well-known inter-vehicle communication protocol.

The development of ubiquitous mobile computing devices has fueled the need for dynamic reconfigurable networks. Mobile ad-hoc network (MANET) routing protocols facilitate the creation of such networks, without centralized infrastructure. One of the challenges in the study of MANET routing protocols is the evaluation and design of an effective routing protocol that works at low data rates and responds to dynamic changes in network topology due to node mobility. Several routing protocols have been standardized by the Internet Engineering Task force (IETF) to address ad-hoc routing requirements. The performance of these protocols are investigated in detail in this thesis. A relatively new approach to ad-hoc routing using the concept of a Minimal Connected Dominating Set (MCDS) has been developed at Virginia Tech. The OSPF-MCDS routing protocol is a modified version of the traditional Open Shortest Path First (OSPF) wired routing protocol which incorporates the MCDS framework. Enhancements to the protocol implementation to support multiple-interface routing are presented in this thesis. The protocol implementation was also ported to ns-2, a popular open source network simulator. Several enhancements to the implementation and simulation model are discussed along with simulation specifics. New scenario visualization tools for mobility pattern generation and analysis are described. A generic framework and tutorial for developing new ad-hoc routing simulation models are also presented. The simulation model developed is used to compare the performance characteristics of OSPF-MCDS to three different standardized MANET routing protocols. Simulation results presented here show that no single protocol can achieve optimal performance for all mobility cases. Different observations from simulation experiments are summarized that support the likely candidate for different mobility scenarios. / Master of Science

Récemment, dans la recherche automobile et dans le domaine des transports intelligents,plusieurs projets intéressants ont été menés afin de diminuer le nombre d’accidents. Lors du développement de ces projets, de nouveaux systèmes d’aide à la conduite ont été proposés,comme les systèmes de prévention de collision, d’aide à la vision de nuit et à la navigation.Ces études ont permis de proposer de nouvelles perspectives telles que les systèmes d’aide à la conduite coopératifs, en utilisant la communication entre les véhicules ou entre les véhicules et l’infrastructure basée sur les réseaux VANETs. Pour évaluer l’impact de systèmes ADAS sur l’amélioration de la sécurité routière et la réaction du conducteur, il est indispensable d’utiliser des outils flexibles et efficaces. Des métriques intéressantes sont ainsi proposées dans le but de tester la performance de ces systèmes. La plateforme LaRA qui est équipée de plusieurs capteurs et d’un système d’acquisition en temps réel nous a fourni une base de données réelles de position et de vitesse. Ces données sont traitées et analysées afin de calculer les métriques de performances tels que : la distance entre véhicules et le temps à collision. Nous avons proposé dans cette thèse une nouvelle méthodologie de développement pour le prototypage de systèmes ADAS. Cette méthodologie dédiée aux systèmes ADAS coopératifs, combine les données de plusieurs modules tels que : le module de vision, le module de communication V2V et le module de géo-localisation GPS. Un des problèmes majeurs des systèmes ADAS communicants concerne la qualité et la robustesse de la communication. Elle est fonction d’un grand nombre de paramètres qu’il faut modéliser pour pouvoir évaluer la fiabilité du système d’aide à la conduite.Nous proposons ainsi, un système de prototypage basé sur le principe de la réalité augmentée,dans lequel nous pouvons rejouer des données réelles et modifier des paramètres de l’environnement de communication. Nous avons mis en œuvre notre méthodologie avec la réalisation d’un système d’alerte coopératif entre les véhicules. Les données du système de géolocalisation GPS et les protocoles de routage ont été des éléments primordiaux pour la simulation du modèleV2V sous le simulateur ns-2. L’étape de la simulation du protocole avec les données réelles a été suivie par l’intégration des résultats de simulations dans le nouveau prototype développé sous RTMaps. La mise en œuvre du système d’alerte a permis d’estimer le nombre de pré-collisions détectées dans les deux situations réelle et simulée. L’écart entre ces deux dernières a été étudié et analysé pour plusieurs scénarios qui correspondent aux différentes situations routières. / During the last recent years, ADAS systems such as collision warning, tracking, night vision and navigation systems have been developed. The development of these systems has witness eda growing importance, as they are expected to help improving both road safety and traffic efficiency. More over, they have an ability to enhance the communication between the road infrastructure and the vehicle or between vehicles for safer and efficient transportation services such as : embedded advance collision, collision avoidance and automatic control. In addition,given the rapidly increasing interest in wireless communications, cooperative ADAS define anew framework of autonomous inter vehicular communication which operates on the assumption that such vehicles consist of a multitude of coordinated advanced sensory technologies.Sensors acquire real-time data about road conditions to help the driver respond effectively by sending appropriate messages between vehicles. In addition, these data help to assess the performance of ADAS in the context of improving driver behavior. It is necessary to set some main metrics such as inter-vehicle distance, driver reaction time and time to collision. The messages are transmitted to drivers using vehicular Ad-hoc networks (VANETs) which are a specific type of Mobile Ad-hoc Networks hold the promise to contribute to safe and more efficient roadways.In this thesis we proposed a new methodology of development to prototype ADAS. This methodology dedicated to cooperative ADAS drove us to implement a new simulated frameworkof prototyping system. This framework combines the data from three models : Geo-localizationGPS, vision and V2V communication towards an application of anti-collision warning system. A major problem in communicating ADAS systems is the quality and robustness of the communication.It depends on a large number of parameters that must be modeled to assess there liability of these systems. We developed a new prototyping system based on the principle ofaugmenting the reality in which we can replay actual data and change settings of communication environment. The GPS data and routing protocols were crucial elements for V2V model simulation into ns-2 simulator. We have performed real tests on the experimental prototyping platform LaRA. Multiple results are presented to show up the constancy of the method and the performance efficiency of real-time multi sensors in an integrated framework for collision avoidance applications. Results of this research have shown that IVCs simulations system provides enhanced data for the verification of features of new ADAS. The results of routing protocols simulation with real-time location data are integrated in the new developed prototype. The implementation of the system warning was used to estimate the number of pre-collisions detected in both real and simulated situations. The difference between these two situations was studied and analyzed for several scenarios corresponding to different road situations.

Les réseaux de capteurs sans fil (RCSF) sont des réseaux ad hoc généralement constitués d’entités autonomes miniaturisées appelés noeuds capteurs pouvant communiquer entre eux par liaison radio. Les RCSF ont suscité beaucoup d’engouement dans la recherche scientifique en raison notamment des nouveaux problèmes de routage sous forte contrainte de durée de vie du réseau et de faibles capacités des noeuds.Ce type de réseau diffère des réseaux filaires par ses caractéristiques et limitations qui ont motivé le développement d’une nouvelle approche de conception cross-layer ignorant certains paradigmes de l’approche classique permettant l’échange mutuel d’informations même entre couches non adjacentes. Cette approche qui n’est pas encore standardisée, a démontré son intérêt à travers plusieurs travaux visant un meilleur compromis entre consommation d’énergie et une certaine qualité de service.Nos contributions peuvent être classées en deux catégories suivant la stratégie de routage à savoir le routage ad-hoc et le routage suivant la technique de clustering.Dans la première partie, nous proposons une architecture cross-layer, modulaire, adaptable et extensible nommée XL-AODV (cross layer AODV) basée sur l'échange du SNR (Signal-to-Noise-Ratio) entre la couche réseau et la couche physique qui a été modélisée par la distribution K. Nous évaluons sous le simulateur NS2 les performances de notre approche XL-AODV. Une analyse comparative avec AODV, a montré pour différentes configurations de réseaux, l’efficacité de notre proposition en termes de gains énergétiques et de latence de bout en bout.Pour la deuxième partie, nous proposons une première approche XL-LEACH qui constitue une amélioration de la version originale de LEACH, en l'adaptant aux réseaux de capteurs denses et à grande échelle tout en tenant compte des caractéristiques de la couche physique modélisée par la distribution K. Dans une troisième partie, nous introduisons une amélioration de XL-LEACH par l'approche dite, XL-CLEACH (XL Cooperative LEACH) en intégrant la communication coopérative au niveau MAC. Nous avons prouvé par une étude analytique qui a été validée par les simulations, le gain apporté en termes de consommation d’énergie, de la durée de vie du réseau et du TES (Taux d'Erreur Symbol). Les architectures XL-LEACH et XL-CLEACH ont été implémentées sous MATLAB. / Wireless sensor networks (WSN) can be defined as an ad hoc network consisting of miniaturized autonomous entities, called sensor nodes which communicate with each other over a radio link. WSNs is a research topic which has gained a lot of interest due, in particular, to new routing problems under low node capacity and high network lifetime constraints.WSNs differ from wired networks in their characteristics and limitations which have motivated the development of a new cross-layer design that ignores certain paradigms of the classical approach allowing the mutual exchange of information even between non-adjacent layers. This approach, which is not yet standardized, has gained a lot of attention through several works aiming to energy consumption minimization under a required QoS (Quality of Service).In this thesis, our contributions can be classified are twofold according to the considered routing strategy namely the ad-hoc routing and clustering based routing.In the first part, we propose a new adaptable and extensible cross-layer design called XL-AODV (Cross Layer AODV) based on the exchange of the SNR (Signal-to-Noise-Ratio) between the network and the physical layer which has been modelled by the K distribution.We evaluate under the NS2 simulator, the performance of XL-AODV. A comparative analysis with AODV, showed for different network configurations, the efficiency of our proposition in terms of energy saving and end-to-end latency.In the second part, we propose an XL-LEACH approach which is an improvement of the original version of LEACH by its adapting to dense and large scale sensor networks. We have also taken into account the characteristics of the physical layer modelled by the K distribution.In a third part, XL-CLEACH (XL Cooperative LEACH) approach is introduced to improve XL-LEACH by integrating the cooperative communication at the MAC layer.We have proved through an analytical study and validated by simulations, the gain in terms of energy consumption, network lifetime and SER (Symbol Error Rate). The XL-LEACH and XL-CLEACH architecture were implemented under MATLAB.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

The use of smart grids is a reality in several developed countries, being a natural evolution for the electrical grids of any developing country, like Brazil. This evolution takes place through the interaction of communication systems with the electrical grids in a bidirectional communication of both data and energy flow using different protocols and communication technologies. Its validation occurs by the physical installation of equipments, or alternatively by computational simulators. This paper demonstrates through simulation the use viability of DNP3 (Distributed Network Protocol) encapsulated over TCP/IP over PLC (Power Line Communication). The network simulator software NS-2 was employed for PLC channel modeling and DNP3 implementation. Some quality parameters, such as packet loss, latency and thoughput, were evaluated under several scenarios. / A utilização de redes inteligentes de energia é uma realidade em diversos países desenvolvidos, sendo uma evolução natural para a rede elétrica de qualquer país em vias de desenvolvimento, como é o caso do Brasil. Essa evolução dá-se por uma interação dos sistemas de comunicação com as redes elétricas, em uma comunicação bidirecional, tanto de dados como de fluxo de energia, utilizando para isso protocolos e tecnologias de comunicação diferentes, cuja validação ocorre com uma instalação física dos equipamentos associados, ou, como alternativa, por simulação computacional. Este trabalho demonstra através de simulações a viabilidade do uso do protocolo DNP3 (do inglês Distributed Network Protocol) encapsulado em TCP/IP e em PLC (do inglês Power Line Communication) para aplicações em redes inteligentes, exceto para atividades que necessitem de comunicação em tempo real. Foram empregados o software de simulação de redes NS-2 para modelagem do canal PLC e do protocolo DNP3 e verificados parâmetros de qualidade, como perda de pacotes, latência e vazão de dados sob diversos cenários de aplicações. / São Cristóvão, SE

Vehicular networks are an emerging technology that offer potential for providing a variety of new services. However, extending vehicular networks to include IP connections is still problematic, due in part to the incompatibility of mobile IP handovers with the increased mobility of vehicles. The handover process, consisting of discovery, registration, and packet forwarding, has a large overhead and disrupts connectivity. With increased handover frequency and smaller access point dwell times in vehicular networks, the handover causes a large degradation in performance. This thesis proposes a predictive handover solution, using a combination of a Kalman filter and an online hidden Markov model, to minimize the effects of prediction errors and to capitalize on advanced handover registration. Extensive simulated experiments were carried out in NS-2 to study the performance of the proposed solution within a variety of traffic and network topology scenarios. Results show a significant improvement to both prediction accuracy and network performance when compared to recent proposed approaches.

<p>The success of the current Internet relies to a large extent on a cooperation between the users and the network. The network signals its current state to the users by marking or dropping packets. The users then strive to maximize the sending rate without causing network congestion. To achieve this, the users implement a flow-control algorithm that controls the rate at which data packets are sent into the Internet. More specifically, the <i>Transmission Control Protocol (TCP)</i> is used by the users to adjust the sending rate in response to changing network conditions. TCP uses the observation of packet loss events and estimates of the round trip time (RTT) to adjust its sending rate. </p><p>In this thesis we investigate and propose stochastic models for TCP. The models are used to estimate network performance like throughput, link utilization, and packet loss rate. The first part of the thesis introduces the TCP protocol and contains an extensive TCP modeling survey that summarizes the most important TCP modeling work. Reviewed models are categorized as renewal theory models, fixed-point methods, fluid models, processor sharing models or control theoretic models. The merits of respective category is discussed and guidelines for which framework to use for future TCP modeling is given. </p><p>The second part of the thesis contains six papers on TCP modeling. Within the renewal theory framework we propose single source TCP-Tahoe and TCP-NewReno models. We investigate the performance of these protocols in both a DropTail and a RED queuing environment. The aspects of TCP performance that are inherently depending on the actual implementation of the flow-control algorithm are singled out from what depends on the queuing environment.</p><p>Using the fixed-point framework, we propose models that estimate packet loss rate and link utilization for a network with multiple TCP-Vegas, TCP-SACK and TCP-Reno on/off sources. The TCP-Vegas model is novel and is the first model capable of estimating the network's operating point for TCP-Vegas sources sending on/off traffic. All TCP and network models in the contributed research papers are validated via simulations with the network simulator <i>ns-2</i>. </p><p>This thesis serves both as an introduction to TCP and as an extensive orientation about state of the art stochastic TCP models.</p>

The success of the current Internet relies to a large extent on a cooperation between the users and the network. The network signals its current state to the users by marking or dropping packets. The users then strive to maximize the sending rate without causing network congestion. To achieve this, the users implement a flow-control algorithm that controls the rate at which data packets are sent into the Internet. More specifically, the Transmission Control Protocol (TCP) is used by the users to adjust the sending rate in response to changing network conditions. TCP uses the observation of packet loss events and estimates of the round trip time (RTT) to adjust its sending rate. In this thesis we investigate and propose stochastic models for TCP. The models are used to estimate network performance like throughput, link utilization, and packet loss rate. The first part of the thesis introduces the TCP protocol and contains an extensive TCP modeling survey that summarizes the most important TCP modeling work. Reviewed models are categorized as renewal theory models, fixed-point methods, fluid models, processor sharing models or control theoretic models. The merits of respective category is discussed and guidelines for which framework to use for future TCP modeling is given. The second part of the thesis contains six papers on TCP modeling. Within the renewal theory framework we propose single source TCP-Tahoe and TCP-NewReno models. We investigate the performance of these protocols in both a DropTail and a RED queuing environment. The aspects of TCP performance that are inherently depending on the actual implementation of the flow-control algorithm are singled out from what depends on the queuing environment. Using the fixed-point framework, we propose models that estimate packet loss rate and link utilization for a network with multiple TCP-Vegas, TCP-SACK and TCP-Reno on/off sources. The TCP-Vegas model is novel and is the first model capable of estimating the network's operating point for TCP-Vegas sources sending on/off traffic. All TCP and network models in the contributed research papers are validated via simulations with the network simulator ns-2. This thesis serves both as an introduction to TCP and as an extensive orientation about state of the art stochastic TCP models.

The goal of the thesis is to design the star-based mesh topology by introducing multiple pan-coordinators (hub/switches) under a multipath-fading environment and to improve the data transaction rate of a network which usually gets worst when there is a single pan-coordinator for synchronization of devices in conventional mesh topology; also reduce the hop-count as least as possible. Most of the work has been done on NS-2 network simulator; therefore the research model which has been used here is a simulation model. Altogether 3 simulations have been done. The first scenario is done on a simplest mesh network with a single coordinator and a radio propagation model which has been used is two-ray ground reflection model. The second scenario simulation is similar to the first scenario but in-order to provide multi-path signal fading and highly congested environment the propagation model which has been used this time is shadowing model. The final simulation which has been done is of multiple-star based mesh topology it also uses the similar radio propagation model which has been defined for second scenario. An intensive performance measurement of all the three simulations has been done in terms of transactions made per-second, packet drop rate along with an analysis of packet drop. An hop-count is also measured between star and mesh topology. For multiple star based mesh topology it can be assumed if multiple stars with a routing capability can be used then nodes in a network will be synchronized or re-synchronized with least number of hops in the congested network with a near-by pan-coordinator (hub/switch). One of the major applications of this topology can be automobile manufacturing industry where alot of machines are installed in a congested network and monitoring of every area is mandatory for swift production.