574 research outputs found
Vehicular Inter-Networking via Named Data
In this paper we apply the Named Data Networking, a newly proposed Internet
architecture, to networking vehicles on the run. Our initial design, dubbed
V-NDN, illustrates NDN's promising potential in providing a unifying
architecture that enables networking among all computing devices independent
from whether they are connected through wired infrastructure, ad hoc, or
intermittent DTN. This paper describes the prototype implementation of V-NDN
and its preliminary performance assessment
The Dynamics of Vehicular Networks in Urban Environments
Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support
intelligent inter-vehicle communication and improve traffic safety and
performance. The road-constrained, high mobility of vehicles, their unbounded
power source, and the emergence of roadside wireless infrastructures make
VANETs a challenging research topic. A key to the development of protocols for
inter-vehicle communication and services lies in the knowledge of the
topological characteristics of the VANET communication graph. This paper
explores the dynamics of VANETs in urban environments and investigates the
impact of these findings in the design of VANET routing protocols. Using both
real and realistic mobility traces, we study the networking shape of VANETs
under different transmission and market penetration ranges. Given that a number
of RSUs have to be deployed for disseminating information to vehicles in an
urban area, we also study their impact on vehicular connectivity. Through
extensive simulations we investigate the performance of VANET routing protocols
by exploiting the knowledge of VANET graphs analysis.Comment: Revised our testbed with even more realistic mobility traces. Used
the location of real Wi-Fi hotspots to simulate RSUs in our study. Used a
larger, real mobility trace set, from taxis in Shanghai. Examine the
implications of our findings in the design of VANET routing protocols by
implementing in ns-3 two routing protocols (GPCR & VADD). Updated the
bibliography section with new research work
Quality of service aware data dissemination in vehicular Ad Hoc networks
Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché.
Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route.
Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem.
In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments.
As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach
A Survey on Topology and Position Based Routing Protocols in Vehicular Ad hoc Network (VANET)
Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks. It is a developing new technology in which vehicles interchange the information from one vehicle to another vehicle within a network. VANET is responsible for providing an illustrated approach for Intelligent Transport System (ITS). The main use of VANET is to save life and prevent the accidents. This Paper describes a survey of routing protocols in vehicular ad hoc networks. The survey of routing protocols in VANET is significant and essential for smart ITS. The routing protocols are divided into two categories of topology-based and position-based routing for VANETs. This review discusses the advantages and disadvantages of these routing protocols
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
A robot swarm assisting a human fire-fighter
Emergencies in industrial warehouses are a major concern for fire-fighters. The large dimensions, together with the development of dense smoke that drastically reduces visibility, represent major challenges. The GUARDIANS robot swarm is designed to assist fire-fighters in searching a large warehouse. In this paper we discuss the technology developed for a swarm of robots assisting fire-fighters. We explain the swarming algorithms that provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also the means to locate the robots and humans. Thus, the robot swarm is able to provide guidance information to the humans. Together with the fire-fighters we explored how the robot swarm should feed information back to the human fire-fighter. We have designed and experimented with interfaces for presenting swarm-based information to human beings
Delay Tolerant Networks for Efficient Information Harvesting and Distribution in Intelligent Transportation Systems
[EN] Intelligent Transportation Systems (ITS) can make transportation safer, more efficient, and more sustainable
by applying various information and communication technologies. One of these technologies are \acfp{VN}.
\acp{VN} combine different communication solutions such as cellular networks,
\acfp{VANET}, or IEEE 802.11 technologies to provide connectivity among
vehicles, and between vehicles and road infrastructure.
This thesis focuses on VNs, and considers that the high speed of the nodes
and the presence of obstacles like buildings, produces a highly variable network
topology, as well as more frequent partitions in the network. Therefore,
classical \ac{MANET} protocols do not adapt well to VANETs. Under these
conditions, \ac{DTN}
have been proposed as an alternative able to cope with these adverse
characteristics. In DTN, when a message cannot be routed
to its destination, it is not immediately dropped but it is instead stored and
carried until a new route becomes available. The combination of VN and
DTN is called \acp{VDTN}.
In this thesis, we propose a new VDTN protocol designed to collect
information from vehicular sensors. Our proposal, called \ac{MSDP}, combines
information about the localization obtained from a GNSS system with the actual
street/road layout obtained from a Navigation System (NS) to define a new
routing metric. Both analytical and simulation results prove that MSDP outperforms
previous proposals.
Concerning the deployment of VNs and VANET technologies, technology
already left behind the innovation and the standardization phases, and it is
about time it reach the first early adopters in the market. However, most car
manufacturers have decided to implement VN devices in the form of On Board
Units (OBUs), which are expensive, heavily manufacturer dependent, and
difficult to upgrade. These facts are delaying the deployment of VN. To boost
this process, we have developed the GRCBox architecture. This architecture is
based on low-cost devices and enables the establishment of V2X, \emph{i.e.} V2I and V2V, communications
while integrating users by easing the use of general purpose devices like
smartphones, tablets or laptops. To demonstrate the viability of the GRCBox
architecture, we combined it with a DTN platform called Scampi to obtain
actual results over a real VDTN scenario. We also
present several GRCBox-aware applications that illustrate how developers can
create applications that bring the potential of VN to user devices.[ES] Los sistemas de transporte inteligente (ITS) son el soporte para el establecimiento de un
transporte más seguro, más eficiente y más sostenible mediante el uso de
tecnologías de la información y las comunicaciones.
Una de estas tecnologías son las redes vehiculares
(VNs). Las VNs combinan diferentes tecnologías de comunicación como las redes
celulares, las redes ad-hoc vehiculares (VANETs) o las redes 802.11p para
proporcionar conectividad entre vehículos, y entre vehículos y la
infraestructura de carreteras.
Esta tesis se centra en las VNs, en las cuales la alta velocidad de los
nodos
y la presencia de obstáculos como edificios producen una topología de red
altamente variable, así como frecuentes particiones en la red. Debido a estas características,
los protocolos para redes móviles ad-hoc (MANETs) no se adaptan bien a las
VANETs. En estas condiciones, las redes tolerantes a retardos (DTNs) se han
propuesto como una alternativa capaz de hacer frente a estos problemas. En DTN,
cuando un mensaje no puede ser encaminado hacia su destino, no es
inmediatamente descartado sino es almacenado hasta que una nueva ruta esta disponible.
Cuando las VNs y las DTNs se combinan surgen las redes vehiculares tolerantes
a retardos (VDTN).
En esta tesis proponemos un nuevo protocolo para VDTNs diseñado para recolectar
la información generada por sensores vehiculares. Nuestra propuesta, llamada
MSDP, combina la información obtenida del servicio de información geográfica
(GIS) con el mapa real de las calles obtenido del sistema de navegación (NS)
para definir una nueva métrica de encaminamiento. Resultados analíticos y
mediante simulaciones prueban que MSDP mejora el rendimiento de propuestas
anteriores.
En relación con el despliegue de las VNs y las tecnologías VANET, la
tecnología ha dejado atrás las fases de innovación y estandarización,
ahora es el momento de alcanzar a los primeros usuarios del mercado. Sin embargo,
la mayoría de fabricantes han decidido implementar los dispositivos para VN
como unidades de a bordo (OBU), las cuales son caras y difíciles de
actualizar. Además, las OBUs son muy dependientes del fabricante original.
Todo esto esta retrasando el despliegue de las VNs. Para acelerar la adopción
de las VNs, hemos desarrollado la arquitectura GRCBox. La arquitectura GRCBox
esta basada en un dispositivo de bajo coste que permite a los usuarios usar
comunicaciones V2X (V2V y V2I) mientras utilizan dispositivos de propósito general como
teléfonos inteligentes, tabletas o portátiles. Las pruebas incluidas en esta
tesis demuestran la viabilidad de la arquitectura GRCBox. Mediante la
combinación de nuestra GRCBox y una plataforma de DTN llamada Scampi hemos
diseñado y probado un escenario VDTN real. También presentamos como los
desarrolladores pueden crear nuevas aplicaciones GRCBox para llevar el
potencial de las VN a los dispositivos de usuario.[CA] Els sistemes de transport intel·ligent (ITS) poden crear un transport més
segur, més eficient i més sostenible mitjançant l'ús de tecnologies de la
informació i les comunicacions aplicades al transport.
Una d'aquestes tecnologies són les xarxes vehiculars (VN). Les VN combinen
diferents tecnologies de comunicació, com ara les xarxes cel·lulars, les
xarxes ad-hoc vehiculars (VANET) o les xarxes 802.11p, per a proporcionar
comunicació entre vehicles, i entre vehicles i la infraestructura de
carreteres.
Aquesta tesi se centra en les VANET, en les quals l'alta velocitat dels nodes
i la presència d'obstacles, com els edificis, produeixen una topologia de
xarxa altament variable, i també freqüents particions en la xarxa. Per aquest
motiu, els protocols per a xarxes mòbils ad-hoc (MANET) no s'adapten bé. En
aquestes condicions, les xarxes tolerants a retards (DTN) s'han proposat com
una alternativa capaç de fer front a aquests problemes. En DTN, quan un
missatge no pot ser encaminat cap a la seua destinació, no és immediatament
descartat sinó que és emmagatzemat fins que apareix una ruta nova.
Quan les VN i les DTN es combinen sorgeixen les xarxes vehicular tolerants a
retards (VDTN).
En aquesta tesi proposem un nou protocol per a VDTN dissenyat per a
recol·lectar la informació generada per sensors vehiculars. La nostra
proposta, anomenada MSDP, combina la informació obtinguda del servei
d'informació geogràfica (GIS) amb el mapa real dels carrers obtingut del
sistema de navegació (NS) per a definir una nova mètrica d'encaminament.
Resultats analítics i mitjançant simulacions proven que MSDP millora el
rendiment de propostes prèvies.
En relació amb el desplegament de les VN i les tecnologies VANET, la
tecnologia ha deixat arrere les fases d'innovació i estandardització, ara és
temps d'aconseguir als primers usuaris del mercat. No obstant això, la majoria
de fabricants han decidit implementar els dispositius per a VN com a unitats
de bord (OBU), les quals són cares i difícils d'actualitzar. A més, les OBU
són molt dependents del fabricant original. Tot això està retardant el
desplegament de les VN.
Per a accelerar l'adopció de les VN, hem desenvolupat l'arquitectura GRCBox.
L'arquitectura GRCBox està basada en un dispositiu de baix cost que permet als
usuaris usar comunicacions V2V mentre usen dispositius de propòsit general,
com ara telèfons intel·ligents, tauletes o portàtils. Les proves incloses en
aquesta tesi demostren la viabilitat de l'arquitectura GRCBox. Mitjançant la
combinació de la nostra GRCBox i la plataforma de DTN Scampi, hem dissenyat i
provat un escenari VDTN pràctic. També presentem com els desenvolupadors poden
crear noves aplicacions GRCBox per a portar el potencial de les VN als
dispositius d'usuari.Martínez Tornell, S. (2016). Delay Tolerant Networks for Efficient Information Harvesting and Distribution in Intelligent Transportation Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/68486TESI
Localization Enhanced Mobile Networks
The interest in mobile ad-hoc networks (MANETs) and often more precisely vehicular ad-hoc networks (VANETs) is steadily growing with many new applications, and even anticipated support in the emerging 5G networks. Particularly in outdoor scenarios, there are different mechanisms to make the mobile nodes aware of their geographical location at all times. The location information can be utilized at different layers of the protocol stack to enhance communication services in the network. Specifically, geographical routing can facilitate route management with smaller overhead than the traditional proactive and reactive routing protocols. In order to achieve similar advantages for radio resource management (RRM) and multiple access protocols, the concept of virtual cells is devised to exploit fully distributed knowledge of node locations. The virtual cells define clusters of MANET nodes assuming a predefined set of geographically distributed anchor points. It enables fast response of the network to changes in the nodes spatial configuration. More importantly, the notion of geographical location can be generalized to other shared contexts which can be learned or otherwise acquired by the network nodes. The strategy of enhancing communication services by shared contexts is likely to be one of the key features in the beyond-5G networks
Reliable Multicast in Mobile Ad Hoc Wireless Networks
A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the mission critical nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented best effort protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead
Multicast Routing in Mobile Adhoc Networks using Source Grouped Flooding
Ad hoc networks are peer to peer, autonomous networks comprised of wireless mobile devices. The ease and speed of deployment of these networks makes them ideal for battlefield communications, disaster recovery and other such applications where fixed infrastructure is not readily available. Limited bandwidth, energy constraints and unpredictable network topologies pose difficult problems for the design of applications for these networks. The last couple of years has seen renewed research in this field. Specifically in unicast and multicast routing and security issues.In this thesis, we address the multicast routing problem for ad hoc networks. We present a novel multicast routing protocol called the source grouped flooding protocol. The protocol creates multicast routes between the source and group members based on hop count distance constraints. We also propose a probabilistic data forwarding mechanism to achieve efficient data dissemination. We present simulation results that capture the performance of our protocol against parameters that characterize an ad hoc network. We find that the protocol is robust against topology changes and achieves efficient data distribution
- …