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

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...

Full description

Saved in:
Bibliographic Details
Published in2017 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
LanguageEnglish
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
Online AccessGet full text

Cover

More Information
Summary: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 latency in a distributed network control. We propose several heuristic approaches which can be adopted to solve the optimization problem in a polynomial time. Our simulations verify the effectiveness of the obtained solutions in different types of graph models.
ISSN:1550-445X
2332-5658
DOI:10.1109/AINA.2017.142