Publications

We propose and evaluate an iterative localization mechanism employing Bayesian inference to estimate the position of a target using received signal strength measurements. The probability density functions of the target's coordinates are estimated through a Bayesian network. Herein, we consider an iterative procedure whereby our predictor (posterior distribution) is updated in a sequential order whenever new measurements are made available. The performance of the mechanism is assessed in terms of the respective root mean square error and kernel density estimation of the target coordinates. Our numerical results showed the proposed iterative mechanism achieves increasingly better estimation of the target node position each updating round of the Bayesian network with new input measurements.

Managing inter-cell interference is among the major challenges in a wireless network, more so when strict quality of service needs to be guaranteed such as in ultra-reliable low latency communications (URLLC) applications. This study introduces a novel intelligent interference management framework for a local 6G network that allocates resources based on interference prediction. The proposed algorithm involves an advanced signal pre-processing technique known as empirical mode decomposition followed by prediction of each decomposed component using the sequence-to-one transformer algorithm. The predicted interference power is then used to estimate future signal-to-interference plus noise ratio, and subsequently allocate resources to guarantee the high reliability required by URLLC applications. Finally, an interference cancellation scheme is explored based on the predicted interference signal with the transformer model. The proposed sequence-to-one transformer model exhibits its robustness for interference prediction. The proposed scheme is numerically evaluated against two baseline algorithms, and is found that the root mean squared error is reduced by up to 55% over a baseline scheme.

In this paper, we study the problem of joint inband backhauling and interference mitigation in 5G heterogeneous networks (HetNets) in which a massive multiple-input multipleoutput (MIMO) macro cell base station equipped with a large number of antennas, overlaid with self-backhauled small cells is assumed. This problem is cast as a network utility maximization subject to wireless backhaul constraints. Due to the non-tractability of the problem, we first resort to random matrix theory to get a closed-form expression of the achievable rate and transmit power in the asymptotic regime, i.e., as the number of antennas and users grows large. Subsequently, leveraging the framework of stochastic optimization, the problem is decoupled into dynamic scheduling of macro cell users and backhaul provisioning of small cells as a function of interference and backhaul links. Via simulations, we evaluate the performance gains of our proposed framework under different network architectures and low/high frequency bands. Our proposed HetNet method achieves the achievable average UE throughput of 1.7 Gbps as well as ensures 1 Gbps cell-edge UE throughput when serving 200 UEs per km2 at 28 GHz with 1 GHz bandwidth. In ultra-dense network, the UE throughput at 28 GHz achieves 62x gain as compared to 2.4 GHz.

This paper presents a framework to evaluate the probability that a decision error event occurs in wireless sensor networks, including sensing and communication errors. We consider a scenario where sensors need to identify whether a given event has occurred based on its periodic, noisy, observations of a given signal. Such information about the signal needs to be sent to a fusion center that decides about the actual state at that specific observation time. The communication links -- single- or multi-hop -- are modeled as binary symmetric channels, which may have different error probabilities. The decision at the fusion center is based on OR, AND, K-OUT-OF-N and MAJORITY Boolean operations on the received signals associated to individual sensor observations. We derive closed-form equations for the average decision error probability as a function of the system parameters (e.g. number of sensors and hops) and the input signal characterization. Our analyses show the best decision rule is closely related to the frequency that the observed events occur and the number of sensors. In our numerical example, we show that the AND rule outperforms MAJORITY if such an event is rare and there is only a handful number of sensors. Conversely, if there is a large number of sensors or more evenly distributed event occurrences, the MAJORITY is the best choice. We further show that, while the error probability using the MAJORITY rule asymptotically goes to 0 with increasing number of sensors, it is also more susceptible to higher channel error probabilities.

This work proposes an analytical framework to study how relay selection strategies perform in half- and full-duplex deployments by combining renewal theory and stochastic geometry. Specifically, we assume that the network nodes -- operating in either half- or full-duplex mode -- are scattered according to a two-dimensional homogeneous Poisson point process to compute the relay selection cost by using a semi-Markov process. Our results show: ($i$) fixed relay outperforms the reactive option in either cases, ($ii$) the performance of both reactive and fixed relay strategies depends on the self-interference attenuation in full-duplex scenarios, evincing when they outperform the half-duplex option, and ($iii$) the reactive relay selection suffers from selecting relays at hop basis, while the fixed relay selection benefits most from the full-duplex communication.

Interference mitigation is a major design challenge in wireless systems,especially in the context of ultra-reliable low-latency communication (URLLC) services. Conventional average-based interference management schemes are not suitable for URLLC as they do not accurately capture the tail information of the interference distribution. This letter proposes a novel interference prediction algorithm that considers the entire interference distribution instead of only the mean. The key idea is to model the interference variation as a discrete state space discrete-time Markov chain. The state transition probability matrix is then used to estimate the state evolution in time, and allocate radio resources accordingly. The proposed scheme is found to meet the target reliability requirements in a low-latency single-shot transmission system considering realistic system assumptions, while requiring only ~25% more resources than the optimum case with perfect interference knowledge.

Reliable energy supply remains a crucial challenge in the Internet of Things (IoT). Although relying on batteries is cost-effective for a few devices, it is neither a scalable nor a sustainable charging solution as the network grows massive. Besides, current energy-saving technologies alone cannot cope, for instance, with the vision of zero-energy devices and the deploy-and-forget paradigm which can unlock a myriad of new use cases. In this context, sustainable radio frequency wireless energy transfer emerges as an attractive solution for efficiently charging the next generation of ultra low power IoT devices. Herein, we highlight that sustainable charging is broader than conventional green charging, as it focuses on balancing economy prosperity and social equity in addition to environmental health. We discuss the economic implications of powering energy transmitters with ambient energy sources, and reveal insights on their optimal deployment. Moreover, we overview different methods for modeling the energy arrival process of ambient energy sources and discuss their application in different use cases. We highlight the potential of integrating sustainable WET with energy harvesting from nearby transmitters and discuss enhancements in energy receiver design. We also illustrate the role of different technologies in enabling sustainable WET and exemplify various use cases. Besides, we reveal insights into low-complexity architectures designed at the energy transmitters. We highlight relevant research challenges and candidate solutions.

This paper studies how dense deployments of small cells with full duplex technology perform under various network configurations and channel conditions. The resulting interference at the receiver of interest combines both its intrinsic self-interference and components from co-channel base stations

In order to reduce the latency of data delivery, one of techniques is to cache the popular contents at the base stations (BSs) i.e. edge caching. However, the technique of caching at edge can only reduce the backhaul delay, other techniques such as BS densification will also need to be considered to reduce the fronthaul delay. In this work, we study the trade-offs between BS densification and cache size under delay constraint at a typical user (UE). For this, we use the downlink SINR coverage probability and throughput obtained based on stochastic geometrical analysis. The network deployment of BS and cache storage is introduced as a minimization problem of the product of the BS intensity and cache size which we refer to the product of \tit{cache intensity}' under probabilistic delay constraint. We examine the cases when (i) either BS intensity or the cache size is held fixed, and (ii) when both BS intensity and the cache size are vary. For the case when both BS intensity and the cache size are variable, the problem become nonconvex and we convert into a geometric programing which we solve it analytically.

A deep learning (DL)-based power control algorithm that solves the max-min user fairness problem in a cell-free massive multiple-input multiple-output (MIMO) system is proposed. Max-min rate optimization problem in a cell-free massive MIMO uplink setup is formulated, where user power allocations are optimized in order to maximize the minimum user rate. Instead of modeling the problem using mathematical optimization theory, and solving it with iterative algorithms, our proposed solution approach is using DL. Specifically, we model a deep neural network (DNN) and train it in an unsupervised manner to learn the optimum user power allocations which maximize the minimum user rate. This novel unsupervised learning-based approach does not require optimal power allocations to be known during model training as in previously used supervised learning techniques, hence it has a simpler and flexible model training stage. Numerical results show that the proposed DNN achieves a performance-complexity trade-off with around 400 times faster implementation and comparable performance to the optimization-based algorithm. An online learning stage is also introduced, which results in near-optimal performance with 4-6 times faster processing.

Radio frequency (RF) wireless power transfer (WPT) is a promising technology for charging the Internet of Things. Practical RF-WPT systems usually require energy beamforming (EB), which can compensate for the severe propagation loss by directing beams toward the devices. The EB flexibility depends on the transmitter architecture, existing a trade-off between cost/complexity and degrees of freedom. Thus, simpler architectures such as dynamic metasurface antennas (DMAs) are gaining attention. Herein, we consider an RF-WPT system with a transmit DMA for meeting the energy harvesting requirements of multiple devices and formulate an optimization problem for the minimum-power design. First, we provide a mathematical model to capture the frequency-dependant signal propagation effect in the DMA architecture. Next, we propose a solution based on semi-definite programming and alternating optimization. Results show that a DMA-based structure can outperform a fully-digital implementation and that the required transmit power decreases with the antenna array size, while it increases and remains almost constant with frequency in DMA and FD, respectively.

With increasing popularity of high speed trains and traffic forecast for future cellular networks, the need to provide improved data rates using higher frequency bands (HFBs) for train passengers is becoming crucial. In this paper, we modify the OFDM frame structure for HST, taking into account the increasing sensitivity to speed at HFBs. A lower bound on the SNR/SINR for a given rate for reliable communication was derived considering the physical layer parameters from the OFDM frame. We also analyze different pathloss models in the context of examining the required gain needed to achieve the same performance as with microwave bands. Finally, we present a time-based analogue beamforming selection approach for HST. We observed that, irrespective of the pathloss models used, the required gains are within the same range. For the same SNR/SINR at different frequency bands, the achievable data rate varies with respect to the frequency bands. Our results show the potential of the use of HFBs. However, due to the increased sensitivity of some channel parameters, a maximum frequency band of 38 GHz is suggested. Evaluation of our proposed beamforming scheme indicates a close performance to the optimal SVD scheme with a marginal rate gap of less than 2 b/s/Hz.

No abstract is provided for this article.