Maximum Finding in the Symmetric Radio Networks with Collision Detection

DOI10.1007/978-3-540-69507-3_23MaRDI QIDQ5448779zbMATH OpenOpenAlexFDO

Authors František Galčík, Gabriel Semanišin

Publication date 7 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69507-3_23

Mathematics Subject Classification ID

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

Recommendations

• Deterministic broadcasting in ad hoc radio networks
• scientific article; zbMATH DE number 1445388
• Broadcasting algorithms in radio networks with unknown topology
• A simple, efficient algorithm for maximum finding on rings
• Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

Cited in

(4)

• Maximal selection in tandem networks with symmetric hearing range
• Finding the size and the diameter of a radio network using short labels
• scientific article; zbMATH DE number 3956780 (Why is no real title available?)
• scientific article; zbMATH DE number 2089983 (Why is no real title available?)

This page was built for publication: Maximum Finding in the Symmetric Radio Networks with Collision Detection

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