Broadcasting on [0,L]

DOI10.1016/0166-218X(94)90193-7MaRDI QIDQ1339897zbMATH OpenFDO

Authors Krishnamurthi Ravishankar, Suresh Singh

Publication date 5 March 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(94)90193-7

zbMATH Keywords

broadcastingtransmitter

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Circuits, networks (94C99)

Recommendations

• Asymptotically optimal gossiping in radio networks
• The impact of information on broadcasting time in linear radio networks.
• Line broadcasting in cycles
• scientific article; zbMATH DE number 1405786

Cites work

• A survey of gossiping and broadcasting in communication networks
• Central limit theorem for time to broadcast in radio networks
• Further gossip problems
• scientific article; zbMATH DE number 3692664 (Why is no real title available?)
• Information Dissemination in Trees

Cited in

(11)

• Power consumption in packet radio networks
• The impact of information on broadcasting time in linear radio networks.
• Asymptotically optimal gossiping in radio networks
• Broadcasting in UDG radio networks with missing and inaccurate information
• Broadcasting in UDG radio networks with unknown topology
• Time-efficient broadcast in radio networks
• Information spreading by mobile particles on a line
• Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
• Broadcast transmission to prioritizing receivers
• Broadcasting in geometric radio networks
• Fast radio broadcasting with advice

This page was built for publication: Broadcasting on \([0,L]\)

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