Karen Miranda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Karen Miranda has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Tahiry Razafindralambo
INRIA Lille - Nord Europe, Villeneuve d'Ascq, France
4 shared publications- Abel García-Nájera
Universidad Autónoma Metropolitana Unidad Cuajimalpa
2 shared publications Enrico Natalizio
Inria Lille-Nord Europe, FUN Research Team, 40 avenue Halley, 59650 Villeneuve d'Ascq, France
2 shared publicationsAbel García-Nájera
Universidad Autónoma Metropolitana Unidad Cuajimalpa
1 shared publicationAntonella Molinaro
Università degli Studi Mediterranea di Reggio Calabria
1 shared publication- Antonio Guerrero Juárez1 shared publication
Latest Publications
- 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Adaptive self-deployment algorithms for mobile wireless substitution networks
Algorithmes d'auto-déploiement adaptatifs pour des réseaux de substitution mobiles sans fil: En cas de sinistre, les infrastructures de communication peuvent être partiellement ou totalement détruites, ou inefficaces en raison du trafic élevé. Néanmoins, il est nécessaire d'assurer la connectivité entre les équipes de secours et le centre de commandement. Par conséquent, les solutions de communication temporaires sont essentielles jusqu'à ce que l'infrastructure soit rétablie. Dans cette thèse, nous nous concentrons sur le déploiement d’une solution de communication appelée réseaux de substitution. Ainsi, nous proposons un algorithme d'auto - déploiement pour permettre aux routeurs mobiles et répartis composant un réseau de substitution de couvrir la zone cible. Notre algorithme surveille les conditions du réseau pour décider si le routeur doit ou non se déplacer, ajustant la position de ce dernier en fonction des informations à un saut au moyen de la mesure active, c'est à dire, les paquets sondes. Ces paquets sondes permettent à l'algorithme de surveiller le canal et ses éventuels changements au fil du temps. Si le taux de transmission des paquets est suffisamment élevé, les connaissances obtenues seront exactes, cependant, le coût augmentera proportionnellement en consommant plus de ressources réseau. Par conséquent, nous proposons d'utiliser des données de substitution obtenus au moyen d'un estimateur autorégressif pour réduire la surcharge sans impacter notre algorithme de déploiement. Nous montrons par simulation l'efficacité des deux algorithmes et leurs performances en termes de temps de déploiement, de délai, de gigue et de débit.
- 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Adaptive self-deployment algorithms for mobile wireless substitution networks
Algorithmes d'auto-déploiement adaptatifs pour des réseaux de substitution mobiles sans fil: En cas de sinistre, les infrastructures de communication peuvent être partiellement ou totalement détruites, ou inefficaces en raison du trafic élevé. Néanmoins, il est nécessaire d'assurer la connectivité entre les équipes de secours et le centre de commandement. Par conséquent, les solutions de communication temporaires sont essentielles jusqu'à ce que l'infrastructure soit rétablie. Dans cette thèse, nous nous concentrons sur le déploiement d’une solution de communication appelée réseaux de substitution. Ainsi, nous proposons un algorithme d'auto - déploiement pour permettre aux routeurs mobiles et répartis composant un réseau de substitution de couvrir la zone cible. Notre algorithme surveille les conditions du réseau pour décider si le routeur doit ou non se déplacer, ajustant la position de ce dernier en fonction des informations à un saut au moyen de la mesure active, c'est à dire, les paquets sondes. Ces paquets sondes permettent à l'algorithme de surveiller le canal et ses éventuels changements au fil du temps. Si le taux de transmission des paquets est suffisamment élevé, les connaissances obtenues seront exactes, cependant, le coût augmentera proportionnellement en consommant plus de ressources réseau. Par conséquent, nous proposons d'utiliser des données de substitution obtenus au moyen d'un estimateur autorégressif pour réduire la surcharge sans impacter notre algorithme de déploiement. Nous montrons par simulation l'efficacité des deux algorithmes et leurs performances en termes de temps de déploiement, de délai, de gigue et de débit.
- 1 October 2025
- Published by Universidad Autónoma del Estado de Morelos in Programación matemática y software
- Vol. 17 (3)
Aplicación de microalgoritmos genéticos para la optimización de hiperparámetros en métodos de clasificación
Este estudio propone el uso de microalgoritmos genéticos como una técnica de optimización de hiperparámetros para mejorar la precisión y eficiencia de algunos métodos de clasificaciòn. Se evaluaron cuatro modelos sin optimización de hiperparámetros y, posteriormente, se aplicó un microalgoritmo genético diseñado específicamente para ajustar el valor de sus hiperparámetros. El objetivo fue analizar el impacto de esta técnica en la mejora de la precisión de los métodos. Los resultados demostraron que la implementación de microalgoritmos genéticos no solo aumentó significativamente la exactitud de los métodos de clasificación, sino que también redujo el tiempo de entrenamiento, mostrando una mejora en la eficiencia. Estos hallazgos sugieren que los microalgoritmos genéticos pueden ser una herramienta efectiva para optimizar el rendimiento de los métodos de clasificación y resolver problemas de clasificación con mayor exactitud y rapidez.
- 1 October 2025
- Published by Universidad Autónoma del Estado de Morelos in Programación matemática y software
- Vol. 17 (3)
Aplicación de microalgoritmos genéticos para la optimización de hiperparámetros en métodos de clasificación
Este estudio propone el uso de microalgoritmos genéticos como una técnica de optimización de hiperparámetros para mejorar la precisión y eficiencia de algunos métodos de clasificaciòn. Se evaluaron cuatro modelos sin optimización de hiperparámetros y, posteriormente, se aplicó un microalgoritmo genético diseñado específicamente para ajustar el valor de sus hiperparámetros. El objetivo fue analizar el impacto de esta técnica en la mejora de la precisión de los métodos. Los resultados demostraron que la implementación de microalgoritmos genéticos no solo aumentó significativamente la exactitud de los métodos de clasificación, sino que también redujo el tiempo de entrenamiento, mostrando una mejora en la eficiencia. Estos hallazgos sugieren que los microalgoritmos genéticos pueden ser una herramienta efectiva para optimizar el rendimiento de los métodos de clasificación y resolver problemas de clasificación con mayor exactitud y rapidez.
- 19 January 2024
- Published by Springer Nature in Scientometrics
- Vol. 129 (3) , 1523-1544
On the analysis of collaboration networks between industry and academia: the Mexican case of the innovation incentive program
- 19 January 2024
- Published by Springer Nature in Scientometrics
- Vol. 129 (3) , 1523-1544
On the analysis of collaboration networks between industry and academia: the Mexican case of the innovation incentive program
- 30 August 2018
- Published by Springer Nature
- p. 165-187
A Comparison of Bio-Inspired Approaches for the Cluster-Head Selection Problem in WSN
- 30 August 2018
- Published by Springer Nature
- p. 165-187
A Comparison of Bio-Inspired Approaches for the Cluster-Head Selection Problem in WSN
- Open Access
- 3 November 2013
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Fast and reliable robot deployment for substitution networks
In this paper, we propose an algorithm to efficiently (re)-deploy the wireless mobile routers of a substitution network by considering the energy consumption, a fast deployment scheme and a mix of the network metric. We consider a scenario where we have two routers in a fixed network and where a robust connection must be restored between those two routers with a wireless mobile router. The main objective of the wireless mobile router is to increase the communication performance such as the throughput by acting as relay node between the two routers of the fixed network. We present a fast, adaptive and localized approach which takes into account different network metrics such as Received Signal Strength (RSS), Round-Trip Time (RTT) and the Transmission Rate, between the wireless mobile router and the two routers of the fixed network. Our method ameliorates the performance of our previous approach from the literature by shortening the deployment time, increasing the throughput, and consuming less energy in some specific cases.
- 3 November 2013
- Published by Association for Computing Machinery (ACM)
- p. 17-24
Open AccessFast and reliable robot deployment for substitution networks
In this paper, we propose an algorithm to efficiently (re)-deploy the wireless mobile routers of a substitution network by considering the energy consumption, a fast deployment scheme and a mix of the network metric. We consider a scenario where we have two routers in a fixed network and where a robust connection must be restored between those two routers with a wireless mobile router. The main objective of the wireless mobile router is to increase the communication performance such as the throughput by acting as relay node between the two routers of the fixed network. We present a fast, adaptive and localized approach which takes into account different network metrics such as Received Signal Strength (RSS), Round-Trip Time (RTT) and the Transmission Rate, between the wireless mobile router and the two routers of the fixed network. Our method ameliorates the performance of our previous approach from the literature by shortening the deployment time, increasing the throughput, and consuming less energy in some specific cases.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Using efficiently autoregressive estimation in wireless sensor networks
Wireless sensor networks (WSNs) are widely deployed nowadays on a large variety of applications. The major goal of a WSN is to collect information about a set of phenomena. Such process is non trivial since batteries' life is limited and thus wireless transmissions as well as computing operations must be minimized. A common task in WSNs is to estimate the sensed data and to spread the estimated samples over the network. Thus, time series estimation mechanisms are vital on this type of processes so as to reduce data transmission. In this paper, we assume a single-hop clustering mechanism in which sensor nodes are grouped into clusters and communicate with a sink through a single hop. We propose a couple of autoregressive mechanisms to predict local sensed samples in order to reduce wireless data communication. We compare our proposal with a model called EEE that has been previously proposed in the literature. We prove the efficiency of our algorithms with real samples publicly available and show that they outperform the EEE mechanism.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Using efficiently autoregressive estimation in wireless sensor networks
Wireless sensor networks (WSNs) are widely deployed nowadays on a large variety of applications. The major goal of a WSN is to collect information about a set of phenomena. Such process is non trivial since batteries' life is limited and thus wireless transmissions as well as computing operations must be minimized. A common task in WSNs is to estimate the sensed data and to spread the estimated samples over the network. Thus, time series estimation mechanisms are vital on this type of processes so as to reduce data transmission. In this paper, we assume a single-hop clustering mechanism in which sensor nodes are grouped into clusters and communicate with a sink through a single hop. We propose a couple of autoregressive mechanisms to predict local sensed samples in order to reduce wireless data communication. We compare our proposal with a model called EEE that has been previously proposed in the literature. We prove the efficiency of our algorithms with real samples publicly available and show that they outperform the EEE mechanism.
- Open Access
- 10 September 2012
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 8 (9)
Adaptive Deployment Scheme for Mobile Relays in Substitution Networks
We present how the mobility of routers impacts the performance of a wireless substitution network. To that end, we simulate a scenario where a wireless router moves between three static nodes, a source and two destinations of UDP traffic. Specifically, our goal is to deploy or redeploy the mobile relays so that application-level requirements, such as data delivery or latency, are met. Our proposal for a mobile relay achieves these goals by using an adaptive approach to self-adjust their position based on local information. We obtain results on the performance of end-to-end delay, jitter, loss percentage, and throughput under such mobility pattern for the mobile relay. We show how the proposed solution is able to adapt to topology changes and to the evolution of the network characteristics through the usage of limited neighborhood knowledge.
- 10 September 2012
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 8 (9)
Open AccessAdaptive Deployment Scheme for Mobile Relays in Substitution Networks
We present how the mobility of routers impacts the performance of a wireless substitution network. To that end, we simulate a scenario where a wireless router moves between three static nodes, a source and two destinations of UDP traffic. Specifically, our goal is to deploy or redeploy the mobile relays so that application-level requirements, such as data delivery or latency, are met. Our proposal for a mobile relay achieves these goals by using an adaptive approach to self-adjust their position based on local information. We obtain results on the performance of end-to-end delay, jitter, loss percentage, and throughput under such mobility pattern for the mobile relay. We show how the proposed solution is able to adapt to topology changes and to the evolution of the network characteristics through the usage of limited neighborhood knowledge.
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 471-474
Adaptive router deployment for multimedia services in mobile pervasive environments
In this paper, we present an adaptive algorithm to deploy or re-deploy wireless mobile relays in pervasive environments. To that end, we simulate a simple scenario where a wireless router moves between two static nodes, a source and a destination of multimedia traffic. The mobile relay and both static nodes are in line of sight. The mobile router can move on the straight line between source and destination to reach the optimal position. We obtain preliminary results on the performance of end-to-end delay, jitter, throughput, and the perceived quality under such mobility pattern for the mobile node.
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 471-474
Adaptive router deployment for multimedia services in mobile pervasive environments
In this paper, we present an adaptive algorithm to deploy or re-deploy wireless mobile relays in pervasive environments. To that end, we simulate a simple scenario where a wireless router moves between two static nodes, a source and a destination of multimedia traffic. The mobile relay and both static nodes are in line of sight. The mobile router can move on the straight line between source and destination to reach the optimal position. We obtain preliminary results on the performance of end-to-end delay, jitter, throughput, and the perceived quality under such mobility pattern for the mobile node.