On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks

DOI10.1007/978-3-642-45346-5_18zbMath1397.68021OpenAlexW1431987959MaRDI QIDQ1796441

Avery Miller

Publication date: 17 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-642-45346-5_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

This page was built for publication: On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks