Pasar al contenido principal

Resultados relacionados

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

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

An Environmentally Adaptive CRO-SL Algorithm Based on Dynamic Agents for the Channel Assignment Problem in Wireless Networks

  • Romero-Barrera, Antonio J.
  • de la Cruz-Piris, Luis
  • Marino Tejedor-Romero
  • Ivan Marsa-Maestre
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] In recent decades, metaheuristic algorithms have emerged as indispensable tools for addressing complex optimization challenges, particularly in several engineering fields, where NP-hard problems are prevalent. A common NP-hard problem in communication engineering is the Channel Assignment Problem (CAP) for wireless access points (APs), with a determined number of stations (STAs) connected to them. The performance of the complete network depends on the interference and noise among the different clusters of devices and the obstacles or elements placed in the physical transmission space. To address the CAP, a new environmentally adaptive approach is proposed for the Coral Reefs Optimization with Substrate Layers (CRO-SL) algorithm, introducing new environmental agents: algae (representing tabu positions) and ocean water acidification (lowering fitness thresholds). The Environmentally Adaptive CRO-SL (EnvAdapt-CRO-SL) implementation aims to improve solution exploration, enhancing computational efficacy in generating new candidate solutions within the coral reef population. An exhaustive comparative analysis of four configurations of the proposed EnvAdapt-CRO-SL variant assesses the impact of each environmental agent on the algorithm's performance. Additionally, external benchmarks against four different metaheuristics, along with an analysis of the influence of pseudorandom number generators on initialization and search operators, and a robust optimization case study, provide deeper insights. The results show that incorporating the new environmental agents into the EnvAdapt-CRO-SL workflow significantly boosts throughput while reducing the computational time required to obtain optimal solutions., This work was supported in part by the MCIN/AEI/10.13039/501100011033 and the European Union ''NextGenerationEU''/PRTR under Project TED2021-131387B-I00; in part by the MCIN/ AEI/10.13039/501100011033/FEDER, UE under Project PID2021-123168NB-I00. In addition, this work has been partially funded by the projects SBPLY/23/180225/000160, which is funded by the EU through FEDER and by the JCCM through INNOCAM and WiDAI (CM/JIN/2021-004) of the Community of Madrid and University of Alcala.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Provenance Verification of Smart Contracts: Analysing the Cost of Ensuring Authenticity over the Logic Hosted in Blockchain Networks

  • Garcia-Valls, Marisol|||0000-0003-2383-5310
  • Chirivella-Ciruelos, Alejandro M.
[EN] The lack of sufficient guarantee about the authenticity of running smart contracts is a major entry barrier to blockchain networks. By authenticity,we refer to the smart contract ownership or provenance; this implies perfect matching between a published source-code and the corresponding running version of a given smart contract. Block verifiers are services that check the provenance authenticity of the logic contained in blockchain networks. Nevertheless, as a block verifier is an external verification service, it consumes time to use it; and the derived overhead may not comply with temporal requirements of time-sensitive domains like cyber-physical systems. Such systems require that the temporal cost of using external services is assessed prior to the final system deployment. To the best of our knowledge, there are no previous contributions on the determination of the temporal cost of the smart-contract provenance verification process. This paper presents the design and implementation of a middleware that assesses the temporal overhead of accessing the verification services; the middleware is hosted in the global ledger and runs the verification services over large sets of smart contracts. Our contribution is validated by providing an implementation on a real blockchain network, employing actual smart contract verifier logic, and analysing the temporal behavior of the overall system operations to comply with the time-sensitive requirements of cyber-physical systems., This research was funded by the following projects: Design of services for resilient and realtime execution of social dispersed computing applications in cyber-physical domains funded by Generalitat Valenciana (Conselleria de Innovación, Universidades, Ciencia y Sociedad Digital), Spain, under grant No. AICO/2021/138. The APC was funded by AICO/2021/138 (Subvenciones para grupos de investigación consolidados). Also, this work has been supported by Grant PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe; and by project Green Networks: Towards environmental-friendly 6G Networks under grant TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Unsupervised Learning for Lateral-Movement-Based Threat Mitigation in Active Directory Attack Graphs

  • Herranz-Oliveros, David
  • Tejedor-Romero, Marino
  • de la Cruz-Piris, Luis
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] Cybersecurity threats, particularly those involving lateral movement within networks, pose significant risks to critical infrastructures such as Microsoft Active Directory. This study addresses the need for effective defense mechanisms that minimize network disruption while preventing attackers from reaching key assets. Modeling Active Directory networks as a graph in which the nodes represent the network components and the edges represent the logical interactions between them, we use centrality metrics to derive the impact of hardening nodes in terms of constraining the progression of attacks. We propose using Unsupervised Learning techniques, specifically density-based clustering algorithms, to identify those nodes given the information provided by their metrics. Our approach includes simulating attack paths using a snowball model, enabling us to analytically evaluate the impact of hardening on delaying Domain Administration compromise. We tested our methodology on both real and synthetic Active Directory graphs, demonstrating that it can significantly slow down the propagation of threats from reaching the Domain Administration across the studied scenarios. Additionally, we explore the potential of these techniques to enable flexible selection of the number of nodes to secure. Our findings suggest that the proposed methods significantly enhance the resilience of Active Directory environments against targeted cyber-attacks., This publication is part of project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR and of project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, UE. Finally, this work is a part of the research project SBPLY/23/180225/000160, which is funded by the EU through FEDER, Spain, and by the JCCM through INNOCAM. David Herranz is also funded by both an FPU grant and a Mobility Grant for Research Staff in Training from the University of Alcala.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Marsá-Maestre, Iván
  • de la Hoz, Enrique
  • Orden, David
  • Herranz-Oliveros, David
[EN] One of the big challenges in decentralized Wi-Fi networks is how to select channels for the different access points (APs) and their associated stations (STAs) in order to minimize interference and hence maximize throughput. Interestingly enough, de facto standards in terms of uncoordinated channel selection are quite simple, and in many cases result in fairly suboptimal channel allocations. Here, we explore how graph coloring can be used to evaluate and inform decisions on Wi-Fi channel selection in uncoordinated settings. Graph coloring, in its most basic form, is a classic mathematical problem where colors have to be assigned to nodes in a graph while avoiding assigning the same color to adjacent nodes. In this paper, we modeled Wi-Fi uncoordinated channel selection as a graph coloring problem and evaluated the performance of different uncoordinated channel selection techniques in a set of representative scenarios of residential buildings. The results confirm some of the widely accepted consensus regarding uncoordinated channel selection but also provide some new insights. For instance, in some settings, it would be better to delegate the decision on which channel to use to transmit the STAs, rather than having the AP make the decision on its own, which is the usual way., This publication is part of Project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR and of Project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, UE. Ivan Marsa-Maestre and David Orden are partially funded by Project SB-PLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER and by Project WiDAI (CM/JIN/2021-004) of the Comunidad de Madrid and University of Alcala. Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, and David Herranz-Oliveros are also funded by Project PID2019-104855RB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation. David Orden is also partially supported by Project PID2019-104129GB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation. The APC was funded by Project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Semantic V2X Communications for Image Transmission in 6G Systems

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Leyva-Mayorga, Israel
  • Popovski, Petar
[EN] The success of future Intelligent Transportation Systems (ITS) heavily relies on the availability of wireless communications technologies that are able to fulfil the strict requirements imposed by applications such as autonomous driving. However, due to the scarce spectrum allocated to ITS, current vehicle-to-everything (V2X) networks experience a severe capacity bottleneck. In this paper, we consider a typical ITS application where images are periodically captured and transmitted by the vehicles. Using an open dataset of real video frames captured by vehicles, we show that the current bandwidth allocated to ITS is insufficient, requiring the vehicles to transmit the video at only a small portion of the frame rate at which it can be captured by the sensors. Furthermore, we show that semantic communications (SemCom) using semantic segmentation are essential to solve this problem, since the receivers are not interested in receiving high definition images but a semantic interpretation that assesses the importance of the elements in it. Our results show that, although the benefits of SemCom in terms of energy consumption are limited to algorithms with a low computational complexity, SemCom are able to greatly improve the performance in terms of maximum supported load and latency, making SemCom essential to make future ITS over 6G viable., This work was supported in part by MICIU/AEI/10.13039/501100011033 under Project TED2021-131387B-I00; in part by the European Union "NextGenerationEU"/PRTR; in part by MICIU/AEI/10.13039/501100011033/FEDER, UE, under Project PID2021-123168NB-I00; in part by the SNS JU Project 6G-GOALS through the EU's Horizon Program under Grant 101139232; and in part by the Villum Investigator Grant "WATER" from the Velux Foundation, Denmark. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Flexible IoT Agriculture Systems for Irrigation Control Based on Software Services

  • Palomar-Cosín, Eva
  • Garcia-Valls, Marisol|||0000-0003-2383-5310
[EN] IoT technology applied to agriculture has produced a number of contributions in the recent years. Such solutions are, most of the time, fully tailored to a particular functional target and focus extensively on sensor-hardware development and customization. As a result, software-centered solutions for IoT system development are infrequent. This is not suitable, as the software is the bottleneck in modern computer systems, being the main source of performance loss, errors, and even cyber attacks. This paper takes a software-centric perspective to model and design IoT systems in a flexible manner. We contribute a software framework that supports the design of the IoT systems' software based on software services in a client-server model with REST interactions; and it is exemplified on the domain of efficient irrigation in agriculture. We decompose the services' design into the set of constituent functions and operations both at client and server sides. As a result, we provide a simple and novel view on the design of IoT systems in agriculture from a sofware perspective: we contribute simple design structure based on the identification of the front-end software services, their internal software functions and operations, and their interconnections as software services. We have implemented the software framework on an IoT irrigation use case that monitors the conditions of the field and processes the sampled data, detecting alarms when needed. We demonstrate that the temporal overhead of our solution is bounded and suitable for the target domain, reaching a response time of roughly 11 s for bursts of 3000 requests., This research was funded by the following projects: "Design of services for resilient and realtime execution of social dispersed computing applications in cyber-physical domains" funded by Generalitat Valenciana (Conselleria de Innovacion, Universidades, Ciencia y Sociedad Digital), Spain, under grant No. AICO/2021/138. The APC was funded by AICO/2021/138 (Subvenciones para grupos de investigacion consolidados). Also, this work has been supported by Grant PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe; and by project Green Networks: Towards environmental-friendly 6G Networks under grant TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Impact of information update generation on the radio access network of cellular Internet of Things

  • Flores Vázquez, Marcelo E.
  • Tello-Oquendo, Luis
  • Aranda, Juan
  • Guamo Morocho, Andrea K.
  • Pla, Vicent|||0000-0002-0894-9494
  • Capella Hernández, Juan Vicente|||0000-0003-3879-9826
[EN] Cellular Internet of Things (CIoT) is considered a suitable technology to provide connectivity to IoT devices and support machine-type communication (MTC). CIoT relies on cellular networks, such as 5 G, to handle the increased demand for data and avoid overload. However, the limited capacity of the Random Access Channel (RACH) in 5 G Radio Access Networks (RANs) represents a challenge for implementing real-time IoT applications. Information update generation and the Random Access (RA) protocol play a crucial role in ensuring timely updates. This paper presents a performance analysis of the impact of information update generation patterns on the RAN in CIoT when the number of IoT devices and information update frequency increase. An extensive simulation study was conducted, considering MTC and H2H (human-to-human) traffic with varying access request intensities. We determine the maximum information update frequency to provide a highly successful access probability over the RAN., The authors would like to acknowledge all the institutions that supported this work: (i) Grupo de Investigacion en Cloud Computing Smart Cities & High Performance Computing (GIHP4C) and the Universidad Politenica Salesiana (Project: Sistema de telemonitoreo automatico del nivel de cloro presente en el agua potabilizada en plantas de tratamiento pertenecientes a pequenas comunidades rurales ubicadas en el territorio ecuatoriano); (ii) Grant PID2021-123168NB-I00, funded by MCIN/AEI/10.13039/501100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, funded by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/RTRP; and (iii) CAPSAB-Facultad de Ingenieria, Universidad de La Sabana (Project ID: ING-310-2023).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An Evaluation Process for IoT Platforms in Time-Sensitive Domains

  • Garcia-Valls, Marisol|||0000-0003-2383-5310
  • Palomar-Cosín, Eva
[EN] Determining the temporal behavior of an IoT platform is of utmost importance as IoT systems are time-sensitive. IoT platforms play a central role in the operation of an IoT system, impacting the overall performance. As a result, initiating an IoT project without the exhaustive knowledge of such a core software piece may lead to a failed project if the finished systems do not meet the needed temporal response and scalability levels. Despite this fact, existing works on IoT software systems focus on the design and implementation of a particular system, providing a final evaluation as the validation. This is a risky approach as an incorrect decision on the core IoT platform may involve great monetary loss if the final evaluation proves that the system does not meet the expected validation criteria. To overcome this, we provide an evaluation process to determine the temporal behavior of IoT platforms to support early design decisions with respect to the appropriateness of the particular platform in its application as an IoT project. The process defines the steps towards the early evaluation of IoT platforms, ranging from the identification of the potential software items and the determination of the validation criteria to running the experiments and obtaining results. The process is exemplified on an exhaustive evaluation of a particular mainstream IoT platform for the case of a medical system for patient monitoring. In this time-sensitive scenario, results report the temporal behavior of the platform regarding the validation parameters expressed at the initial steps., This research was funded by the following projects: "Design of services for resilient and real-time execution of social dispersed computing applications in cyber-physical domains" funded by Generalitat Valenciana (Conselleria de Innovacion, Universidades, Ciencia y Sociedad Digital), Spain, under grant No. AICO/2021/138. The APC was funded by AICO/2021/138 (Subvenciones para grupos de investigacion consolidados). Also, this work has been supported by Grant PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe; and by project Green Networks: Towards environmental-friendly 6G Networks under grant TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimal channel assignment on dense Wi-Fi networks using Thermodynamic Threshold Accepting

  • Tejedor-Romero, Marino
  • Cruz-Piris, Luis
  • Herranz-Oliveros, David
  • Marsa-Maestre, Iván
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] Channel assignment in Wi-Fi 6 dense networks is a challenging problem which critically impacts the performance of WLAN communications. Although there have been many proposals in the area of IEEE 802.11 channel assignment, LCCS has emerged as the de facto standard for distributed channel selection. Notwithstanding, centralized optimizers overcome the performance of distributed channel assignment algorithms, so their study is of utmost importance. One of the most successful optimization proposals in the state-of-the-art for Wi-Fi 4 is based on simulated annealing (SA). However, SA presents a significant limitation: its parameters must be adjusted manually for each scenario, otherwise yielding suboptimal solutions. In this paper, we propose a new technique for channel assignment optimization of Wi-Fi dense networks, called Thermodynamic Threshold Accepting (TTA), including modifications inspired by Threshold Accepting (TA) and Thermodynamic Simulated Annealing (TSA). With respect to SA, TTA avoids manual tuning, being able to adapt to the specific setting automatically. We evaluate TTA in a dense Wi-Fi model and, compared to SA, we show that our approach reaches optimal results without requiring any prior fine-tuning. We also show that TTA is even able to slightly overcome the performance of an accurately calibrated SA optimizer for the same number of iterations., This publication is part of project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/ 501100011033 and by the European Union NextGenerationEU /PRTR and of project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, UE. The work has also been funded by Project SB- PLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER, Spain, by Project WiDAI (CM/JIN/2021 004) of the Comunidad de Madrid and University of Alcalá, and by Projects PID2019-104855RB-I00 and PID2019-104129GB-I00/AEI / 10.13039/501100011033 of the Spanish Ministry of Science and Innovation. Finally, this work is part of the research project SBPLY/23/180225/000160, which is funded b
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

IEEE 802.11 graph models

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Marsa-Maestre, Ivan
  • Cruz-Piris, Luis
  • Orden, David
  • Tejedor-Romero, Marino
[EN] There are several recent research lines addressing Wi-Fi network planning and optimiza-tion, both in terms of channel assignment and access point deployment. The problem with these works is that evaluation is usually performed with specific and closed models regarding signal prop-agation, throughput computation, and utility definition. Also, many of the models in the literature make assumptions about the role of wireless stations, or the co-channel interference, which-while being valid in the context of a single research work-makes very difficult to compare different approaches, to re-use concepts from previous mechanisms to create new ones, or to generalize mechanisms to other scenarios. This makes the different research lines in Wi-Fi network planning and optimization progress in an isolated manner.This paper aims to address such a recurring problem by proposing a graph-based generic model for Wi-Fi utility computation in network planning scenarios, as well as providing a collection of scenario graphs which may be used to benchmark different planning and optimization approaches. Experiments are conducted to show the validity of the model and the significance of its features, along with its extensibility to other scenarios., This work has been partially funded by Projects PID2019-10 4855RB-I00/AEI/10.13039/501100011033 and PID2019-10412 9GB-I00/AEI/10.13039/501100011033, by Project SBPLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER, by Projects UCeNet (CM/JIN/2019-031) and WiDAI (CM/JIN/2021-004) of the Comunidad de Madrid and University of Alcala, and by H2020-MSCA-RISE project 734922 - CONNECT. The publication is also part of project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR and of project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/50110001103 3/FEDER, UE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Understanding Inter- and Intra-Cluster Concurrent Transmissions for IoT Uplink Traffic in MIMO-NOMA Networks: A DTMC Analysis

  • Kumar, Abhishek
  • Li, Frank Y.
  • Florea, Carmen
  • Dobre, Octavia A.
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
[EN] To enable concurrent transmissions for Internet of things (IoT) traffic in multi-antenna beyond fifth generation networks, non-orthogonal multiple access (NOMA) mechanisms appear as a promising approach. For NOMA-enabled transmissions, IoT devices are grouped into clusters in order to exploit the benefit of concurrent transmissions. However, how to facilitate transmissions from both intra- and inter-cluster is not an easy task and the performance of such concurrent transmissions is so far not well understood from a mathematical point of view, especially when error-prone channel conditions are considered. In this paper, we propose two random access schemes which enable intra- and inter-cluster concurrent transmissions for uplink IoT traffic with and without access control. To assess the performance of such systems, we develop two analytical models based on discrete-time Markov chains (DTMCs) that mimic the behavior of such transmissions. Our models deal with cluster-level performance considering dynamic packet arrivals and the transmissions from devices belonging to the same or different clusters. Through extensive simulations, we validate the accuracy of the analytical models and evaluate the system- and cluster-level performance in terms of throughput and delay under various traffic load conditions and network configurations., This work was supported by the European Economic Area (EEA) Norway (NO) through the A Massive MIMO Enabled IoT Platform with Networking Slicing for Beyond 5G IoV/V2X and Maritime Services (SOLID-B5G) under Grant 2014-2021, Project 42/2021, and Project RO-NO2019-0499. The work of Jorge Martinez-Bauset was supported in part by the MCIN/AEI, Spain/10.13039/501100011033 under Grant PGC2018-094151BI00, Grant PID2021-123168NB-I00; in part by the European Union A Way of Making Europe/ERDF under Grant TED2021-131387B-I00; and in part by the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Energy-Based Cell Association in Nonuniform Renewable Energy-Powered Cellular Networks: Analysis and Optimization of Carbon Efficiency

  • Zhao, Yuxi
  • Humar, Iztok
  • Zhong, Yi
  • Ge, Xiaohu
  • Casares-Giner, Vicente|||0000-0002-6947-8470
  • Pla, Vicent|||0000-0002-0894-9494
  • Guijarro, Luis|||0000-0001-9774-9728
[EN] The increasing global push for carbon reduction highlights the importance of integrating renewable energy into the supply chain of cellular networks. However, due to the stochastic nature of renewable energy generation and the uneven load distribution across base stations, the utilization rate of renewable energy remains low. To address these challenges, this paper investigates the trade-off between carbon emissions and downlink throughput in cellular networks, offering insights into optimizing both network performance and sustainability. The renewable energy state of base station batteries and the number of occupied channels are modeled as a quasi-birth-death process. We construct models for the probability of channel blocking, average successful transmission probability for users, downlink throughput, carbon emissions, and carbon efficiency based on stochastic geometry. Based on these analyses, an energy-based cell association scheme is proposed to optimize the carbon efficiency of cellular networks. The results show that, compared to the closest cell association scheme, the energy-based cell association scheme is capable of reducing the carbon emissions of the network by 13.0% and improving the carbon efficiency by 11.3%., This work was supported in part by the National Key R&D Program of China under Grant 2024YFE0200504, in part by the Ministry of Science and Technology (MOST) of China through project no. 110000206520238034, in part by Grant PID2021-123168NB-I00, MCIN/AEI, Spain/10.13039/50 1100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, in part by MCIN/AEI, Spain/10.13039/501100011033 and the European Union NextGenerationEU/RTRP. The work of Iztok Humar was supported by the Slovenian Research and Innovation Agency program P2-0425.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Policy Gradient Algorithms for Age-of-Information Cost Minimization

  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Pla, Vicent|||0000-0002-0894-9494
  • Guijarro, Luis|||0000-0001-9774-9728
  • Leyva-Mayorga, Israel
[EN] Recent developments in cyber-physical systems have increased the importance of maximizing the freshness of the information about the physical environment. However, optimizing the access policies of Internet of Things devices to maximize the data freshness, measured as a function of the Age-of-Information (AoI) metric, is a challenging task. This work introduces two algorithms to optimize the information update process in cyber-physical systems operating under the generate-at-will model, by finding an online policy without knowing the characteristics of the transmission delay or the age cost function. The optimization seeks to minimize the time-average cost, which integrates the AoI at the receiver and the data transmission cost, making the approach suitable for a broad range of scenarios. Both algorithms employ policy gradient methods within the framework of model-free reinforcement learning (RL) and are specifically designed to handle continuous state and action spaces. Each algorithm minimizes the cost using a distinct strategy for deciding when to send an information update. Moreover, we demonstrate that it is feasible to apply the two strategies simultaneously, leading to an additional reduction in cost. The results demonstrate that the proposed algorithms exhibit good convergence properties and achieve a time-average cost within 3% of the optimal value, when the latter is computable. A comparison with other state-of-the-art methods shows that the proposed algorithms outperform them in one or more of the following aspects: being applicable to a broader range of scenarios, achieving a lower time-average cost, and requiring a computational cost at least one order of magnitude lower., This work was supported through Grant PID2021- 123168NB-I00, funded by MCIN/AEI/10.13039/50 1100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, funded by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Surgical immunization strategies against lateral movement in Active Directory environments

  • Herranz-Oliveros, David
  • Marsa-Maestre, Ivan
  • Tejedor-Romero, Marino
  • de la Hoz, Enrique
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] Lateral movement, in which a cyber attacker progresses through an enterprise network in order to compromise its most valuable assets, is a key stage of any intrusion nowadays. Therefore, being able to mitigate lateral movement, be it by slowing down attacker progress or by limiting its reach, is a top priority for enterprise cyber-defence. Due to the inherent complexity of enterprise networks, it is also a paramount challenge. This challenge becomes even more prominent if we take into account the high impact of deploying security countermeasures on the performance or functionality of the network. In this paper we model lateral movement as an infection process and propose a methodology to prioritize which network elements to protect for a more effective and efficient mitigation. To do this we rely on a graph model and graph theoretic metrics taken from epidemiology research, and apply them to the trust relationships in Microsoft Active Directory infrastructures. We propose selective immunization techniques which act as ``surgical¿¿ countermeasures, by impacting a very reduced ratio of the nodes in the network. Experiments show that the selective immunization strategies we propose effectively mitigate infection spread in these settings while keeping the amount of immunized nodes at a minimum., This work has been partially funded by the project PID2019-104855RB-I00/AEI/10.13039/501100011033 from the Ministry of Science and Innovation of Spain, the project SBPLY/19/180501/000171 from the Government of Castilla-La Mancha (Spain), and the projects UCeNet (CM/JIN/2019-031) and WiDAI (CM/JIN/2021-004) from the Community of Madrid and the University of Alcalá. David Herranz is also funded by an FPU grant from the University of Alcalá. This publication is also part of the TED2021-131387B-I00 project funded by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU /PRTR, and the project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, EU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Energy Consumption Modeling for Heterogeneous Internet of Things Wireless Sensor Network Devices: Entire Modes and Operation Cycles Considerations

  • Portillo-Jimenez, Canek
  • Martínez Bauset, Jorge|||0000-0003-3342-3037
  • Pla, Vicent|||0000-0002-0894-9494
  • Casares-Giner, Vicente|||0000-0002-6947-8470
[EN] Wireless sensor networks (WSNs) and sensing devices are considered to be core components of the Internet of Things (IoT). The performance modeling of IoT-WSN is of key importance to better understand, deploy, and manage this technology. As sensor nodes are battery-constrained, a fundamental issue in WSN is energy consumption. Additional issues also arise in heterogeneous scenarios due to the coexistence of sensor nodes with different features. In these scenarios, the modeling process becomes more challenging as an efficient orchestration of the sensor nodes must be achieved to guarantee a successful operation in terms of medium access, synchronization, and energy conservation. We propose a novel methodology to determine the energy consumed by sensor nodes deploying a recently proposed synchronous duty-cycled MAC protocol named Priority Sink Access MAC (PSA-MAC). We model the operation of a WSN with two classes of sensor devices by a pair of two-dimensional Discrete-Time Markov Chains (2D-DTMC), determine their stationary probability distribution, and propose new expressions to compute the energy consumption based solely on the obtained stationary probability distribution. This new approach is more systematic and accurate than previously proposed ones. The new methodology to determine energy consumption takes into account different specific features of the PSA-MAC protocol as: (i) the synchronization among sensor nodes; (ii) the normal and awake operation cycles to ensure synchronization among sensor nodes and energy conservation; (iii) the two periods that compose a full operation cycle: the data and sleep periods; (iv) two transmission schemes, SPT (single packet transmission) and APT (aggregated packet transmission) (v) the support of multiple sensor node classes; and (vi) the support of different priority assignments per class of sensor nodes. The accuracy of the proposed methodology has been validated by an independent discrete-event-based simulation model, showing that very precise results are obtained., This work was supported through Grant PID2021-123168NB-I00, funded by MCIN/AEI, Spain/10.13039/501100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, funded by MCIN/AEI, Spain/10.13039/501100011033 and the European Union NextGenerationEU/ RTRP. Canek Portillo was supported in part by Grant 2014-0870/001-001 (EuroinkaNet) and by Grant DSA/103.5/15/6629 (SEP-SES).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Goal-Oriented Source Coding and Filtering for Vehicular Communications

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Leyva-Mayorga, Israel
  • Popovski, Petar
[EN] Vehicle-to-everything (V2X) networks will constitute a prominent application in future generations of cellular networks, definitely transforming our conception of transportation systems. A major challenge in V2X networks is the vast amount of data generated by the large number of sensors in the vehicles, which saturates the wireless links. As it is not possible to meet the throughput, timing, and reliability requirements for the total bulk of generated data, one needs to filter out data based on the actual communication goal. In this article, we present an architecture and diverse options to implement filtering and source coding for goal-oriented (GO) vehicular communications. We illustrate how filtering and source coding contribute to meeting the strict delay requirements while maintaining energy-efficient operation. Our results show that GO communications, performed as the combination of Bloom filtering and GO source coding, can greatly contribute not only to reduce the energy consumption by up to 30% but also to decrease delay, which in turn increases the supported amount of delay-sensitive traffic by up to 819.2%., This work was supported in part by the MCIN/AEI/10.13039/501100011033 and the European Union "NextGenerationEU"/PRTR under Project TED2021-131387B-I00; in part by the MCIN/AEI/10.13039/501100011033/FEDER, UE under Project PID2021123168NB-I00; in part by the Spanish Ministry of Science and Innovation under Project PID2019-104855RB-I00/AEI/10.13039/501100011033; in part by the SNS JU Project 6G-GOALS through the EU's Horizon Program under Grant 101139232; and in part by the Villum Investigator Grant "WATER" from the Velux Foundation, Denmark. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A user subscription model in mobile radio access networks with network slicing

  • Vidal Catalá, José Ramón|||0000-0002-7137-1349
  • Guijarro, Luis|||0000-0001-9774-9728
  • Pla, Vicent|||0000-0002-0894-9494
[EN] Network slicing is an architectural enabling technology that logically decouples the current cellular networks into infrastructure providers (InPs) and Network Slice Tenants (NSTs). The network resources (e.g., radio access resources at each cell) are owned by the InP, and are shared by the NSTs to provide a service to their mobile users. In this context, we proposed a business model that includes resource allocation and user subscription to NSTs in a competitive setting, and provides, among other things, closed-form expressions for the subscription indicators in equilibrium of each NST at each cell. This model relies on the widely adopted logit model to characterize user subscriptions. However, as a consequence of user mobility and radio propagation, some of the underlying assumptions in the logit model do not hold. Therefore, further research is needed to assess the accuracy of the results provided by the logit model in a mobile radio scenario. We carry out a thorough evaluation of the validity of the model by comparing its results against those obtained through computer simulation. Our simulation model includes complete and realistic characterizations of user mobility and radio propagation. From the results, we conclude that in most cases the logit model provides valid results in a mobile radio scenario., This work was supported through Grants PGC2018-094151B-I00 and PID2021-123168NB-I00, funded by MCIN/AEI, Spain/10.13039/501100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, funded by MCIN/AEI, Spain/10.13039/501100011033 and the European Union NextGenerationEU/RTRP.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Economic Alternatives for the Provision of URLLC and eMBB Services Over a 5G Network

  • Moreno-Cardenas, Edison
  • Sacoto-Cabrera, Erwin J.
  • Guijarro, Luis|||0000-0001-9774-9728
[EN] This research work analyzes economic alternatives for the provision of ultra-reliable low latency communication (URLLC) and enhanced mobile broadband (eMBB) services by mobile network operators over the same fifth-generation (5G) network. Two business models are proposed to provide the two services to end users. Concretely, a monopoly is a single operator who offers both services, and a duopoly is two different operators that share network resources and offer one service each. In addition, two types of network scenarios for resource sharing are studied. Specifically, a shared network (SN) is a type of network scenario allowing resources to be shared between the two services without priority. A differentiated network (DN) is a type of network scenario that allows resources to be shared between the two services with a priority to URLLC service using network slicing (NS). Regarding the economic aspects, the incentive is modeled through the user's utility and the operator's benefit. At the same time, game theory is used to model the strategic interaction between users and operators, and queuing theory is used to model the interaction between the two services. We conclude that the monopoly social welfare (SW) is closer to the SW of the social optimum than the duopoly SW. In addition, the DN scenario to offer the services through NS is more suitable than the SN scenario since the point of view of service prices, user utilities, and operator benefit., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported through Grants PGC2018-094151B-I00 and PID2021-123168NB-I00, funded by MCIN/AEI, Spain/10.13039/501100011033 and the European Union A way of making Europe/ERDF, and Grant TED2021-131387B-I00, funded by MCIN/AEI, Spain /10.13039/501100011033 and the European Union NextGenerationEU/RTRP and partially fnanced by the Government of Peru through the Bicentennial Generation Scholarship granted to the frst author.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Market and Sharing Alternatives for the Provision of Massive Machine-Type and Ultra-Reliable Low-Latency Communications Services over a 5G Network

  • Moreno-Cardenas, Edison
  • Guijarro, Luis|||0000-0001-9774-9728
[EN] The objective of this paper is to analyze economic alternatives for the provision of ultra-reliable low-latency communication (URLLC) and massive machine-type communication (mMTC) services over a fifth-generation (5G) network. Two business models, a monopoly and a duopoly, are studied and two 5G network scenarios are analyzed: a 5G network where the network resources are shared between the two services without service priority, and a 5G network with network slicing that allows for URLLC traffic to have a higher priority. Microeconomics is used to model the behavior of users and operators, and game theory is used to model the strategic interaction between users and operators. The results show that a monopoly over a 5G network with network slicing is the most efficient way to provide both URLLC and mMTC services., This work received support from various sources, including Grant PID2021-123168NB-I00 funded by MCIN/AEI, Spain/10.13039/501100011033; the European Union s A way of making Europe/ERDF, Grant TED2021-131387B-I00 funded by MCIN/AEI, Spain/10.13039/501100011033; the European Union s NextGenerationEU/RTRP; and Grant AICO/2021/138 funded by the Generalitat Valenciana, Spain. This work was also partially financed by the Government of Peru through the Bicentennial Generation Scholarship granted to the first author
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Energy-Autonomous Roadside Nodes in V2I Using RF Energy Harvesting

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Leyva-Mayorga, Israel
  • Azarbahram, Amirhossein
  • López, Onel Alcaraz
  • Popovski, Petar
[EN] Future intelligent transportation systems will require complex networking infrastructures with communication among a huge number of vehicles and roadside nodes to support services such as autonomous driving. However, the deployment and operation of such a large number of roadside nodes is expensive due to either the cost of battery replacement or the maintenance of a continuous energy supply in long highways or rural areas. In this work, we evaluate the feasibility of a roadside unit harvesting energy from radio frequency (RF) signals transmitted by a nearby moving vehicle, with the incentive of using a part of the harvested energy to transmit small amounts of data to the vehicle. We consider a realistic model with the timing elements related to the movement of the vehicle, beam tracking errors, a non-linear model for energy harvesting, and potential line-of-sight obstructions in multi-vehicle scenarios. Results show that, with typical off-the-shelf components, it is feasible to use the RF harvested energy to transmit between a few hundred and several thousand bytes, depending on the speed of vehicles and the frequency of operation for energy harvesting, among other parameters., This work was supported in part by the MCIN/AEI/10.13039/501100011033 and the European Union "NextGenerationEU"/PRTR underProject TED2021-131387B-I00; in part by the MCIN/AEI/10.13039/501100011033/FEDER, UE under Project PID2021-123168NB-I00; in part by the Villum Investigator Grant "WATER" from the Velux Foundation, Denmark; in part by the Finnish Foundation for Technology Promotion; and in part by the Research Council of Finland (former Academy of Finland) under Grant 348515 and Grant 346208 (6G Flagship Programme).
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Unsupervised Learning for Lateral-Movement-Based Threat Mitigation in Active Directory Attack Graphs

  • Herranz Oliveros, David|||0009-0009-0926-3986
  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
Cybersecurity threats, particularly those involving lateral movement within networks, pose significant risks to critical infrastructures such as Microsoft Active Directory. This study addresses the need for effective defense mechanisms that minimize network disruption while preventing attackers from reaching key assets. Modeling Active Directory networks as a graph in which the nodes represent the network components and the edges represent the logical interactions between them, we use centrality metrics to derive the impact of hardening nodes in terms of constraining the progression of attacks. We propose using Unsupervised Learning techniques, specifically density-based clustering algorithms, to identify those nodes given the information provided by their metrics. Our approach includes simulating attack paths using a snowball model, enabling us to analytically evaluate the impact of hardening on delaying Domain Administration compromise. We tested our methodology on both real and synthetic Active Directory graphs, demonstrating that it can significantly slow down the propagation of threats from reaching the Domain Administration across the studied scenarios. Additionally, we explore the potential of these techniques to enable flexible selection of the number of nodes to secure. Our findings suggest that the proposed methods significantly enhance the resilience of Active Directory environments against targeted cyber-attacks., Ministerio de Ciencia, Innovación y Universidades, Junta de Comunidades de Castilla-La Mancha, Comunidad de Madrid, Fondo Europeo de Desarrollo Regional, European Union
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Optimal channel assignment on dense Wi-Fi networks using Thermodynamic Threshold Accepting

  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
  • Herranz Oliveros, David|||0009-0009-0926-3986
  • Marsá Maestre, Iván|||0000-0002-5529-2851
Channel assignment in Wi-Fi 6 dense networks is a challenging problem which critically impacts the performance of WLAN communications. Although there have been many proposals in the area of IEEE 802.11 channel assignment, LCCS has emerged as the de facto standard for distributed channel selection. Notwithstanding, centralized optimizers overcome the performance of distributed channel assignment algorithms, so their study is of utmost importance. One of the most successful optimization proposals in the state-of-the-art for Wi-Fi 4 is based on simulated annealing (SA). However, SA presents a significant limitation: its parameters must be adjusted manually for each scenario, otherwise yielding suboptimal solutions. In this paper, we propose a new technique for channel assignment optimization of Wi-Fi dense networks, called Thermodynamic Threshold Accepting (TTA), including modifications inspired by Threshold Accepting (TA) and Thermodynamic Simulated Annealing (TSA). With respect to SA, TTA avoids manual tuning, being able to adapt to the specific setting automatically. We evaluate TTA in a dense Wi-Fi model and, compared to SA, we show that our approach reaches optimal results without requiring any prior fine-tuning. We also show that TTA is even able to slightly overcome the performance of an accurately calibrated SA optimizer for the same number of iterations., Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Surgical immunization strategies against lateral movement in Active Directory environments

  • Herranz Oliveros, David|||0009-0009-0926-3986
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
Lateral movement, in which a cyber attacker progresses through an enterprise network in order to compromise its most valuable assets, is a key stage of any intrusion nowadays. Therefore, being able to mitigate lateral movement, be it by slowing down attacker progress or by limiting its reach, is a top priority for enterprise cyber-defence. Due to the inherent complexity of enterprise networks, it is also a paramount challenge. This challenge becomes even more prominent if we take into account the high impact of deploying security countermeasures on the performance or functionality of the network. In this paper we model lateral movement as an infection process and propose a methodology to prioritize which network elements to protect for a more effective and efficient mitigation. To do this we rely on a graph model and graph theoretic metrics taken from epidemiology research, and apply them to the trust relationships in Microsoft Active Directory infrastructures. We propose selective immunization techniques which act as ?surgical? countermeasures, by impacting a very reduced ratio of the nodes in the network. Experiments show that the selective immunization strategies we propose effectively mitigate infection spread in these settings while keeping the amount of immunized nodes at a minimum., Ministerio de Ciencia e Innovación, Junta de Comunidades de Castilla-La Mancha, Comunidad de Madrid
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo preliminar (WorkingPaper)

User Guide EnvAdapt-CRO-SL v.1.0

  • Romero Barrera, Antonio José|||0000-0001-5496-1331
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
In the realm of computational science, the effectiveness of algorithms heavily relies on clear understanding and implementation. This user’s guide provides comprehensive insights for the MATLAB scripts comprising the EnvAdapt-CRO-SL algorithm, designed to simulate coral reef adaptation in response to environmental changes. Each chapter delves into the functionality, contributions, and availability of a specific script, offering detailed explanations of its inner workings through this documentation. From initializing problem structures to executing main loops and saving results, these guides systematically outline the algorithms’ processes, fostering comprehension and facilitating seamless implementation. By encapsulating the essence of each script in structured pseudocode, this document serves as a guide for the practitioners interested in working with the EnvAdapt-CRO-SL v.1.0., Comunidad de Madrid, Universidad de Alcalá, Ministerio de Ciencia, Innovación y Universidades
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

IEEE 802.11 graph models

  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Cruz Piris, Luis De La|||0000-0002-9570-2851
  • Orden Martín, David|||0000-0001-5403-8467
  • Tejedor Romero, Marino|||0000-0002-1679-0161
There are several recent research lines addressing Wi-Fi network planning and optimization, both in terms of channel assignment and access point deployment. The problem with these works is that evaluation is usually performed with specific and closed models regarding signal propagation, throughput computation, and utility definition. Also, many of the models in the literature make assumptions about the role of wireless stations, or the co-channel interference, which -while being valid in the context of a single research work- makes very difficult to compare different approaches, to re-use concepts from previous mechanisms to create new ones, or to generalize mechanisms to other scenarios. This makes the different research lines in Wi-Fi network planning and optimization progress in an isolated manner. This paper aims to address such a recurring problem by proposing a graph-based generic model for Wi-Fi utility computation in network planning scenarios, as well as providing a collection of scenario graphs which may be used to benchmark different planning and optimization approaches. Experiments are conducted to show the validity of the model and the significance of its features, along with its extensibility to other scenarios., Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá, European Commission