### Abstract

We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log^{3/2} n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log^{3/2} n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

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

Title of host publication | Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings |

Pages | 106-120 |

Number of pages | 15 |

DOIs | |

State | Published - Dec 1 2012 |

Externally published | Yes |

Event | 16th International Conference on Principles of Distributed Systems, OPODIS 2012 - Rome, Italy Duration: Dec 18 2012 → Dec 20 2012 |

### Publication series

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

Volume | 7702 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 16th International Conference on Principles of Distributed Systems, OPODIS 2012 |
---|---|

Country | Italy |

City | Rome |

Period | 12/18/12 → 12/20/12 |

### Fingerprint

### Keywords

- distributed algorithm
- gossiping
- leader election
- lower bound
- radio network
- randomization

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings*(pp. 106-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7702 LNCS). https://doi.org/10.1007/978-3-642-35476-2_8

**Electing a leader in multi-hop radio networks.** / Chlebus, Bogdan S.; Kowalski, Dariusz R.; Pelc, Andrzej.

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

*Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7702 LNCS, pp. 106-120, 16th International Conference on Principles of Distributed Systems, OPODIS 2012, Rome, Italy, 12/18/12. https://doi.org/10.1007/978-3-642-35476-2_8

}

TY - GEN

T1 - Electing a leader in multi-hop radio networks

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

AU - Pelc, Andrzej

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

AB - We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.

KW - distributed algorithm

KW - gossiping

KW - leader election

KW - lower bound

KW - radio network

KW - randomization

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

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

U2 - 10.1007/978-3-642-35476-2_8

DO - 10.1007/978-3-642-35476-2_8

M3 - Conference contribution

AN - SCOPUS:84871660038

SN - 9783642354755

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

SP - 106

EP - 120

BT - Principles of Distributed Systems - 16th International Conference, OPODIS 2012, Proceedings

ER -