scientific article
From MaRDI portal
Publication:3579470
zbMath1192.94018MaRDI QIDQ3579470
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05)
Related Items (18)
Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Fast Radio Broadcasting with Advice ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Fast radio broadcasting with advice ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Information gathering in ad-hoc radio networks ⋮ On Efficient Gossiping in Radio Networks
This page was built for publication:
