On the realization of VANET using named data networking: On improvement of VANET using NDN-based routing, caching, and security

Named data networking (NDN) presents a huge opportunity to tackle some of the unsolved issues of IP-based vehicular ad hoc networks (VANET). The core characteristics of NDN such as the name-based routing, in-network caching, and built-in data security provide better management of VANET proprieties (e.g., the high mobility, link intermittency, and dynamic topology). This study aims at providing a clear view of the state-of-the-art on the developments in place, in order to leverage the characteristics of NDN in VANET. We resort to a systematic literature review (SLR) to perform a reproducible study, gathering the proposed solutions and summarizing the main open challenges on implementing NDN-based VANET. There exist several related studies, but they are more focused on other topics such as forwarding. This work specifically restricts the focus on VANET improvements by NDN-based routing (not forwarding), caching, and security. The surveyed solution herein presented is performed between 2010 and 2021. The results show that proposals on the selected topics for NDN-based VANET are recent (mainly from 2016 to 2021). Among them, caching is the most investigated topic. Finally, the main findings and the possible roadmaps for further development are highlighted

Περί κοινωνιοκεντρικών προσεγγίσεων στο πρόβλημα δρομολόγησης σε ασύρματα οπορτουνιστικά δίκτυα

Τα τελευταία χρόνια, το ενδιαφέρον της δρομολόγησης στα οπορτουνιστικά δίκτυα επικεντρώνεται στην εξαγωγή των κοινωνικών χαρακτηριστικών που θα μπορούσαν να περιγράψουν τα συγκεκριμένα δίκτυα. Κάποιες μετρικές κεντρικότητας, όπως το Betweenness Centrality, που αντιστοιχεί στο βαθμό που ένας κόμβος βρίσκεται στη διαδρομή που συνδέει άλλους κόμβους, παρουσιάζουν τη σπουδαιότητα κάθε κόμβου στην αναμετάδοση ενός μηνύματος προς κάποιον προορισμό, συνεισφέροντας σε μία καλύτερη δρομολόγηση, συγκριτικά με τις πιο απλοϊκές τεχνικές. Ωστόσο, η ανωτέρω προσέγγιση παρουσιάζει τρεις αδυναμίες: α) Η δρομολόγηση είναι ανεξάρτητη του προορισμού του μηνύματος. β) Η απόδοση καθορίζεται άμεσα από το γράφο των επαφών μεταξύ των κόμβων, στους οποίους υπολογίζονται οι τιμές κεντρικότητας. γ) Η συνολική κεντρικότητα του δικτύου πρέπει πρακτικά να υπολογιστεί με χρήση των εγωκεντρικών δικτύων. Η παρούσα εργασία εξετάζει πειραματικά την επίδραση αυτών των τριών παραγόντων στη δρομολόγηση που εκμεταλλεύεται την κεντρικότητα. Πέντε διαφορετικές τεχνικές δρομολόγησης συγκρίνονται μεταξύ τους και με δύο εξαιρετικές περιπτώσεις πολύπλοκης δρομολόγησης στα DTN: το απλό πρωτόκολλο δρομολόγησης με πιθανότητες και ένα ιδεατό σχήμα, με πλήρη γνώση των μελλοντικών επαφών, που υπολογίζει τη βέλτιστη χωροχρονική διαδρομή σε έναν πρωτότυπο γράφο, με κόμβους τις επαφές και ακμές με χρονικά βάρη. Τα αποτελέσματα αποδεικνύουν ότι η δρομολόγηση με βάση την κεντρικότητα περικλείει εγγενείς αδυναμίες.The exploitation of social context for routing data in opportunistic networks is a relatively recent trend. Node centrality metrics, such as the betweenness centrality, quantify the relaying utility of network nodes and inform routing decisions,resulting in better performance than more naive routing approaches. Nevertheless, centrality-based routing is far from optimal for three main reasons: a) routing decisions are greedy and message destination-agnostic; b) its performance is highly sensitive to the contact graph over which the node centrality values are computed; c) the global network centrality values have for practical reasons to be approximated by their egocentric counterparts. Our paper experimentally assesses the impact of these three factors on the efficacy of centrality-based routing. Five centrality-based routing variants are compared with each other and against two schemes representing extreme instances of DTN routing complexity:the simple probabilistic forwarding protocol and an ideal scheme with perfect knowledge of future contacts that computes optimal message space-time paths over a novel graph construct with contacts as vertices and time-weighted edges.The results of this comparison are not always inline with intuition and indicate inherent weaknesses of centrality-based routing

Flexpop: A popularity-based caching strategy for multimedia applications in information-centric networking

Information-Centric Networking (ICN) is the dominant architecture for the future Internet. In ICN, the content items are stored temporarily in network nodes such as routers. When the memory of routers becomes full and there is no room for a new arriving content, the stored contents are evicted to cope with the limited cache size of the routers. Therefore, it is crucial to develop an effective caching strategy for keeping popular contents for a longer period of time. This study proposes a new caching strategy, named Flexible Popularity-based Caching (FlexPop) for storing popular contents. The FlexPop comprises two mechanisms, i.e., Content Placement Mechanism (CPM), which is responsible for content caching, and Content Eviction Mechanism (CEM) that deals with content eviction when the router cache is full and there is no space for the new incoming content. Both mechanisms are validated using Fuzzy Set Theory, following the Design Research Methodology (DRM) to manifest that the research is rigorous and repeatable under comparable conditions. The performance of FlexPop is evaluated through simulations and the results are compared with those of the Leave Copy Everywhere (LCE), ProbCache, and Most Popular Content (MPC) strategies. The results show that the FlexPop strategy outperforms LCE, ProbCache, and MPC with respect to cache hit rate, redundancy, content retrieval delay, memory utilization, and stretch ratio, which are regarded as extremely important metrics (in various studies) for the evaluation of ICN caching. The outcomes exhibited in this study are noteworthy in terms of making FlexPop acceptable to users as they can verify the performance of ICN before selecting the right caching strategy. Thus FlexPop has potential in the use of ICN for the future Internet such as in deployment of the IoT technology

Congestion control framework for delay-tolerant communications

Detecting and dealing with congestion in delay tolerant networks is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards particular nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become unusable. This thesis proposes Café, an adaptive congestion aware framework that reduces traffic entering congesting network regions by using alternative paths and dynamically adjusting sending rates, and CafRep, a replication scheme that considers the level of congestion and the forwarding utility of an encounter when dynamically deciding the number of message copies to forward. Our framework is a fully distributed, localised, adaptive algorithm that evaluates a contact’s next-hop potential by means of a utility comparison of a number of congestion signals, in addition to that contact’s forwarding utility, both from a local and regional perspective. We extensively evaluate our work using two different applications and three real connectivity traces showing that, independent of the network inter-connectivity and mobility patterns, our framework outperforms a number of major DTN routing protocols. Our results show that both Café and CafRep consistently outperform the state-of-the-art algorithms, in the face of increasing traffic demands. Additionally, with fewer replicated messages, our framework increases success ratio and the number of delivered packets, and reduces the message delay and the number of dropped packets, while keeping node buffer availability high and congesting at a substantially lower rate, demonstrating our framework’s more efficient use of network resources

Enhanced Interest Aware PeopleRank for Opportunistic Mobile Social Networks

Network infrastructures are being continuously challenged by increased demand, resource-hungry applications, and at times of crisis when people need to work from homes such as the current Covid-19 epidemic situation, where most of the countries applied partial or complete lockdown and most of the people worked from home. Opportunistic Mobile Social Networks (OMSN) prove to be a great candidate to support existing network infrastructures. However, OMSNs have copious challenges comprising frequent disconnections and long delays. we aim to enhance the performance of OMSNs including delivery ratio and delay. We build upon an interest-aware social forwarding algorithm, namely Interest Aware PeopleRank (IPeR). We explored three pillars for our contribution, which encompass (1) inspect more than one hop (multiple hops) based on IPeR (MIPeR), (2) by embracing directional forwarding (Directional-IPeR), and (3) by utilizing a combination of Directional forwarding and multi-hop forwarding (DMIPeR). For Directional-IPeR, different values of the tolerance factor of IPeR, such as 25% and 75%, are explored to inspect variations of Directional-IPeR. Different interest distributions and users’ densities are simulated using the Social-Aware Opportunistic Forwarding Simulator (SAROS). The results show that (1) adding multiple hops to IPeR enhanced the delivery ratio, number of reached interested forwarders, and delay slightly. However, it increased the cost and decreased F-measure hugely. Consequently, there is no significant gain in these algorithms. (2) Directional-IPeR-75 performed generally better than IPeR in delivery ratio, and the number of reached interested forwarders. Besides, when some of the uninterested forwarders did not participate in messages delivery, which is a realistic behavior, the performance is enhanced and performed better generally in all metrics compared to IPeR. (3) Adding multiple hops to directional guided IPeR did not gain any enhancement. (4) Directional-IPeR-75 performs better in high densities in all metrics except delay. Even though, it enhances delay in sparse environments. Consequently, it can be utilized in disastrous areas, in which few people are with low connectivity and spread over a big area. In addition, it can be used in rural areas as well where there is no existing networks

Congestion control framework for delay-tolerant communications

Detecting and dealing with congestion in delay tolerant networks is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards particular nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become unusable. This thesis proposes Café, an adaptive congestion aware framework that reduces traffic entering congesting network regions by using alternative paths and dynamically adjusting sending rates, and CafRep, a replication scheme that considers the level of congestion and the forwarding utility of an encounter when dynamically deciding the number of message copies to forward. Our framework is a fully distributed, localised, adaptive algorithm that evaluates a contact’s next-hop potential by means of a utility comparison of a number of congestion signals, in addition to that contact’s forwarding utility, both from a local and regional perspective. We extensively evaluate our work using two different applications and three real connectivity traces showing that, independent of the network inter-connectivity and mobility patterns, our framework outperforms a number of major DTN routing protocols. Our results show that both Café and CafRep consistently outperform the state-of-the-art algorithms, in the face of increasing traffic demands. Additionally, with fewer replicated messages, our framework increases success ratio and the number of delivered packets, and reduces the message delay and the number of dropped packets, while keeping node buffer availability high and congesting at a substantially lower rate, demonstrating our framework’s more efficient use of network resources

Roteamento de tráfego veicular colaborativo e sem infraestrutura para sistemas de transportes inteligentes

Orientadores: Leandro Aparecido Villas, Edmundo Roberto Mauro MadeiraTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Devido à atual tendência mundial de urbanização, a sociedade moderna enfrenta, cada vez mais, sérios problemas de mobilidade urbana. Além disso, com o aumento constante do fluxo de tráfego veicular, as atuais soluções existentes para gerenciamento de tráfego se tornaram ineficientes. Com isso, para atender às crescentes necessidades dos sistemas de transporte, é necessário sistemas de transporte inteligentes (ITS). O desenvolvimento de ITS sustentável requer integração e interoperabilidade contínuas com tecnologias emergentes, tais como as redes veiculares (VANETs). As VANETs são consideradas uma tecnologia promissora que provê aplicações críticas de segurança e serviços de entretenimento, consequentemente melhorando a experiência de viagem do motorista e dos passageiros. Esta tese propõe um sistema de gerenciamento de tráfego de veículos sem a necessidade de uma infraestrutura de apoio. Para alcançar o sistema desejado foram necessários propor soluções intermediárias que contribuíram nesta tese. A primeira contribuição reside em uma solução que emprega conhecimento histórico dos padrões de mobilidade dos motoristas para obter uma visão global da situação da rede viária. Diferentemente de outras abordagens que precisam de troca constante de informações entre os veículos e o servidor central, nossa solução utiliza informações espaciais e temporais sobre padrões de mobilidade, além das informações específicas da infraestrutura viária, a fim de identificar congestionamentos no tráfego, permitindo, assim, o planejamento de roteamento de veículos. Como segunda contribuição, foi proposta uma solução distribuída para calcular a intermediação egocêntrica nas VANETs. Por meio da métrica egocêntrica foi proposto um mecanismo inovador de ranqueamento de veículos em redes altamente dinâmicas. As principais vantagens desse mecanismo para aplicações de VANETs são: (i) a redução do consumo de largura de banda e (ii) a superação do problema de topologias altamente dinâmicas. A terceira contribuição é uma solução de planejamento de rotas colaborativo com intuito de melhorar o gerenciamento do tráfego de veículos em cenários urbanos. Como última contribuição, esta tese integra as soluções descritas acima, propondo um sistema eficiente de gerenciamento de tráfego de veículos. As soluções propostas foram amplamente comparadas com outras soluções da literatura em diferentes métricas de avaliação de desempenho. Os resultados mostram que o sistema de gerenciamento de tráfego de veículos proposto é eficiente e escalável, qual pode ser uma boa alternativa para mitigar os problemas de mobilidade urbanaAbstract: Due to the current global trend of urbanization, modern society is facing severe urban mobility problems. In addition, considering the constant increase in vehicular traffic on roads, existing traffic management solutions have become inefficient. In order to assist the increasing needs of transport systems today, there is a need for intelligent transportation systems (ITS). Developing a sustainable ITS requires seamless integration and interoperability with emerging technologies such as vehicular ad-hoc networks (VANETs). VANETs are considered to be a promising technology providing access to critical life-safety applications and infotainment services, consequently improving drivers¿ and passengers¿ on-road experiences. This thesis proposes an infrastructure-less vehicular traffic management system. To achieve such a system, intermediate solutions that contributed to this thesis were proposed. The first contribution lies in a solution that employs historical knowledge of driver mobility patterns to gain an overall view of the road network situation. Unlike other approaches that need constant information exchange between vehicles and the central server, our solution uses space and temporal information about mobility patterns, as well as road infrastructure information, in order to identify traffic congestion, thus allowing for vehicle routing planning. Secondly, a distributed solution to calculate egocentric betweenness in VANETs was proposed. Through the egocentric metric, an innovative vehicle ranking mechanism in highly dynamic networks was proposed. The main advantages of this mechanism for VANETs applications are (i) reduced bandwidth consumption and (ii) overcoming the problem of highly dynamic topologies. The third contribution is a collaborative route planning solution designed to improve vehicle traffic management in urban settings. As the last contribution, this thesis integrates the solutions described above, proposing an efficient vehicle traffic management system. The proposed solutions were widely compared with other literature solutions on different performance evaluation metrics. The evaluation results show that the proposed vehicle traffic management system is efficient, scalable, and cost-effective, which may be a good alternative to mitigate urban mobility problemsDoutoradoCiência da ComputaçãoDoutor em Ciência da Computação2015/25588-6FAPES