scientific article; zbMATH DE number 1947418

MaRDI QIDQ4411387zbMATH OpenFDO

Authors Aris Pagourtzis, Igor Potapov, Leszek Gąsieniec

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610512.htm

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Deterministic communication in radio networks with large labels
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2119728
• Information dissemination in unknown radio networks with large labels
• On adaptive deterministic gossiping in ad hoc radio networks.

Cited in

(11)

• Faster deterministic communication in radio networks
• Many-to-many communication in radio networks
• Time efficient centralized gossiping in radio networks
• Round complexity of leader election and gossiping in bidirectional radio networks
• Radio communication in random graphs
• Lower and upper bounds for deterministic convergecast with labeling schemes
• On Efficient Gossiping in Radio Networks
• Lower Bounds for Clear Transmissions in Radio Networks
• Information dissemination in unknown radio networks with large labels
• Algorithm Theory - SWAT 2004
• Deterministic communication in radio networks with large labels

This page was built for publication:

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