document: Fast broadcasting and gossiping in radio networks We establish an O -LRB- n log/sup 2 / n -RRB- upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology . This nearly matches the known lower bound of Omega -LRB- n log n -RRB- . The fastest previously known algorithm for this problem works in time O -LRB- n/sup 3/2 / -RRB- . Using our broadcasting algorithm , we develop an O -LRB- n/sup 3/2 / log/sup 2 / n -RRB- algorithm for gossiping in the same network model
doc_bio_tags: B I O B O B I O O O O O O O O O O O B I O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O