EREstefanía Recayte

Estefanía Recayte

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Estefanía Recayte has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    OFDM-Based Waveforms in 6G NTN: A Comparative Analysis

    by Carla Amatetti, Marius Caus, Musbah Shaat, Eduardo Medeiros, Chao Zhang, Per-Erik Eriksson, Sebastian Euler, Dorin Panaitopol, Sorya Tong, Estefanía Recayte, et al.

  • Open Access

    Two-Step Interference Cancellation for Energy Saving in Irregular Repetition Slotted ALOHA

    by Estefanía Recayte, Leonardo Badia, Andrea Munari

    We evaluate a modification of irregular repetition slotted ALOHA (IRSA) involving intermediate decoding and early transmission termination by some nodes, upon their decoding success. This is meant to avoid unnecessary transmissions, thereby reducing energy consumption. We expect this to be particularly useful at low loads, where most transmissions can be avoided as they do not often result in a collision and are therefore redundant. To validate this proposal, we observe that most of the literature related to IRSA considers an asymptotic heavily loaded regime; thus, we also present a model of energy consumption and success probability for frames of limited length and low offered loads. Thanks to our analysis, also confirmed by simulation, we are able to show that the proposed technique is able to reduce IRSA energy consumption by minimizing transmissions, while preserving performance gains over standard ALOHA. For example, we are able to get a 33% energy saving at offered loads around 10% without affecting throughput.

  • Contention-Based Early Data Transmission for 3GPP IoT Over Non-Terrestrial Networks

    by Andrea Munari, Stefano Cioni, Harikumar Krishnamurthy, Bharat Shrestha, Ayan Sengupta, Estefanía Recayte, Alberto Rico Alvariño

    3GPP Release-19 is introducing an interesting new feature for narrowband Internet of Things (NB-IoT) and enhanced machine type communications (eMTC). The solution, currently enabled only for IoT over non-terrestrial networks, consists in the use of contention-based early data transmission (CB-EDT) procedures to allow a UE send data over shared uplink resources following a random access approach. In contrast to the existing EDT solution, the new feature does not rely on the exchange of a random access preamble and random access response, but rather foresees the UE directly transmitting its message, thus saving overhead and reducing delay. Moreover, CB-EDT implements diversity slotted ALOHA (DSA), so that a UE transmits multiple replicas of its packet over the available uplink resources, aiming to enhance the probability of having at least one of its messages not colllided. Further improvements are attained by using a multicast acknowledgment (message 4), addressing multiple UEs and saving downlink capacity. This article provides a description of the new feature, starting from its basic working principles and adding up details that cover the current 3GPP implementation status. The potential of the solution is demonstrated and discussed by means of numerical results, also identifying potential developments in future releases.


  • On the Error Floor Evaluation of NOMA-Irregular Repetition Slotted ALOHA

    by Estefanía Recayte

    In this work, we provide a simple yet tight analytical approximation of the packet loss rate in the error floor region for a non-orthogonal multiple access (NOMA)-based irregular repetition slotted ALOHA (IRSA) scheme. Considering an Internet of Things (IoT) scenario, users randomly select both the number of replicas based on a designed degree distribution and the transmission power from predetermined levels, while successive interference cancellation (SIC) is performed at the receiver. Our derived packet loss rate expression in the finite length regime is promptly evaluated. Its accuracy is validated through Monte-Carlo simulations, demonstrating a strong match across channel loads, including those beyond the low load regime.


  • Edge Caching: On the Performance of Placement and Delivery Coding Schemes

    by Estefanía Recayte

    We study the performance of caching schemes based on two different coding techniques. A heterogeneous network is assumed, in which cache-aided relays are connected through a backhaul link to a master node while no connection exits between users and the master node. The first caching scheme considers to fill the cache with encoded content while the second scheme considers to encode the content during the delivery phase. We compare the schemes by characterizing the average transmission load when users ask for downloading content to the network. We provide an approximation of the expression of the average load which allows a fast evaluation of the network behavior for each scheme considered. We further assume a constraint on the capacity of the backhaul link and derive the expression of the outage probability, i.e. the probability that the system is not able to serve the entire set of users demands. Finally, we examine and discuss how the derived analysis of a two relays scenario can be scaled to study the performance of a network with a generic number of relays.


  • Caching in heterogeneous satellite networks with fountain codes

    by Estefanía Recayte, Francisco Lázaro, Gianluigi Liva

    Summary: In this paper, we investigate the performance of caching schemes based on fountain codes in a heterogeneous satellite network. We consider multiple cache‐aided hubs, which are connected to a geostationary satellite through backhaul links. With the aim of reducing the average number of transmissions over the satellite backhaul link, we propose the use of a caching scheme based on fountain codes. We derive a simple analytical expression of the average backhaul transmission rate and provide a tight upper bound on it. Furthermore, we show how the performance of the fountain code‐based caching scheme is similar to that of a caching scheme based on maximum distance separable codes.


  • Open Access

    Caching in Heterogeneous Networks With Per-File Rate Constraints

    by Estefania Recayte, Giuseppe Cocco

    We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the users and (ii) a noncooperative approach in which each transmitter serves only the respective user. We formulate the cache allocation optimization problem so that the overall system power consumption is minimized while the use of the link from the master node to the end users is spared whenever possible. We also propose a lowcomplexity optimization algorithm and show that it outperforms the considered benchmark strategies. Our results indicate that significant gains both in terms of power saving and sparing of master node’s resources can be obtained when full cooperation between the transmitters is in place. Interestingly, we show that in some cases storing the most popular files is not the best solution from a power efficiency perspective.


  • Open Access

    Caching at the Edge with LT codes

    by Estefanía Recayte, Francisco Lázaro, Gianluigi Liva

    We study the performance of caching schemes based on LT under peeling (iterative) decoding algorithm. We assume that users ask for downloading content to multiple cache-aided transmitters. Transmitters are connected through a backhaul link to a master node while no direct link exists between users and the master node. Each content is fragmented and coded with LT code. Cache placement at each transmitter is optimized such that transmissions over the backhaul link is minimized. We derive a closed form expression for the calculation of the backhaul transmission rate. We compare the performance of a caching scheme based on LT with respect to a caching scheme based on maximum distance separable codes. Finally, we show that caching with \acl{LT} codes behave as good as caching with maximum distance separable codes.

  • Open Access

    Caching in Heterogeneous Networks with Per-File Rate Constraints

    by Estefanía Recayte, Giuseppe Cocco

    We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a coordinator node serve two users. We analyse and compare two approaches: (i) a cooperative approach where each of the transmitters might serve either of the users and (ii) a non-cooperative approach in which each transmitter serves only the respective user. We formulate the cache allocation optimization problem so that the overall system power consumption is minimized while the use of the link from the master node to the end users is spared whenever possible. We also propose a low-complexity optimization algorithm and show that it outperforms the considered benchmark strategies. Our results indicate that significant gains both in terms of power saving and sparing of master node's resources can be obtained when full cooperation between the transmitters is in place. Interestingly, we show that in some cases storing the most popular files is not the best solution from a power efficiency perspective.