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

Stephen Diadamo

dblp:232/4085 · also Stephen DiAdamo · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0001-5758-9563ORCID · corroborated

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

Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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.

Theoretical computer science
1 paper
Quantum computing and quantum information · 87% Mathematical optimization · 13%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum network
entanglement distribution
0.912025
A Sigmoid-Based Optimization Approach for Multi-UAV-Aided IRS-Assisted Quantum Entanglement Distribution in FSO Networks · IEEE Trans. Commun. 2025
Quantum computing and quantum information
quantum communication
0.912025
A Sigmoid-Based Optimization Approach for Multi-UAV-Aided IRS-Assisted Quantum Entanglement Distribution in FSO Networks · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks › aerial networks
UAV networks
0.312025
A Sigmoid-Based Optimization Approach for Multi-UAV-Aided IRS-Assisted Quantum Entanglement Distribution in FSO Networks · IEEE Trans. Commun. 2025
Mathematical optimization › nonconvex optimization
successive convex approximation
0.312025
A Sigmoid-Based Optimization Approach for Multi-UAV-Aided IRS-Assisted Quantum Entanglement Distribution in FSO Networks · IEEE Trans. Commun. 2025

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

successive convex approximation · 1.7sigmoid-based approximation · 1.7
YearPublicationVenuePosition
2025 A Sigmoid-Based Optimization Approach for Multi-UAV-Aided IRS-Assisted Quantum Entanglement Distribution in FSO Networks
abstract
Quantum networks connect devices to facilitate the transmission of quantum bits (qubits), harnessing quantum mechanics for groundbreaking telecommunications applications. The quantum state exchange rely on quantum entangled particles which have to be sent from a Quantum Base Station (QBS) to Quantum Nodes (QNs) through an optical channel. Free Space Optical (FSO) links promise flexibility and cost advantages over the classical fiber-based infrastructure. However, the absence of Line of Sight (LoS) between the QBS and QNs may completely disrupt the communication. Therefore, this work focuses on an Intelligent Reflective Surface (IRS)-assisted Unmanned Aerial Vehicle (UAV)-aided FSO quantum network. An optimization problem is formulated to fairly maximize qubit reception at QNs by optimizing UAV hovering locations, constrained by fidelity and link-per-IRS limits. The intractability of the original problem is first tackled with a sigmoid-based approximations, subsequently split into three sub-problems, sequentially solved applying the Successive Convex Approximation (SCA) technique. Numerical results (i) validate the approximation accuracy, and (ii) demonstrates the effectiveness of the proposal against three baseline approaches, showing an order of magnitude increase in terms of fairness.
Giovanni Iacovelli, Francesco Vista, Stephen Diadamo, Symeon Chatzinotas
IEEE Trans. Commun.3
2020 Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer Perspective
abstract
Quantum entanglement as a resource has repeatedly proven to add performance improvements for various tasks in communication and computing, yet no current application justifies a wide spread use of entanglement as a commodity in communication systems. In this work, we detail how the addition of an entanglement storage system at the end-points of a communication link integrated seamlessly into the current Internet can benefit that link's capabilities via a protocol implementing the simple rule to "create entanglement when idle", and use entanglement-assisted communication whenever possible. The benefits are shown with regards to throughput, packet drop-rate, and average packet processing time. The modelling is done in an information-theoretic style, thereby establishing a connecting from information-theoretic capacities to statistical network analysis.
Janis Noetzel, Stephen Diadamo
ISIT2