Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Performance Modeling of Vehicular Clouds Under Different Service Strategies

The amount of data being generated at the edge of the Internet is rapidly rising as a result of the Internet of Things (IoT). Vehicles themselves are contributing enormously to data generation with their advanced sensor systems. This data contains contextual information; it's temporal and needs to be processed in real-time to be of any value. Transferring this data to the cloud is not feasible due to high cost and latency. This has led to the introduction of edge computing for processing of data close to the source. However, edge servers may not have the computing capacity to process all the data. Future vehicles will have significant computing power, which may be underutilized, and they may have a stake in the processing of the data. This led to the introduction of a new computing paradigm called vehicular cloud (VC), which consists of interconnected vehicles that can share resources and communicate with each other. The VCs may process the data by themselves or in cooperation with edge servers. Performance modeling of VCs is important, as it will help to determine whether it can provide adequate service to users. It will enable determining appropriate service strategies and the type of jobs that may be served by the VC such that Quality of service (QoS) requirements are met. Job completion time and throughput of VCs are important performance metrics. However, performance modeling of VCs is difficult because of the volatility of resources. As vehicles join and leave the VC, available resources vary in time. Performance evaluation results in the literature are lacking, and available results mostly pertain to stationary VCs formed from parked vehicles. This thesis proposes novel stochastic models for the performance evaluation of vehicular cloud systems that take into account resource volatility, composition of jobs from multiple tasks that can execute concurrently under different service strategies. First, we developed a stochastic model to analyze the job completion time in a VC system deployed on a highway with service interruption. Next, we developed a model to analyze the job completion time in a VC system with a service interruption avoidance strategy. This strategy aims to prevent disruptions in task service by only assigning tasks to vehicles that can complete the tasks’ execution before they leave the VC. In addition to analyzing job completion time, we evaluated the computing capacity of VC systems with a service interruption avoidance strategy, determining the number of jobs a VC system can complete during its lifetime. Finally, we studied the computing capacity of a robotaxi fleet, analyzing the average number of tasks that a robotaxi fleet can serve to completion during a cycle. By developing these models, conducting various analyses, and comparing the numerical results of the analyses to extensive Monte Carlo simulation results, we gained insights into job completion time, computing capacity, and overall performance of VC systems deployed in different contexts

Performance Modeling of Vehicular Clouds Under Different Service Strategies

The amount of data being generated at the edge of the Internet is rapidly rising as a result of the Internet of Things (IoT). Vehicles themselves are contributing enormously to data generation with their advanced sensor systems. This data contains contextual information; it's temporal and needs to be processed in real-time to be of any value. Transferring this data to the cloud is not feasible due to high cost and latency. This has led to the introduction of edge computing for processing of data close to the source. However, edge servers may not have the computing capacity to process all the data. Future vehicles will have significant computing power, which may be underutilized, and they may have a stake in the processing of the data. This led to the introduction of a new computing paradigm called vehicular cloud (VC), which consists of interconnected vehicles that can share resources and communicate with each other. The VCs may process the data by themselves or in cooperation with edge servers. Performance modeling of VCs is important, as it will help to determine whether it can provide adequate service to users. It will enable determining appropriate service strategies and the type of jobs that may be served by the VC such that Quality of service (QoS) requirements are met. Job completion time and throughput of VCs are important performance metrics. However, performance modeling of VCs is difficult because of the volatility of resources. As vehicles join and leave the VC, available resources vary in time. Performance evaluation results in the literature are lacking, and available results mostly pertain to stationary VCs formed from parked vehicles. This thesis proposes novel stochastic models for the performance evaluation of vehicular cloud systems that take into account resource volatility, composition of jobs from multiple tasks that can execute concurrently under different service strategies. First, we developed a stochastic model to analyze the job completion time in a VC system deployed on a highway with service interruption. Next, we developed a model to analyze the job completion time in a VC system with a service interruption avoidance strategy. This strategy aims to prevent disruptions in task service by only assigning tasks to vehicles that can complete the tasks’ execution before they leave the VC. In addition to analyzing job completion time, we evaluated the computing capacity of VC systems with a service interruption avoidance strategy, determining the number of jobs a VC system can complete during its lifetime. Finally, we studied the computing capacity of a robotaxi fleet, analyzing the average number of tasks that a robotaxi fleet can serve to completion during a cycle. By developing these models, conducting various analyses, and comparing the numerical results of the analyses to extensive Monte Carlo simulation results, we gained insights into job completion time, computing capacity, and overall performance of VC systems deployed in different contexts

Schemes for multi-hop dissemination of non-safety information in VANETs

Vehicular Ad Hoc Networks (VANETs) are a special case of Mobile Ad Hoc Network (MANET), whose nodes are vehicles and occasional fixed devices with communication capabilities. What makes them special is the limited range of possible movements of the mobile nodes (they can only travel on the existing roads or rails) and their high speed. The potential applications in this new type of network are almost endless. Researchers have typically classified them in four groups: active safety, public service support, improved driving and business/entertainment. The communication patterns that they require are varied, being information dissemination one of them. It is aimed at reaching a group of vehicles in an area that is larger than the reception range of a single node, so that a multi-hop broadcast is necessary. It can take multiple forms depending on the type of message. For example, a warning caused by a sudden brake requires a fast and reliable dissemination, whereas a blocked route announcement is tolerant to delays up to a few seconds and may miss some target without risking safety. The work in this PhD thesis is focused on this last type of use. The objective is to create schemes that would allow for the multi-hop dissemination of messages that do not have hard delay and delivery requirements (typically, any non-safety information). Our goals for this solution are four. First, we want it to be useful in roadways as well as inside cities. Vehicles movements and the occurrence of obstacles to the signal propagation are very different in both scenarios and so we need to adapt it to both. Second, we want it to be independent of infrastructure. The cost of deploying fixed units along every road and street is high and it may take a long time until there is global coverage. Our intention is that this solution can be used regardlessly of the deployment point. In addition, it must avoid the broadcast storm problem by reducing as much as possible the number of generated duplicates. Lastly, the scheme needs to cope with intermittent partitions in the vehicular network. Implementing a store-carry-forward mechanism that allows a message reach disconnected groups of vehicles inside the destination area rises the number of necessary duplicates. In order to achieve the aforementioned goals, we first study how typical infrastructure-less dissemination schemes from the state of the art in MANETs, plus a new specific one, apply to VANETs. According to their results in relation to a series of metrics, we learn that the distance-based scheme is the one that best meets our requirements. We select it to create an optimized scheme for the two existing scenarios-roadways and urban areas. Regarding the adaptation for roadways, we begin by optimizing the scheme so that its forwarding ratio is as close to the minimum as possible, and analyzing its average per-hop delay in a connected network (i.e., there is at least one feasible route between any two nodes in the network). Next, we study how to add a custom store-carry-forward mechanism that, with minimal additions, manages to overcome short-lived network partitions. We validate the addition and the complete scheme under different channel loads and in contrast with a well-known protocol aimed at the same type of traffic, DV-CAST. Our work on the version for urban scenarios parts from the assumption that we need to detect junctions and react accordingly in order to spread the dissemination in new directions and reach as many vehicles as possible. We create two different modifications of the basic distance-based scheme, each using a different method to detect intersections, and test them along with the basic one. This first step leads us to discovering that it is not necessary to detect intersections in order to achieve good results. Then, similarly to the process for the roadway scenario, we work on optimizing the scheme and creating a suitable store-carry-forward mechanism. We follow the same reasoning but this time we consider three different options for subsequent retransmissions. We test each version of the scheme throughly via simulations using real city maps and compare the results to those of the urban counterpart of DV-CAST, named UV-CAST. We use validated simulators as ns-2 and the Veins framework for testing realistically the different stages of our work. The performance of the resulting schemes meet our requirements to a high degree and so we consider that we have fulfilled our goals. In addition, the work done so far opens the door to new lines of research that are either the natural consequence or an application of our achievements.La expresión inglesa Vehicular Ad Hoc Networks (VANETs) nombra a un tipo especial de Mobile Ad Hoc Network (MANET), cuyos nodos son vehículos y, ocasionalmente, dispositivos fijos con capacidad de comunicación. Lo que las hace especiales es el rango limitado de movimientos posibles para los nodos móviles (ya que sólo pueden viajar por las vías existentes) y su alta velocidad. Las aplicaciones potenciales de este nuevo tipo de red son casi infinitas. La comunidad investigadora las ha clasificado típicamente en cuatro grupos: seguridad activa, apoyo a servicios públicos, asistencia a la conducción y negocios/entretenimiento. Los patrones de comunicación que precisan son variados, siendo la diseminación de información uno de ellos. Su objetivo es alcanzar a un grupo de vehículos en un área mayor que el de la cobertura alcanzada por un nodo, de modo que es necesaria una difusión multisalto. Esta puede tomar múltiples formas dependiendo del tipo de mensaje. Por ejemplo, una alarma provocada por un frenazo brusco requiere una diseminación rápida y confiable, mientras que un aviso de calle cortada es tolerante a retardos de hasta algunos segundos y si no alcanza a algún destinatario no supone un riesgo para la seguridad. El trabajo contenido en esta tesis se enfoca en este último caso de uso. La meta es crear esquemas que permitan la diseminación multisalto de mensajes que no tienen requisitos fuertes en cuanto a retardo y entrega (típicamente, cualquier información no relacionada con la seguridad). Nuestros objetivos para esta solución son cuatro. Primero, queremos que sea útil en carretera así como en ciudad. Los movimientos de los vehículos y la existencia de obstáculos para la propagación de la señal son muy diferentes en ambos escenarios y por tanto necesitamos adaptarla a ambos. Segundo, queremos que no dependa de infraestructura. El coste de desplegar unidades fijas a lo largo de cada calle y carretera es alto, y puede llevar un largo tiempo hasta que haya cobertura global. Nuestra intención es que esta solución pueda ser usada en cualquier punto del proceso de despliegue. Además, debe evitar el problema conocido como “tormenta broadcast”, reduciendo en la medida de lo posible el número de duplicados generados. Por último, el esquema necesita hacer frente a particiones intermitentes de la red vehicular. Implementar un mecanismo de los llamados “store-carry-forward” (guardar-llevar-reenviar), que permita a un mensaje llegar a grupos desconectados de vehículos dentro de la zona de destino, aumenta el número de duplicados necesarios. Para conseguir estos objetivos, primero estudiamos cómo esquemas típicos de diseminación sin apoyo de infraestructura, tomados del estado del arte en MANETs, más uno nuevo y específico, se pueden aplicar en VANETs. De acuerdo con los resultados en relación con una serie de métricas, hemos aprendido que el esquema basado en distancia es el que mejor cubre nuestros requisitos. Seleccionamos este para crear un esquema optimizado para los dos tipos de escenarios existentes: carretera (entorno interurbano) y ciudad (entorno urbano). En cuanto a la adaptación al entorno interurbano, comenzamos optimizando el esquema de modo que su tasa de reenvío esté tan cerca del mínimo como sea posible, y analizando su retardo medio por salto en una red conectada (es decir, que hay al menos una ruta posible entre dos nodos cualesquiera de la red). A continuación, estudiamos cómo añadir un mecanismo “store-carry-forward" específico para nuestra solución que, con cambios mínimos, consiga superar particiones de red breves. Validamos este añadido y el esquema completo bajo diferentes cargas de canal y en contraste con un conocido protocolo para este mismo tipo de tráfico, DV-CAST. Nuestro trabajo en la versión para escenarios urbanos parte del supuesto de que necesitamos detectar intersecciones y reaccionar en consecuencia para poder extender la diseminación en nuevas direcciones y alcanzar tantos vehículos como sea posible. Creamos dos modificaciones del esquema basado en distancia, cada una en base a un método distinto para detectar cruces, y las probamos junto con el esquema básico. Este primer paso nos lleva a descubrir que no es necesaria dicha detección para poder conseguir buenos resultados. Después, de forma similar al proceso que seguimos para el escenario de carretera, trabajamos en optimizar el esquema y crear un mecanismo “store-carry-forward" apropiado. Seguimos el mismo razonamiento pero en esta ocasión consideramos tres opciones diferentes para las repetidas retransmisiones. Probamos cada versión del esquema concienzudamente con simulaciones, utilizando mapas reales de ciudades, y comparamos los resultados con los del equivalente urbano de DV-CAST, llamado UV-CAST. Usamos simuladores validados como ns-2 y Veins para probar de forma realista las diferentes etapas de nuestro trabajo. Las prestaciones de los esquemas resultantes cumplen con nuestros requisitos en un alto grado, por lo que consideramos que hemos conseguido alcanzar nuestros objetivos. Además, el trabajo realizado hasta el momento abre la puerta a nuevas líneas de investigación que son, bien consecuencia natural, bien aplicación de nuestros logros.Programa Oficial de Doctorado en Ingeniería TelemáticaPresidente: Juan Carlos Cano Escriba.- Secretario: Florina Almenares Mendoza.- Vocal: José Marta Barcelo Ordina

Délestage de données en D2D : de la modélisation à la mise en oeuvre

Mobile data traffic is expected to reach 24.3 exabytes by 2019. Accommodating this growth in a traditional way would require major investments in the radio access network. In this thesis, we turn our attention to an unconventional solution: mobile data offloading through device-to-device (D2D) communications. Our first contribution is DROiD, an offloading strategy that exploits the availability of the cellular infrastructure as a feedback channel. DROiD adapts the injection strategy to the pace of the dissemination, resulting at the same time reactive and relatively simple, allowing to save a relevant amount of data traffic even in the case of tight delivery delay constraints.Then, we shift the focus to the gains that D2D communications could bring if coupled with multicast wireless networks. We demonstrate that by employing a wise balance of multicast and D2D communications we can improve both the spectral efficiency and the load in cellular networks. In order to let the network adapt to current conditions, we devise a learning strategy based on the multi-armed bandit algorithm to identify the best mix of multicast and D2D communications. Finally, we investigate the cost models for operators wanting to reward users who cooperate in D2D offloading. We propose separating the notion of seeders (users that carry content but do not distribute it) and forwarders (users that are tasked to distribute content). With the aid of the analytic framework based on Pontryagin's Maximum Principle, we develop an optimal offloading strategy. Results provide us with an insight on the interactions between seeders, forwarders, and the evolution of data dissemination.Le trafic mobile global atteindra 24,3 exa-octets en 2019. Accueillir cette croissance dans les réseaux d’accès radio devient un véritable casse-tête. Nous porterons donc toute notre attention sur l'une des solutions à ce problème : le délestage (offloading) grâce à des communications de dispositif à dispositif (D2D). Notre première contribution est DROiD, une stratégie qui exploite la disponibilité de l'infrastructure cellulaire comme un canal de retour afin de suivre l'évolution de la diffusion d’un contenu. DROiD s’adapte au rythme de la diffusion, permettant d'économiser une quantité élevée de données cellulaires, même dans le cas de contraintes de réception très serrées. Ensuite, nous mettons l'accent sur les gains que les communications D2D pourraient apporter si elles étaient couplées avec les transmissions multicast. Par l’utilisation équilibrée d'un mix de multicast, et de communications D2D, nous pouvons améliorer, à la fois, l'efficacité spectrale ainsi que la charge du réseau. Afin de permettre l’adaptation aux conditions réelles, nous élaborons une stratégie d'apprentissage basée sur l'algorithme dit ‘’bandit manchot’’ pour identifier la meilleure combinaison de communications multicast et D2D. Enfin, nous mettrons en avant des modèles de coûts pour les opérateurs, désireux de récompenser les utilisateurs qui coopèrent dans le délestage D2D. Nous proposons, pour cela, de séparer la notion de seeders (utilisateurs qui transportent contenu, mais ne le distribuent pas) et de forwarders (utilisateurs qui sont chargés de distribuer le contenu). Avec l'aide d’un outil analytique basée sur le principe maximal de Pontryagin, nous développons une stratégie optimale de délestage

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Advances in Intelligent Vehicle Control

This book is a printed edition of the Special Issue Advances in Intelligent Vehicle Control that was published in the journal Sensors. It presents a collection of eleven papers that covers a range of topics, such as the development of intelligent control algorithms for active safety systems, smart sensors, and intelligent and efficient driving. The contributions presented in these papers can serve as useful tools for researchers who are interested in new vehicle technology and in the improvement of vehicle control systems

Future Transportation

Greenhouse gas (GHG) emissions associated with transportation activities account for approximately 20 percent of all carbon dioxide (co2) emissions globally, making the transportation sector a major contributor to the current global warming. This book focuses on the latest advances in technologies aiming at the sustainable future transportation of people and goods. A reduction in burning fossil fuel and technological transitions are the main approaches toward sustainable future transportation. Particular attention is given to automobile technological transitions, bike sharing systems, supply chain digitalization, and transport performance monitoring and optimization, among others