Asymptotically optimal gossiping in radio networks

DOI10.1016/0166-218X(93)E0176-YzbMath0831.90055OpenAlexW2091467056MaRDI QIDQ1897368

Krishnamurthi Ravishankar, Suresh B. Singh

Publication date: 18 February 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0176-y

zbMATH Keywords

gossiping

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Quick gossiping without duplicate transmissions
• Further gossip problems
• A class of solutions to the gossip problem. I
• Broadcasting on \([0,L\)]
• Central Limit Theorem for Time to Broadcast in Radio Networks
• Delay analysis of interval-searching contention resolution algorithms
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Gossiping without Duplicate Transmissions

This page was built for publication: Asymptotically optimal gossiping in radio networks