Arash Pourdamghani

Arash Pourdamghani

Auto-generated profile, based on publicly available information

Arash Pourdamghani

TU Berlin

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 May 2022 in Proceedings of the IEEE
Verified
Journal Article
Closed access
CLChristos Liaskos
Christos Liaskos
LMLefteris Mamatas
Lefteris Mamatas
APArash Pourdamghani
Arash Pourdamghani
ATAgeliki Tsioliaridou
Ageliki Tsioliaridou
SISotiris Ioannidis
Sotiris Ioannidis
IAIan F. Akyildiz
Ian F. Akyildiz
Programmable wireless environments (PWEs) utilize internetworked intelligent metasurfaces to transform wireless propagation into a software-controlled resource. In this article, the interplay is explored between the user devices, the metasurfaces, and the PWE control system from the theory to the end-to-end implementation. This article first discusses the metasurface hardware and software, covering the complete workflow from the user device initialization to its final service via the PWE. Furthermore, to be compatible with the 5G and 6G wireless systems, the software-defined networking (SDN) paradigm is extended to achieve scalable internetworking and central control in PWE deployments with multiple metasurfaces and multihop communication. Subsequently, the set of SDN foundations is exploited in order to abstract the physics behind PWEs and a theoretical framework is established to describe and manipulate them in an algorithmic form. This can lead to smart radio environments that are readily accessible from various engineering disciplines, facilitating their integration into existing networks, wireless systems, and applications. This article is concluded by outlining strategies for the optimal placement of metasurfaces within a PWE-controlled space, open challenges in PWE security, specialized SDN integration issues, and theoretical problems toward the graph-driven modeling of PWEs.

7 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
MHMonika Henzinger
Monika Henzinger
APAmi Paz
Ami Paz
APArash Pourdamghani
Arash Pourdamghani
SSStefan Schmid
Stefan Schmid
Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiting the workload's temporal structure. However, operating networks adaptively is algorithmically challenging, as meeting networks' stringent dependability requirements relies on maintaining basic consistency and performance properties, such as loop freedom and congestion minimization, even during the update process. This paper leverages an augmentation-speed tradeoff to significantly speed up consistent network updates. We show that allowing for a small and short (hence practically tolerable, e.g., using buffering) oversubscription of links allows us to solve many network update instances much faster, as well as to reduce computational complexities (i.e., the running times of the algorithms). We first explore this tradeoff formally, revealing the computational complexity of scheduling updates. We then present and analyze algorithms that maintain logical and performance properties during the update. Using an extensive simulation study, we find that the tradeoff is even more favorable in practice than our analytical bounds suggest. In particular, we find that by allowing just 10% augmentation, update times reduce by more than 32% on average, across a spectrum of real-world networks.

18 November 2025
Verified
Book Chapter
Closed access
PDF file
QJQingyun Ji
Qingyun Ji
DMDarya Melnyk
Darya Melnyk
APArash Pourdamghani
Arash Pourdamghani
SSStefan Schmid
Stefan Schmid

1 January 2026 in IEEE Communications Standards Magazine
Verified
Journal Article
Closed access
PQPeng Qian
Peng Qian
APArash Pourdamghani
Arash Pourdamghani
ABAndreas Blenk
Andreas Blenk
SSStefan Schmid
Stefan Schmid
VKVivek Kulkarni
Vivek Kulkarni
NZNoa Zilberman
Noa Zilberman

17 June 2024
Verified
Conference Paper
Open access
AFAleksander Figiel
Aleksander Figiel
DMDarya Melnyk
Darya Melnyk
ANAndré Nichterlein
André Nichterlein
APArash Pourdamghani
Arash Pourdamghani
SSStefan Schmid
Stefan Schmid
Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication networks. In this variant, we differentiate between a given physical network and the measured communication demands between the nodes. Our goal is to minimize the weighted average shortest path length via matching augmentation, where the weights correspond to the communication frequency of any pair of nodes. We use results from demand-aware network design to provide a constant-factor approximation algorithm for adding a matching on a ring in case only a few nodes in the network cause almost all the communication. Since the problem is NP-hard, we design and evaluate a series of heuristics that can deal with arbitrary graphs as underlying network structures. We evaluate our heuristics on general real-world communication patterns and show that already with simple and efficient heuristics we are able to reach near-optimal quality.

8 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
FGFabian Göttsch
Fabian Göttsch
MFMax Franke
Max Franke
APArash Pourdamghani
Arash Pourdamghani
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
SSStefan Schmid
Stefan Schmid
We investigate the physical layer (PHY) spectral efficiency and fronthaul network load of a scalable user-centric cell-free massive MIMO system. Each user-centric cluster processor responsible for cluster-level signal processing is located at one of multiple decentralized units (DUs). Thus, the radio units in the cluster must exchange data with the corresponding DU over the fronthaul. Because the fronthaul links have limited capacity, this data must be quantized before it is sent over the fronthaul. We consider a routed fronthaul network, where the cluster processor placement and fronthaul traffic routing are jointly optimized with a mixed-integer linear program. For different numbers of users in the network, we investigate the effect of fronthaul quantization rates, a system parameter computed based on rate-distortion theory. Our results show that with optimized quantization rates, the fronthaul load is quite stable for a wide range of user loads without significant PHY performance loss. This demonstrates that the cell-free massive MIMO PHY and fronthaul network are resilient to varying user densities.