Skip to main content

INTELIGENCIA DE FUENTES ABIERTAS PARA REDES ELECTRICAS INTELIGENTES SEGURAS. PRIVACIDAD DE DATOS Y COMUNICACIONES FIABLES.

TEC2017-84197-C4-3-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
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 2017
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

A hybrid analysis of LBSN data to early detect anomalies in crowd dynamics

  • Díaz Redondo, Rebeca Pilar
  • García Rubio, Carlos
  • Fernández Vilas, Ana
  • Campo Vázquez, María Celeste
  • Rodríguez Carrión, Alicia
Undoubtedly, Location-based Social Networks (LBSNs) provide an interesting source of geo-located data that we have previously used to obtain patterns of the dynamics of crowds throughout urban areas. According to our previous results, activity in LBSNs reflects the real activity in the city. Therefore, unexpected behaviors in the social media activity are a trustful evidence of unexpected changes of the activity in the city. In this paper we introduce a hybrid solution to early detect these changes based on applying a combination of two approaches, the use of entropy analysis and clustering techniques, on the data gathered from LBSNs. In particular, we have performed our experiments over a data set collected from Instagram for seven months in New York City, obtaining promising results., Ministerio de Economía y Competitividad | Ref. TEC2014-54335-C4-2-R, Ministerio de Economía y Competitividad | Ref. TEC2014-54335-C4-3-R, Agencia Estatal de Investigación | Ref. TEC2017-84197-C4-2-R, Agencia Estatal de Investigación | Ref. TEC2017-84197-C4-3-R
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

How does the traffic behavior change by using SUMO traffic generation tools

  • Barbecho Bautista, Pablo Andrés|||0000-0002-5281-9208
  • Urquiza Aguiar, Luis Felipe
  • Aguilar Igartua, Mónica|||0000-0002-6518-888X
© 2022 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/, Simulations are the traditional approach used by the research community to evaluate mobile ad hoc networks. Mainly, vehicular ad hoc networks (VANETs) are a particular type of mobile ad hoc networks that raise specific technical challenges. When assessing VANETs, it is crucial to use realistic mobility models and traffic demand to produce meaningful results. In this context, vehicular traces affect vehicles’ signal strengths, radio interference, and channel occupancy. This paper provides a thorough analysis of the influence of using the different SUMO’s traffic demand generation tools on mobility and node connectivity. Using the data traffic in the district of Gracia in Barcelona (Spain), we analyze the generated traffic demand in terms of traffic measures: (i) traffic intensity, (ii) trip time/distance, (iii) emissions, and (iv) re-routing capabilities. This last feature allow cars to re-compute their routes in front of congestion situations. Then, we analyze the available tools in terms of resources usage (CPU, RAM, disk). Lastly, we analyze the node’s connectivity using well-known graph metrics. Our results provide insights into the behavior of the vehicle’s mobility and the nodes’ connectivity of SUMO demand generation tools. Additionally, we propose an automatized tool that facilitates researchers the generation of synthetic traffic based on real data., This work was partly supported by the Spanish Government through project TEC2017-84197-C4-3-R (Secure sMArt Grid using Open Source Intelligence, MAGOS) and SENESCYT ., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

The Fast Maximum Distance to Average Vector (F-MDAV): an algorithm for k-Anonymous microaggregation in big data

  • Rodríguez Hoyos, Ana Fernanda
  • Estrada Jiménez, José Antonio
  • Rebollo-Monedero, David
  • Mezher, Ahmad Mohamad
  • Parra Arnau, Javier
  • Forné Muñoz, Jorge
© <2019> 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 massive exploitation of tons of data is currently guiding critical decisions in domains such as economics or health. But serious privacy risks arise since personal data is commonly involved. k-Anonymous microaggregation is a well-known method that guarantees individuals’ privacy while preserving much of data utility. Unfortunately, methods like this are computationally expensive in big data settings, whereas the application domain of data might require an immediate response to make “life or death” decisions. Accordingly, this paper proposes five strategies to simplify the internal operations (such as distance calculations and element sorting) of the maximum distance to average vector method, the de facto microaggregation standard. For the sake of its usability in large-scale databases, they, e.g., reduce the number of operations necessary to compute distances from 3m to 2m, where m is the number of attributes of the data set. Also, the complexity of sorting operations gets reduced from O(n log n) to O(n) where n is the number of records. Through extensive experimentation over multiple data sets, we show that the new algorithm gets significantly faster. Interestingly, the speedup factor by each technique is not greater than 2, but the multiplicative effect of combining them all turns the algorithm four times faster than the original microaggregation mechanism. This remarkable speedup factor is achieved, literally, with no additional cost in terms of data utility, i.e., it does not incur greater information loss., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Anonymizing cybersecurity data in critical infrastructures: the CIPSEC approach

  • Rodríguez Hoyos, Ana Fernanda
  • Estrada Jiménez, José Antonio
  • Rebollo-Monedero, David
  • Forné Muñoz, Jorge
  • Trapero Burgos, Rubén
  • Álvarez Romero, Antonio
Cybersecurity logs are permanently generated by network devices to describe security incidents. With modern computing technology, such logs can be exploited to counter threats in real time or before they gain a foothold. To improve these capabilities, logs are usually shared with external entities. However, since cybersecurity logs might contain sensitive data, serious privacy concerns arise, even more when critical infrastructures (CI), handling strategic data, are involved. We propose a tool to protect privacy by anonymizing sensitive data included in cybersecurity logs. We implement anonymization mechanisms grouped through the definition of a privacy policy. We adapt said approach to the context of the EU project CIPSEC that builds a unified security framework to orchestrate security products, thus offering better protection to a group of CIs. Since this framework collects and processes security-related data from multiple devices of CIs, our work is devoted to protecting privacy by integrating our anonymization approach., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

3MRP+: an improved multimetric geographical routing protocol for VANETs

  • Lemus Cárdenas, Leticia
  • Mezher, Ahmad Mohamad
  • López Márquez, Nely Patricia
  • Barbecho Bautista, Pablo Andrés
  • Cárdenas Barrera, Julián
  • Aguilar Igartua, Mónica
The design of routing protocols in vehicular ad hoc networks (VANETs) is fundamental to achieve a high packets’ delivery ratio. Routing protocols whose operation considers the nodes’ positions use updated routing information according to the reception frequency of hello messages. The routing information can help to improve the routing operation by including several metrics such as vehicle’s trajectory, vehicle’s density, percentage of packet losses, among others. In addition, there is a trade-off between the beaconing frequency and the overhead injected to the network: a high frequency provides a better accuracy on selecting the best forwarding node to route a packet but at the same time the overhead is increased. However, a low frequency will provide less accuracy on selecting the best forwarding candidate node but the overhead injected to the network will be decreased. In this paper we have designed an efficient method to improve the accuracy of the nodes’ position used to select the next forwarding node without any modification on the beaconing frequency value. Our approach improves the operation of the routing protocol used in our performance evaluation. Simulations show the benefits of our proposal, increasing the accuracy of the nodes’ selection and maintaining the same level of overhead, without the necessity to increase the beacon frequency., Thiswork was supported by the Spanish Government under Projects Secure “sMARt Grid using Open Source Intelligence. Data Privacy and reliable communications” (MAGOS), TEC2017-84197-C4-3-R and “INcident monitoRing In Smart COmmunities” (INRISCO),TEC2014- 54335-C4-1-R. Leticia Lemus and Nely López are recipients of a Ph.D. grant from the Academic Coordination of the University of Guadalajara, México. Pablo Barbecho is recipient of a grant from the Secretaría Nacional de Educación Superior, Ciencia y Tecnología SENESCYT, Ecuador., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

How does the traffic behavior change by using SUMO traffic generation tools

  • Barbecho Bautista, Pablo Andrés
  • Urquiza Aguiar, Luis Felipe
  • Aguilar Igartua, Mónica
© 2022 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/, Simulations are the traditional approach used by the research community to evaluate mobile ad hoc networks. Mainly, vehicular ad hoc networks (VANETs) are a particular type of mobile ad hoc networks that raise specific technical challenges. When assessing VANETs, it is crucial to use realistic mobility models and traffic demand to produce meaningful results. In this context, vehicular traces affect vehicles’ signal strengths, radio interference, and channel occupancy. This paper provides a thorough analysis of the influence of using the different SUMO’s traffic demand generation tools on mobility and node connectivity. Using the data traffic in the district of Gracia in Barcelona (Spain), we analyze the generated traffic demand in terms of traffic measures: (i) traffic intensity, (ii) trip time/distance, (iii) emissions, and (iv) re-routing capabilities. This last feature allow cars to re-compute their routes in front of congestion situations. Then, we analyze the available tools in terms of resources usage (CPU, RAM, disk). Lastly, we analyze the node’s connectivity using well-known graph metrics. Our results provide insights into the behavior of the vehicle’s mobility and the nodes’ connectivity of SUMO demand generation tools. Additionally, we propose an automatized tool that facilitates researchers the generation of synthetic traffic based on real data., This work was partly supported by the Spanish Government through project TEC2017-84197-C4-3-R (Secure sMArt Grid using Open Source Intelligence, MAGOS) and SENESCYT ., Peer Reviewed, Postprint (author's final draft)
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)

A fair and distributed congestion control mechanism for smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Begin, Thomas
  • Busson, Anthony
  • Cruz Llopis, Luis Javier de la
© <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/, The need for significant improvements in the management and efficient use of electrical energy has led to the evolution from the traditional electrical infrastructures towards modern Smart Grid networks. Taking into account the critical importance of this type of networks, multiple research groups focus their work on issues related to the generation, transport and consumption of electrical energy. One of the key research points is the data communication network associated with the electricity transport infrastructure, and specifically the network that interconnects the devices in consumers’ homes, the so-called Neighborhood Area Networks (NANs). In this paper, a new fair and distributed congestion control mechanism for NANs is proposed, implemented and evaluated. The main goal of this mechanism is to provide fairness in the access to the network, thus avoiding that some network nodes monopolize the use of the channels due to their higher traffic generation rate, or to their geographical position. Besides, different priorities have been considered for the traffic flows transmitted by different applications. The goal here is to provide the needed Quality of Service (QoS) to all traffic flows, especially when the traffic load is high. The proposal is evaluated in the context of a wireless ad hoc network composed by a set of smart grid meter devices. Applying our proposed congestion control mechanism leads to performance improvements in terms of packet delivery ratio, network throughput fairness between different traffic sources, packet network transit time and QoS provision., This work was supported by the Spanish Research Council under project MAGOS (TEC2017-84197-C4-3-R). Juan Pablo Astudillo León is the recipient of a full scholarship from the Secretaría de Educación Superior, Ciencia, Tecnología e Innovación (SENESCYT), Ecuador. The authors wish to thank the anonymous referees for their thorough and constructive review of an earlier version of this paper., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Preserving empirical data utility in k-anonymous microaggregation via linear discriminant analysis

  • Rodríguez Hoyos, Ana Fernanda
  • Rebollo Monedero, David
  • Estrada Jiménez, José Antonio
  • Forné Muñoz, Jorge
  • Urquiza Aguiar, Luis Felipe
© <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/, Today’s countless benefits of exploiting data come with a hefty price in terms of privacy. -Anonymous microaggregation is a powerful technique devoted to revealing useful demographic information of microgroups of people, whilst protecting the privacy of individuals therein. Evidently, the inherent distortion of data results in the degradation of its utility. This work proposes and analyzes an anonymization method that draws upon the technique of linear discriminant analysis (LDA), with the aim of preserving the empirical utility of data. Further, this utility is measured as the accuracy of a machine learning model trained on the microaggregated data. By transforming the original data records to a different data space, LDA enables -anonymous microaggregation to build microcells more tailored to an intrinsic classification threshold. To do this, first, data is rotated (projected) towards the direction of maximum discrimination and, second, scaled in this direction by a factor that penalizes distortion across the classification threshold. The upshot is that thinner cells are built along the threshold, which ends up preserving data utility in terms of the accuracy of machine learned models for a number of standardized data sets., We gratefully acknowledge the invaluable assistance of Irene Carrión-Barberà, M.D., in the preparation of the medical example in Fig. 2. This work is supported by the Escuela Politécnica Nacional through the project ‘‘Privacidad Sintáctica Funcional: Análisis y adaptación de mecanismos de anonimato con enfoque en la preservación de utilidad de los datos’’, ref. PII-DETRI-2019-01. This work is partly supported by the Spanish Ministry of Economy and Competitiveness (MINECO) through the project ‘‘MAGOS’’, ref. TEC2017-84197-C4-3-R. Ana Rodríguez-Hoyos and José Estrada-Jiménez acknowledge the support from Escuela Politécnica Nacional (EPN), Republic of Ecuador for their doctoral studies at Universitat Politècnica de Catalunya (UPC)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Improved selection of the best forwarding candidate in 3MRP for VANETs

  • Mohamad Mezher, Ahmad
  • Lemus Cárdenas, Leticia
  • Cárdenas Barrera, Julián
  • Castillo Guerra, Eduardo
  • Meng, Julian
  • Aguilar Igartua, Mónica
The design of different metrics in hop-by-hop routing protocols for vehicular ad hoc networks (VANETs) has been investigated with the clear objective to improve the performance of VANETs in terms of packet losses and average end-to-end delay. However, the best way of combining these metrics to compute a multiscore value for each candidate node to choose the best forwarding one, is an open issue yet. Based on a previous designed routing protocol called Multimedia Multimetric MapAware Routing Protocol (3MRP), a detailed analysis of the power mean function is done to determine which form of metrics combination will give the best results in terms of packet losses and average end-to-end delay. Extensive simulations have been conducted indicating that the geometric mean has obtained the lowest average percentage of packet losses., This work was supported by the Spanish Government under project “sMArt Grid using Open Source Intelligence. Data Privacy and reliable communications (MAGOS)”, TEC2017-84197-C4-3-R. Additional funding supporting this work has been granted by the Government of Canada through the Atlantic Innovation Funds program in partnership with Emera Inc. Leticia Lemus is recipient of a Ph.D. grant from the Academic Coordination of the University of Guadalajara, Mexico. Ahmad Mohamad Mezher holds a Postdoctoral Fellowship position with the Electrical and Computer Engineering department at the University of New Brunswick (UNB), Canada., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A measurement study of online tracking and advertising in Ibero-America

  • Estrada Jiménez, José Antonio
  • Parra Arnau, Javier
  • Rodríguez Hoyos, Ana Fernanda
  • Forné Muñoz, Jorge
  • Pallarès Segarra, Esteve
This research work is part of J. Estrada-Jiménez's Ph.D. thesis, The ability of the online marketing industry to track and pro le users' Web-browsing activity is what enables effective, tailored-made advertising services. The intrusiveness of these practices and the increasing invasiveness of digital advertising, however, have raised serious concerns regarding user privacy. Although the level of ubiquity of tracking and advertising has been investigated in top-world sites based in North America and Western Europe, the extent to which those practices are carried out in territories with less or no legal coverage in terms of data protection has not been studied so far. In this work, we present the rst detailed measurement of online tracking and advertising conducted to date in one of those regions, namely, Ibero-America, by analyzing local websites (e.g., education and government sites). In doing so, our measurement study aims to nd out how user location as well as the type of publisher may impact on tracking and advertising and thus user privacy. Lastly, our thorough, extensive analysis also explores whether differences are appreciated between Latin America and the EU with regard to the third-party tracking conducted from and towards the corresponding countries., This work was supported by the Spanish Ministerio de Economía y Competitividad (MINECO) through the project ``Secure SMArt Grid using Open Source Intelligence. Data Privacy and Reliable Communications (MAGOS)'', ref. TEC2017-84197-C4-3-R. The research was also supported by the La Caixa Foundation under Grant ID 100010434, in part by the European Union's Horizon 2020 Research and Innovation Programme through the Marie Sklodowska-Curie under Grant 847648, and in part by the Fellowship under Grant LCF/BQ/PR20/11770009., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Predictive traffic control and differentiation on smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Rico Novella, Francisco José
  • Cruz Llopis, Luis Javier de la
Smart Grid (SG) networks include an associated data network for the transmission and reception of control data related to the electric power supply service. A subset of this data network is the SG Neighborhood Area Network (SG NAN), whose objective is to interconnect the subscribers' homes with the supplier control center. The data flows transmitted through these SG NANs belong to different applications, giving rise to the need for different quality of service requirements. Additionally, other subscriber appliances could use this network to communicate over the Internet. To avoid network congestion, as well as to differentiate the quality of service (QoS) received by the different data flows, a congestion control mechanism with traffic differentiation capabilities is required. The main contribution of this work is the proposal of a new congestion control mechanism based on machine learning techniques to try to guarantee the different QoS requirements to the different data flows. A main problem when applying machine learning techniques is the need for datasets to be used in the training steps. In this sense, a second contribution of this article is the proposal of a method to generate such datasets by means of simulation techniques. The proposed mechanism is then evaluated in the context of a wireless SG NAN. The nodes of this network are the subscriber's smart meters, which in turn perform the function of concentrating the data traffic sent and received by the rest of the home appliances. Besides, different machine learning classification methods are taken into account. The evaluation carried out shows significant improvements in terms of network throughput, transit time, and quality of service differentiation. Finally, the computational cost of the algorithms used in this proposal has also been evaluated, using real low-cost IoT hardware platforms., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Mathematically optimized, recursive prepartitioning strategies for k-anonymous microaggregation of large-scale datasets

  • Pallarès Segarra, Esteve
  • Rebollo-Monedero, David
  • Rodríguez Hoyos, Ana Fernanda
  • Estrada Jiménez, José Antonio
  • Mezher, Ahmad Mohamad
  • Forné Muñoz, Jorge
© <2019> 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 technical contents of this work fall within the statistical disclosure control (SDC) field, which concerns the postprocessing of the demographic portion of the statistical results of surveys containing sensitive personal information, in order to effectively safeguard the anonymity of the participating respondents. A widely known technique to solve the problem of protecting the privacy of the respondents involved beyond the mere suppression of their identifiers is the k-anonymous microaggregation. Unfortunately, most microaggregation algorithms that produce competitively low levels of distortions exhibit a superlinear running time, typically scaling with the square of the number of records in the dataset. This work proposes and analyzes an optimized prepartitioning strategy to reduce significantly the running time for the k-anonymous microaggregation algorithm operating on large datasets, with mild loss in data utility with respect to that of MDAV, the underlying method. The optimization strategy is based on prepartitioning a dataset recursively until the desired k-anonymity parameter is achieved. Traditional microaggregation algorithms have quadratic computational complexity in the form T(n2). By using the proposed method and fixing the number of recurrent prepartitions we obtain subquadratic complexity in the form T(n3/2), T(n4/3), ..., depending on the number of prepartitions. Alternatively, fixing the ratio between the size of the microcell and the macrocell on each prepartition, quasilinear complexity in the form T(nlog¿n) is achieved. Our method is readily applicable to 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)

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

Tips and tools to automate OMNeT++ simulations and to facilitate post data management tasks

  • Lemus Cárdenas, Leticia
  • Astudillo León, Juan Pablo
  • Barbecho Bautista, Pablo Andrés
  • Aguilar Igartua, Mónica
Report with tips and tools for PhD students who need to start working with tools like OMNeT++, SUMO; OpenStreetMaps. We collect here a list of tips to help them to speed up the learning process. Also, we introduce the researcher to machine learning techniques focusing on neural networks. We give tools, references and useful examples to start with. Finally, we also comment how to use latex editors easily., Nowadays, network simulators are frequently used by researchers to work with different kind of communication networks. In this context, the objective of this work is to introduce the user to the main used simulation tools for wireless networks, in particular vehicular ad hoc networks (VANETs). In this report, we gather some useful tools and tips for researchers, including installation and operation of OMNET++, SUMO and VEINS. We think this information will be useful for new users and will save them a lot of time and effort at the beginning of their research works. For this, we have used a widely known distribution of Linux (Ubuntu 16.X). We describe how to integrate simulators OMNET++, VEINS, and SUMO to test vehicular communication protocols and services in an urban environment. This tutorial includes a virtual machine as additional material to help researchers. Our final objective is to assist researchers with their tasks associated to the development of novel proposals that require to perform simulations to show the benefits of their approaches., Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Large-scale simulations manager tool for OMNeT ++: expediting simulations and post-processing analysis

  • Barbecho Bautista, Pablo Andrés
  • Urquiza Aguiar, Luis Felipe
  • Lemus Cárdenas, Leticia
  • Aguilar Igartua, Mónica
Usually, simulations are the first approach to evaluate wireless and mobile networks due to the difficulties involved in deploying real test scenarios. Working with simulations, testing, and validating the target network model often requires a large number of simulation runs. Consequently, there are a significant amount of outcomes to be analyzed to finally plot results. One of the most extensively used simulators for wireless and mobile networks is OMNeT++. This simulation environment provides useful tools to automate the execution of simulation campaigns, yet single-scenario simulations are also supported where the assignation of resources (i.e., CPUs) has to be declared manually. However, conducting a large number of simulations is still cumbersome and can be improved to make it easier, faster, and more comfortable to analyze. In this work, we propose a large-scale simulations framework called simulations manager for OMNeT ++ (SMO). SMO allows OMNeT++ users to quickly and easily execute large-scale network simulations, hiding the tedious process of conducting big simulation campaigns. Our framework automates simulations executions, resources assignment, and post-simulation data analysis through the use of Python’s wide established statistical analysis tools. Besides, our tool is flexible and easy to adapt to many different network scenarios. Our framework is accompanied by a command-line environment allowing a fast and easy manipulation that allows users to significantly reduce the total processing time to carry out large sets of simulations about 25% of the original time. Our code and its documentation are publicly available at GitHub and on our website., This work was supported by the Spanish Government through the Research Project sMArt Grid Using Open Source Intelligence (MAGOS) under Grant TEC2017-84197-C4-3-R. The work of Pablo Andrés Barbecho Bautista was supported by a grant from the Secretaría Nacional de Educación Superior, Ciencia y Tecnología (SENESCYT). The work of Leticia Lemus CÁrdenas was supported by a Ph.D. grant from the Academic Coordination of the University of Guadalajara, Mexico., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A multimetric predictive ANN-based routing protocol for vehicular ad hoc networks

  • Lemus Cárdenas, Leticia
  • Mezher, Ahmad Mohamad
  • Barbecho Bautista, Pablo Andrés
  • Astudillo León, Juan Pablo
  • Aguilar Igartua, Mónica
© 2021 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., Vehicular networks support intelligent transportation system (ITS) to improve drivers’ safety and traffic efficiency on the road by exchanging traffic-related information between vehicles and also between vehicles and infrastructure. Routing protocols that are designed for vehicular networks should be flexible and able to adapt to the inherent dynamic network characteristics of these kind of networks. Therefore, there is a need to have effective vehicular communications, not only to make mobility more efficient but also to reduce collateral issues such as pollution and health problems. Nowadays, the use of machine learning (ML) algorithms in wireless networks are on the rise, including vehicle networks that can benefit from possible data-driven predictions. This work aims to contribute to the design of a smart ML-based routing protocol for vehicular ad hoc networks (VANETs) used to report traffic-related messages in urban environments. We propose a new ML-based forwarding algorithm to be used by the current vehicle holding a given packet to predict which vehicle within its transmission range is the best next-hop to forward that packet towards its destination. Our algorithm is based on a neural network designed from a dataset that contains data records that are captured during simulated urban scenarios. Simulation results show how our ML-based proposal improves the performance of our multimetric routing protocol for VANETs in urban scenarios in terms of packet delivery probability. The performance evaluation of MPANN shows packet losses lower than 20% (and average packet delays below 0.04 ms) for different vehicles’ densities, in completely new scenarios but of similar complexity than the Barcelona scenario used to train the model. Even for much more complex scenarios (with narrow curvy streets), our proposal is able to reduce the packet losses in 20% with respect to the multimetric routing protocol as well as the average packet delays in 0.04 ms., This work was supported by the Spanish Government under Research Project sMArt Grid using Open Source intelligence (MAGOS) under Grant TEC2017-84197-C4-3-R. The work of Pablo Andrés Barbecho Bautista was supported by the Secretaría Nacional de Educación Superior, Ciencia y Tecnología (SENESCYT). The work of Leticia Lemus Cárdenas was supported by the Academic Coordination of the University of Guadalajara, México., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Performance evaluation of dissemination protocols over vehicular networks for an automatic speed fine system

  • Carrión Ojeda, Dustin
  • Iza, Cristhian
  • Aguilar Igartua, Mónica
© 2021 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., Vehicular accidents cause severe problems in our society including economic, material, and even life losses. The cause of those situations relies on several factors such as traffic density, vehicular flow, lack of traffic signaling and speed limit violations. Some of these problems cannot completely be eliminated but could be mitigated by proposing solutions such as people's awareness or intelligent radars to monitor speed limit violations. This work proposes a system to automatically generate fines in case of speed limit infractions. Our approach uses vehicular networks to monitor the vehicles' speed. We also propose a dissemination protocol to ensure the propagation and delivery of the generated fines at the road-side units, achieving a 94.99% and 99.91% fine delivery rate in urban scenarios with vehicles' densities of 30 and 200 vehicles per km 2 , respectively., This work was supported by the Spanish Government through Research Project ‘‘sMArt Grid using Open Source Intelligence (MAGOS)’’ under Grant TEC2017-84197-C4-3-R., 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 Contribución de congreso (ConferenceOutput)

Performance evaluation of a cooperative LTE-DSRC vehicular network

  • Calle Heredia, Xavier
  • Barbecho Bautista, Pablo Andrés
  • Aguilar Igartua, Mónica
Intelligent Transport Systems (ITS) are fundamental to reaching the concept of smart cities. However, the incoming development of vehicular applications will originate an increase in long-term evolution (LTE) traffic demand, so an approach consists of reducing the cell coverage area. This paper presents an alternative solution to deal with areas with a lack of coverage originated by the deployment of LTE micro-cells.We propose a heterogeneous network algorithm named Multi-Metric Heterogeneous Network Algorithm(MMHNA), which uses LTE and dedicated short-range communications (DSRC) technologies. The objective is to extend the LTE communication range with the support of DSRC technology through a forwarding process. This proposal will allow vehicles to send messages to a server directly connected to the evolved Node B (eNB), i.e., the radio network node for LTE networks, even if the sending vehicle is out of range of the eNB., This work was supported by the Spanish Government under research projects “sMArt Grid using Open Source intelligence (MAGOS)" TEC2017-84197-C4-3-R and “Enhancing Communication Protocols with Machine Learning while Protecting Sensitive Data (COMPROMISE)" (PID2020-113795RB-C31/AEI/10.13039/501100011033). Xavier Calle Heredia and Pablo Barbecho Bautista are recipient of a full scholarship from the Secretaria Nacional de Educación Superior, Ciencia y Tecnología (SENESCYT)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Evaluation of dynamic route planning impact on vehicular communications with SUMO

  • Barbecho Bautista, Pablo Andrés
  • Urquiza Aguiar, Luis Felipe
  • Aguilar Igartua, Mónica
Simulations are the first approach used by the research community to evaluate mobile ad hoc networks. Particularly, vehicular ad hoc networks (VANETs) are a singular type of mobile ad hoc networks that raise technical challenges, for instance, in the context of vehicular mobility models. When assessing VANETs, realistic vehicular models are essential to produce meaningful evaluation results. In this context, realistic vehicles' mobility includes re-routing capabilities that allow vehicles to re-compute their routes in front of specific traffic conditions (e.g., traffic jams). In this paper, we provide a thorough analysis of the influence of enabling re-routing properties on (i) the mobility of the vehicle and (ii) on the connections of the vehicular network. For this, we use the road traffic simulator SUMO to generate vehicular traces, and then we will analyze the connectivity of the vehicular network employing well-known graph metrics. Our results provide insights about the behavior of the vehicle's mobility and the nodes' connectivity., This work was supported by the Spanish Government under research project “sMArt Grid using Open Source intelligence" (MAGOS) TEC2017-84197-C4-3-R. Pablo Barbecho is the recipient of a grant from Secretaría Nacional de Educación Superior, Ciencia y Tecnología SENESCYT., 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 Contribución de congreso (ConferenceOutput)

Hybrid autonomous connected vehicle platooning with federated learning: state of the art and simulation framework

  • Prashanth Kannan, Prashanth
  • Al-zuhairi, Yaqoob
  • Aguilar Igartua, Mónica
In this paper, we present a brief overview about technologies and state of art methods being used for Hybrid Autonomous Connected Vehicles (HACV). Moreover, Federated Learning (FL) help in avoiding transmission of raw local data in the design of machine learning models for diverse purposes, which help to ensure privacy of sensible data. On the other hand, to reduce tailpipe emissions hybrid electric vehicles are required, as complete conversion of engines to electric might take time. Communication and connectivity of vehicles and infrastructure are increasing for connected autonomous vehicles (CAV) that play a vital role in future transportation. High speed, reliable and efficient communication between vehicles and infrastructure is made possible with fifth generation (5G) wireless technology. Here, Platooning and 5G helps in joining a cluster of vehicles that aids in reducing fuel consumption and allowing exchange of energy using wireless charging., This work was supported by the Spanish Government under research project ``sMArt Grid using Open Source intelligence (MAGOS)" TEC 2017-84197-C4-3-R., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A probability-based multimetric routing protocol for vehicular ad hoc networks in urban scenarios

  • Lemus Cárdenas, Leticia
  • Mezher, Ahmad Mohamad
  • Barbecho Bautista, Pablo Andrés
  • Aguilar Igartua, Mónica
Vehicular Ad hoc Networks have received considerable attention in recent years and are considered as one of the most promising ad-hoc network technologies for intelligent transport systems. Vehicular Ad hoc Networks have special requirements and unique characteristics (e.g., special mobility patterns, short life links, rapid topology changes) which make the design of suitable routing protocols, a challenge. Consequently, an efficient routing protocol that fits with VANETs’ requirements and characteristics is a crucial task to obtain a good performance in terms of average percentage of packet losses and average end-to-end packet delay. To attain this goal, we propose a novel probabilistic multimetric routing protocol (ProMRP) that is specially designed for VANETs. ProMRP estimates the probability for each neighbor of the node currently carrying the packet, to successfully deliver a packet to destination. This probability is computed based on four designed metrics: distance to destination, node’s position, available bandwidth and nodes’ density. Furthermore, an improved version of ProMRP called EProMRP is also proposed. EProMRP includes an algorithm that accurately estimates the current position of nodes in the moment of sending the packet instead of using the last updated position obtained from the previous beacon message. Simulations are carried out in a realistic urban scenario using OMNeT++/VEINS/SUMO, including real maps from the OpenStreetMaps platform. Simulation results show a better performance of ProMRP and EProMRP compared to recent similar proposals found in the literature in terms of packet losses and end-to-end packet delay, for different vehicles’ densities., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Research data Set de datos (Dataset)

Dataset 5Routingmetrics VANET BCN

  • Lemus Cárdenas, Leticia
  • Mezher, Ahmad Mohamad
  • Aguilar Igartua, Mónica
We have created a representative dataset based on the collection of different traffic metrics from VANET simulations in urban scenarios. The five collected metrics that compose the dataset used to train and test our ML-based forwarding algorithm are available bandwidth, distance to destination, vehicles’ density, MAC layer losses, and vehicle’s trajectory. Notice that those metrics are gathered by the vehicles from the beacons periodically interchanged with the vehicles in their neighborhood (i.e., with vehicles within their transmission range). This way, nodes have local knowledge of the VANET, according to the decentralized nature inherent in VANETs., 1
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Towards a distributed congestion control mechanism for smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Begin, Thomas
  • Busson, Anthony
  • Cruz Llopis, Luis Javier de la
The need for significant improvements in the management and efficient use of electrical energy has led to the evolution from the traditional electrical infrastructures towards modern Smart Grid networks. Taking into account the critical importance of this type of networks, multiple research groups focus their work on issues related to the generation, transport and consumption of electrical energy. One of the key research points is the data communication network associated with the electricity transport infrastructure, and specifically the network that interconnects the devices in consumers' homes, the so-called Neighborhood Area Networks (NANs). In this paper, a new distributed congestion control mechanism is proposed, implemented and evaluated for NANs. Besides, different priorities have been considered for the traffic flows transmitted by different applications. The main goal is to provide with the needed Quality of Service (QoS) to all traffic flows, especially in high traffic load situations. The proposal is evaluated in the context of a wireless ad hoc network made up by a set of smart meter devices, using the Ad hoc On-Demand Distance Vector (AODV) routing protocol and the IEEE 802.11ac physical layer standard. The application of the proposed congestion control mechanism, together with the necessary modifications made to the AODV protocol, lead to performance improvements in terms of packet delivery ratio, network throughput and transit time, fairness between different traffic sources and QoS provision., This work was supported by the Spanish Research Council underprojects INRISCO (TEC2014-54335-C4-1-R) and MAGOS (TEC2017-84197-C4-3-R), and Juan Pablo Astudillo León is the recipient of afull scholarship from the Secretaria Nacional de Educación Superior,Ciencia y Tecnología, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A testbed based performance evaluation of smart grid wireless neighborhood area networks routing protocols

  • Astudillo León, Juan Pablo
  • Cruz Llopis, Luis Javier de la
Smart Grid networks have a data communication network associated with the electrical energy distribution infrastructure. This network connects all the sub- scribers’ homes with the data control centers of the supplying companies, which in turn have access to the global Internet network. They are in charge of transporting the needed information between the elements that comprise the electricity network and the control centers. A part of these networks is the so-called Neighborhood Area Networks (NANs), which transports the data from the subscriber’s home to some data concentrators. This article presents a comparison of the performance of different routing protocols that can be used in this part of the data network, when a wireless technology is selected. For this comparison, a hardware testbed has been implemented, with a simple initial configuration, which allows the comparison of the OLSR v1, OLSR v2 and HWMP protocols. The numerical results are presented in terms of network throughput, protocol overhead, number of retransmissions, net- work transit and packet transfer times., This work was supported by the Spanish Research Council under project MAGOS (TEC2017-84197-C4-3-R), and Juan Pablo Astudillo León is the recipient of a full scholarship from the Secretaría de Educación Superior, Ciencia, Tecnología e Innovación (SENESCYT), Ecuador., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Multi channel allocation and congestion control for smart grid neighborhood area networks

  • Astudillo León, Juan Pablo
  • Cruz Llopis, Luis Javier de la
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 paper, three mechanisms for these kind of networks are proposed, implemented and evaluated: traffic differentiation, multichannel allocation and congestion control. 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, we have built some NAN scenarios by using the ns-3 simulator and its 802.11s basic model, which we have modified to implement our techniques. Compared with the basic Hybrid Wireless Mesh Protocol (HWMP), our modifications, multiple channel (M-HWMP) and congestion control (MC-HWMP), show improvements in terms of packet delivery ratio and transit time., Peer Reviewed, Postprint (published version)
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)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Comparison of traffic demand generation tools in SUMO: case study: access highways to Quito

  • Urquiza Aguiar, Luis
  • Coloma Gómez, William
  • Barbecho Bautista, Pablo Andrés
  • Calderón, Javier
SUMO is one of the tools used to generate synthetic traces of vehi- cles for VANET simulations. Sumo allows creating vehicles’ routes manually, generate random traffic or use traffic demand genera- tion tools. In this paper, a qualitative review of the five traffic de- mand generation tools of SUMO: DUArouter, JTRrouter, DFrouter, OD2trips and MArouter, is presented. We include the advantages and limitations of each of these tools to simulate vehicles’ mobility in real scenarios. In addition, a comparative analysis of these tools is carried out over three access highways of Quito. Our results show that most of the tools provide similar trip times among them but lower than the real ones. However, the distribution of trip times differs among them., The authors gratefully acknowledge the financial support providedby the Escuela Politécnica Nacional, for the development of theproject PIJ-16-01-“Modelamiento de la Packet Error Rate (PER)incluyendo condiciones de Peak-to-Average Power Ratio (PAPR)para transmisiones Ad-Hoc” and the Spanish Government throughproject TEC2017-84197-C4-3-R "Secure sMArt Grid using OpenSource Intelligence, MAGOS".Pablo Barbecho Batista is recipient of a Ph.D. grant from Sec-retaria Nacional de Educación Superior, Ciencia y Tecnología (SE-NESCYT), Ecuador., Peer Reviewed, Postprint (published version)