Multi-leader Election in a Clustered Graph for Distributed Network Control

• Published in: 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA) pp. 342 - 346
• Main Authors: Shindo, Hideki, Kobayashi, Hideo, Ishigaki, Genya, Shinomiya, Norihiko
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2017
• Subjects: Algorithm design and analysis; clustered network; graph theory; leader election; Mathematical model; Maximum likelihood estimation; Nominations and elections; Numerical models; Optimization; Structural rings

This paper discusses an election problem of multiple leaders in a network divided into clusters which specifically takes a form of ring structures or cycles. The objective function is defined by considering a positional relation between adjacent leaders aiming at the reduction of communication laten...