Tree-based Leader Election

Tree-Based Leader Election is a distributed leader election protocol in which processes are organized into a tree topology and election proceeds via hierarchical message passing from leaves to root or vice versa, distinguishing it from general graph-based or ring-based election algorithms by exploiting the tree structure for efficient coordination.

10

Publications

292

Citations

32

Authors

19

Institutions

Publications per year

2017–2026

5

Authors

32

  1. AB
    Ahcène Bounceur

    Université de Bretagne Occidentale, France

    3 publications · 53 citations

    3

    h-index

  2. MB
    Madani Bezoui

    Université de Bretagne Occidentale, France

    3 publications · 53 citations

    3

    h-index

  3. RE
    Reinhardt Euler

    Université de Bretagne Occidentale, France

    3 publications · 53 citations

    3

    h-index

  4. NK
    Nabil Kadjouh

    Université de Bretagne Occidentale, France

    2 publications · 32 citations

    2

    h-index

  5. CG
    Christian Glacet

    Institute of Electronics, Computer and Telecommunication Engineering, Italy

    1 publications · 27 citations

    1

    h-index

1–5 of 32

Venues

  1. ACM Transactions on Algorithms

    TALG · 1 publications · 27 citations

    1

    h-index

  2. Mobile Networks and Applications

    MONET · 1 publications · 16 citations

    1

    h-index

  3. Algorithmica

    1 publications · 41 citations

    1

    h-index

  4. Telecommunication Systems

    1 publications · 13 citations

    1

    h-index

  5. Journal of Parallel and Distributed Computing

    1 publications · 34 citations

    1

    h-index

1–5