26 research outputs found
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
Reliability and Efficiency of Vehicular Network Applications
The DSRC/WAVE initiative is forecast to enable a plethora of applications, classified in two broad types of safety and non-safety applications. In the former type, the reliability performance is of tremendous prominence while, in the latter case, the efficiency of information dissemination is the key driving factor. For safety applications, we adopt a systematic approach to analytically investigate the reliability of the communication system in a symbiotic relationship with the host system comprising a vehicular traffic system and radio propagation environment. To this aim, the¬ interference factor is identified as the central element of the symbiotic relationship. Our approach to the investigation of interference and its impacts on the communication reliability departs from previous studies by the degree of realism incorporated in the host system model. In one dimension, realistic traffic models are developed to describe the vehicular traffic behaviour. In a second dimension, a realistic radio propagation model is employed to capture the unique signal propagation aspects of the host system. We address the case of non-safety applications by proposing a generic framework as a capstone architecture for the development of new applications and the efficiency evaluation of existing ones. This framework, while being independent from networking technology, enables accurate characterization of the various information dissemination tasks that a node performs in cooperation with others. As the central element of the framework, we propose a game theoretic model to describe the interaction of meeting nodes aiming to exchange information of mutual or social interests. An adaptive mechanism is designed to enable a mobile node to measure the social significance of various information topics, which is then used by the node to prioritize the forwarding of information objects
Mining and Managing Large-Scale Temporal Graphs
Large-scale temporal graphs are everywhere in our daily life. From online social networks, mobile networks, brain networks to computer systems, entities in these large complex systems communicate with each other, and their interactions evolve over time. Unlike traditional graphs, temporal graphs are dynamic: both topologies and attributes on nodes/edges may change over time. On the one hand, the dynamics have inspired new applications that rely on mining and managing temporal graphs. On the other hand, the dynamics also raise new technical challenges. First, it is difficult to discover or retrieve knowledge from complex temporal graph data. Second, because of the extra time dimension, we also face new scalability problems. To address these new challenges, we need to develop new methods that model temporal information in graphs so that we can deliver useful knowledge, new queries with temporal and structural constraints where users can obtain the desired knowledge, and new algorithms that are cost-effective for both mining and management tasks.In this dissertation, we discuss our recent works on mining and managing large-scale temporal graphs.First, we investigate two mining problems, including node ranking and link prediction problems. In these works, temporal graphs are applied to model the data generated from computer systems and online social networks. We formulate data mining tasks that extract knowledge from temporal graphs. The discovered knowledge can help domain experts identify critical alerts in system monitoring applications and recover the complete traces for information propagation in online social networks. To address computation efficiency problems, we leverage the unique properties in temporal graphs to simplify mining processes. The resulting mining algorithms scale well with large-scale temporal graphs with millions of nodes and billions of edges. By experimental studies over real-life and synthetic data, we confirm the effectiveness and efficiency of our algorithms.Second, we focus on temporal graph management problems. In these study, temporal graphs are used to model datacenter networks, mobile networks, and subscription relationships between stream queries and data sources. We formulate graph queries to retrieve knowledge that supports applications in cloud service placement, information routing in mobile networks, and query assignment in stream processing system. We investigate three types of queries, including subgraph matching, temporal reachability, and graph partitioning. By utilizing the relatively stable components in these temporal graphs, we develop flexible data management techniques to enable fast query processing and handle graph dynamics. We evaluate the soundness of the proposed techniques by both real and synthetic data. Through these study, we have learned valuable lessons. For temporal graph mining, temporal dimension may not necessarily increase computation complexity; instead, it may reduce computation complexity if temporal information can be wisely utilized. For temporal graph management, temporal graphs may include relatively stable components in real applications, which can help us develop flexible data management techniques that enable fast query processing and handle dynamic changes in temporal graphs
A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks
In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs
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: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
Recommended from our members
EBS Radionuclide Transport Abstraction
The purpose of this report is to develop and analyze the engineered barrier system (EBS) radionuclide transport abstraction model, consistent with Level I and Level II model validation, as identified in ''Technical Work Plan for: Near-Field Environment and Transport: Engineered Barrier System: Radionuclide Transport Abstraction Model Report Integration'' (BSC 2005 [DIRS 173617]). The EBS radionuclide transport abstraction (or EBS RT Abstraction) is the conceptual model used in the total system performance assessment for the license application (TSPA-LA) to determine the rate of radionuclide releases from the EBS to the unsaturated zone (UZ). The EBS RT Abstraction conceptual model consists of two main components: a flow model and a transport model. Both models are developed mathematically from first principles in order to show explicitly what assumptions, simplifications, and approximations are incorporated into the models used in the TSPA-LA. The flow model defines the pathways for water flow in the EBS and specifies how the flow rate is computed in each pathway. Input to this model includes the seepage flux into a drift. The seepage flux is potentially split by the drip shield, with some (or all) of the flux being diverted by the drip shield and some passing through breaches in the drip shield that might result from corrosion or seismic damage. The flux through drip shield breaches is potentially split by the waste package, with some (or all) of the flux being diverted by the waste package and some passing through waste package breaches that might result from corrosion or seismic damage. Neither the drip shield nor the waste package survives an igneous intrusion, so the flux splitting submodel is not used in the igneous scenario class. The flow model is validated in an independent model validation technical review. The drip shield and waste package flux splitting algorithms are developed and validated using experimental data. The transport model considers advective transport and diffusive transport from a breached waste package. Advective transport occurs when radionuclides that are dissolved or sorbed onto colloids (or both) are carried from the waste package by the portion of the seepage flux that passes through waste package breaches. Diffusive transport occurs as a result of a gradient in radionuclide concentration and may take place while advective transport is also occurring, as well as when no advective transport is occurring. Diffusive transport is addressed in detail because it is the sole means of transport when there is no flow through a waste package, which may dominate during the regulatory compliance period in the nominal and seismic scenarios. The advective transport rate, when it occurs, is generally greater than the diffusive transport rate. Colloid-facilitated advective and diffusive transport is also modeled and is presented in detail in Appendix B of this report
Recommended from our members
IN SITU FIELD TESTING OF PROCESSES
The purpose of this scientific analysis report is to update and document the data and subsequent analyses from ambient field-testing activities performed in underground drifts and surface-based boreholes through unsaturated zone (UZ) tuff rock units. In situ testing, monitoring, and associated laboratory studies are conducted to directly assess and evaluate the waste emplacement environment and the natural barriers to radionuclide transport at Yucca Mountain. This scientific analysis report supports and provides data to UZ flow and transport model reports, which in turn contribute to the Total System Performance Assessment (TSPA) of Yucca Mountain, an important document for the license application (LA). The objectives of ambient field-testing activities are described in Section 1.1. This report is the third revision (REV 03), which supercedes REV 02. The scientific analysis of data for inputs to model calibration and validation as documented in REV 02 were developed in accordance with the Technical Work Plan (TWP) ''Technical Work Plan for: Performance Assessment Unsaturated Zone'' (BSC 2004 [DIRS 167969]). This revision was developed in accordance with the ''Technical Work Plan for: Unsaturated Zone Flow Analysis and Model Report Integration'' (BSC 2004 [DIRS 169654], Section 1.2.4) for better integrated, consistent, transparent, traceable, and more complete documentation in this scientific analysis report and associated UZ flow and transport model reports. No additional testing or analyses were performed as part of this revision. The list of relevant acceptance criteria is provided by ''Technical Work Plan for: Unsaturated Zone Flow Analysis and Model Report Integration'' (BSC 2004 [DIRS 169654]), Table 3-1. Additional deviations from the TWP regarding the features, events, and processes (FEPs) list are discussed in Section 1.3. Documentation in this report includes descriptions of how, and under what conditions, the tests were conducted. The descriptions and analyses provide data useful for refining and confirming the understanding of flow, drift seepage, and transport processes in the UZ. The UZ testing activities included measurement of permeability distribution, quantification of the seepage of water into the drifts, evaluation of fracture-matrix interaction, study of flow along faults, testing of flow and transport between drifts, characterization of hydrologic heterogeneity along drifts, estimation of drying effects on the rock surrounding the drifts due to ventilation, monitoring of moisture conditions in open and sealed drifts, and determination of the degree of minimum construction water migration below drift. These field tests were conducted in two underground drifts at Yucca Mountain, the Exploratory Studies Facility (ESF) drift, and the cross-drift for Enhanced Characterization of the Repository Block (ECRB), as described in Section 1.2. Samples collected in boreholes and underground drifts have been used for additional hydrochemical and isotopic analyses for additional understanding of the UZ setting. The UZ transport tests conducted at the nearby Busted Butte site (see Figure 1-4) are also described in this scientific analysis report
Exploiting Host Availability in Distributed Systems.
As distributed systems become more decentralized, fluctuating host availability is an increasingly disruptive phenomenon. Older systems such as AFS used a small number of well-maintained, highly available machines to coordinate access to shared client state; server uptime (and thus service availability) were expected to be high. Newer services scale to larger number of clients by increasing the number of servers. In these systems, the responsibility for maintaining the service abstraction is spread amongst thousands of machines. In the extreme, each client is also a server who must respond to requests from its peers, and each host can opt in or out of the system at any time. In these operating environments, a non-trivial fraction of servers will be unavailable at any give time.
This diffusion of responsibility from a few dedicated hosts to many unreliable ones has a dramatic impact on distributed system design, since it is difficult to build robust applications atop a partially available, potentially untrusted substrate. This dissertation explores one aspect of this challenge: how can a distributed system measure the fluctuating availability of its constituent hosts, and how can it use an understanding of this churn to improve performance and security?
This dissertation extends the previous literature in three ways. First, it introduces new analytical techniques for characterizing availability data, applying these techniques to several real networks and explaining the distinct uptime patterns found within. Second, this dissertation introduces new methods for predicting future availability, both at the granularity of individual hosts and clusters of hosts. Third, my dissertation describes how to use these new techniques to improve the performance and security of distributed systems.Ph.D.Computer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/58445/1/jmickens_1.pd
Recommended from our members
Efficient Routing and Scheduling in Wireless Networks
The temporal and spatial variation in wireless channel conditions, node mobility make it challenging to design protocols for wireless networks. In this thesis, we design efficient routing and scheduling algorithms which adapt to changing network conditions caused by varying link quality or node mobility to improve user-level performance. We design and analyze routing protocols for static, mobile and heterogeneous wireless networks. We analyze the performance of opportunistic and cooperative forwarding in static mesh networks showing that opportunism outperforms cooperation; we identify interference as the main cause for mitigating the potential gains achievable with cooperative forwarding. For mobile networks, we quantitatively analyze the tradeoff between state information collection (sampling frequency and number of bits per sample) and power consumption for a fixed source-to-destination goodput constraint. For heterogeneous networks comprising of both static and mobile nodes, we propose a greedy algorithm (adaptive-flood) which dynamically classifies individual nodes as routers/flooders depending on network conditions and demonstrate that it achieves performance equivalent to, and in some cases significantly better than, that of network-wide routing or flooding alone. Last, we consider an application-level wireless streaming scenario where multiple clients are streaming different videos from a cellular base station. We design a greedy algorithm for efficiently scheduling multiple video streams from a base station to mobile clients so as to minimize the total number of application-playout stalls. We develop models for coarse timescale wireless channel variation to aid network and application-layer protocol design