電子情報通信学会総合大会講演要旨

AS-1-7

Multiple Leader Election in Clustered Graph for Distributed Network Control

In this paper, we formulate a minimization problem of the average distance between a leader node of a cycle and other leader node of an adjacent cycle and solve the problem by a leader election algorithm based on closeness centrality and adjacent relations with cycles. Additionally, we construct a lower bound algorithm regarding the average distance. By comparing the two heuristic algorithms, simulation results show the algorithm based on adjacent relations with cycles is more efficient in terms of the average distance than the algorithm based on closeness centrality.