Pasar al contenido principal

REDES COMUNITARIAS Y SERVICIOS CLOUD

TIN2013-47245-C2-1-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
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 2013
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A stochastic approach for modeling message dissemination in opportunistic networks

  • Orozco, Javier
  • Santos, Rodrigo
  • Meseguer Pallarès, Roc|||0000-0002-9414-646X
  • Ochoa, Sergio
This is a pre-print of an article published in Wireless Personal Communications. The final authenticated version is available online at: https://doi.org/10.1007/s11277-017-4604-6, The opportunistic networks have shown to be an interesting communication infrastructure for supporting mobile collaborative systems in several application scenarios like disaster relief efforts, hospital work and tourism. The message delivery strategies used in these networks affect in different ways the performance and energy consumption of these systems. Therefore, it is important to understand the message dissemination process in opportunistic networks to envision the impact that it will have on mobile collaborative systems. Most approaches used to study the message dissemination in these networks use simulations or empirical tests. Although useful, the first one requires an important modeling effort, and the second one involves high design and experimentation costs. This limits our capability to evaluate alternatives for message dissemination and choose the most appropriate one according to the features of the application scenario. In order to help address this limitation, we propose a stochastic approach for modeling message dissemination in opportunistic networks. This approach involves a low modeling and usage effort that allows designers not only to compare several dissemination strategies, but also design particular ones using an iterative process. The usability and usefulness of this approach is illustrated through the modeling and analysis of the dissemination process of two well-known message routing strategies. Although the results are still preliminary, they show the feasibility of using this proposal, and opens several opportunities for studying these networks and improving the mobile applications that use them., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Mobile Autonomous Sensing Unit (MASU): a framework that supports distributed pervasive data sensing

  • Medina Medina, Esunly
  • López Nuevo, David Andrés
  • Meseguer Pallarès, Roc|||0000-0002-9414-646X
  • Ochoa, Sergio
  • Royo Vallés, María Dolores
  • Santos, Rodrigo
Pervasive data sensing is a major issue that transverses various research areas and application domains. It allows identifying people’s behaviour and patterns without overwhelming the monitored persons. Although there are many pervasive data sensing applications, they are typically focused on addressing specific problems in a single application domain, making them difficult to generalize or reuse. On the other hand, the platforms for supporting pervasive data sensing impose restrictions to the devices and operational environments that make them unsuitable for monitoring loosely-coupled or fully distributed work. In order to help address this challenge this paper present a framework that supports distributed pervasive data sensing in a generic way. Developers can use this framework to facilitate the implementations of their applications, thus reducing complexity and effort in such an activity. The framework was evaluated using simulations and also through an empirical test, and the obtained results indicate that it is useful to support such a sensing activity in loosely-coupled or fully distributed work scenarios., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Evaluation of mesh routing protocols for wireless community networks

  • Neumann, Axel
  • López Berga, Ester
  • Navarro Moldes, Leandro|||0000-0003-4775-5526
In recent years, we have witnessed the exponential growth of wireless community networks as a response to the clear necessity of Internet access for participation in society. For wireless mesh networks that can scale up to thousands of nodes, which are owned and managed in a decentralized way, it is imperative for their survival to provide the network with self-management mechanisms that reduce the requirements of human intervention and technological knowledge in the operation of a community network. In this paper, we focus on one important self-management mechanism, routing, and we study the scalability, performance, and stability of three proactive mesh routing protocols: BMX6, OLSR, and Babel. We study different metrics on an emulation framework and on the W-ILab.T testbed at iMinds, making the most of the two worlds. Emulation allows us to have more control over the topology and more systematically repeat the experiments, whereas a testbed provides a realistic wireless medium and more reliable measurements, especially in terms of interference and CPU consumption. Results show the relative merits, costs, and limitations of the three protocols., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A technological overview of the guifi.net community network

  • Vega d'Aurelio, Davide|||0000-0001-8795-1957
  • Baig Viñas, Roger|||0000-0001-9813-7678
  • Cerdà Alabern, Llorenç|||0000-0002-2799-6173
  • Medina Medina, Esunly
  • Meseguer Pallarès, Roc|||0000-0002-9414-646X
  • Navarro Moldes, Leandro|||0000-0003-4775-5526
This work presents a technological analysis of guifi.net, a free, neutral, and open-access community network. Guifi.net consists of more than 27,000 operational nodes, which makes it the world’s largest community network in terms of the number of nodes and coverage area. This paper describes the characteristics of the network, the link level topology, its growth over a decade, and its resilience in terms of availability and reachability of network nodes. Our study is based on open data published by guifi.net regarding its nodes and wireless links, monitoring information, community database, and its web portal. The data includes historical information that covers the lifetime of the network. The scale and diversity of the network requires a separate analysis of the subsets of the entire dataset by area or by separating the core from the leaf nodes. This shows some degree of diversity in local characteristics caused by several demographic, geographic, technological, and network design factors. We focus on the following aspects: technological network diversity, topology characteristics, evolution of the network over time, analysis of robustness, and its effect on networking service availability. In addition, we analyse how the community, the technology used, the geographical region where the network is deployed, and its self-organised structure shape the network properties and determine its strengths and weaknesses. The study demonstrates that the guifi.net community network is diverse in technological choices for hardware, link protocols, and channels and uses a combination of routing protocols yet provides a common private IP network. The graph topology follows a power- law distribution for links in regions up to a few thousand Km 2 , limited to the scope of wireless links. Network growth has two aspects: a geographic growth of the network core using long distance links with wireless or fibre, and the local growth in density with leaf low-cost leaf nodes. The resilience of the network derived from the nodes’ uptime and the structure of the graph varies across different regions with more fragile leafs than core nodes and diverse degrees of graph resilience to random failures or coordinated attacks, such as natural causes, depending on the network planning, structure, and maturity. The guifi.net community network results from a loosely coupled and decentralised organic growth that exhibits large local differences, diverse growth, and maturity under a common community license and social network., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Enabling individually entrusted routing security for open and decentralized community networks

  • Neumann, Axel
  • Navarro Moldes, Leandro|||0000-0003-4775-5526
  • Cerdà Alabern, Llorenç|||0000-0002-2799-6173
Routing in open and decentralized networks relies on cooperation. However, the participation of unknown nodes and node administrators pursuing heterogeneous trust and security goals is a challenge. Community-mesh networks are good examples of such environments due to their open structure, decentralized management, and ownership. As a result, existing community networks are vulnerable to various attacks and are seriously challenged by the obligation to find consensus on the trustability of participants within an increasing user size and diversity. We propose a practical and novel solution enabling a secured but decentralized trust management. This work presents the design and analysis of securely-entrusted multi-topology routing (SEMTOR), a set of routing-protocol mechanisms that enable the cryptographically secured negotiation and establishment of concurrent and individually trusted routing topologies for infrastructure-less networks without relying on any central management. The proposed mechanisms have been implemented, tested, and evaluated for their correctness and performance to exclude non-trusted nodes from the network. Respective safety and liveness properties that are guaranteed by our protocol have been identified and proven with formal reasoning. Benchmarking results, based on our implementation as part of the BMX7 routing protocol and tested on real and minimal (OpenWRT, 10 Euro) routers, qualify the behaviour, performance, and scalability of our approach, supporting networks with hundreds of nodes despite the use of strong asymmetric cryptography., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A technological overview of the guifi.net community network

  • Vega d'Aurelio, Davide
  • Baig Viñas, Roger
  • Cerdà Alabern, Llorenç
  • Medina Medina, Esunly
  • Meseguer Pallarès, Roc
  • Navarro Moldes, Leandro
This work presents a technological analysis of guifi.net, a free, neutral, and open-access community network. Guifi.net consists of more than 27,000 operational nodes, which makes it the world’s largest community network in terms of the number of nodes and coverage area. This paper describes the characteristics of the network, the link level topology, its growth over a decade, and its resilience in terms of availability and reachability of network nodes. Our study is based on open data published by guifi.net regarding its nodes and wireless links, monitoring information, community database, and its web portal. The data includes historical information that covers the lifetime of the network. The scale and diversity of the network requires a separate analysis of the subsets of the entire dataset by area or by separating the core from the leaf nodes. This shows some degree of diversity in local characteristics caused by several demographic, geographic, technological, and network design factors. We focus on the following aspects: technological network diversity, topology characteristics, evolution of the network over time, analysis of robustness, and its effect on networking service availability. In addition, we analyse how the community, the technology used, the geographical region where the network is deployed, and its self-organised structure shape the network properties and determine its strengths and weaknesses. The study demonstrates that the guifi.net community network is diverse in technological choices for hardware, link protocols, and channels and uses a combination of routing protocols yet provides a common private IP network. The graph topology follows a power- law distribution for links in regions up to a few thousand Km 2 , limited to the scope of wireless links. Network growth has two aspects: a geographic growth of the network core using long distance links with wireless or fibre, and the local growth in density with leaf low-cost leaf nodes. The resilience of the network derived from the nodes’ uptime and the structure of the graph varies across different regions with more fragile leafs than core nodes and diverse degrees of graph resilience to random failures or coordinated attacks, such as natural causes, depending on the network planning, structure, and maturity. The guifi.net community network results from a loosely coupled and decentralised organic growth that exhibits large local differences, diverse growth, and maturity under a common community license and social network., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A stochastic approach for modeling message dissemination in opportunistic networks

  • Orozco, Javier
  • Santos, Rodrigo
  • Meseguer Pallarès, Roc
  • Ochoa, Sergio
This is a pre-print of an article published in Wireless Personal Communications. The final authenticated version is available online at: https://doi.org/10.1007/s11277-017-4604-6, The opportunistic networks have shown to be an interesting communication infrastructure for supporting mobile collaborative systems in several application scenarios like disaster relief efforts, hospital work and tourism. The message delivery strategies used in these networks affect in different ways the performance and energy consumption of these systems. Therefore, it is important to understand the message dissemination process in opportunistic networks to envision the impact that it will have on mobile collaborative systems. Most approaches used to study the message dissemination in these networks use simulations or empirical tests. Although useful, the first one requires an important modeling effort, and the second one involves high design and experimentation costs. This limits our capability to evaluate alternatives for message dissemination and choose the most appropriate one according to the features of the application scenario. In order to help address this limitation, we propose a stochastic approach for modeling message dissemination in opportunistic networks. This approach involves a low modeling and usage effort that allows designers not only to compare several dissemination strategies, but also design particular ones using an iterative process. The usability and usefulness of this approach is illustrated through the modeling and analysis of the dissemination process of two well-known message routing strategies. Although the results are still preliminary, they show the feasibility of using this proposal, and opens several opportunities for studying these networks and improving the mobile applications that use them., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Evaluation of mesh routing protocols for wireless community networks

  • Neumann, Axel
  • López Berga, Ester
  • Navarro Moldes, Leandro
In recent years, we have witnessed the exponential growth of wireless community networks as a response to the clear necessity of Internet access for participation in society. For wireless mesh networks that can scale up to thousands of nodes, which are owned and managed in a decentralized way, it is imperative for their survival to provide the network with self-management mechanisms that reduce the requirements of human intervention and technological knowledge in the operation of a community network. In this paper, we focus on one important self-management mechanism, routing, and we study the scalability, performance, and stability of three proactive mesh routing protocols: BMX6, OLSR, and Babel. We study different metrics on an emulation framework and on the W-ILab.T testbed at iMinds, making the most of the two worlds. Emulation allows us to have more control over the topology and more systematically repeat the experiments, whereas a testbed provides a realistic wireless medium and more reliable measurements, especially in terms of interference and CPU consumption. Results show the relative merits, costs, and limitations of the three protocols., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Enabling individually entrusted routing security for open and decentralized community networks

  • Neumann, Axel
  • Navarro Moldes, Leandro
  • Cerdà Alabern, Llorenç
Routing in open and decentralized networks relies on cooperation. However, the participation of unknown nodes and node administrators pursuing heterogeneous trust and security goals is a challenge. Community-mesh networks are good examples of such environments due to their open structure, decentralized management, and ownership. As a result, existing community networks are vulnerable to various attacks and are seriously challenged by the obligation to find consensus on the trustability of participants within an increasing user size and diversity. We propose a practical and novel solution enabling a secured but decentralized trust management. This work presents the design and analysis of securely-entrusted multi-topology routing (SEMTOR), a set of routing-protocol mechanisms that enable the cryptographically secured negotiation and establishment of concurrent and individually trusted routing topologies for infrastructure-less networks without relying on any central management. The proposed mechanisms have been implemented, tested, and evaluated for their correctness and performance to exclude non-trusted nodes from the network. Respective safety and liveness properties that are guaranteed by our protocol have been identified and proven with formal reasoning. Benchmarking results, based on our implementation as part of the BMX7 routing protocol and tested on real and minimal (OpenWRT, 10 Euro) routers, qualify the behaviour, performance, and scalability of our approach, supporting networks with hundreds of nodes despite the use of strong asymmetric cryptography., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Mobile Autonomous Sensing Unit (MASU): a framework that supports distributed pervasive data sensing

  • Medina Medina, Esunly
  • López Nuevo, David Andrés
  • Meseguer Pallarès, Roc
  • Ochoa, Sergio
  • Royo Vallés, María Dolores
  • Santos, Rodrigo
Pervasive data sensing is a major issue that transverses various research areas and application domains. It allows identifying people’s behaviour and patterns without overwhelming the monitored persons. Although there are many pervasive data sensing applications, they are typically focused on addressing specific problems in a single application domain, making them difficult to generalize or reuse. On the other hand, the platforms for supporting pervasive data sensing impose restrictions to the devices and operational environments that make them unsuitable for monitoring loosely-coupled or fully distributed work. In order to help address this challenge this paper present a framework that supports distributed pervasive data sensing in a generic way. Developers can use this framework to facilitate the implementations of their applications, thus reducing complexity and effort in such an activity. The framework was evaluated using simulations and also through an empirical test, and the obtained results indicate that it is useful to support such a sensing activity in loosely-coupled or fully distributed work scenarios., Peer Reviewed, Postprint (published version)