Broadcasting algorithms in radio networks with unknown topology

From MaRDI portal
Publication:5491455

DOI10.1016/j.jalgor.2004.08.001zbMath1100.68649OpenAlexW2160268831MaRDI QIDQ5491455

Artur Czumaj, Wojciech Rytter

Publication date: 5 October 2006

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.08.001




Related Items (60)

Distributed bare-bones communication in wireless networksFast message dissemination in random geometric networksSade: competitive MAC under adversarial SINRBroadcasting in UDG radio networks with missing and inaccurate informationBroadcasting in UDG radio networks with unknown topologyCentralized asynchronous broadcast in radio networksTime efficient centralized gossiping in radio networksUpper and lower bounds for deterministic broadcast in powerline communication networksFeasibility and complexity of broadcasting with random transmission failuresCompetitive throughput in multi-hop wireless networks despite adaptive jammingAcknowledged broadcasting and gossiping in ad hoc radio networksInformation dissemination in unknown radio networks with large labelsInformation gathering in ad-hoc radio networks with tree topologyNear-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionFast Radio Broadcasting with AdviceRandomized broadcast in radio networks with collision detectionDynamic multiple-message broadcast: bounding throughput in the affectance modelUnnamed ItemUniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationScalable wake-up of multi-channel single-hop radio networksDeterministic Communication in Radio NetworksOptimal deterministic broadcasting in known topology radio networksActivating anonymous ad hoc radio networksBroadcasting in geometric radio networksOn Radio Broadcasting in Random Geometric GraphsBroadcasting in UDG Radio Networks with Missing and Inaccurate InformationEfficient Broadcasting in Known Geometric Radio Networks with Non-uniform RangesRound complexity of leader election and gossiping in bidirectional radio networksFast Message Dissemination in Random Geometric Ad-Hoc Radio NetworksSensor Network Gossiping or How to Break the Broadcast Lower BoundThe abstract MAC layerCoordination Problems in Ad Hoc Radio NetworksInformation Spreading in Dynamic Networks: An Analytical ApproachFaster information gathering in ad-hoc radio tree networksEnergy-efficient broadcasting in ad hoc wireless networksTree exploration with adviceFast radio broadcasting with adviceTrade-offs between the size of advice and broadcasting time in treesCommunication algorithms with adviceImproved lower bound for deterministic broadcasting in radio networksAcknowledged broadcasting in ad hoc radio networksDeterministic M2M multicast in radio networksOn simple back-off in unreliable radio networksGlobal synchronization and consensus using beeps in a fault-prone multiple access channelBroadcasting in undirected ad hoc radio networksInformation gathering in ad-hoc radio networksBounded-contention coding for the additive network modelBroadcasting in dynamic radio networksOn the effect of the deployment setting on broadcasting in Euclidean radio networksFault-Tolerant Consensus with an Abstract MAC Layer.Many-to-many communication in radio networksLeveraging Channel Diversity to Gain Efficiency and Robustness for Wireless BroadcastEnergy efficient randomised communication in unknown AdHoc networksDeterministic recurrent communication in restricted sensor networksTime-Efficient Broadcast in Radio NetworksOn Efficient Gossiping in Radio NetworksLeader election in multi-hop radio networksFast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access ChannelExactly optimal deterministic radio broadcasting with collision detectionNoisy beeping networks




This page was built for publication: Broadcasting algorithms in radio networks with unknown topology