Assume that the GHS algorithm uses an additional wake-up procedure that guarantees that each node starts the algorithm within N time units.
Prove by induction that after at most 5N l - 3N time units each node is at level l.
Prove that the algorithm terminates within 5N log N time units.
Show that there exists an O(N(log N + k)) election algorithm for networks with bounded degree k (i. e. , networks where each node has at most k neighbors).
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here