On composing a disruption tolerant tree in a network with intermittent links based on stress centrality

• Item type: SIG Technical Reports(1)
• 公開日: 2015-11-13
• タイトル: On composing a disruption tolerant tree in a network with intermittent links based on stress centrality
• タイトル / 言語: en
• タイトル: On composing a disruption tolerant tree in a network with intermittent links based on stress centrality
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Graduate School of Engineering, Soka University
• 著者所属: Graduate School of Engineering, Soka University
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Soka University
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Soka University
• 著者名: Genya, Ishigaki; Norihiko, Shinomiya
• 著者名(英): Genya, Ishigaki; Norihiko, Shinomiya
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: This paper discusses a composition problem and properties of a high penetration tree in a disruption tolerant network. Modeling a network whose communication links are intermittent with a probabilistic graph, each edge in the graph is assigned availability that represents existence frequency of the corresponding link. The tree composition tries to consider the relationship between availability and the importance of relative location of each edge based on stress centrality. In order to design an algorithm to obtain an ideal tree topology based on the relationship, some conditions where a given graph holds such a tree are deduced exploiting empirical results on specific graphs.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: This paper discusses a composition problem and properties of a high penetration tree in a disruption tolerant network. Modeling a network whose communication links are intermittent with a probabilistic graph, each edge in the graph is assigned availability that represents existence frequency of the corresponding link. The tree composition tries to consider the relationship between availability and the importance of relative location of each edge based on stress centrality. In order to design an algorithm to obtain an ideal tree topology based on the relationship, some conditions where a given graph holds such a tree are deduced exploiting empirical results on specific graphs.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2015-AL-155, 号 4, p. 1-4, 発行日 2015-11-13
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8566
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会