Routing in a many-to-one communication scenario in a realistic VDTN

In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft

Improving vehicular delay-tolerant network performance with relay nodes

“Copyright © [2009] IEEE. Reprinted from Next Generation Internet Network. NGI '09). ISBN:978-1-4244-4244-7. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Networking (VDTN) is an extension of the Delay-Tolerant Network (DTN) architecture concept to transit networks. VDTN architecture handles non-real time applications, exploiting vehicles to enable connectivity under unreliable scenarios with unstable links and where an end-to-end path may not exist. Intuitively, the use of stationary store-and-forward devices (relay nodes) located at crossroads where vehicles meet them and should improve the message delivery probability. In this paper, we analyze the influence of the number of relay nodes, in urban scenarios with different numbers of vehicles. It was shown that relay nodes significantly improve the message delivery probability on studied DTN routing protocols.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of Seven Framework Programme of EU

A Taxonomy on Misbehaving Nodes in Delay Tolerant Networks

Delay Tolerant Networks (DTNs) are type of Intermittently Connected Networks (ICNs) featured by long delay, intermittent connectivity, asymmetric data rates and high error rates. DTNs have been primarily developed for InterPlanetary Networks (IPNs), however, have shown promising potential in challenged networks i.e. DakNet, ZebraNet, KioskNet and WiderNet. Due to unique nature of intermittent connectivity and long delay, DTNs face challenges in routing, key management, privacy, fragmentation and misbehaving nodes. Here, misbehaving nodes i.e. malicious and selfish nodes launch various attacks including flood, packet drop and fake packets attack, inevitably overuse scarce resources (e.g., buffer and bandwidth) in DTNs. The focus of this survey is on a review of misbehaving node attacks, and detection algorithms. We firstly classify various of attacks depending on the type of misbehaving nodes. Then, detection algorithms for these misbehaving nodes are categorized depending on preventive and detective based features. The panoramic view on misbehaving nodes and detection algorithms are further analyzed, evaluated mathematically through a number of performance metrics. Future directions guiding this topic are also presented

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

Content storage and retrieval mechanisms for vehicular delay-tolerant networks

Vehicular delay-tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN architecture uses vehicles to relay messages, enabling network connectivity in challenging scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. Thus, the storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This dissertation proposes a content storage and retrieval (CSR) solution for VDTN networks. This solution consists on storage and retrieval control labels, attached to every data bundle of aggregated network traffic. These labels define cacheable contents, and apply cachecontrol and forwarding restrictions on data bundles. The presented mechanisms gathered several contributions from cache based technologies such as Web cache schemes, ad-hoc and DTN networks. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. This work presents the performance evaluation and validation of CSR mechanisms through a VDTN testbed. Furthermore it presents several network performance evaluations and results using the well-known DTN routing protocols, Epidemic and Spray and Wait (including its binary variant). The comparison of the network behavior and performance on both protocols, with and without CSR mechanisms, proves that CSR mechanisms improve significantly the overall network performance

Performance of management solutions and cooperation approaches for vehicular delay-tolerant networks

A wide range of daily-life applications supported by vehicular networks attracted the interest, not only from the research community, but also from governments and the automotive industry. For example, they can be used to enable services that assist drivers on the roads (e.g., road safety, traffic monitoring), to spread commercial and entertainment contents (e.g., publicity), or to enable communications on remote or rural regions where it is not possible to have a common network infrastructure. Nonetheless, the unique properties of vehicular networks raise several challenges that greatly impact the deployment of these networks. Most of the challenges faced by vehicular networks arise from the highly dynamic network topology, which leads to short and sporadic contact opportunities, disruption, variable node density, and intermittent connectivity. This situation makes data dissemination an interesting research topic within the vehicular networking area, which is addressed by this study. The work described along this thesis is motivated by the need to propose new solutions to deal with data dissemination problems in vehicular networking focusing on vehicular delay-tolerant networks (VDTNs). To guarantee the success of data dissemination in vehicular networks scenarios it is important to ensure that network nodes cooperate with each other. However, it is not possible to ensure a fully cooperative scenario. This situation makes vehicular networks suitable to the presence of selfish and misbehavior nodes, which may result in a significant decrease of the overall network performance. Thus, cooperative nodes may suffer from the overwhelming load of services from other nodes, which comprises their performance. Trying to solve some of these problems, this thesis presents several proposals and studies on the impact of cooperation, monitoring, and management strategies on the network performance of the VDTN architecture. The main goal of these proposals is to enhance the network performance. In particular, cooperation and management approaches are exploited to improve and optimize the use of network resources. It is demonstrated the performance gains attainable in a VDTN through both types of approaches, not only in terms of bundle delivery probability, but also in terms of wasted resources. The results and achievements observed on this research work are intended to contribute to the advance of the state-of-the-art on methods and strategies for overcome the challenges that arise from the unique characteristics and conceptual design of vehicular networks.O vasto número de aplicações e cenários suportados pelas redes veiculares faz com que estas atraiam o interesse não só da comunidade científica, mas também dos governos e da indústria automóvel. A título de exemplo, estas podem ser usadas para a implementação de serviços e aplicações que podem ajudar os condutores dos veículos a tomar decisões nas estradas, para a disseminação de conteúdos publicitários, ou ainda, para permitir que existam comunicações em zonas rurais ou remotas onde não é possível ter uma infraestrutura de rede convencional. Contudo, as propriedades únicas das redes veiculares fazem com que seja necessário ultrapassar um conjunto de desafios que têm grande impacto na sua aplicabilidade. A maioria dos desafios que as redes veiculares enfrentam advêm da grande mobilidade dos veículos e da topologia de rede que está em constante mutação. Esta situação faz com que este tipo de rede seja suscetível de disrupção, que as oportunidades de contacto sejam escassas e de curta duração, e que a ligação seja intermitente. Fruto destas adversidades, a disseminação dos dados torna-se um tópico de investigação bastante promissor na área das redes veiculares e por esta mesma razão é abordada neste trabalho de investigação. O trabalho descrito nesta tese é motivado pela necessidade de propor novas abordagens para lidar com os problemas inerentes à disseminação dos dados em ambientes veiculares. Para garantir o sucesso da disseminação dos dados em ambientes veiculares é importante que este tipo de redes garanta a cooperação entre os nós da rede. Contudo, neste tipo de ambientes não é possível garantir um cenário totalmente cooperativo. Este cenário faz com que as redes veiculares sejam suscetíveis à presença de nós não cooperativos que comprometem seriamente o desempenho global da rede. Por outro lado, os nós cooperativos podem ver o seu desempenho comprometido por causa da sobrecarga de serviços que poderão suportar. Para tentar resolver alguns destes problemas, esta tese apresenta várias propostas e estudos sobre o impacto de estratégias de cooperação, monitorização e gestão de rede no desempenho das redes veiculares com ligações intermitentes (Vehicular Delay-Tolerant Networks - VDTNs). O objetivo das propostas apresentadas nesta tese é melhorar o desempenho global da rede. Em particular, as estratégias de cooperação e gestão de rede são exploradas para melhorar e optimizar o uso dos recursos da rede. Ficou demonstrado que o uso deste tipo de estratégias e metodologias contribui para um aumento significativo do desempenho da rede, não só em termos de agregados de pacotes (“bundles”) entregues, mas também na diminuição do volume de recursos desperdiçados. Os resultados observados neste trabalho procuram contribuir para o avanço do estado da arte em métodos e estratégias que visam ultrapassar alguns dos desafios que advêm das propriedades e desenho conceptual das redes veiculares

Performance Assessment of Fragmentation Mechanisms for Vehicular Delay-Tolerant Networks

[EN] Vehicular Delay-Tolerant Networks (VDTNs) are a new approach for vehicular communications where vehicles cooperate with each other, acting as the communication infrastructure, to provide low-cost asynchronous opportunistic communications. These communication technologies assume variable delays and bandwidth constraints characterized by a non-transmission control protocol/internet protocol architecture but interacting with it at the edge of the network. VDTNs are based on the principle of asynchronous communications, bundle-oriented communication from the DTN architecture, employing a store-carry-and-forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. Given the limited contact times among nodes, fragmentation appears as a possible solution to improve the overall network performance, increasing the bundle delivery probability. This article proposes the use of several fragmentation approaches (proactive, source, reactive, and toilet paper) for VDTNs. They are discussed and evaluated through a laboratory testbed. Reactive and toilet paper approaches present the best results. It was also shown that only the source fragmentation approach presents worst results when compared with non-fragmentation approaches.This study was partially supported by the Instituto de Telecomunicacoes, Next Generation Networks and Applications Group (NetGNA), Portugal, by the Euro-NF Network of Excellence of the Seventh Framework Programme of EU, in the framework of the Specific Joint Research Project VDTN, and by the INESC-ID multiannual funding through the PIDDAC program funds and National Funding from the FCT - Fundacao para a Ciencia e a Tecnologia through the PEst-OE/EEI/LA0008/2011 and PTDC/EEA-TEL/099074/2008 (MPSat) Projects.Dias, JAFF.; Rodrigues, JJPC.; Isento, JN.; Pereira, PRBA.; Lloret, J. (2011). Performance Assessment of Fragmentation Mechanisms for Vehicular Delay-Tolerant Networks. EURASIP Journal on Wireless Communications and Networking. 2011(195):1-14. https://doi.org/10.1186/1687-1499-2011-195S1142011195Tatchikou R, Biswas S, Dion F: Cooperative vehicle collision avoidance using inter-vehicle packet forwarding. In Presented at the IEEE Global Telecommunications Conference (IEEE GLOBECOM 2005). St. Louis, MO, USA; 2005.Park JS, Lee U, Oh SY, Gerla M, Lun DS: Emergency related video streaming in VANET using network coding. In The Third ACM International Workshop on Vehicular Ad Hoc Networks. (VANET 2006), Los Angeles, CA, USA; 2006:102-103.Buchenscheit A, Schaub F, Kargl F, Weber M: A VANET-based emergency vehicle warning system. Presented at the First IEEE Vehicular Networking Conference (IEEE VNC 2009), Tokyo, Japan 2009.Nekovee M: Sensor networks on the road: the promises and challenges of vehicular ad hoc networks and vehicular grids. In Proceedings of the Workshop on Ubiquitous Computing and e-Research. Edinburgh, UK; 2005.Blum J, Eskandarian A, Hoffmman L: Challenges of intervehicle ad hoc networks. IEEE Trans. Intell. Transport. Syst 2004, 5(4):347-351. 10.1109/TITS.2004.838218Yousefi S, Mousavi MS, Fathy M: Vehicular ad hoc networks (VANETs): challenges and perspectives. 6th International Conference on ITS Telecommunications (ITST 2006) 2006, 761-766.Füßler H, Torrent-Moreno M, Transier M, Festag A, Hartenstein H: Thoughts on a protocol architecture for vehicular ad-hoc networks. In Presented at the 2nd International Workshop on Intelligent Transportation (WIT 2005). Hamburg, Germany; 2005.Cerf V, Burleigh S, Hooke A, Torgerson L, Durst R, Scott K, Fall K, Weiss H: Delay-tolerant networking architecture. RFC 4838 2007. [Online] [ http://www.rfc-editor.org/rfc/rfc4838.txt ]Soares VNGJ, Farahmand F, Rodrigues JJPC: A layered architecture for vehicular delay-tolerant networks. In The Fourteenth IEEE Symposium on Computers and Communications (ISCC 2009). Sousse, Tunisia; 2009:122-127.Rodrigues JJPC, Soares VNGJ, Farahmand F: Stationary relay nodes deployment on vehicular opportunistic networks. In Mobile Opportunistic Networks: Architectures, Protocols and Applications. Edited by: Denko M. CRC Press, Taylor & Francis Group (hardcover); 2011:227-243.Postel J: Internet Protocol. RFC 791 1981. [Online] [ http://www.ietf.org/rfc/rfc791.txt ]Kent CA, Moguk JC: Fragmentation considered harmful. SIGCOMM Comput Commun Rev 1995, 25(1):75-87. 10.1145/205447.205456Kim B-S, Fang Y, Wong TF, Kwon Y: Throughput enhancement through dynamic fragmentation in wireless LANs. IEEE Trans Veh Technol 2005, 54(4):1415-1425. 10.1109/TVT.2005.851361Ginzboorg P, Niemi V, Ott J: Message Fragmentation in Disruptive Networks. Nokia Research Center, Technical Report; 2009.Legner M: Map-Based Geographic Forwarding in Vehicular Networks. Department of Informatic, University of Stuttgart; 2002.Li Q, Rus D: Sending messages to mobile users in disconnected ad-hoc wireless networks. 6th Annual International Conference on Mobile Computing and Networking, New York, USA 2000, 44-55.Vahdat A, Becker B: Epidemic Routing for Partially-Connected Ad-Hoc Networks. Duke University, Technical Report; 2000.Briesemeister L, Hommel G: Overcoming fragmentation in mobile ad-hoc networks. J Commun Netw 2000, 2(3):182-187.Liu H, Sheng H, Lv Z, Li L, Ma C: A cross layer design of fragmentation and priority scheduling in vehicular ad hoc networks. 7th World Congress on Intelligent Control and Automation (WCICA 2008) 2008, 6157-6160.Joshi HP: Distributed robust geocast: a multicast protocol for inter-vehicle communication. Master Thesis, North Carolina State University; 2006.Bachir A, Benslimane A: A multicast protocol in ad hoc networks: Inter-vehicles geocast. Proceedings of the 57th IEEE Vehicular Technology Conference, Korea 2003, 2456-2460.Mikko P, Ari K, Ott J: Message fragmentation in opportunistic DTNs. In 9th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WOWMOM 2008). Newport Beach, CA, USA; 2008.Farrell S, Symington S, Weiss H: Delay-tolerant networking security overview. Internet Draft 2009. [Online] [ http://tools.ietf.org/html/draft-irtf-dtnrg-sec-overview-06 ]Magaia N, Pereira PR, Casaca A, Rodrigues J, Dias JA, Isento JN, Cervelló-Pastor C, Gallego J: Bundles fragmentation in vehicular delay-tolerant networks. 7th Euro-nf conference on next generation internet, Kaiserslautern, Germany 2011.Soares V, Rodrigues J, Farahmand F, Denko M: Exploiting node localization for performance improvement of vehicular delay-tolerant networks. In IEEE International Conference on Communications (ICC 2010). Cape Town, South Africa; 2010.Rubinstein MG, Abdesselm FB, Cavalcanti SR, Campista MEM, Alves RSA, Costa LHMK, Amorim MD, Duarte OCMB: Measuring the capacity of in-car to in-car vehicular networks. IEEE Commun Mag 2009, 47(11):128-136.Spyropoulos T, Psounis K, Raghavendra C S: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In ACM SIGCOMM 2005--Workshop on Delay Tolerant Networking and Related Networks (WDTN-05). Philadelphia, PA, USA; 2005:252-259.Lindgren A, Doria A, Davies E, Grasic S: Probabilistic routing protocol for intermittently connected networks (2010). Internet Draft 2010. [Online] [ http://tools.ietf.org/html/draft-irtf-dtnrg-prophet-06 ]Teshima S, Ohta T, Kohno E, Kakuda Y: A data transfer scheme using autonomous clustering in VANETs environment. In 10th International Symposium on Autonomous Decentralized Systems (ISADS 2011). Tokyo, Japan; 2011:477-482.Psounis K: Efficient Routing for Safety Applications in Vehicular Networks. METRANS Project DTRS98-G0019, Electrical Engineering. University of Southern California, Los Angeles, USA; 2009.Li X, Shu W, Li M, Huang H, Min-You Wu: DTN routing in vehicular sensor networks. In IEEE Global Telecommunications Conference (IEEE GLOBECOM 2008). New Orleans, USA; 2008:1-5