Jesús Gómez Vilardebó

Dr. Jesús Gómez Vilardebó


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
22 March 2016 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Open access
MGMaria Gregori
Maria Gregori
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
JMJavier Matamoros
Javier Matamoros
DGDeniz Gunduz
Deniz Gunduz
The fifth generation wireless networks must provide fast and reliable connectivity while coping with the ongoing traffic growth. It is of paramount importance that the required resources, such as energy and bandwidth, do not scale with traffic. While the aggregate network traffic is growing at an unprecedented rate, users tend to request the same popular contents at different time instants. Therefore, caching the most popular contents at the network edge is a promising solution to reduce the traffic and the energy consumption over the backhaul links. In this paper, two scenarios are considered, where caching is performed either at a small base station, or directly at the user terminals, which communicate using Device-to-Device (D2D) communications. In both scenarios, joint design of the transmission and caching policies is studied when the user demands are known in advance. This joint design offers two different caching gains, namely, the pre-downloading and local caching gains. It is shown that the finite cache capacity limits the attainable gains, and creates an inherent tradeoff between the two types of gains. In this context, a continuous time optimization problem is formulated to determine the optimal transmission and caching policies that minimize a generic cost function, such as energy, bandwidth, or throughput. The jointly optimal solution is obtained by demonstrating that caching files at a constant rate is optimal, which allows reformulation of the problem as a finite-dimensional convex program. The numerical results show that the proposed joint transmission and caching policy dramatically reduces the total cost, which is particularised to the total energy consumption at the Macro Base Station (MBS), as well as to the total economical cost for the service provider, when users demand economical incentives for delivering content to other users over the D2D links.

30 September 2010 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KLKonstantinos P. Liolis
Konstantinos P. Liolis
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
ECEnrico Casini
Enrico Casini
APAna I. Perez-Neira
Ana I. Perez-Neira
This Letter addresses the statistical modeling of dual-polarized MIMO-LMS fading channels. In the absence of accurate experimental results, a statistical model for the characterization of MIMO-LMS channels is proposed based on consolidation of available experimental results for SISO-LMS and MIMO wireless channels as well as on their extrapolation to the MIMO-LMS case of interest. Moreover, a step-by-step methodology for the simulation and time-series generation of the proposed MIMO-LMS channel model is provided, which is useful for the design and performance assessment of MIMO-LMS transmission systems. The proposed model incorporates the effects of all relevant critical channel aspects in a flexible and fully-parameterized way.

20 January 2017 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
OTOnur Tan
Onur Tan
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
Demand-side energy management (EM) is studied from a privacy-cost trade-off perspective, considering time-of-use pricing and the presence of an energy storage unit. Privacy is measured as the variation of the power withdrawn from the grid from a fixed target value. Assuming non-causal knowledge of the household's aggregate power demand profile and the electricity prices at the energy management unit (EMU), the privacy-cost trade-off is formulated as a convex optimization problem, and a low-complexity backward water-filling algorithm is proposed to compute the optimal EM policy. The problem is studied also in the online setting assuming that the power demand profile is known to the EMU only causally, and the optimal EM policy is obtained numerically through dynamic programming (DP). Due to the high computational cost of DP, a low-complexity heuristic EM policy with a performance close to the optimal online solution is also proposed, exploiting the water-filling algorithm obtained in the offline setting. As an alternative, information theoretic leakage rate is also evaluated, and shown to follow a similar trend as the load variance, which supports the validity of the load variance as a measure of privacy. Finally, the privacy-cost trade-off, and the impact of the size of the storage unit on this trade-off are studied through numerical simulations using real smart meter data in both the offline and online settings.

27 October 2014 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
Smart meters (SMs) measure and report users' energy consumption to the utility provider (UP) in almost real-time, providing a much more detailed depiction of the consumer's energy consumption compared to their analog counterparts. This increased rate of information flow to the UP, together with its many potential benefits, raise important concerns regarding user privacy. This paper investigates, from an information theoretic perspective, the privacy that can be achieved in a multiuser SM system in the presence of an alternative energy source (AES). To measure privacy, we use the mutual information rate between the users' real energy consumption profile and SM readings that are available to the UP. The objective is to characterize the privacy-power function, defined as the minimal information leakage rate that can be obtained with an average power-limited AES. We characterize the privacy-power function in a single letter form when the users' energy demands are assumed to be independent and identically distributed over time. Moreover, for binary and exponentially distributed energy demands, we provide an explicit characterization of the privacy-power function. For any discrete energy demands, we demonstrate that the privacy-power function can always be efficiently evaluated numerically. Finally, for continuous energy demands, we derive an explicit lower bound on the privacy-power function, which is tight for exponentially distributed loads.

8 January 2010 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
APAna I. Perez-Neira
Ana I. Perez-Neira
MNMontse Najar
Montse Najar
This paper addresses the energy efficiency analysis of the relay channel under additive white Gaussian noise. We consider the rate bounds given by decode and forward and the cut set bound and assume that resources are optimally allocated to maximize the spectral efficiency according to the channel information and the sum network energy. The low energy analysis tools are used to compute the maximum rate per energy (RPE) and the slope of the spectral efficiency as a function of the energy per bit. Using these metrics, the energy efficiency benefit of several capabilities at terminals is investigated. Specifically, we take into account: (i) the phase synchronization between transmitters, (ii) the full duplex capability at the relay and (iii) the channel access via superposition.

20 August 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
BHBurak Hasircioglu
Burak Hasircioglu
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
Coded computing is an effective technique to mitigate “stragglers” in large-scale and distributed matrix multiplication. In particular, univariate polynomial codes have been shown to be effective in straggler mitigation by making the computation time depend only on the fastest workers. However, these schemes completely ignore the work done by the straggling workers resulting in a waste of computational resources. To reduce the amount of work left unfinished at workers, one can further decompose the matrix multiplication task into smaller sub-tasks, and assign multiple sub-tasks to each worker, possibly heterogeneously, to better fit their particular storage and computation capacities. In this work, we propose a novel family of bivariate polynomial codes to efficiently exploit the work carried out by straggling workers. We show that bivariate polynomial codes bring significant advantages in terms of upload communication costs and storage efficiency, measured in terms of the number of sub-tasks that can be computed per worker. We propose two bivariate polynomial coding schemes. The first one exploits the fact that bivariate interpolation is always possible on a rectangular grid of evaluation points. We obtain such points at the cost of adding some redundant computations. For the second scheme, we relax the decoding constraints and require decodability for almost all choices of the evaluation points. We present interpolation sets satisfying such decodability conditions for certain storage configurations of workers. Our numerical results show that bivariate polynomial coding considerably reduces the average computation time of distributed matrix multiplication. We believe this work opens up a new class of previously unexplored coding schemes for efficient coded distributed computation.