Vlady Ravelomanana

most citedA Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DC2006

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots

Christian Lavault, Jean-François Marckert, Vlady Ravelomanana

A radio network (RN) is a distributed system consisting of $n$ radio stations. We design and analyze two distributed leader election protocols in RN where the number $n$ of radio s…

cs.DC2006★ 1 cited

A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots

Christian Lavault, Jean-François Marckert, Vlady Ravelomanana

Radio networks (RN) are distributed systems (\textit{ad hoc networks}) consisting in $n \geq 2$ radio stations. Assuming the number $n$ unknown, two distinct models of RN without co…