Faster information gathering in ad-hoc radio tree networks

DOI10.1007/s00453-017-0336-yzbMath1390.68056arXiv1512.02179OpenAlexW2746550359MaRDI QIDQ1742375

Kevin P. Costello, Marek Chrobak

Publication date: 11 April 2018

Published in: Algorithmica, LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (2)

Information gathering in ad-hoc radio networks with tree topology ⋮ Information gathering in ad-hoc radio networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded contention resolution in multiple-access channels
• Families of finite sets in which no set is covered by the union of \(r\) others
• A lower bound for radio broadcast
• A Strahler bijection between Dyck paths and planar trees
• Distributed broadcast in radio networks of unknown topology.
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Information Gathering in Ad-Hoc Radio Networks with Tree Topology
• Efficient Distributed Communication in Ad-Hoc Radio Networks
• Fast broadcasting and gossiping in radio networks
• On Efficient Gossiping in Radio Networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• A randomized algorithm for gossiping in radio networks
• Faster Deterministic Communication in Radio Networks
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Lower bounds for the broadcast problem in mobile radio networks
• On selection problem in radio networks
• Algorithm Theory - SWAT 2004
• Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
• Faster Centralized Communication in Radio Networks
• Broadcasting algorithms in radio networks with unknown topology
• Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel

This page was built for publication: Faster information gathering in ad-hoc radio tree networks