Skip to content

Author

Sinem Coleri

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

Reliability- and Connectivity-Constrained Age-of-Information Optimization for UAV Swarm IoT Data Collection

Uncrewed aerial vehicle~(UAV) swarms provide a flexible platform for Internet of Things~(IoT) data collection by gathering delay-sensitive measurements from distributed sensor clusters and relaying them to a fusion center. Such missions require jointly optimizing data freshness, short-packet communication reliability, and swarm connectivity, yet existing approaches typically prioritize freshness while neglecting its impact on connectivity. This paper proposes a topology-coupled urgency~(TCU) scheduler that weights each cluster's age-of-information urgency by a per-UAV connectivity score, prioritizing stale clusters while dispersing collection across the swarm, with connectivity preserved by an explicit probabilistic constraint. For each time slot, the resulting problem is a mixed-integer nonconvex program, which we solve by successive convex approximation: the binary assignments are relaxed and the finite-blocklength rate, the inter-UAV link reliability and the connectivity score are linearized together into one convex subproblem, so their coupling is retained rather than broken across alternating blocks. Integer assignments are recovered by Hungarian matching and verified against the original nonconvex constraints, while a deficit queue sustains long-run coverage without explicit long-horizon planning. Simulation results demonstrate that the proposed scheduler consistently achieves the lowest mean AoI and the highest service reliability among all baselines, reducing service failures by approximately $3.5\times$ under nominal operating conditions. Under increasingly stringent connectivity and coverage requirements, it maintains full service while competing methods either become infeasible or fragment the swarm, demonstrating the effectiveness of jointly optimizing data freshness, communication reliability, and connectivity.

Milad Bafarassat, Sinem Coleri · 0 citations
2026

End-to-End Learning With EM-Aware Differentiable-Ready Discrete-Phase RIS for MIMO–OFDM via Ray Tracing

Most learning-based reconfigurable intelligent surface (RIS) designs assume continuous control or closed-box channel models, limiting physically grounded end-to-end (E2E) training and neglecting practical 1-bit hardware constraints. We propose a physics-informed framework for RIS-assisted MIMO–OFDM that embeds an optics-consistent differentiable ray tracer (RT) in the training loop while enforcing strictly discrete, frequency-flat 1-bit RIS control. Per-element phases are injected into the RT transition matrices and optimized via quantization-aware training (QAT) with hard binary forward passes and surrogate gradients. The same pipeline also acts as a digital twin, enabling controlled sweeps over geometry, materials, and LOS/NLOS conditions to generate labeled CIRs and OFDM channels. We study both staged optimization, where the RIS is trained using a pilot-energy proxy before neural receiver (NRX) training, and full E2E co-optimization by backpropagating NRX loss through the RT–RIS block. In the E2E setting, the RIS is optimized as part of the electromagnetic propagation environment using receiver-side bitwise loss, rather than through an intermediate channel-quality proxy alone. We compare QAT with straight-through estimator (STE), straight-through Gumbel-softmax (ST-Gumbel), and a non-differentiable dueling Double-DQN (DDQN) bit-flip baseline. In fully NLOS scenarios, QAT-optimized RIS with NRX consistently outperforms least-squares and unoptimized baselines, and narrows the gap to a perfect-CSI reference under both staged and E2E training.

Ahmad Faisal Mirza, Messaoud Ahmed Ouameur, Mohammed Ali Dou et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.