2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/158204We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.Distributed, Parallel, and Cluster ComputingComputational ComplexityC.2.2; F.2.2On ad hoc routing with guaranteed deliverytext