Multiple Communication in Multihop Radio Networks

DOI10.1137/0222055MaRDI QIDQ3137713zbMATH OpenOpenAlexFDO

Authors Amos Israeli, Alon Itai, Reuven Bar-Yehuda

Publication date 10 October 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222055

zbMATH Keywords

average case analysisbroadcastdistributed algorithmspoint-to-point routingprotocolsqueueing theoryradio networkrandomized algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Queueing theory (aspects of probability theory) (60K25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1857647
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Distributed multi-broadcast in unknown radio networks
• Faster deterministic communication in radio networks
• Time-efficient randomized multiple-message broadcast in radio networks

Cited in

(32)

• Many-to-many communication in radio networks
• Energy efficient randomised communication in unknown AdHoc networks
• Methods and problems of communication in usual networks
• Distributed broadcast in radio networks of unknown topology.
• Faster broadcasting in unknown radio networks
• Information gathering in ad-hoc radio networks with tree topology
• The impact of information on broadcasting time in linear radio networks.
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• Noisy beeping networks
• Bounded information dissemination in multi-channel wireless networks
• Optimal gossiping in geometric radio networks in the presence of dynamical faults
• Efficient distributed communication in ad-hoc radio networks
• Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channels
• Time-efficient broadcast in radio networks
• The Distributed Wireless Gathering Problem
• scientific article; zbMATH DE number 5657666 (Why is no real title available?)
• Single round simulation on radio networks
• Communication and energy efficient routing protocols for single-hop radio networks
• Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
• scientific article; zbMATH DE number 1857647 (Why is no real title available?)
• Deterministic broadcasting in ad hoc radio networks
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• Coordination Problems in Ad Hoc Radio Networks
• Transmitting once to elect a leader on wireless networks
• Dynamic multiple-message broadcast: bounding throughput in the affectance model
• The distributed wireless gathering problem
• Bounded-contention coding for the additive network model
• Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
• Quasi-optimal energy-efficient leader election algorithms in radio networks
• Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model
• Randomized broadcast in radio networks with collision detection
• An approximation algorithm for the wireless gathering problem

This page was built for publication: Multiple Communication in Multihop Radio Networks

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