49 research outputs found

    Practical Bloom filter based epidemic forwarding and congestion control in DTNs: A comparative analysis

    Get PDF
    International audienceEpidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in delay tolerant networks (DTNs). Even if this technique is well known and widely referred, one has to address several practical problems before using it. Unfortunately, while the literature on DTNs is full of new techniques, very little has been done in comparing them. In particular, while Bloom filters have been proposed to exchange information about the buffer content prior to sending information in order to avoid redundant retransmissions, up to our knowledge no real evaluation has been provided to study the tradeoffs that exist for using Bloom filters in practice. A second practical issue in DTNs is buffer management (resulting from finite buffers) and congestion control (resulting from greedy sources). This has also been the topic of several papers that had already uncovered the difficulty to acquire accurate information mandatory to regulate the data transmission rates and buffer space. In this paper, we fill this gap. We have been implementing a simulation of different proposed congestion control schemes for epidemic forwarding in ns-3 environment. We use this simulation to compare different proposed schemes and to uncover issues that remain in each one of them. Based on this analysis, we proposed some strategies for Bloom filter management based on windowing and describe implementation tradeoffs. Afterwards, we propose a back-pressure rate control as a well as an aging based buffer managing solution to deal with congestion control. By simulating our proposed mechanisms in ns-3 both with random-waypoint mobility and realistic mobility traces coming from San-Francisco taxicabs, we show that the proposed mechanisms alleviate the challenges of using epidemic forwarding in DTN

    Towards efficacy and efficiency in sparse delay tolerant networks

    Get PDF
    The ubiquitous adoption of portable smart devices has enabled a new way of communication via Delay Tolerant Networks (DTNs), whereby messages are routed by the personal devices carried by ever-moving people. Although a DTN is a type of Mobile Ad Hoc Network (MANET), traditional MANET solutions are ill-equipped to accommodate message delivery in DTNs due to the dynamic and unpredictable nature of people\u27s movements and their spatio-temporal sparsity. More so, such DTNs are susceptible to catastrophic congestion and are inherently chaotic and arduous. This manuscript proposes approaches to handle message delivery in notably sparse DTNs. First, the ChitChat system [69] employs the social interests of individuals participating in a DTN to accurately model multi-hop relationships and to make opportunistic routing decisions for interest-annotated messages. Second, the ChitChat system is hybridized [70] to consider both social context and geographic information for learning the social semantics of locations so as to identify worthwhile routing opportunities to destinations and areas of interest. Network density analyses of five real-world datasets is conducted to identify sparse datasets on which to conduct simulations, finding that commonly-used datasets in past DTN research are notably dense and well connected, and suggests two rarely used datasets are appropriate for research into sparse DTNs. Finally, the Catora system is proposed to address congestive-driven degradation of service in DTNs by accomplishing two simultaneous tasks: (i) expedite the delivery of higher quality messages by uniquely ordering messages for transfer and delivery, and (ii) avoid congestion through strategic buffer management and message removal. Through dataset-driven simulations, these systems are found to outperform the state-of-the-art, with ChitChat facilitating delivery in sparse DTNs and Catora unencumbered by congestive conditions --Abstract, page iv

    A novel queue management policy for delay-tolerant networks

    Get PDF
    Delay-tolerant networks (DTNs) have attracted increasing attention from governments, academia and industries in recent years. They are designed to provide a communication channel that exploits the inherent mobility of trams, buses and cars. However, the resulting highly dynamic network suffers from frequent disconnections, thereby making node-to-node communications extremely challenging. Researchers have thus proposed many routing/forwarding strategies in order to achieve high delivery ratios and/or low latencies and/or low overheads. Their main idea is to have nodes store and carry information bundles until a forwarding opportunity arises. This, however, creates the following problems. Nodes may have short contacts and/or insufficient buffer space. Consequently, nodes need to determine (i) the delivery order of bundles at each forwarding opportunity and (ii) the bundles that should be dropped when their buffer is full. To this end, we propose an efficient scheduling and drop policy for use under quota-based protocols. In particular, we make use of the encounter rate of nodes and context information such as time to live, number of available replicas and maximum number of forwarded bundle replicas to derive a bundle\u27s priority. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that the proposed policy achieves up to 80 % improvement when nodes have an infinite buffer and up to 35 % when nodes have a finite buffer over six popular queuing policies: Drop Oldest (DO), Last Input First Output (LIFO), First Input First Output (FIFO), Most FOrwarded first (MOFO), LEast PRobable first (LEPR) and drop bundles with the greatest hop-count (HOP-COUNT)

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

    Get PDF
    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 Aggregation and Deaggregation Algorithms in Vehicular Delay-Tolerant Networks

    Get PDF
    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, bundleoriented communication from the DTN architecture, employing a store-carryand- forward routing paradigm. In this sense, VDTNs should use the tight network resources optimizing each opportunistic contact among nodes. At the ingress edge nodes, incoming IP Packets (datagrams) are assembled into large data packets, called bundles. The bundle aggregation process plays an important role on the performance of VDTN applications. Then, this paper presents three aggregation algorithms based on time, bundle size, and a hybrid solution with combination of both. Furthermore, the following four aggregation schemes with quality of service (QoS) support are proposed: 1) single-class bundle with N = M, 2) composite-class bundle with N = M, 3) single-class bundle with N > M, and 4) composite-class bundle with N > M, where N is the number of classes of incoming packets and M is the number of priorities supported by the VDTN core network. The proposed mechanisms were evaluated through a laboratory testbed, called VDTN@Lab. The adaptive hybrid approach and the composite-class schemes present the best performance for different types of traffic load and best priorities distribution, respectively

    Maximizing Routing Throughput with Applications to Delay Tolerant Networks

    Get PDF
    abstract: Many applications require efficient data routing and dissemination in Delay Tolerant Networks (DTNs) in order to maximize the throughput of data in the network, such as providing healthcare to remote communities, and spreading related information in Mobile Social Networks (MSNs). In this thesis, the feasibility of using boats in the Amazon Delta Riverine region as data mule nodes is investigated and a robust data routing algorithm based on a fountain code approach is designed to ensure fast and timely data delivery considering unpredictable boat delays, break-downs, and high transmission failures. Then, the scenario of providing healthcare in Amazon Delta Region is extended to a general All-or-Nothing (Splittable) Multicommodity Flow (ANF) problem and a polynomial time constant approximation algorithm is designed for the maximum throughput routing problem based on a randomized rounding scheme with applications to DTNs. In an MSN, message content is closely related to users’ preferences, and can be used to significantly impact the performance of data dissemination. An interest- and content-based algorithm is developed where the contents of the messages, along with the network structural information are taken into consideration when making message relay decisions in order to maximize data throughput in an MSN. Extensive experiments show the effectiveness of the above proposed data dissemination algorithm by comparing it with state-of-the-art techniques.Dissertation/ThesisDoctoral Dissertation Computer Science 201

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

    Get PDF
    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

    Efficient Buffer Management Protocol for Multicast Streaming in MANET

    Get PDF
    AbstractBuffer management techniques are essential while handling multicast streaming in MANET since real-time data will involve playback delay and jitter. In this paper, an efficient buffer management protocol is developed for streaming data in multicast groups. The frequently requested video data can be buffered in any intermediate nodes along the multicast tree from the source to the receivers. When packets are received, they are classified as real-time or non-real-time and placed into respective queues. Cumulative weight of the packets in the real-time buffer is then estimated based on number of hops, deadline and waiting time. Based on the estimated weight value, transmission priorities are assigned. The buffer space is dynamically adjusted depending on the number of intermediate nodes along the multicast tree from the source to the receivers. Simulation results show that the proposed buffer management protocol reduces the latency and energy consumption while increasing the packet delivery ratio

    Distribuição de conteúdos em redes veiculares com mecanismos de filtragem

    Get PDF
    Mestrado em Engenharia Eletrónica e TelecomunicaçõeConectividade representa uma grande necessidade da população desde o início dos tempos. As pessoas têm, logo à partida, um desejo de estarem ligadas entre si e ao resto do mundo. Tal não mudou nos tempos actuais, especialmente na era das novas tecnologias onde conectarse com alguém está apenas a uns cliques de distância. Do ponto de vista de engenheiros da área das telecomunicações, este rápido desenvolvimento nas comunicações sem fios tem sido especialmente marcante. Devido a esta constante necessidade de comunicação, as VANETs (Vehicular Ad-Hoc Networks) atraem actualmente um interesse significativo. Esse interesse deve-se ao facto de as redes veiculares não só poderem ser usadas para uma condução potencialmente mais segura, como também poderem proporcionar aos passageiros o acesso à Internet. As redes veiculares têm características específicas face a outro tipo de redes, tais como o número elevado de veículos ou nós, rotas imprevis íveis e a constante perda de conectividade entre os mesmos, revelando vários desafios que propõem estudos para os solucionar. A solução encontrada para a conectividade intermitente prende-se com o uso de DTNs (Delay-Tolerant Networks) cuja arquitectura assegura a entrega de informação mesmo quando não há conhecimento do percurso completo que esta deve percorrer. Esta Dissertação de Mestrado foca-se no estudo da disseminação de conteúdo não-urgente via uso de DTNs, assegurando que esta mesma disseminação é feita no menor espaço de tempo possível e com o mínimo congestionamento possível na rede. Actualmente, embora a entrega de informação já seja efectuada na rede num espaço de tempo satisfatório, as estratégias implementadas forçam um congestionamento (overhead ) considerável na rede. Para combater este efeito, foi desenvolvida uma estratégia de disseminação através do uso de Bloom Filters, uma estrutura de dados capaz de eliminar a maior parte dos acessos desnecessários à memória, assegurando a um nó a existência de um pacote específico, com uma certa probabilidade, de entre toda a informação que os seus vizinhos contêm. Esta estratégia foi implementada no software de DTNs mOVERS Emulator, desenvolvido pelo Instituto de Telecomunicações de Aveiro (IT) e pela Veniam® e posteriormente testada no mesmo. O emulador utilizado simula uma rede veicular com base em informação recolhida da rede veicular da cidade do Porto. Após análise dos resultados obtidos, foi concluído que a nova estratégia de disseminação proposta, denominada FILTER, cumpriu o principal objectivo proposto, nomeadamente, a redução do overhead na rede veicular, com uma pequena perda de taxa de entrega da informação. Para trabalho futuro, é aconselhável realizar um estudo mais extenso em métodos relacionados com utilidade da informação para optimizar essa mesma taxa de entrega.Connectivity represents one of people's great needs since the beginning of times. From the start, people have a desire to be connected to each other and to the rest of the world. Such has not changed in modern times, especially in the era of new technologies where connecting with someone is only a few clicks away. From the point of view of engineers in the area of telecommunications, this fast development in wireless communications has been especially outstanding. Due to this constant need for communication, VANETs (Vehicular Ad- Hoc Networks) are currently attracting signi cant attention. Such attention is due to the fact that vehicular networks may be used for, not only potentially safer driving, they also provide its users with Internet access. Vehicular Networks have speci c characteristics when compared to other types of networks, such as the high number of vehicles or nodes, unpredictable routes and the constant loss of connectivity between these nodes, thus revealing several challenges which propose studies to solve them. The solution found for the intermittent connectivity involves the use of DTNs (Delay-Tolerant Networks) whose architecture ensures the delivery of information even without knowledge of the whole path it must travel. This Masters Dissertation focuses on the study of non-urgent content dissemination through the use of DTNs, ensuring that this same dissemination is done within the shortest time frame and with the minimum congestion possible in the network. Currently, though the information delivery is already performed in the network with a satisfactory time frame, the implemented strategies force considerable congestion in the network. To overcome this e ect, a dissemination strategy was developed through the use of Bloom Filters, a data structure capable of eliminating most of the unnecessary access to memory, by ensuring a node the existence of a speci c packet, with a certain probability, from among all the information its neighbours contain. This strategy was implemented in the DTN software mOVERS, developed by Instituto de Telecomunicações in Aveiro (IT) and Veniam® and posteriorly tested in the same emulator. The emulator used simulates a vehicular network with information gathered from the vehicular network in the city of Porto. After the analysis of the obtained results, it was concluded that the new proposed dissemination strategy, named FILTER, has ful lled its primary objective, namely, the reduction of the vehicular network's overhead, with a small loss in the delivery rate of the information. For future work, it is advisable to perform a more extensive study in methods related to the information's usefulness to a neighbour to optimize such delivery rate
    corecore