arXiv subjects

Ali H. Abdollahi Bafghi

Publications and source records attributed to Ali H. Abdollahi Bafghi.

7 recordsLinked to original sources

arXiv2026

Degrees of Freedom of Cache-Aided Interference Channels Assisted by Active Intelligent Reflecting Surfaces

This paper studies cache-aided wireless networks in the presence of active intelligent reflecting surfaces (IRSs) from an information-theoretic perspective. Specifically, we investigate interference management in a cache-aided wireless network assisted by an active IRS to enhance the achievable degrees of freedom (DoF). To this end, we jointly design the content placement, delivery phase, and IRS coefficients, and propose a one-shot achievability scheme. Our scheme exploits transmitters' cooperation, cache contents, interference alignment, and IRS capabilities, based on the network parameters. We derive the achievable one-shot sum-DoF for different cache sizes, network configurations, and numbers of IRS elements, followed by an upper bound. Our results highlight the potential of deploying an IRS in cache-aided wireless communication systems. In particular, they underscore the enhancement of achievable DoF for various parameter regimes, especially when cache sizes are inadequate. Notably, we show that access to an IRS with a sufficient number of elements enables the achievement of the maximum possible DoF for various parameter regimes of interest.

cs.IT↗

arXiv2024

MISO Wireless Localization in The Presence of Reconfigurable Intelligent Surface

Reconfigurable Intelligent Surface (RIS) plays a pivotal role in the sixth generation networks to enhance communication rate and localization accuracy. In this letter, we propose a positioning algorithm in a RIS-assisted environment, where the Base Station (BS) is multi-antenna, and the Mobile Station (MS) is single-antenna. We show that our method can achieve a high-precision positioning if the line-of-sight (LOS) is obstructed and three RISs are available. We send several known signals to the receiver in different time slots and change the phase shifters of the RISs simultaneously in a proper way, and we propose a technique to eliminate the destructive effect of the angle-of-departure (AoD) in order to determine the distances between each RISs and the MS. The accuracy of the proposed algorithm is better than the algorithms which do not estimate the AoD, shown in the numerical result section.

eess.SP↗

arXiv2024

Stochastic Analysis of Homogeneous Wireless Networks Assisted by Intelligent Reflecting Surfaces

In this paper, we study the impact of the existence of multiple IRSs in a homogeneous wireless network, in which all BSs, users (U), and IRSs are spatially distributed by an independent homogeneous PPP, with density $λ_{\rm BS}\rm{[BS/m^2]}$, $λ_{\rm U}\rm{[U/m^2]}$, and $λ_{\rm IRS}\rm{[IRS/m^2]}$, respectively. We utilize a uniformly random serving strategy for BS and IRS to create stochastic symmetry in the network. We analyze the performance of the network and study the effect of the existence of the IRS on the network performance. To this end, for a typical user in the system, we derive analytical upper and lower bounds on the expectation of the power (second statistical moment) of the desired signal and the interference caused by BSs and other users. After that, we obtain analytical upper bounds on the decay of the probability of the power of the desired signal and the interference for the typical user (which results in a lower bound for the cumulative distribution function (CDF)). Moreover, we derive upper bounds on the decay of the probability of the capacity of one typical user, which results in a lower bound for the outage probability. In the numerical results, we observe that the numerical calculation of the power of the desired signal and the interference is near the derived lower bounds and we show that the increment of the parameter ${(λ_{\rm IRS})}$ causes increment in powers of both the desired and interference signals. We also observe that the increment of the parameter ${λ_{\rm IRS}}$ causes the decrement of outage probability.

cs.IT↗

arXiv2021

Degrees of Freedom of the $K$-User Interference Channel in the Presence of Intelligent Reflecting Surfaces

In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$-user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider four types of IRSs, namely 1) active IRSs, which are able to amplify, attenuate, and add a phase shift to the received signal, 2) passive IRSs, which are able to attenuate and add a phase shift to the received signal, 3) passive lossless IRSs, which are only able to add a phase shift to the received signal, and 4) $\varepsilon$-relaxed passive lossless IRSs, which are able to scale the received signal by a number between $1-\varepsilon$ and $1$ in addition to adding a phase shift. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$-user interference channel in the presence of an active IRS and prove that the maximum value $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. Then, we introduce probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$-user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large. For the DoF analysis of passive lossless IRSs, first, we approximate it by the $\varepsilon$-relaxed passive lossless IRS and introduce a probabilistic lower bound for the corresponding sum DoF. We prove that this bound asymptotically tends to $K$. In addition, we define a relaxed type of DoF called $ρ$-limited DoF. We introduce a lower bound for the $ρ$-limited sum DoF of the passive lossless IRS-assisted $K$-user interference channel and prove that this lower bound asymptotically also tends to $K$.

cs.IT↗

arXiv2021

Achievable Rates for Binary Two-hop Channel with Energy Harvesting Relay and Finite Battery

We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory. We model the energy saved in the battery as the channel state with the challenge that the receiver does not know the channel state. We propose two different achievable schemes, the first one is based on state-dependent superposition coding and the second one is based on the equivalent timing channel approach. Both of our schemes are based on block Markov coding and backward decoding techniques. Due to these two approaches, we find achievable rates with a single-letter expression for the model.

cs.IT↗

arXiv2021

On Achievable Degrees of Freedom for the Frequency-Selective K-User Interference Channel in the Presence of an Instantaneous Relay

In this paper, we study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on the IR antennas' cooperation ability. First, we assume that the IR receive and transmit antennas can coordinate with each other, where the transmitted signal of each transmit antenna can depend on the received signals of all receive antennas, and we derive an achievable DoF for this model. In our interference alignment scheme, we divide receivers into two groups, called clean and dirty receivers. We design our scheme such that a part of the message of clean receivers can be demultiplexed at the IR. Thus, the IR can use these message streams for interference cancelation at the clean receivers. Next, we consider an IR, whose antennas do not have coordination with each other, where the transmitted signal of each transmit antenna only depends on the received signal of its corresponding receive antenna, and we derive an achievable DoF for it. We show that the achievable DoF decreases considerably compared with the coordinated case. In both of these models, our schemes achieve the maximum K DoFs, if the number of transmit and receive antennas is more than a finite threshold.

cs.IT↗

arXiv2017

Joint Transfer of Energy and Information in a Two-hop Relay Channel

We study the problem of joint information and energy transfer in a two-hop channel with a Radio frequency (RF) energy harvesting relay. We consider a finite battery size at the relay and deterministic energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory. We model the energy saved in battery as channel state with the challenge that the receiver does not know the channel state. First, we consider the problem without any channel noise and derive an achievable rate. Next, we extend the results to the case with an independent and identically distributed noise in the second hop (the relay-receiver link).

cs.IT↗