Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.68511MaRDI QIDQ5315391

Qin Xin, Tomasz Radzik, Leszek Gąsieniec

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

Related Items

Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks, Information dissemination in unknown radio networks with large labels, Modeling radio networks, Acknowledged broadcasting and gossiping in ad hoc radio networks, Many-to-many communication in radio networks, Information gathering in ad-hoc radio networks with tree topology, Faster information gathering in ad-hoc radio tree networks, Information gathering in ad-hoc radio networks, Deterministic protocols in the SINR model without knowledge of coordinates, Fast message dissemination in random geometric networks, Time efficient centralized gossiping in radio networks, Round complexity of leader election and gossiping in bidirectional radio networks, Deterministic M2M multicast in radio networks, Efficient Distributed Communication in Ad-Hoc Radio Networks, Time-Efficient Broadcast in Radio Networks, On Efficient Gossiping in Radio Networks