Time-efficient broadcasting in radio networks: A review

D Peleg - … Conference on Distributed Computing and Internet …, 2007 - Springer
Broadcasting is a basic network communication task, where a message initially held by a
source node has to be disseminated to all other nodes in the network. Fast algorithms for …

[HTML][HTML] Broadcasting in geometric radio networks

A Dessmark, A Pelc - Journal of Discrete Algorithms, 2007 - Elsevier
We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes
know only a limited part of the network. Nodes of a GRN are situated in the plane and each …

Fast radio broadcasting with advice

D Ilcinkas, DR Kowalski, A Pelc - Theoretical Computer Science, 2010 - Elsevier
We study deterministic broadcasting in radio networks in the recently introduced framework
of network algorithms with advice. We concentrate on the problem of trade-offs between the …

Timing-driven routing for symmetrical array-based FPGAs

YW Chang, K Zhu, DF Wong - ACM Transactions on Design Automation …, 2000 - dl.acm.org
In this paper we present a timing-driven router for symmetrical array-based FPGAs. The
routing resources in the FPGAs consist of segments of various lengths. Researchers have …

Trade-offs between the size of advice and broadcasting time in trees

EG Fusco, A Pelc - Proceedings of the twentieth annual symposium on …, 2008 - dl.acm.org
We study the problem of the amount of information required to perform fast broadcasting in
tree networks. The source located at the root of a tree has to disseminate a message to all …

Broadcasting in UDG radio networks with unknown topology

Y Emek, L Gasieniec, E Kantor, A Pelc… - Proceedings of the …, 2007 - dl.acm.org
We consider broadcasting in radio networks, modeled as unit disk graphs (UDG). Such
networks occur in wireless communication between sites (eg, stations or sensors) situated in …

Reliable broadcast in wireless mobile ad hoc networks

M Mohsin, D Cavin, Y Sasson… - Proceedings of the …, 2006 - ieeexplore.ieee.org
We propose a single source reliable broadcasting algorithm for linear grid-based networks
where a message is guaranteed to be delivered to all the nodes of the network. The nodes …

Constant-length labelling schemes for faster deterministic radio broadcast

F Ellen, S Gilbert - Proceedings of the 32nd ACM Symposium on …, 2020 - dl.acm.org
In this paper, we consider the problem of broadcast from a specified source node in a known
synchronous radio network. In 2019, Ellen, Gorain, Miller and Plc showed that this is …

A lower bound for broadcasting in mobile ad hoc networks

R Prakash, A Schiper, M Mohsin, D Cavin, Y Sasson - 2004 - infoscience.epfl.ch
We give a lower bound of $\Omega (n) $ rounds for broadcasting in a mobile ad hoc
network, where $ n $ is the number of nodes in the network. A round is the time taken by a …