Egemen Erbayat

h-index4
2papers
34citations

2 Papers

1.5NIJul 13
A benchmarking framework for PON-based fronthaul network design

Egemen Erbayat, Gustavo B. Figueiredo, Shih-Chun Lin et al.

As mobile networks transition toward 5G and 6G RAN architectures, Passive Optical Networks (PONs) offer a critical solution for cost-effective fronthaul transport. However, the lack of standardized evaluation models in current literature makes an objective comparison of diverse optimization strategies difficult. This paper addresses this gap by proposing a unified benchmarking framework that standardizes cost catalogs and deployment scenarios. We formulate the network design problem using Integer Linear Programming (ILP) to establish optimality bounds and evaluate three scalable heuristic strategies: a Genetic Algorithm, K-Means Clustering (KMC+), and a graph-based Randomized Successive Splitter Assignment (RSSA+) algorithm. Simulation results show that a time-limited ILP remains a strong reference point, even when optimality is not reached. Despite being rarely used in prior fronthaul planning studies, it consistently yields solutions superior to those produced by standard heuristic methods. Among scalable approaches, RSSA+ reliably attains near-ILP performance while ensuring feasibility across all evaluated scenarios, which underscores the importance of advanced, constraint-aware algorithmic designs over simpler heuristics.

9.1ITApr 15
Age of Information Optimization in Distributed Sensor Networks with Half-Duplex Channels

Peng Zou, Ali Maatouk, Egemen Erbayat et al.

Motivated by cooperative distributed networks in which users dynamically alternate between transmit and receive modes under half-duplex constraints, this paper studies the Age of Information (AoI) in a distributed multi-user network using an ALOHA-based protocol. We derive closed-form expressions for the average AoI and formulate an optimization problem over transmission probabilities. After proving the convexity of the problem, we leverage the derived optimality conditions to characterize optimal policies for general network graphs, obtain closed-form solutions for $d$-regular topologies, and derive tractable optimality conditions for star topologies. Numerical results confirm that the proposed mechanism can effectively and adaptively determine user-specific optimal transmission probabilities across varying network topologies. These findings contribute to the design of adaptive and efficient distributed networks with enhanced information freshness.