Pasar al contenido principal

Resultados relacionados

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

Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

On the necessity of counterfeits and deletions for continuous data publishing

  • Tobar Nicolau, Adrián
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
Continuous data publishing is the scenario where a dataset is published at different times, while it changes between publications through insertion of new tuples, reinsertions, deletions and updates of previously published tuples. Existing algorithms follow a similar structure, requiring in some cases the edition of the dataset in order to feasibly enforce the expected notion of privacy. The possible editions are insertion of synthetic tuples (counterfeits), deletion of part of the dataset, or edition of the sensitive values of a subset of the tuples. In this paper, we study when such operations are unavoidable and prove that the use of centroids as an alternative proposal to data deletion preserves the privacy of the state-of-the-art notions used in the literature., Javier Parra-Arnau is the recipient of a “Ramón y Cajal” fellowship (ref. RYC2021- 034256-I) funded by the Spanish Ministry of Science and Innovation and the European Union – “NextGenerationEU”/PRTR (Plan de Recuperación, Transformación y Resiliencia). This work was also supported by the Spanish Government under the project “Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)” PID2020-113795RB-C31, funded by MICIU/AEI/10.13039/501100011033; the project “Anonymization technology for AIbased analytics of mo- bility data (MOBILYTICS)” (TED2021-129782B-I00), funded byMICIU/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR; and funded by the Generalitat de Catalunya, under AGAUR grant “2021 SGR 01413., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Strategic deployment of RSUs in urban settings: optimizing IEEE 802.11p infrastructure

  • Astudillo Leon, Juan Pablo
  • Busson, Anthony
  • Cruz Llopis, Luis Javier de la
  • Begin, Thomas
  • Boukerche, Azzedine
© 2024 Elsevier. 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 efficient deployment of Roadside Units (RSUs) in an infrastructure based on IEEE 802.11p is essential for delivering Internet-based services to vehicles. In this paper, we introduce novel strategies that, in contrast to prior works, exclusively rely on the average vehicular density within specific urban areas, and these strategies depend on a performance model of IEEE 802.11p for guidance and decision-making regarding RSU placement. This minimal upfront information contributes to the practicality and ease of implementation of our strategies. We apply our strategies to three real-world urban scenarios, utilizing the ns-3 and sumo simulators for validation. This study contributes to three fundamental aspects. First, we establish that any efficient deployment of RSUs is closely linked to the unique characteristics of the city under consideration such as the street layout and spatial density of vehicles. In other words, the characteristics of an efficient RSU deployment are unique to each city. Second, we show that the optimal strategy is not to place the RSUs at the locations with the highest traffic density. Instead, with the help of an analytical performance model of IEEE 802.11, we propose a more efficient strategy wherein the location of each RSU is determined to maximize the number of vehicles receiving the target QoS. This can lead to a significant drop in the number of RSUs required to equip a city. Finally, we demonstrate that, by preventing the use of the lowest transmission rate of IEEE 802.11p at each RSU, a collective benefit can be achieved, even though each RSU experiences a shorter radio range., This work was partially supported by the Spanish Government under research project ”Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)” PID2020-113795RB-C31, funded by MICIU/AEI/10.13039/501100011033, research project ”Anonymization technology for AI-based analytics of mobility data (MOBILYTICS)”, TED2021-129782B-I00, funded by MICIU/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR, and by the Generalitat de Catalunya, under AGAUR grant ”2021 SGR 01413”., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Design of a SUMO-based simulator for optimal location of emergency vehicles in the Emergency Medical Systems

  • Mínguez, Antoni
  • Tozan, Volkan
  • El-Assaad, Monica
  • Sola Muñoz, Silvia
  • Azeli, Youcef
  • Cruz Llopis, Luis Javier de la
  • Jiménez-Fàbrega, Xavier
  • Galup, Carles
  • Dalmau, Raimon
  • Aguilar Igartua, Mónica
Te response time between an accident happening and an ambulance reaching the incident place is a very delicate andcrucial time. Te time elapsed between those two events could be the determining factor of whether the injured person getsto live or die. Terefore, the response time of the ambulance assisting in the accident should be as small as possible. Responsetime can directly afect a person’s recovery time and can make the diference between the patient sufering temporary orprolonged disability, or even death. Locating the best position for ambulance bases is a challenge for emergency medicalsystems (EMSs). Tis will improve the EMS service in assigning the ambulance that arrives sooner to a given incident, thusreducing the risks associated with long response times. In this paper, we design a SUMO-based simulation frameworknamed SEMSIM (Sistema d’Emerg`encies M`ediques SIMulator) that mimics the management of ambulances done by theEMS. Te goal is to develop a tool to easily explore alternatives of stationing the available ambulances at the available bases,following diferent confguration settings (i.e., distributing the ambulances in diferent ways in the current bases or in-cluding new base locations), and analyze the average response time for each of those alternative confgurations incomparison to the current confguration. Te designed tool will help the EMS to explore dynamic confgurations that areoptimal throughout time, e.g. for diferent seasons, type of day, or time of the day. Te SEMSIM simulation tool accuratelyreplicates the ambulance assignments and response times of the EMS, validating its efectiveness. Tis allows SEMSIM to testnew ambulance distribution confgurations, including the addition of new bases, which would be costly or impractical toexplore in real life. SEMSIM provides a valuable resource for EMS to optimize their operations using real incident data andmaps from OpenStreetMap. Te aim in this paper is to design a methodology based on dynamic SUMO simulations toanalyze the optimal dynamic confguration of the feet of ambulances that ofers the smallest average response time and thushelps to improve the EMS service. As a case study, we explored various alternative confgurations reducing response time bymore than 2 min., This work was partially supported by the Spanish Government under research projects: (i) “DIstributed Smart Communications with Verifiable EneRgy-optimal Yields (DISCOVERY)” PID2023-148716OB-C32, funded by MCIN/AEI/10.13039/501100011033; (ii) “Anonymization technology for AI-based analytics of mobility data (MOBILYTICS)” TED2021-129782B-I00, funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/ PRTR; (iii) “Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)” PID2020-113795RB-C31, funded by MCIN/AEI/10.13039/501100011033; and (iv) the Generalitat de Catalunya under AGAUR grant “2021 SGR 01413”., Peer Reviewed, Objectius de Desenvolupament Sostenible::3 - Salut i Benestar, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A reinforcement learning congestion control algorithm for smart grid networks

  • Andrade Zambrano, Argenis Ronaldo
  • Astudillo Leon, Juan Pablo
  • Morocho Cayamcela, Manuel Eugenio
  • Lemus Cárdenas, Leticia
  • Cruz Llopis, Luis Javier de la
Modern electrical systems are evolving with data communication networks, ushering in upgraded electrical infrastructures and enabling bidirectional communication between utility grids and consumers. The selection of communication technologies is crucial, where wireless communications have emerged as one of the main benefactor technologies due to its cost-effectiveness, scalability, and ease of deployment. Ensuring the streamlined transmission of diverse applications between residential users and utility control centers is crucial for the effective data delivery in smart grids. This paper proposes a congestion control mechanism tailored to smart grid applications using unreliable transport protocols such as UDP, which, unlike TCP, lacks inherent congestion control, presenting a significant challenge to the performance of the network. In this article, we have exploited a reinforcement learning (RL) algorithm and a deep Q-neural network (DQN), to manage congestion control under a UDP environment. In this particular instance, the DQN model learns on its own from interactions with the environment without the need to generate a dataset, rendering it apt for intricate and dynamic scenarios within smart grid communications. Our evaluation covers two scenarios: 1) a grid-like configuration, and 2) urban scenarios considering the deployment of smart meters in the cities of Montreal, Berlin and Beijing. These evaluations provide a comprehensive examination of the proposed DQN-based congestion control approach under different conditions, showing its effectiveness and adaptability. Conducting a comprehensive performance assessment in both scenarios leads to improvements in metrics such as packet delivery ratio, network throughput, fairness between different traffic sources, packet network transit time, and QoS provision., This work was supported in part by the Spanish Government under the Research Project ‘‘Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)’’ under Grant PID2020-113795RB-C31; in part by MICIU/AEI/10.13039/501100011033 under the Research Project ‘‘Anonymization Technology for AI-Based Analytics of Mobility Data (MOBILYTICS)’’ under Grant TED2021-129782B-I00; in part by MICIU/AEI/10.13039/501100011033; in part by European Union NextGenerationEU/PRTR; and in part by the Generalitat de Catalunya through AGAUR under Grant 2021 SGR 01413., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

On the adaptation of trajectory generative models to enforce differential privacy through gradient perturbation

  • Rubio Jornet, Víctor
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
Synthetic trajectories have become a crucial tool for enabling data sharing in domains such as telecommunications and urban planning, yet most generators provide neither formal privacy guarantees nor empirical validation of the protection they claim. This paper investigates whether state-of-the-art deep learning trajectory generators can be adapted to satisfy differential privacy (DP) while retaining usable utility, and makes three contributions. First, we analyze 16 state-of-the-art generators and determine which can be trained with Differentially Private Stochastic Gradient Descent (DP-SGD), showing that common architectural choices — such as index-based coordinate look-ups at inference — silently void the guarantee. Second, we present Sec-LSTM-TrajGAN, a DP adaptation of LSTM-TrajGAN, a well-known trajectory generator chosen after the analysis of the existing models. Third, we introduce RouteMIA, to our knowledge the first closed-box membership inference attack tailored to synthetic trajectories, which adapts the distanceto-closest-record attack to sequential spatio-temporal data and requires access only to the released dataset. Evaluating on GeoLife (17, 000 trajectories) and Porto (100, 000 trajectories) datasets for several scenarios of increasing privacy. RouteMIA attains an AUC of 0.59 and 0.55 against the non-private models, which drops to ˜ 0.50 — chance level — for every private configuration. Notably, gradient clipping alone, with no noise added, already accounts for this entire empirical gain, at a utility cost of a distance JSD rising from 0.12 to 0.20 on Porto and essentially none on GeoLife, whereas strict budgets (e = 3) degrade GeoLife markedly (distance JSD up to 0.35). Per-example clipping, not the noise, therefore delivers the measurable protection against this attack — a cheap empirical complement to, but not a replacement for, formal guarantees., This work was supported in part by Spanish Government, funded by Ministerio de Ciencia e Innovación (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 through the research project ‘‘DIstributed Smart COmmunications with Verifiable EneRgy-optimal Yields (DISCOVERY)’’ under Grant PID2023-148716OB-C32, through the research project ‘‘Privacy-Preserving Techniques for Mobility Data (PRIMOD)’’ under Grant CNS2025-166870, through the research project ‘‘Anonymization Technology for Artificial Intelligence (AI)-Based Analytics of Mobility Data (MOBILYTICS)’’ under Grant TED2021-129782B-I00, and through the research project ‘‘Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)’’ under Grant PID2020-113795RB-C31; in part by the project MOBILYTICS funded by European Union—NextGenerationEU/Recovery, Transformation and Resilience Plan (PRTR); and in part by the Generalitat de Catalunya through AGAUR under Grant 2021 SGR 01413. The work of Víctor Rubio-Jornet was supported by the Joan Oró Agència de Gestió d’Ajuts Universitaris i de Recerca (AGAUR)-Formació d’Investigadors (FI) Predoctoral Program, funded by the Secretariat of Universities and Research of the Department of Research and Universities of the Generalitat of Catalonia and European Social Fund Plus under Grant 2024 FI-1 00762. The work of Javier Parra-Arnau was supported by Ramón y Cajal Grant through Spanish Ministry of Science and Innovation and European Union—‘‘NextGenerationEU’’/PRTR under Grant RYC2021-034256-I., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A taxonomy of syntactic privacy notions for continuous data publishing

  • Tobar Nicolau, Adrián
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
© 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Continuous data publishing aims to anonymise the next publication of changing microdata while preserving privacy. The microdata can change between publications via additions, deletions, insertions, and updates. There are numerous proposals for different database types, adversaries, attacks, and notions. However, many anonymization algorithms include notions of privacy and adversarial models that are specific to the context, with their own terminology and notation. Unfortunately, these proposals are difficult to generalize or translate them to other contexts complicating their understanding and comparison. To address these issues, we propose a taxonomy of anonymization technologies, compare existing solutions, and develop a unifying framework that not only harmonizes concepts and terminology but also notation and nomenclature. We analyze the current state of the art and recent advances in the literature. The analysis enables us to understand the significance and appropriateness of the various proposals in achieving privacy., Javier Parra-Arnau is the recipient of a “Ramón y Cajal” fellowship (ref. RYC2021-034256-I) funded y the Spanish Ministry of Science and Innovation and the European Union– “NextGenerationEU”/PRTR (Plan de Recuperación, Transformación y Resiliencia). This work was also supported by the Spanish Government under the project “Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)” PID2020-113795RB-C31, funded by MCIN/AEI/10.13039/501100011033, and through the project “MOBILYTICS” (TED2021-129782B-I00), funded by MCIN/AEI/10.13039/501100011033 and the European Union “NextGenerationEU”/PRTR., Postprint (author's final draft)