scientific article; zbMATH DE number 5764877

MaRDI QIDQ3579470zbMATH OpenFDO

Authors Gianluca De Marco

Publication date 6 August 2010

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05)

Cited in

(17)

• Information gathering in ad-hoc radio networks with tree topology
• Information gathering in ad-hoc radio networks
• 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
• Contention resolution in a non-synchronized multiple access channel
• Upper and lower bounds for deterministic broadcast in powerline communication networks
• On Efficient Gossiping in Radio Networks
• Fast Radio Broadcasting with Advice
• Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
• Leader election in ad hoc radio networks: a keen ear helps
• Energy-efficient broadcasting in ad hoc wireless networks
• Efficient k-shot broadcasting in radio networks
• Dynamic multiple-message broadcast: bounding throughput in the affectance model
• Scalable wake-up of multi-channel single-hop radio networks
• Fast radio broadcasting with advice
• Acknowledged broadcasting in ad hoc radio networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579470)