Broadcasting in undirected ad hoc radio networks

@article{Kowalski2005BroadcastingIU,
  title={Broadcasting in undirected ad hoc radio networks},
  author={Dariusz R. Kowalski and Andrzej Pelc},
  journal={Distributed Computing},
  year={2005},
  volume={18},
  pages={43-57}
}
We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time $ {\user1{\mathcal{O}}}{\left( {D\;\log {\left( {n/D} \right)} + \log ^{2} n} \right)} $ in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. [1] and Kushilevitz and Mansour [16… CONTINUE READING
Highly Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 208 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 127 extracted citations

208 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 208 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…