Searcharxiv⌕ Search

arXiv subjects

Masoumeh Nasiri-Kenari

Publications and source records attributed to Masoumeh Nasiri-Kenari.

At least 19 recordsLinked to original sources

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↗

UAV-Mounted IRS (UMI) in the Presence of Hovering Fluctuations: 3D Pattern Characterization and Performance Analysis

This paper investigates unmanned aerial vehicle (UAV)-mounted intelligent reflecting surfaces (IRS) to leverage the benefits of this technology for future communication networks, such as 6G. Key advantages include enhanced spectral and energy efficiency, expanded network coverage, and flexible deployment. One of the main challenges in employing UAV-mounted IRS (UMI) technology is the random fluctuations of hovering UAVs. Focusing on this challenge, this paper explores the capabilities of UMI with passive/active elements affected by UAV fluctuations in both horizontal and vertical angles, considering the three-dimensional (3D) radiation pattern of the IRS. The relationship between UAV fluctuations and IRS pattern is investigated by taking into account the random angular vibrations of UAVs. A tractable and closed-form distribution function for the IRS pattern is derived, using linear approximation and by dividing it into several sectors. In addition, closed-form expressions for outage probability (OP) are obtained using central limit theorem (CLT) and Gamma approximation. The theoretical expressions are validated through Monte Carlo simulations. The findings indicate that the random fluctuations of hovering UAVs have a notable impact on the performance of UMI systems. To avoid link interruptions due to UAV instability, IRS should utilize fewer elements, even though this leads to a decrease in directivity. As a result, unlike terrestrial IRS, incorporating more elements into aerial IRS systems does not necessarily improve performance due to the fluctuations in UAV. Numerical results show that the OP can be minimized by selecting the optimal number of IRS elements and using active elements.

eess.SP↗

RIS-Assisted D2D Communication in the Presence of Interference: Outage Performance Analysis and DNN-Based Prediction

This paper analyses the performance of reconfigurable intelligent surface (RIS)-assisted device-to-device (D2D) communication systems, focusing on addressing co-channel interference, a prevalent issue due to the frequency reuse of sidelink in the underlay in-band D2D communications. In contrast to previous studies that either neglect interference or consider it only at the user, our research investigates a performance analysis in terms of outage probability (OP) for RIS-assisted D2D communication systems considering the presence of interference at both the user and the RIS. More specifically, we introduce a novel integral-form expression for an exact analysis of OP. Additionally, we present a new accurate approximation expression for OP, using the gamma distributions to approximate the fading of both desired and interference links, thereby yielding a closed-form expression. Nevertheless, both derived expressions, i.e., the exact integral-form and the approximate closed-form, contain special functions, such as Meijer's G-function and the parabolic cylinder function, which complicate real-time OP analysis. To circumvent this, we employ a deep neural network (DNN) for real-time OP prediction, trained with data generated by the exact expression. Moreover, we present a tight upper bound that quantifies the impact of interference on achievable diversity order and coding gain. We validate the derived expressions through Monte Carlo simulations. Our analysis reveals that while interference does not affect the system's diversity order, it significantly degrades the performance by reducing the coding gain. The results further demonstrate that increasing the number of RIS's reflecting elements is an effective strategy to mitigate the adverse effects of the interference on the system performance.

eess.SP↗

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↗

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↗

A Novel Stochastic Model for IRS-Assisted Communication Systems Based on the Sum-Product of Nakagami-$m$ Random Variables

This paper presents exact formulas for the probability distribution function (PDF) and moment generating function (MGF) of the sum-product of statistically independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ random variables (RVs) in terms of Meijer's G-function. Additionally, exact series representations are also derived for the sum of double-Nakagami RVs, providing useful insights on the trade-off between accuracy and computational cost. Simple asymptotic analytical expressions are provided to gain further insight into the derived formula, and the achievable diversity order is obtained. The suggested statistical properties are proved to be a highly useful tool for modeling parallel cascaded Nakagami-$m$ fading channels. The application of these new results is illustrated by deriving exact expressions and simple tight upper bounds for the outage probability (OP) and average symbol error rate (ASER) of several binary and multilevel modulation signals in intelligent reflecting surfaces (IRSs)-assisted communication systems operating over Nakagami-$m$ fading channels. It is demonstrated that the new asymptotic expression is highly accurate and can be extended to encompass a wider range of scenarios. To validate the theoretical frameworks and formulations, Monte-Carlo simulation results are presented. Additionally, supplementary simulations are provided to compare the derived results with two common types of approximations available in the literature, namely the central limit theorem (CLT) and gamma distribution.

cs.IT↗

Abnormality Detection and Localization Schemes using Molecular Communication Systems: A Survey

Abnormality detection and localization (ADL) have been studied widely in wireless sensor networks (WSNs) literature, where the sensors use electromagnetic waves for communication. Molecular communication (MC) has been introduced as an alternative approach for ADL in particular areas such as healthcare, being able to tackle the shortcomings of conventional WSNs, such as invasiveness, bio-incompatibility, and high energy consumption. In this paper, we introduce a general framework for MC-based ADL, which consists of multiple tiers for sensing the abnormality and communication between different agents, including the sensors, the fusion center (FC), the gateway (GW), and the external node (e.g., a local cloud), and describe each tier and the agents in this framework. We classify and explain different abnormality recognition methods, the functional units of the sensors, and different sensor features. Further, we describe different types of interfaces required for converting the internal and external signals at the FC and GW. Moreover, we present a unified channel model for the sensing and communication links. We categorize the MC-based abnormality detection schemes based on the sensor mobility, cooperative detection, and cooperative sensing/activation. We also classify the localization approaches based on the sensor mobility and propulsion mechanisms and present a general framework for the externally-controllable localization systems. Finally, we present some challenges and future research directions to realize and develop MC-based systems for ADL. The important challenges in the MC-based systems lie in four main directions as implementation, system design, modeling, and methods, which need considerable attention from multidisciplinary perspectives.

cs.IT↗

IRS-User Association in IRS-Aided MISO Wireless Networks: Convex Optimization and Machine Learning Approaches

This paper concentrates on the problem of associating an intelligent reflecting surface (IRS) to multiple users in a multiple-input single-output (MISO) downlink wireless communication network. The main objective of the paper is to maximize the sum-rate of all users by solving the joint optimization problem of the IRS-user association, IRS reflection, and BS beamforming, formulated as a non-convex mixed-integer optimization problem. The variable separation and relaxation are used to transform the problem into three convex sub-problems, which are alternatively solved through the convex optimization (CO) method. The major drawback of the proposed CO-based algorithm is high computational complexity. Thus, we make use of machine learning (ML) to tackle this problem. To this end, first, we convert the optimization problem into a regression problem. Then, we solve it with feed-forward neural networks (FNNs), trained by CO-based generated data. Simulation results show that the proposed ML-based algorithm has a performance equivalent to the CO-based algorithm, but with less computation complexity due to its offline training procedure.

eess.SP↗

Interference Alignment Using Reaction in Molecular Interference Channels

Co-channel interference (CCI) is a performance limiting factor in molecular communication (MC) systems with shared medium. Interference alignment (IA) is a promising scheme to mitigate CCI in traditional communication systems. Due to the signal-dependent noise in MC systems, the traditional IA schemes are less useful in MC systems. In this paper, we propose a novel IA scheme in molecular interference channels (IFCs), based on the choice of releasing/sampling times. To cancel the aligned interference signals and reduce the signal dependent noise, we use molecular reaction in the proposed IA scheme. We obtain the feasible region for the releasing/sampling times in the proposed scheme. Further, we investigate the error performance of the proposed scheme. Our results show that the proposed IA scheme using reaction improves the performance significantly.\blfootnote{This work was supported in part by the Iran National Science Foundation (INSF) Research Grant on Nano-Network Communications and in part by the Research Center of Sharif University of Technology.

cs.IT↗

Joint Sensing, Communication and Localization of a Silent Abnormality Using Molecular Diffusion

In this paper, we propose a molecular communication system to localize an abnormality in a diffusion based medium. We consider a general setup to perform joint sensing, communication and localization. This setup consists of three types of devices, each for a different task: mobile sensors for navigation and molecule releasing (for communication), fusion centers (FC)s for sampling, amplifying and forwarding the signal, and a gateway for making decision or exchanging the information with an external device. The sensors move randomly in the environment to reach the abnormality. We consider both collaborative and non-collaborative sensors that simultaneously release their molecules to the FCs when the number of activated sensors or the moving time reach a certain threshold, respectively. The FCs amplify the received signal and forward it to the gateway for decision making using either an ideal or a noisy communication channel. A practical application of the proposed model is drug delivery in a tissue of human body, in order to guide the nanomachine bound drug to the exact location. The decision rules and probabilities of error are obtained for two considered sensors types in both ideal and noisy communication channels.

eess.SP↗

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↗

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↗

An Analytical Model for Molecular Communication over a Non-linear Reaction-Diffusion Medium

One of the main challenges in diffusion-based molecular communication is dealing with the non-linearity of reaction-diffusion chemical equations. While numerical methods can be used to solve these equations, a change in the input signals or the parameters of the medium requires one to redo the simulations. This makes it difficult to design modulation schemes and practically impossible to prove the optimality of a given transmission strategy. In this paper, we provide an analytical technique for modeling the non-linearity of chemical reaction equations based on the perturbation method. The perturbation method expresses the solution in terms of an infinite power series. An approximate solution can be found by keeping the leading terms of the power series. The approximate solution is shown to track the true solution if either the simulation time interval or the reaction rate is sufficiently small. Approximate solutions for long time intervals are also discussed. An illustrative example is given. For this example, it is shown that when the reaction rate (or the total time interval) is low, instead of using a continuous release waveform, it is optimal for the transmitters to release molecules at two time instances.

cs.IT↗

Theoretical Concept Study of Cooperative Abnormality Detection and Localization in Fluidic-Medium Molecular Communication

In this paper, we propose a theoretical framework for cooperative abnormality detection and localization systems by exploiting molecular communication setup. The system consists of mobile sensors in a fluidic medium, which are injected into the medium to search the environment for abnormality. Some fusion centers (FC) are placed at specific locations in the medium, which absorb all sensors arrived at their locations, and by observing its state, each FC decides on the abnormality existence and/or its location. To reduce the effects of sensor imperfection, we propose a scheme where the sensors release some molecules (i.e., markers) into the medium after they sense an abnormality. If the goal is abnormality detection, the released molecules are used to cooperatively activate other sensors. If the goal is abnormality localization, the released molecules are used by the FCs to determine the location. In our model, both sensors' imperfection and markers background noise are taken into account. For the detection phase, we consider two sensor types based on their activation strategy by markers. To make the analysis tractable, we assume some ideal assumptions for the sensors' model. We investigate the related binary hypothesis testing problem and obtain the probabilities of false alarm and miss-detection. It is shown that using sensors with the ability of cooperatively activating each other can significantly improve the detection performance in terms of probability of error. For the localization phase, we consider two types of FCs based on their capability in reading sensors' storage levels. We study their performance and obtain the optimal and sub-optimal decision schemes and also the probability of localization error for both perfect and imperfect sensing regimes.

eess.SP↗

On Molecular Flow Velocity Meters

Flow velocity is an important characteristic of the fluidic mediums. In this paper, we introduce a molecular based flow velocity meter consisting of a molecule releasing node and a receiver that counts these molecules. We consider both flow velocity detection and estimation problems, which are employed in different applications. For the flow velocity detection, we obtain the maximum a posteriori (MAP) decision rule. To analyze the performance of the proposed flow velocity detector, we obtain the error probability, its Gaussian approximation and Chernoff information (CI) upper bound, and investigate the optimum and sub-optimum sampling times accordingly. We show that, for binary hypothesis, the sub-optimum sampling times using CI upper bound are the same. Further, the sub-optimum sampling times are close to the optimum sampling times. For the flow velocity estimation, we obtain the MAP and minimum mean square error (MMSE) estimators. We consider the mean square error (MSE) to investigate the error performance of the flow velocity estimators and obtain the Bayesian Cramer-Rao (BCR) and expected Cramer-Rao (ECR) lower bounds. Further, we obtain the optimum sampling times for each estimator. It is seen that the optimum sampling times for each estimator are nearly the same. The proposed flow velocity meter can be used to design a new modulation technique in molecular communication (MC), where information is encoded in the flow velocity of the medium instead of the concentration, type, or release time of the molecules. The setup and performance analysis of the proposed flow velocity detector and estimator for molecular communication system need further investigation.

cs.IT↗

Towards High Data-Rate Diffusive Molecular Communications: Performance Enhancement Strategies

Diffusive molecular communications (DiMC) have recently gained attention as a candidate for nano- to micro- and macro-scale communications due to its simplicity and energy efficiency. As signal propagation is solely enabled by Brownian motion mechanics, DiMC faces severe inter-symbol interference (ISI), which limits reliable and high data-rate communications. Herein, recent literature on DiMC performance enhancement strategies is surveyed; key research directions are identified. Signaling design and associated design constraints are presented. Classical and novel transceiver designs are reviewed with an emphasis on methods for ISI mitigation and performance-complexity tradeoffs. Key parameter estimation strategies such as synchronization and channel estimation are considered in conjunction with asynchronous and timing error robust receiver methods. Finally, source and channel coding in the context of DiMC is presented.

cs.IT↗

On the Capacity of the Joint Time and Concentration Modulation for Molecular Communications

Most diffusion based molecular channels suffer from low information capacity due to the structure of the diffusion environment. To address this issue, this paper studies the capacity of the diffusion based molecular communication by exploiting both time and concentration level of the released molecules for information transfer. The transmitter releases molecules in one of the sub-intervals with a level of concentration both determined by input data, hereby applying joint time and concentration (JTAC) modulation. The observation time, at the receiver, which is equal to symbol period, is divided to some sub-intervals, not necessarily equal to the number of sub-intervals in the transmitter, and the number of received molecules in each sub-interval is counted. We propose three practical schemes, depending on how the receiver uses the number of molecules counted in the sub-intervals and find the lower bound on capacity in each case. Moreover, the symmetric Kullback-Liebler (KL) divergence metric is used to obtain a computable upper bound on the JTAC channel capacity. Finally, the Blahut-Arimoto algorithm is used to compute the capacity numerically, and to determine how tight the derived bounds are. Our numerical results indicate that our bounds are tight especially in environments with high diffusion coefficient. The improvements compared to the conventional concentration based modulation and timing based modulation are also demonstrated.

cs.IT↗

Adaptive Release Duration Modulation for Limited Molecule Production and Storage

The nature of molecular transmitter imposes some limitations on the molecule production process and its storage. As the molecules act the role of the information carriers, the limitations affect the transmission process and the system performance considerably. In this paper, we focus on the transmitter's limitations, in particular, the limited molecule production rate and the finite storage capacity. We consider a time-slotted communication where the transmitter opens its outlets and releases the stored molecules for a specific time duration to send bit "1" and remains silent to send bit "0". By changing the release duration, we propose an adaptive release duration modulation. The objective is to find the optimal transmission release duration to minimize the probability of error. We characterize the properties of the optimal release duration and use it to derive upper and lower bounds on the system performance. We see that the proposed modulation scheme improves the performance.

cs.IT↗