Pasar al contenido principal

PLATAFORMA SEGURA CROWD2CROWD PARA APLICACIONES DE TRANPORTE INTELIGENTE OPORTUNISTAS Y DESCENTRALIZADAS

TIN2017-87211-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

General and mixed linear regressions to estimate inter-contact times and contact duration in opportunistic networks

  • Borrego, Carlos
  • Magaia, Naercio
  • Hernández-Orallo, Enrique|||0000-0002-3284-561X
[EN] In the context of Opportunistic Networking (OppNet), routing and delivery algorithms used for content dissemination employ different metrics to perform accurate decisions. It has been shown that of these metrics, the inter-contact time and the contact duration are very useful for characterising OppNet scenarios. In this article, we show that the exponential moving averages of the historical values of these metrics are correlated with future observed values, in addition to also being good estimators for them. Moreover, we go a step further to investigate how to locally, from the OppNet node perspective, improve the estimations for these metrics by defining two novel estimation functions. These estimation functions are based on two different linear models: a general regression model and a mixed regression model, where future values of the studied metrics are explained in terms of their corresponding exponential moving averages. Experimentation using real mobility traces from well-known OppNet scenarios show that our estimation functions greatly reduce the estimation error of the future values of both metrics when compared to representative state of the art proposals. (C) 2019 Elsevier B.V. All rights reserved., This work was supported by LASIGE Research Unit, ref. UlD/CE000408/2013, by the Catalan AGAUR 2017SGR-463 project and the Spanish Ministry of Science and Innovation TIN2017-87211-R project.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Efficient Broadcast in Opportunistic Networks using Optimal Stopping Theory

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrell i Viader, Joan|||0000-0001-6649-0450
In this paper, we present a broadcast dissemination protocol for messages in opportunistic networks (OppNet) that is efficient in terms of energy consumption and network capacity usage, while not increasing the number of excluded nodes (nodes not receiving messages). The majority of the OppNet broadcast delivery schemes proposed in the literature, do not take into consideration that reducing energy and buffer usage is of paramount importance in these wireless networks normally consisting of small devices. In our protocol, broadcast messages are limited by carefully selecting their prospective forwarders (storers). The keystone of our protocol is the use of Optimal Stopping Theory, which selects the best message storers at every stage of the algorithm, while holding back broad message dissemination until convenient conditions are met. The broadcast efficiency of the proposed protocol out competes other OppNet broadcast proposals in four well-known scenarios. Furthermore, the protocol reduces the number of both dropped messages and nodes not receiving messages, thus maximising network capacity usage, and the span of the message delivery.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Hey, Influencer! Message Delivery to Social Central Nodes in Social Opportunistic Networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Borrell i Viader, Joan|||0000-0001-6649-0450
  • Robles, Sergi|||0000-0002-9924-2477
This paper presents a new strategy to efficiently deliver messages to influencers in social opportunistic networks. An influencer node is an important node in the network with a high social centrality and, as a consequence, it can have some characteristics such as high reputation, trustfulness and credibility, that makes it an interesting recipient. Social network analysis has already been used to improve routing in opportunistic networking, but there are no mechanisms to efficiently route and deliver messages to these network influencers. The delivery strategy proposed in this article uses optimal stopping statistical techniques to choose among the different delivery candidate nodes in order to maximise the social centrality of the node chosen for delivery. For this decision process, we propose a routing-delivery strategy that takes into account node characteristics such as how central a node is in terms of its physical encounters. We show, by means of simulations based on real traces and message exchange datasets, that our proposal is efficient in terms of influencer selection, overhead, delivery ratio and latency time. With the proposed strategy, a new venue of applications for opportunistic networks can be devised and developed using the leading figure of social influencers.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Probabilistic Metric Spaces for Privacy by Design Machine Learning Algorithms, Modeling Database Changes

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Machine learning, data mining and statistics are used to analyze the data and to build models from them. Data privacy for big data needs to find a compromise between data analysis and disclosure risk. Privacy by design machine learning algorithms need to take into account the space of models and the relationship between the data that generates the models and the models themselves. In this paper we propose the use of probabilistic metric spaces for comparing these models.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

General and mixed linear regressions to estimate inter-contact times and contact duration in Opportunistic Networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Hernández Orallo, Enrique|||0000-0002-3284-561X
  • Magaia, Naercio|||0000-0002-6613-1666
In the context of Opportunistic Networking (OppNet), routing and delivery algorithms used for content dissemination employ different metrics to perform accurate decisions. It has been shown that of these metrics, the inter-contact time and the contact duration are very useful for characterising OppNet scenarios. In this article, we show that the exponential moving averages of the historical values of these metrics are correlated with future observed values, in addition to also being good estimators for them. Moreover, we go a step further to investigate how to locally, from the OppNet node perspective, improve the estimations for these metrics by defining two novel estimation functions. These estimation functions are based on two different linear models: a general regression model and a mixed regression model, where future values of the studied metrics are explained in terms of their corresponding exponential moving averages. Experimentation using real mobility traces from well-known OppNet scenarios show that our estimation functions greatly reduce the estimation error of the future values of both metrics when compared to representative state of the art proposals.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Privacy-Preserving Routing Protocol Using Mix Networks in Opportunistic Networks

  • Chen, Depeng
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
This paper focuses on the problem of providing anonymous communications in opportunistic networks. To that end, we propose an approach using Mix networks that enables a relatively simple solution. Opportunistic networks present some constraints that make the deployment of typical network anonymity solutions difficult or infeasible. We show, utilizing simulations on the basis of real mobility traces, that the proposed solution is feasible for some scenarios by introducing a tolerable penalty in terms of message delay and delivery. To investigate the impact of routing strategies, we offer two different methods to select Mix nodes. From the experiment results, we show the trade-off between network performance and security.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Corpus for development of routing algorithms in opportunistic networks

  • Freire Bastidas, Diego Mauricio|||0000-0002-9517-7292
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
We have designed a collection of scenarios, a corpus, for its use in the study and development of routing algorithms for opportunistic networks. To obtain these scenarios, we have followed a methodology based on characterizing the space and choosing the best exemplary items in such a way that the corpus as a whole was representative of all possible scenarios. Until now, research in this area was using some sets of non-standard network traces that made it difficult to evaluate algorithms and perform fair comparisons between them. These developments were hard to assess in an objective way, and were prone to introduce unintentional biases that directly affected the quality of the research. Our contribution is more than a collection of scenarios; our corpus provides a fine collection of network behaviors that suit the development of routing algorithms, specifically in evaluating and comparing them. If the scientific community embraces this corpus, the community will have a global-agreed methodology where the validity of results would not be limited to specific scenarios or network conditions, thus avoiding self-produced evaluation setups, availability problems and selection bias, and saving time. New research in the area will be able to validate the routing algorithms already published. It will also be possible to identify the scenarios better suit specific purposes, and results will be easily verified. The corpus is available free to download and use.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Message anonymity on predictable opportunistic networks

  • Chen, D.
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Borrell i Viader, Joan|||0000-0001-6649-0450
A Predictable Opportunistic Network (POppNet) is a network where end-to-end connectivity is not guaranteed, and node communication happens in an opportunistic manner, but the behavior of the network can be predicted in advance. The predictability of such networks can be exploited to simplify some mechanisms of more generic OppNets where there is no prior knowledge on the network behavior. In this paper, we propose some solutions to provide anonymity for messages on POppNets by using simple onion routing, and thus to increase the privacy of the nodes in communication.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

The space of models in machine learning, using Markov chains to model transitions

  • Torra, Vicenç
  • Taha, Mariam
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Machine and statistical learning is about constructing models from data. Data is usually understood as a set of records, a database. Nevertheless, databases are not static but change over time. We can understand this as follows: there is a space of possible databases and a database during its lifetime transits this space. Therefore, we may consider transitions between databases, and the database space. NoSQL databases also fit with this representation. In addition, when we learn models from databases, we can also consider the space of models. Naturally, there are relationships between the space of data and the space of models. Any transition in the space of data may correspond to a transition in the space of models. We argue that a better understanding of the space of data and the space of models, as well as the relationships between these two spaces is basic for machine and statistical learning. The relationship between these two spaces can be exploited in several contexts as, e.g., in model selection and data privacy. We consider that this relationship between spaces is also fundamental to understand generalization and overfitting. In this paper, we develop these ideas. Then, we consider a distance on the space of models based on a distance on the space of data. More particularly, we consider distance distribution functions and probabilistic metric spaces on the space of data and the space of models. Our modelization of changes in databases is based on Markov chains and transition matrices. This modelization is used in the definition of distances. We provide examples of our definitions.