Single round simulation on radio networks

DOI10.1016/0196-6774(92)90015-5MaRDI QIDQ3990605zbMATH OpenOpenAlexFDO

Authors Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1016/0196-6774(92)90015-5

zbMATH Keywords

message-passing modelpacket radio networksSingle Round SimulationSRS schedule length

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A lower bound for radio broadcast
• Acknowledged broadcasting and gossiping in ad hoc radio networks
• scientific article; zbMATH DE number 2090695
• Multiple Communication in Multihop Radio Networks
• Modeling radio networks

Cited in

(9)

• Probabilistic methods in coloring and decomposition problems
• Power consumption in packet radio networks
• Time-efficient broadcast in radio networks
• A parallel algorithmic version of the local lemma
• A randomized algorithm for gossiping in radio networks
• scientific article; zbMATH DE number 2090695 (Why is no real title available?)
• The abstract MAC layer
• A robust multi-priority topology-independent transmission schedule for packet radio networks
• Deterministic recurrent communication in restricted sensor networks

This page was built for publication: Single round simulation on radio networks

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