### Abstract

We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step. The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n^{11/6}). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n^{1.77291}) = O(n^{9/5}), for general networks, and in time O(n^{1+a+H(a)+o(1)}) for sparse networks with in-degrees O(n^{a}) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n^{3/2} log^{1/2} n) for general networks or O(n^{1+a+o(1)}) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n^{3/2}).

Original language | English (US) |
---|---|

Title of host publication | Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings |

Editors | Ugo Montanari, Emo Welzl, Jose D. P. Rolim |

Publisher | Springer Verlag |

Pages | 717-729 |

Number of pages | 13 |

ISBN (Print) | 9783540450221 |

State | Published - Jan 1 2000 |

Externally published | Yes |

Event | 27th International Colloquium on Automata, Languages and Programming, ICALP 2000 - Geneva, Switzerland Duration: Jul 9 2000 → Jul 15 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1853 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 27th International Colloquium on Automata, Languages and Programming, ICALP 2000 |
---|---|

Country | Switzerland |

City | Geneva |

Period | 7/9/00 → 7/15/00 |

### Fingerprint

### Keywords

- Broadcasting
- Deterministic
- Distributed
- Radio network

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings*(pp. 717-729). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1853). Springer Verlag.

**Deterministic radio broadcasting.** / Chlebus, Bogdan S.; Gąsieniec, Leszek; Östlin, Anna; Robson, John Michael.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1853, Springer Verlag, pp. 717-729, 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, Geneva, Switzerland, 7/9/00.

}

TY - GEN

T1 - Deterministic radio broadcasting

AU - Chlebus, Bogdan S.

AU - Gąsieniec, Leszek

AU - Östlin, Anna

AU - Robson, John Michael

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step. The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n1.77291) = O(n9/5), for general networks, and in time O(n1+a+H(a)+o(1)) for sparse networks with in-degrees O(na) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n3/2 log1/2 n) for general networks or O(n1+a+o(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n3/2).

AB - We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step. The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n1.77291) = O(n9/5), for general networks, and in time O(n1+a+H(a)+o(1)) for sparse networks with in-degrees O(na) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n3/2 log1/2 n) for general networks or O(n1+a+o(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n3/2).

KW - Broadcasting

KW - Deterministic

KW - Distributed

KW - Radio network

UR - http://www.scopus.com/inward/record.url?scp=84983155164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983155164&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84983155164

SN - 9783540450221

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 717

EP - 729

BT - Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings

A2 - Montanari, Ugo

A2 - Welzl, Emo

A2 - Rolim, Jose D. P.

PB - Springer Verlag

ER -