Communication Primitives in Cognitive Radio Networks

DOI10.1145/3087801.3087805zbMath1380.68020arXiv1703.06130OpenAlexW2602029586MaRDI QIDQ5368937

Fabian Kuhn, Chaodong Zheng

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.06130

zbMATH Keywords

broadcastcognitive radio networksneighbor discovery

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Approximate Neighbor Counting in Radio Networks

This page was built for publication: Communication Primitives in Cognitive Radio Networks