| 大会名称 |
| 2016年 総合大会 |
| 大会コ－ド |
| 2016G |
| 開催年 |
|
2016
|
| 発行日 |
|
2016/3/1
|
| セッション番号 |
|
AS-1
|
| セッション名 |
|
グラフ理論の工学的魅力を語る － 基礎から最前線の応用まで
|
| 講演日 |
|
2016/3/17
|
| 講演場所(会議室等) |
|
総合学習プラザ 2F 第16講義室
|
| 講演番号 |
|
AS-1-7
|
| タイトル |
|
Multiple Leader Election in Clustered Graph for Distributed Network Control
|
| 著者名 |
|
○Hideki Shindo, Norihiko Shinomiya,
|
| キーワード |
|
Leader election, Closeness centrality, Cycle, 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.
|
| 本文pdf |
|
PDF download
|
