Skip to main content

MONITORIZACION DE INCIDENTES EN COMUNIDADES INTELIGENTES

TEC2014-54335-C4-1-R

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

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

Emergency aware congestion control for smart grid neighborhood area networks

  • Astudillo León, Juan Pablo|||0000-0002-7291-3584
  • Cruz Llopis, Luis Javier de la|||0000-0003-4171-8310
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, The evolution of traditional electricity distribution infrastructures towards Smart Grid networks has generated the need to carry out new research. There are many fields that have attracted the attention of researchers, among which is the improvement of the performance of the so-called Neighborhood Area Networks (NAN). In this sense, and given the critical nature of some of the data transmitted by these networks, maintaining an adequate quality of service (QoS) is absolutely necessary. In emergency situations, this need becomes even more evident. This article presents a congestion control mechanism, whose parameters are modified according to the network state of emergency. The mechanism also applies a multi-channel allocation technique, together with a differentiation in the QoS offered to the different data flows according to their relevance. These proposals have been evaluated in the context of a wireless mesh networks (WMN) made up by a set of smart meter devices, where various smart grids (SG) applications are sending their data traffics. Each SG application must meet its unique quality of service (QoS) requirements, such as reliability and delay. To evaluate the proposals, some NAN scenarios have been built by using the ns-3 simulator and its 802.11s basic model, which was modified to implement the proposed techniques. Compared with the basic Hybrid Wireless Mesh Protocol (HWMP), Emergency Aware Congestion Control proposal (EA-HWMP), shows significant improvements in terms of packet delivery ratio, network throughput and transit time., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A novel dynamic reputation-based source routing protocol for mobile ad hoc networks

  • Guaya, Lenin
  • Pallarès Segarra, Esteve|||0000-0001-6966-8349
  • Mezher, Ahmad Mohamad|||0000-0003-3263-0122
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
This is a post-peer-review, pre-copyedit version of an article published in Eurasip journal on wireless communication and networking. The final authenticated version is available online at: http://dx.doi.org/10.1186/s13638-019-1375-7, Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations., This work was supported in part by the Spanish Government under projects INRISCO (TEC2014–-54335-C4-1-R) and MAGOS (TEC2017-84197-C4-3-R)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A joint multi-path and multi-channel protocol for traffic routing in smart grid neighborhood area networks

  • Astudillo León, Juan Pablo|||0000-0002-7291-3584
  • Cruz Llopis, Luis Javier de la|||0000-0003-4171-8310
In order to improve the management mechanisms of the electric energy transport infrastructures, the smart grid networks have associated data networks that are responsible for transporting the necessary information between the different elements of the electricity network and the control center. Besides, they make possible a more efficient use of this type of energy. Part of these data networks is comprised of the Neighborhood Area Networks (NANs), which are responsible for interconnecting the different smart meters and other possible devices present at the consumers' premises with the control center. Among the proposed network technologies for NANs, wireless technologies are becoming more relevant due to their flexibility and increasing available bandwidth. In this paper, some general modifications are proposed for the routing protocol of the wireless multi-hop mesh networks standardized by the IEEE. In particular, the possibility of using multiple paths and transmission channels at the same time, depending on the quality of service needs of the different network traffic, is added. The proposed modifications have been implemented in the ns-3 simulator and evaluated in situations of high traffic load. Simulation results show improvements in the network performance in terms of packet delivery ratio, throughput and network transit time., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A traffic-aware electric vehicle charging management system for smart cities

  • Barbecho Bautista, Pablo Andrés|||0000-0002-5281-9208
  • Lemus Cárdenas, Leticia
  • Urquiza Aguiar, Luis
  • Aguilar Igartua, Mónica|||0000-0002-6518-888X
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, The expected increase in the number of electric vehicles (EVs) in the coming years will contribute to reducing CO2 pollution in our cities. Currently, EVs' users may suffer from distress due to long charging service times and overloaded charging stations (CSs). Critical traffic conditions (e.g., traffic jams) affect EVs' trip time (TT) towards CSs and thus influence the total trip duration. With this concern, Intelligent transport systems (ITS) and more specifically connected vehicle technologies, can leverage an efficient real-time EV charging service by jointly considering CSs status and traffic conditions in the city. In this work, we propose a scheme to manage EVs' charging planning, focusing on the selection of a CS for the energy-requiring EV. The proposed scheme considers anticipated charging slots reservations performed through a vehicular ad hoc network (VANET), which has been regarded as a cost-efficient communication framework. In specific, we consider two aspects: 1) the EV's total trip time towards its destination considering an intermediate charging at each candidate CS, and 2) the communication delay of the VANET routing protocol. First, in order to estimate the EV's total trip time, our CS selection scheme takes into account the average road speed, traffic lights, and route distance, along the path of the EV. The optimal CS that produces the minimum total charging service time (including the TT) is suggested to that energy-requiring EV. Then, we introduce two communication modes based on geographical routing protocols for VANETs to attain an anticipated charging slot reservation. Simulation results show that with our charging scheme EVs' charging service time is reduced and more EVs are successfully charged., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Incremental k-Anonymous microaggregation in large-scale electronic surveys with optimized scheduling

  • Rebollo Monedero, David|||0000-0002-0783-2382
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
  • Soriano Ibáñez, Miguel|||0000-0003-0457-8531
  • Hernández Baigorri, César
Improvements in technology have led to enormous volumes of detailed personal information made available for any number of statistical studies. This has stimulated the need for anonymization techniques striving to attain a difficult compromise between the usefulness of the data and the protection of our privacy. k-Anonymous microaggregation permits releasing a dataset where each person remains indistinguishable from other k–1 individuals, through the aggregation of demographic attributes, otherwise a potential culprit for respondent reidentification. Although privacy guarantees are by no means absolute, the elegant simplicity of the k-anonymity criterion and the excellent preservation of information utility of microaggregation algorithms has turned them into widely popular approaches whenever data utility is critical. Unfortunately, high-utility algorithms on large datasets inherently require extensive computation. This work addresses the need of running k-anonymous microaggregation efficiently with mild distortion loss, exploiting the fact that the data may arrive over an extended period of time. Specifically, we propose to split the original dataset into two portions that will be processed subsequently, allowing the first process to start before the entire dataset is received, while leveraging the superlinearity of the microaggregation algorithms involved. A detailed mathematical formulation enables us to calculate the optimal time for the fastest anonymization, as well as for minimum distortion under a given deadline. Two incremental microaggregation algorithms are devised, for which extensive experimentation is reported. The theoretical methodology presented should prove invaluable in numerous data-collection applications, including largescale electronic surveys in which computation is possible as the data comes in., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On the anonymity risk of time-varying user profiles.

  • Puglisi, Silvia
  • Rebollo Monedero, David|||0000-0002-0783-2382
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
Websites and applications use personalisation services to profile their users, collect their patterns and activities and eventually use this data to provide tailored suggestions. User preferences and social interactions are therefore aggregated and analysed. Every time a user publishes a new post or creates a link with another entity, either another user, or some online resource, new information is added to the user profile. Exposing private data does not only reveal information about single users’ preferences, increasing their privacy risk, but can expose more about their network that single actors intended. This mechanism is self-evident in social networks where users receive suggestions based on their friends’ activities. We propose an information-theoretic approach to measure the differential update of the anonymity risk of time-varying user profiles. This expresses how privacy is affected when new content is posted and how much third-party services get to know about the users when a new activity is shared. We use actual Facebook data to show how our model can be applied to a real-world scenario., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A LINDDUN-based framework for privacy threat analysis on identification and authentication processes

  • Robles González, Antonio
  • Parra Arnau, Javier|||0000-0002-1772-1088
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
© <2020>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, Identification and authentication (IA) are security procedures that are ubiquitous in our online life, and that constantly require disclosing personal, sensitive information to non-fully trusted service providers, or to fully trusted providers that unintentionally may fail to protect such information. Although user IA processes are extensively supported by heterogeneous software and hardware, the simultaneous protection of user privacy is an open problem. From a legal point of view, the European Union legislation requires protecting the processing of personal data and evaluating its impact on privacy throughout the whole IA procedure. Privacy Threat Analysis (PTA) is one of the pillars for the required Privacy Impact Assessment (PIA). Among the few existing approaches for conducting a PTA, LINDDUN is a very promising framework, although generic, in the sense that it has not been specifically conceived for IA. In this work, we investigate an extension of LINDDUN that allows performing a reliable and systematically-reproducible PTA of user IA processes, thereby contributing to one of the cornerstones of PIA. Specifically, we propose a high-level description of the IA verification process, which we illustrate with an UML use case. Then, we design an identification and authentication modelling framework, propose an extension of two critical steps of the LINDDUN scheme, and adapt and tailor the trust boundary concept applied in the original framework. Finally, we propose a systematic methodology aimed to help auditors apply the proposed improvements to the LINDDUN framework., The authors are thankful for the support through the research project “INRISCO”, ref. TEC2014-54335-C4-1-R, “MAGOS”, TEC2017-84197-C4-3-R, and the project “Sec-MCloud”, ref. TIN2016-80250-R. J. Parra-Arnau is the recipient of a Juan de la Cierva postdoctoral fellowship, IJCI-2016–28239, from the Spanish Ministry of Economy and Competitiveness. J. Parra-Arnau is with the UNESCO Chair in Data Privacy, but the views in this paper are his own and are not necessarily shared by UNESCO., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

QSMVM: QoS-aware and social-aware multimetric routing protocol for video-streaming services over MANETS

  • Palacios Jara, Efraín
  • Mezher, Ahmad Mohamad|||0000-0003-3263-0122
  • Aguilar Igartua, Mónica|||0000-0002-6518-888X
  • Díaz Redondo, Rebeca P.
  • Fernández Vilas, Ana
A mobile ad hoc network (MANET) is a set of autonomous mobile devices connected by wireless links in a distributed manner and without a fixed infrastructure. Real-time multimedia services, such as video-streaming over MANETs, offers very promising applications, e.g., two members of a group of tourists who want to share a video transmitted through the MANET they form, a video-streaming service deployed over a MANET where users watch a film, among other examples. On the other hand, social web technologies, where people actively interact online with others through social networks, are leading to a socialization of networks. Information of interaction among users is being used to provide socially-enhanced software. To achieve this, we need to know the strength of the relationship between a given user and each user they interact with. This strength of the relationship can be measured through a concept called tie strength (TS), first introduced by Mark Granovetter in 1973. In this article, we modify our previous proposal named multipath multimedia dynamic source routing (MMDSR) protocol to include a social metric TS in the decisions taken by the forwarding algorithm. We find a trade-off between the quality of service (QoS) and the trust level between users who form the forwarding path in the MANET. Our goal is to increase the trust metric while the QoS is not affected significantly., This work is supported by the Spanish Government through the projects (i) INRISCO (TEC2014-54335-C4-1-R and TEC2014-54335-C4-3-R); (ii) MAGOS (TEC2017-84197-C4-3-R and TEC2017- 84197-C4-2-R); (iii) the European Regional Development Fund (ERDF); and (iv) the Galician Regional Government under agreement for funding the Atlantic Research Center for Information and Communication Technologies (AtlantTIC)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On the regulation of personal data distribution in online advertising platforms

  • Estrada Jiménez, José Antonio
  • Parra Arnau, Javier|||0000-0002-1772-1088
  • Rodríguez Hoyos, Ana Fernanda
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
Online tracking is the key enabling technology of modern online advertising. In the recently established model of real-time bidding (RTB), the web pages tracked by ad platforms are shared with advertising agencies (also called DSPs), which, in an auction-based system, may bid for user ad impressions. Since tracking data are no longer confined to ad platforms, RTB poses serious risks to privacy, especially with regard to user profiling, a practice that can be conducted at a very low cost by any DSP or related agency, as we reveal here. In this work, we illustrate these privacy risks by examining a data set with the real ad-auctions of a DSP, and show that for at least 55% of the users tracked by this agency, it paid nothing for their browsing data. To mitigate this abuse, we propose a system that regulates the distribution of bid requests (containing user tracking data) to potentially interested bidders, depending on their previous behavior. In our approach, an ad platform restricts the sharing of tracking data by limiting the number of DSPs participating in each auction, thereby leaving unchanged the current RTB architecture and protocols. However, doing so may have an evident impact on the ad platform’s revenue. The proposed system is designed accordingly, to ensure the revenue is maximized while the abuse by DSPs is prevented to a large degree. Experimental results seem to suggest that our system is able to correct misbehaving DSPs, and consequently enhance user privacy., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Efficient k-anonymous microaggregation of multivariate numerical data via principal component analysis

  • Rebollo-Monedero, David
  • Mezher, Ahmad Mohamad|||0000-0003-3263-0122
  • Casanova, Xavier
  • Forné Muñoz, Jorge|||0000-0002-8401-3292
  • Soriano Ibáñez, Miguel|||0000-0003-0457-8531
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, k-Anonymous microaggregation is a widespread technique to address the problem of protecting the privacy of the respondents involved beyond the mere suppression of their identifiers, in applications where preserving the utility of the information disclosed is critical. Unfortunately, microaggregation methods with high data utility may impose stringent computational demands when dealing with datasets containing a large number of records and attributes. This work proposes and analyzes various anonymization methods which draw upon the algebraic-statistical technique of principal component analysis (PCA), in order to effectively reduce the number of attributes processed, that is, the dimension of the multivariate microaggregation problem at hand. By preserving to a high degree the energy of the numerical dataset and carefully choosing the number of dominant components to process, we manage to achieve remarkable reductions in running time and memory usage with negligible impact in information utility. Our methods are readily applicable to high-utility SDC of large-scale datasets with numerical demographic attributes., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A novel dynamic reputation-based source routing protocol for mobile ad hoc networks

  • Guaya, Lenin
  • Pallarès Segarra, Esteve
  • Mezher, Ahmad Mohamad
  • Forné Muñoz, Jorge
This is a post-peer-review, pre-copyedit version of an article published in Eurasip journal on wireless communication and networking. The final authenticated version is available online at: http://dx.doi.org/10.1186/s13638-019-1375-7, Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations., This work was supported in part by the Spanish Government under projects INRISCO (TEC2014–-54335-C4-1-R) and MAGOS (TEC2017-84197-C4-3-R)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

QSMVM: QoS-aware and social-aware multimetric routing protocol for video-streaming services over MANETS

  • Palacios Jara, Efraín
  • Mezher, Ahmad Mohamad
  • Aguilar Igartua, Mónica
  • Díaz Redondo, Rebeca P.
  • Fernández Vilas, Ana
A mobile ad hoc network (MANET) is a set of autonomous mobile devices connected by wireless links in a distributed manner and without a fixed infrastructure. Real-time multimedia services, such as video-streaming over MANETs, offers very promising applications, e.g., two members of a group of tourists who want to share a video transmitted through the MANET they form, a video-streaming service deployed over a MANET where users watch a film, among other examples. On the other hand, social web technologies, where people actively interact online with others through social networks, are leading to a socialization of networks. Information of interaction among users is being used to provide socially-enhanced software. To achieve this, we need to know the strength of the relationship between a given user and each user they interact with. This strength of the relationship can be measured through a concept called tie strength (TS), first introduced by Mark Granovetter in 1973. In this article, we modify our previous proposal named multipath multimedia dynamic source routing (MMDSR) protocol to include a social metric TS in the decisions taken by the forwarding algorithm. We find a trade-off between the quality of service (QoS) and the trust level between users who form the forwarding path in the MANET. Our goal is to increase the trust metric while the QoS is not affected significantly., This work is supported by the Spanish Government through the projects (i) INRISCO (TEC2014-54335-C4-1-R and TEC2014-54335-C4-3-R); (ii) MAGOS (TEC2017-84197-C4-3-R and TEC2017- 84197-C4-2-R); (iii) the European Regional Development Fund (ERDF); and (iv) the Galician Regional Government under agreement for funding the Atlantic Research Center for Information and Communication Technologies (AtlantTIC)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the regulation of personal data distribution in online advertising platforms

  • Estrada Jiménez, José Antonio
  • Parra Arnau, Javier
  • Rodríguez Hoyos, Ana Fernanda
  • Forné Muñoz, Jorge
Online tracking is the key enabling technology of modern online advertising. In the recently established model of real-time bidding (RTB), the web pages tracked by ad platforms are shared with advertising agencies (also called DSPs), which, in an auction-based system, may bid for user ad impressions. Since tracking data are no longer confined to ad platforms, RTB poses serious risks to privacy, especially with regard to user profiling, a practice that can be conducted at a very low cost by any DSP or related agency, as we reveal here. In this work, we illustrate these privacy risks by examining a data set with the real ad-auctions of a DSP, and show that for at least 55% of the users tracked by this agency, it paid nothing for their browsing data. To mitigate this abuse, we propose a system that regulates the distribution of bid requests (containing user tracking data) to potentially interested bidders, depending on their previous behavior. In our approach, an ad platform restricts the sharing of tracking data by limiting the number of DSPs participating in each auction, thereby leaving unchanged the current RTB architecture and protocols. However, doing so may have an evident impact on the ad platform’s revenue. The proposed system is designed accordingly, to ensure the revenue is maximized while the abuse by DSPs is prevented to a large degree. Experimental results seem to suggest that our system is able to correct misbehaving DSPs, and consequently enhance user privacy., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the anonymity risk of time-varying user profiles.

  • Puglisi, Silvia
  • Rebollo Monedero, David
  • Forné Muñoz, Jorge
Websites and applications use personalisation services to profile their users, collect their patterns and activities and eventually use this data to provide tailored suggestions. User preferences and social interactions are therefore aggregated and analysed. Every time a user publishes a new post or creates a link with another entity, either another user, or some online resource, new information is added to the user profile. Exposing private data does not only reveal information about single users’ preferences, increasing their privacy risk, but can expose more about their network that single actors intended. This mechanism is self-evident in social networks where users receive suggestions based on their friends’ activities. We propose an information-theoretic approach to measure the differential update of the anonymity risk of time-varying user profiles. This expresses how privacy is affected when new content is posted and how much third-party services get to know about the users when a new activity is shared. We use actual Facebook data to show how our model can be applied to a real-world scenario., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Emergency aware congestion control for smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Cruz Llopis, Luis Javier de la
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, The evolution of traditional electricity distribution infrastructures towards Smart Grid networks has generated the need to carry out new research. There are many fields that have attracted the attention of researchers, among which is the improvement of the performance of the so-called Neighborhood Area Networks (NAN). In this sense, and given the critical nature of some of the data transmitted by these networks, maintaining an adequate quality of service (QoS) is absolutely necessary. In emergency situations, this need becomes even more evident. This article presents a congestion control mechanism, whose parameters are modified according to the network state of emergency. The mechanism also applies a multi-channel allocation technique, together with a differentiation in the QoS offered to the different data flows according to their relevance. These proposals have been evaluated in the context of a wireless mesh networks (WMN) made up by a set of smart meter devices, where various smart grids (SG) applications are sending their data traffics. Each SG application must meet its unique quality of service (QoS) requirements, such as reliability and delay. To evaluate the proposals, some NAN scenarios have been built by using the ns-3 simulator and its 802.11s basic model, which was modified to implement the proposed techniques. Compared with the basic Hybrid Wireless Mesh Protocol (HWMP), Emergency Aware Congestion Control proposal (EA-HWMP), shows significant improvements in terms of packet delivery ratio, network throughput and transit time., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Incremental k-Anonymous microaggregation in large-scale electronic surveys with optimized scheduling

  • Rebollo Monedero, David
  • Forné Muñoz, Jorge
  • Soriano Ibáñez, Miguel
  • Hernández Baigorri, César
Improvements in technology have led to enormous volumes of detailed personal information made available for any number of statistical studies. This has stimulated the need for anonymization techniques striving to attain a difficult compromise between the usefulness of the data and the protection of our privacy. k-Anonymous microaggregation permits releasing a dataset where each person remains indistinguishable from other k–1 individuals, through the aggregation of demographic attributes, otherwise a potential culprit for respondent reidentification. Although privacy guarantees are by no means absolute, the elegant simplicity of the k-anonymity criterion and the excellent preservation of information utility of microaggregation algorithms has turned them into widely popular approaches whenever data utility is critical. Unfortunately, high-utility algorithms on large datasets inherently require extensive computation. This work addresses the need of running k-anonymous microaggregation efficiently with mild distortion loss, exploiting the fact that the data may arrive over an extended period of time. Specifically, we propose to split the original dataset into two portions that will be processed subsequently, allowing the first process to start before the entire dataset is received, while leveraging the superlinearity of the microaggregation algorithms involved. A detailed mathematical formulation enables us to calculate the optimal time for the fastest anonymization, as well as for minimum distortion under a given deadline. Two incremental microaggregation algorithms are devised, for which extensive experimentation is reported. The theoretical methodology presented should prove invaluable in numerous data-collection applications, including largescale electronic surveys in which computation is possible as the data comes in., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A joint multi-path and multi-channel protocol for traffic routing in smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Cruz Llopis, Luis Javier de la
In order to improve the management mechanisms of the electric energy transport infrastructures, the smart grid networks have associated data networks that are responsible for transporting the necessary information between the different elements of the electricity network and the control center. Besides, they make possible a more efficient use of this type of energy. Part of these data networks is comprised of the Neighborhood Area Networks (NANs), which are responsible for interconnecting the different smart meters and other possible devices present at the consumers' premises with the control center. Among the proposed network technologies for NANs, wireless technologies are becoming more relevant due to their flexibility and increasing available bandwidth. In this paper, some general modifications are proposed for the routing protocol of the wireless multi-hop mesh networks standardized by the IEEE. In particular, the possibility of using multiple paths and transmission channels at the same time, depending on the quality of service needs of the different network traffic, is added. The proposed modifications have been implemented in the ns-3 simulator and evaluated in situations of high traffic load. Simulation results show improvements in the network performance in terms of packet delivery ratio, throughput and network transit time., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Efficient k-anonymous microaggregation of multivariate numerical data via principal component analysis

  • Rebollo-Monedero, David
  • Mezher, Ahmad Mohamad
  • Casanova, Xavier
  • Forné Muñoz, Jorge
  • Soriano Ibáñez, Miguel
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, k-Anonymous microaggregation is a widespread technique to address the problem of protecting the privacy of the respondents involved beyond the mere suppression of their identifiers, in applications where preserving the utility of the information disclosed is critical. Unfortunately, microaggregation methods with high data utility may impose stringent computational demands when dealing with datasets containing a large number of records and attributes. This work proposes and analyzes various anonymization methods which draw upon the algebraic-statistical technique of principal component analysis (PCA), in order to effectively reduce the number of attributes processed, that is, the dimension of the multivariate microaggregation problem at hand. By preserving to a high degree the energy of the numerical dataset and carefully choosing the number of dominant components to process, we manage to achieve remarkable reductions in running time and memory usage with negligible impact in information utility. Our methods are readily applicable to high-utility SDC of large-scale datasets with numerical demographic attributes., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A LINDDUN-based framework for privacy threat analysis on identification and authentication processes

  • Robles González, Antonio
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
© <2020>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, Identification and authentication (IA) are security procedures that are ubiquitous in our online life, and that constantly require disclosing personal, sensitive information to non-fully trusted service providers, or to fully trusted providers that unintentionally may fail to protect such information. Although user IA processes are extensively supported by heterogeneous software and hardware, the simultaneous protection of user privacy is an open problem. From a legal point of view, the European Union legislation requires protecting the processing of personal data and evaluating its impact on privacy throughout the whole IA procedure. Privacy Threat Analysis (PTA) is one of the pillars for the required Privacy Impact Assessment (PIA). Among the few existing approaches for conducting a PTA, LINDDUN is a very promising framework, although generic, in the sense that it has not been specifically conceived for IA. In this work, we investigate an extension of LINDDUN that allows performing a reliable and systematically-reproducible PTA of user IA processes, thereby contributing to one of the cornerstones of PIA. Specifically, we propose a high-level description of the IA verification process, which we illustrate with an UML use case. Then, we design an identification and authentication modelling framework, propose an extension of two critical steps of the LINDDUN scheme, and adapt and tailor the trust boundary concept applied in the original framework. Finally, we propose a systematic methodology aimed to help auditors apply the proposed improvements to the LINDDUN framework., The authors are thankful for the support through the research project “INRISCO”, ref. TEC2014-54335-C4-1-R, “MAGOS”, TEC2017-84197-C4-3-R, and the project “Sec-MCloud”, ref. TIN2016-80250-R. J. Parra-Arnau is the recipient of a Juan de la Cierva postdoctoral fellowship, IJCI-2016–28239, from the Spanish Ministry of Economy and Competitiveness. J. Parra-Arnau is with the UNESCO Chair in Data Privacy, but the views in this paper are his own and are not necessarily shared by UNESCO., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A traffic-aware electric vehicle charging management system for smart cities

  • Barbecho Bautista, Pablo Andrés
  • Lemus Cárdenas, Leticia
  • Urquiza Aguiar, Luis
  • Aguilar Igartua, Mónica
© <2019>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, The expected increase in the number of electric vehicles (EVs) in the coming years will contribute to reducing CO2 pollution in our cities. Currently, EVs' users may suffer from distress due to long charging service times and overloaded charging stations (CSs). Critical traffic conditions (e.g., traffic jams) affect EVs' trip time (TT) towards CSs and thus influence the total trip duration. With this concern, Intelligent transport systems (ITS) and more specifically connected vehicle technologies, can leverage an efficient real-time EV charging service by jointly considering CSs status and traffic conditions in the city. In this work, we propose a scheme to manage EVs' charging planning, focusing on the selection of a CS for the energy-requiring EV. The proposed scheme considers anticipated charging slots reservations performed through a vehicular ad hoc network (VANET), which has been regarded as a cost-efficient communication framework. In specific, we consider two aspects: 1) the EV's total trip time towards its destination considering an intermediate charging at each candidate CS, and 2) the communication delay of the VANET routing protocol. First, in order to estimate the EV's total trip time, our CS selection scheme takes into account the average road speed, traffic lights, and route distance, along the path of the EV. The optimal CS that produces the minimum total charging service time (including the TT) is suggested to that energy-requiring EV. Then, we introduce two communication modes based on geographical routing protocols for VANETs to attain an anticipated charging slot reservation. Simulation results show that with our charging scheme EVs' charging service time is reduced and more EVs are successfully charged., Peer Reviewed, Postprint (author's final draft)