Karen Miranda

Dr. Karen Miranda


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 September 2012 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
Karen MirandaKaren Miranda
Karen Miranda
ENEnrico Natalizio
Enrico Natalizio
TRTahiry Razafindralambo
Tahiry Razafindralambo
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 May 2013
Verified
Conference Paper
Closed access
Karen MirandaKaren Miranda
Karen Miranda
VRVictor Ramos
Victor Ramos
TRTahiry Razafindralambo
Tahiry Razafindralambo
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.

30 August 2018
Verified
Book Chapter
Closed access
PDF file
Karen MirandaKaren Miranda
Karen Miranda
SZSaúl Zapotecas-Martínez
Saúl Zapotecas-Martínez
ALAntonio López-Jaimes
Antonio López-Jaimes
AGAbel García-Nájera
Abel García-Nájera


3 November 2013
Verified
Conference Paper
Open access
JRJean Razafimandimby
Jean Razafimandimby
Karen MirandaKaren Miranda
Karen Miranda
DZDimitrios Zorbas
Dimitrios Zorbas
TRTahiry Razafindralambo
Tahiry Razafindralambo
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 March 2012
Verified
Conference Paper
Closed access
Karen MirandaKaren Miranda
Karen Miranda
ENEnrico Natalizio
Enrico Natalizio
TRTahiry Razafindralambo
Tahiry Razafindralambo
AMAntonella Molinaro
Antonella Molinaro
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.