Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marziyeh Soltani

dblp:292/2717 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0007-9582-5126ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Cellular and mobile networks · 56% Physical-layer communications · 44%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
integrated sensing and communication
0.912025
On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network · IEEE Trans. Commun. 2025
Cellular and mobile networks › integrated sensing and communication
MIMO ISAC
0.912025
On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network · IEEE Trans. Commun. 2025
Physical-layer communications
outage probability and ergodic rate
0.912025
On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network · IEEE Trans. Commun. 2025
Physical-layer communications
beamforming
0.312025
On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network · IEEE Trans. Commun. 2025
Physical-layer communications › wireless communication systems
dual-function radar-communication
0.312025
On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

pareto optimization · 0.9cramér-rao lower bound · 0.9central limit theorem · 0.9
YearPublicationVenuePosition
2026 Massive MIMO-NOMA Systems Secrecy in the Presence of Active Eavesdroppers
abstract
Non-orthogonal multiple access (NOMA) and massive multiple-input multiple-output (MIMO) systems are highly efficient. Massive MIMO systems are inherently resistant to passive attackers (eavesdroppers), thanks to transmissions directed to the users. However, active attackers can transmit a combination of legitimate user pilot signals during the channel estimation phase. This way, they can mislead the base station (BS) to rotate the transmission in their direction and allow them to eavesdrop during the downlink data transmission phase. In this paper, we analyze this vulnerability with two-user pairing strategies and investigate how physical layer security can mitigate such attacks and ensure secure (confidential) communication. We derive the secrecy outage probability (SOP) and a lower bound on the ergodic secrecy capacity using stochastic geometry tools when the number of antennas in the BSs tends to infinity (i.e., massive MIMO BS). The numerical and simulation results show that one of the strategies performs better and has a higher ergodic secrecy rate (ESR) and lower SOP. Moreover, we show that using NOMA instead of orthogonal multiple access (OMA) improves system performance significantly.
Marziyeh Soltani, Mahtab Mirmohseni, Panagiotis Papadimitratos
IEEE Trans. Wirel. Commun.1
2025 On Stochastic Fundamental Limits in a Downlink Integrated Sensing and Communication Network
abstract
This paper aims to analyze the stochastic performance of a multiple input multiple output (MIMO) integrated sensing and communication (ISAC) system in a downlink scenario, where a base station (BS) transmits a dual-functional radar-communication (DFRC) signal matrix, serving the purpose of transmitting communication data to the user while simultaneously sensing the angular location of a target. The channel between the BS and the user is modeled as a random channel with Rayleigh fading distribution, and the azimuth angle of the target is assumed to follow a uniform distribution. Due to the randomness inherent in the network, the challenge is to consider suitable performance metrics for this randomness. To address this issue, for users, we employ the user’s rate outage probability (OP) and ergodic rate, while for target, we propose using the OP of the Cramér-Rao lower bound (CRB) for the angle of arrival and the ergodic CRB. We have obtained the expressions of these metrics for scenarios where the BS employs two different beamforming methods. Our approach to deriving these metrics involves computing the probability density function (PDF) of the signal-to-noise ratio for users and the CRB for the target. We have demonstrated that the central limit theorem provides a viable approach for deriving these PDFs. In our numerical results, we demonstrate the trade-off between sensing and communication (S & C) by characterizing the region of S & C metrics and by obtaining the Pareto optimal boundary points, confirmed with simulations.
Marziyeh Soltani, Mahtab Mirmohseni, Rahim Tafazolli
IEEE Trans. Commun.1
2021 Massive MIMO-NOMA Systems Secrecy in the Presence of Active Eavesdroppers
abstract
Non-orthogonal multiple access (NOMA) and massive multiple-input multiple-output (MIMO) systems are highly efficient. Massive MIMO systems are inherently resistant to passive attackers (eavesdroppers), thanks to transmissions directed to the desired users. However, active attackers can transmit a combination of legitimate user pilot signals during the channel estimation phase. This way they can mislead the base station (BS) to rotate the transmission in their direction, and allow them to eavesdrop during the downlink data transmission phase. In this paper, we analyse this vulnerability in an improved system model and stronger adversary assumptions, and investigate how physical layer security can mitigate such attacks and ensure secure (confidential) communication. We derive the secrecy outage probability (SOP) and a lower bound on the ergodic secrecy capacity, using stochastic geometry tools when the number of antennas in the BSs tends to infinity. We adapt the result to evaluate the secrecy performance in massive orthogonal multiple access (OMA). We find that appropriate power allocation allows NOMA to outperform OMA in terms of ergodic secrecy rate and SOP.
Marziyeh Soltani, Mahtab Mirmohseni, Panagiotis Papadimitratos
ICCCN1