Content Download in Vehicular Networks in Presence of Noisy Mobility Prediction

Bandwidth availability in the cellular backhaul is challenged by ever-increasing demand by mobile users. Vehicular users, in particular, are likely to retrieve large quantities of data, choking the cel- lular infrastructure along major thoroughfares and in urban areas. It is envisioned that alternative roadside network connectivity can play an important role in offloading the cellular infrastructure. We investigate the effectiveness of vehicular networks in this task, considering that roadside units can exploit mobility prediction to decide which data they should fetch from the Internet and to schedule transmissions to vehicles. Rather than adopting a specific prediction scheme, we propose a fog-of-war model that allows us to express and account for different degrees of prediction accuracy in a simple, yet effective, manner. We show that our fog-of-war model can closely reproduce the prediction accuracy of Markovian techniques. We then provide a probabilistic graph-based representation of the system that includes the prediction information and lets us optimize content prefetching and transmission scheduling. Analytical and simulation results show that our approach to content downloading through vehicular networks can achieve a 70% offload of the cellular networ

On the performance of social-based and location-aware forwarding strategies in urban vehicular networks

High vehicular mobility in urban scenarios originates inter-vehicles communication discontinuities, a highly important factor when designing a forwarding strategy for vehicular networks. Store, carry and forward mechanisms enable the usage of vehicular networks in a large set of applications, such as sensor data collection in IoT, contributing to smart city platforms. This work evaluates the performance of several location-based and social-aware forwarding schemes through emulations and in a real scenario. Gateway Location Awareness (GLA), a location-aware ranking classification, makes use of velocity, heading angle and distance to the gateway, to select the vehicles with higher chance to deliver the information in a shorter period of time, thus differentiating nodes through their movement patterns. Aging Social-Aware Ranking (ASAR) exploits the social behavior of each vehicle, where nodes are ranked based on a historical contact table, differentiating vehicles with a high number of contacts from those who barely contact with other vehicles. To merge both location and social aforementioned algorithms, a HYBRID approach emerges, thus generating a more intelligent mechanism. For each strategy, we evaluate the influence of several parameters in the network performance, as well as we comparatively evaluate the strategies in different scenarios. Experiment results, obtained both in emulated (with real traces of both mobility and vehicular connectivity from a real city-scale urban vehicular network) and real scenarios, show the performance of GLA, ASAR and HYBRID schemes, and their results are compared to lower- and upper-bounds. The obtained results show that these strategies are a good tradeoff to maximize data delivery ratio and minimize network overhead, while making use of mobile networks as a smart city network infrastructure.publishe

Exploiting Mobile Social Networks from Temporal Perspective:A Survey

With the popularity of smart mobile devices, information exchange between users has become more and more frequent, and Mobile Social Networks (MSNs) have attracted significant attention in many research areas. Nowadays, discovering social relationships among people, as well as detecting the evolution of community have become hotly discussed topics in MSNs. One of the major features of MSNs is that the network topology changes over time. Therefore, it is not accurate to depict the social relationships of people based on a static network. In this paper, we present a survey of this emerging field from a temporal perspective. The state-of-the-art research of MSNs is reviewed with focus on four aspects: social property, time-varying graph, temporal social property, and temporal social properties-based applications. Some important open issues with respect to MSNs are discussed

Optimal Content Downloading in Vehicular Networks

We consider a system where users aboard communication-enabled vehicles are interested in downloading different contents from Internet-based servers. This scenario captures many of the infotainment services that vehicular communication is envisioned to enable, including news reporting, navigation maps and software updating, or multimedia file downloading. In this paper, we outline the performance limits of such a vehicular content downloading system by modelling the downloading process as an optimization problem, and maximizing the overall system throughput. Our approach allows us to investigate the impact of different factors, such as the roadside infrastructure deployment, the vehicle-to-vehicle relaying, and the penetration rate of the communication technology, even in presence of large instances of the problem. Results highlight the existence of two operational regimes at different penetration rates and the importance of an efficient, yet 2-hop constrained, vehicle-to-vehicle relaying

Timely Data Delivery in a Realistic Bus Network

Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I

The Role of Parked Cars in Content Downloading for Vehicular Networks

When it comes to content access using Inter-Vehicle Communication (IVC), data will mostly flow through Road Side Units (RSUs), deployed in our cities. Unfortunately, the RSU coverage is expected to be rather scattered. Instead of relying on RSUs only, the paper investigate the possibility of exploiting parked vehicles to extend the RSU service coverage. Our approach leverages optimization models aiming at maximizing the freshness of content that downloaders retrieve, the efficiency in the utilization of radio resources, and the fairness in exploiting the energy resources of parked vehicles. The latter is constrained so as not to excessively drain parked vehicle batteries. Our approach provides an estimate of the system performance, even in those cases where users may only be willing to lease a limited amount of their battery capacity to extend RSU coverage. Our optimization-based results are validated by comparing them against ns-3 simulations. Performance evaluation highlights that the use of parked vehicles enhances the efficiency of the content downloading process by 25%-35% and can offload more than half the data traffic from RSUs, with respect to the case where only moving cars are used as relays. Such gains in performance come at a small cost in terms of battery utilization for the parked vehicles, and they are magnified when a backbone of parked vehicles can be formed

Improving Message Dissemination in Opportunistic Networks

Data transmission has become a need in various fields, like in social networks with the diverse interaction applications, or in the scientific and engineering areas where for example the use of sensors to capture data is growing, or in emergency situations where there is the imperative need to have a communication system to coordinate rescue operations. Wireless networks have been able to solve these issues to a great extent, but what can we do when a fixed supporting infrastructure is not available or becomes inoperative because of saturation? Opportunistic wireless networks are an alternative to consider in these situations, since their operation does not depend on the existence of a telecommunications infrastructure but they provide connectivity through the organized cooperation of users. This research thesis focuses on these types of networks and is aimed at improving the dissemination of information in opportunistic networks analyzing the main causes that influence the performance of data transmission. Opportunistic networks do not depend on a fixed topology but depend on the number and mobility of users, the type and quantity of information generated and sent, as well as the physical characteristics of the mobile devices that users have to transmit the data. The combination of these elements impacts on the duration of the contact time between mobile users, directly affecting the information delivery probability. This thesis starts by presenting a thorough "state of the art" study where we present the most important contributions related to this area and the solutions offered for the evaluation of the opportunistic networks, such as simulation models, routing protocols, simulation tools, among others. After offering this broad background, we evaluate the consumption of the resources of the mobile devices that affect the performance of the the applications of opportunistic networks, both from the energetic and the memory point of view. Next, we analyze the performance of opportunistic networks considering either pedestrian and vehicular environments. The studied approaches include the use of additional fixed nodes and different data transmission technologies, to improve the duration of the contact between mobile devices. Finally, we propose a diffusion scheme to improve the performance of data transmission based on extending the duration of the contact time and the likelihood that users will collaborate in this process. This approach is complemented by the efficient management of the resources of the mobile devices.La transmisión de datos se ha convertido en una necesidad en diversos ámbitos, como en las redes sociales con sus diversas aplicaciones, o en las áreas científicas y de ingeniería donde, por ejemplo, el uso de sensores para capturar datos está creciendo, o en situaciones de emergencia donde impera la necesidad de tener un sistema de comunicación para coordinar las operaciones de rescate. Las redes inalámbricas actuales han sido capaces de resolver estos problemas en gran medida, pero ¿qué podemos hacer cuando una infraestructura de soporte fija no está disponible o estas se vuelven inoperantes debido a la saturación de peticiones de red? Las redes inalámbricas oportunísticas son una alternativa a considerar en estas situaciones, ya que su funcionamiento no depende de la existencia de una infraestructura de telecomunicaciones sino que la conectividad es a través de la cooperación organizada de los usuarios. Esta tesis de investigación se centra en estos tipos de redes oportunísticas y tiene como objetivo mejorar la difusión de información analizando las principales causas que influyen en el rendimiento de la transmisión de datos. Las redes oportunísticas no dependen de una topología fija, sino que dependen del número y la movilidad de los usuarios, del tipo y cantidad de información generada y enviada, así como de las características físicas de los dispositivos móviles que los usuarios tienen para transmitir los datos. La combinación de estos elementos influye en la duración del tiempo de contacto entre usuarios móviles, afectando directamente a la probabilidad de entrega de información. Esta tesis comienza presentando un exhaustivo estudio del ``estado del arte", donde presentamos las contribuciones más importantes relacionadas con esta área y las soluciones existentes para la evaluación de las redes oportunísticas, tales como modelos de simulación, protocolos de enrutamiento, herramientas de simulación, entre otros. Tras ofrecer esta amplia compilación de investigaciones, se evalúa el consumo de recursos de los dispositivos móviles que afectan al rendimiento de las aplicaciones de redes oportunísticas, desde el punto de vista energético así como de la memoria. A continuación, analizamos el rendimiento de las redes oportunísticas considerando tanto los entornos peatonales como vehiculares. Los enfoques estudiados incluyen el uso de nodos fijos adicionales y diferentes tecnologías de transmisión de datos, para mejorar la duración del contacto entre dispositivos móviles. Finalmente, proponemos un esquema de difusión para mejorar el rendimiento de la transmisión de datos basado en la extensión de la duración del tiempo de contacto, y de la probabilidad de que los usuarios colaboren en este proceso. Este enfoque se complementa con la gestión eficiente de los recursos de los dispositivos móviles.La transmissió de dades s'ha convertit en una necessitat en diversos àmbits, com ara en les xarxes socials amb les diverses aplicacions d'interacció, o en les àrees científiques i d'enginyeria, en les quals, per exemple, l'ús de sensors per a capturar dades creix en l'actualitat, o en situacions d'emergència en què impera la necessitat de tenir un sistema de comunicació per a coordinar les operacions de rescat. Les xarxes sense fil han sigut capaces de resoldre aquests problemes en gran manera, però què podem fer quan una infraestructura de suport fixa no està disponible, o bé aquestes es tornen inoperants a causa de la saturació de peticions de xarxa? Les xarxes sense fil oportunistes són una alternativa que cal considerar en aquestes situacions, ja que el funcionament d'aquestes xarxes no depèn de l'existència d'una infraestructura de telecomunicacions, sinó que la connectivitat s'hi aconsegueix a través de la cooperació organitzada dels usuaris. Aquesta tesi de recerca se centra en aquest tipus de xarxes, i té com a objectiu millorar la difusió d'informació en xarxes oportunistes tot analitzant les principals causes que influeixen en el rendiment de la transmissió de dades. Les xarxes oportunistes no depenen d'una topologia fixa, sinó del nombre i la mobilitat dels usuaris, del tipus i la quantitat d'informació generada i enviada, i de les característiques físiques dels dispositius mòbils que els usuaris tenen per a transmetre les dades. La combinació d'aquests elements influeix en la durada del temps de contacte entre usuaris mòbils, i afecta directament la probabilitat de lliurament d'informació. Aquesta tesi comença amb un estudi exhaustiu de l'estat de la qüestió, en què presentem les contribucions més importants relacionades amb aquesta àrea i les solucions oferides per a l'avaluació de les xarxes oportunistes, com ara models de simulació, protocols d'encaminament o eines de simulació, entre d'altres. Després de mostrar aquest ampli panorama, s'avalua el consum dels recursos dels dispositius mòbils que afecten l'acompliment de les aplicacions de xarxes oportunistes, tant des del punt de vista energètic com de la memòria. A continuació, analitzem l'acompliment de xarxes oportunistes considerant tant els entorns de vianants com els vehiculars. Els enfocaments estudiats inclouen l'ús de nodes fixos addicionals i diferents tecnologies de transmissió de dades per a millorar la durada del contacte entre dispositius mòbils. Finalment, proposem un esquema de difusió per a millorar el rendiment de la transmissió de dades basat en l'extensió de la durada del temps de contacte, i de la probabilitat que els usuaris col·laboren en aquest procés. Aquest enfocament es complementa amb la gestió eficient dels recursos dels dispositius mòbils.Herrera Tapia, J. (2017). Improving Message Dissemination in Opportunistic Networks [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/86129TESI

Estratégias de encaminhamento para recolha oportunística de informação em redes móveis de internet das coisas

High vehicular mobility in urban scenarios originates inter-vehicles communication discontinuities, a highly important factor when designing a forwarding strategy for vehicular networks. Store, carry and forward mechanisms enable the usage of vehicular networks in a large set of applications, such as sensor data collection in IoT, contributing to smart city platforms. This work focuses on two main topics to enhance the forwarding decision: i) forwarding strategies that make use of location-aware and social-based to perform neighborhood selection, ii) and packet selection mechanisms to provide Quality of Service (QoS). The neighborhood selection is performed through multiple metrics, resulting in three forwarding strategies: (1) Gateway Location Awareness (GLA), a location-aware ranking classification making use of velocity, heading angle and distance to the gateway, to select the vehicles with higher chance to deliver the information in a shorter period of time, thus differentiating nodes through their movement patterns; (2) Aging Social-Aware Ranking (ASAR) that exploits the social behaviours of each vehicle, where nodes are ranked based on a historical contact table, differentiating vehicles with a high number of contacts from those who barely contact with other vehicles; (3) and to merge both location and social aforementioned algorithms, a hybrid approach emerges, thus generating a more intelligent mechanism. Allied to the forwarding criteria, two packet selection mechanisms are proposed to address distinct network functionalities, namely: Distributed Packet Selection, that focuses primarily on data type prioritization and secondly, on packet network lifetime; and Equalized Packet Selection, which uses network metrics to calculate a storage packet ranking. To do so, the packet number of hops, the packet type and packet network lifetime are used. In order to perform the evaluation of the proposed mechanisms, both real and emulation experiments were performed. For each forwarding strategy, it is evaluated the influence of several parameters in the network's performance, as well as comparatively evaluate the strategies in different scenarios. Experiment results, obtained with real traces of both mobility and vehicular connectivity from a real city-scale urban vehicular network, are used to evaluate the performance of GLA, ASAR and HYBRID schemes, and their results are compared to lower- and upper-bounds. Later, these strategies' viability is also validated in a real scenario. The obtained results show that these strategies are a good tradeoff to maximize data delivery ratio and minimize network overhead, while making use of moving networks as a smart city network infrastructure. To evaluate the proposed packet selection mechanisms, a First In First Out packet selection technique is used as ground rule, thus contrasting with the more objective driven proposed techniques. The results show that the proposed mechanisms are capable of provide distinct network functionalities, from prioritizing a packet type to enhancing the network's performance.A elevada mobilidade em cenários veiculares urbanos origina descontinuidades de comunicação entre veículos, um fator altamente importante quando se desenha uma estratégia de encaminhamento para redes veiculares. Mecanismos de store, carry and forward (guardar, carregar e entregar) possibilitam a recolha de dados de sensores em aplicações da Internet das coisas, contribuindo para plataformas de cidades inteligentes. Este trabalho é focado em dois tópicos principais de forma a melhorar a decisão de encaminhamento: i) estratégias de encaminhamento que fazem uso de métricas sociais e de localização para efetuar a seleção de vizinhos, ii) e mecanismos de seleção de pacotes que qualificam a rede com qualidade de serviço. A seleção de vizinhos é feita através de múltiplas métricas, resultando em três estratégias de encaminhamento: Gateway Location Awareness (GLA), uma classificação baseada em localização que faz uso de velocidade, ângulo de direção e distância até uma gateway, para selecionar os veículos com maior probabilidade de entregar a informação num menor período temporal, distinguindo os veículos através dos seus padrões de movimento. Aging Social-Aware Ranking (ASAR) explora os comportamentos sociais de cada veículo, onde é atribuída uma classificação aos veículos com base num histórico de contactos, diferenciando veículos com um alto número de contactos de outros com menos. Por fim, por forma a tirar partido das distintas características de cada uma das destas estratégias, é proposta uma abordagem híbrida, Hybrid between GLA and ASAR (HYBRID). Aliado ao critério de encaminhamento, são propostos dois mecanismos de seleção de pacotes que focam distintas funcionalidades na rede, sendo estes: Distributed Packet Selection, que foca em primeiro lugar na prioritização de determinados tipos de pacotes e em segundo lugar, no tempo de vida que resta ao pacote na rede; e Equalized Packet Selection, que usa métricas da rede para calcular a classificação de cada pacote em memória. Para tal, é usado o numero de saltos do pacote, o tipo de dados do pacote e o tempo de vida que resta ao pacote na rede. De forma a avaliar os mecanismos propostos, foram realizadas experiências em emulador e em cenário real. Para cada estratégia de encaminhamento, e avaliada a influência de vários parâmetros de configuração no desempenho da rede. Para além disso, é feita uma avaliação comparativa entre as várias estratégias em diferentes cenários. Resultados experimentais, obtidos usando traços reais de mobilidade e conetividade de uma rede veicular urbana, são utilizados para avaliar a performance dos esquemas GLA, ASAR e HYRID. Posteriormente, a viabilidade destas estratégias é também validada em cenário real. Os resultados obtidos mostram que estas estratégias são um bom tradeoff para maximizar a taxa de entrega de dados e minimizar a sobrecarga de dados na rede. Para avaliar os mecanismos de seleção de pacotes, um simples mecanismo First In First Out é utilizado como base, contrapondo com as técnicas propostas mais orientadas a objectivos concretos. Os resultados obtidos mostram que os mecanismos propostos são capazes de proporcionar à rede diferentes funcionalidades, desde prioritização de determinado tipos de dados a melhoramentos no desempenho da rede.Agradeço à Fundação Portuguesa para a Ciência e Tecnologia pelo suporte financeiro através de fundos nacionais e quando aplicável cofi nanciado pelo FEDER, no âmbito do Acordo de Parceria PT2020 pelo projecto MobiWise através do programa Operacional Competitividade e Internacionalização (COMPETE 2020) do Portugal 2020 (POCI-01-0145-FEDER-016426).Mestrado em Engenharia Eletrónica e Telecomunicaçõe

RECAST: Telling Apart Social and Random Relationships in Dynamic Networks

International audienceIn this paper, we argue that the ability to accurately spot random and social relationships in dynamic networks is essential to net- work applications that rely on human routines, such as, e.g., op- portunistic routing. We thus propose a strategy to analyze users' interactions in mobile networks where users act according to their interests and activity dynamics. Our strategy, named Random rElationship ClASsifier sTrategy (RECAST), allows classifying users' wireless interactions, separating random interactions from differ- ent kinds of social ties. To that end, RECAST observes how the real system differs from an equivalent one where entities' decisions are completely random. We evaluate the effectiveness of the RECAST classification on real-world user contact datasets collected in diverse networking contexts. Our analysis unveils significant dif- ferences among the dynamics of users' wireless interactions in the datasets, which we leverage to unveil the impact of social ties on opportunistic routing