Presentation 2015-11-20
On composing a disruption tolerant tree in a network with intermittent links based on stress centrality
Genya Ishigaki, Norihiko Shinomiya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) treecommunication stabilityordered setgraph theory
Paper # CAS2015-47,MSS2015-21
Date of Issue 2015-11-13 (CAS, MSS)

Conference Information
Committee MSS / CAS / IPSJ-AL
Conference Date 2015/11/20(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Ibusuki CityHall
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Satoshi Yamane(Kanazawa Univ.) / Satoshi Tanaka(Murata)
Vice Chair Morikazu Nakamura(Univ. of Ryukyus) / Toshihiko Takahashi(Niigata Univ.)
Secretary Morikazu Nakamura(Yamaguchi Univ.) / Toshihiko Takahashi(Toshiba) / (Hitachi)
Assistant Hideki Kinjo(Okinawa Univ.) / Toshihiro Tachibana(Shonan Inst. of Tech.) / Yohei Nakamura(Hitachi)

Paper Information
Registration To Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Circuits and Systems / Special Interest Group on Algorithms
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On composing a disruption tolerant tree in a network with intermittent links based on stress centrality
Sub Title (in English)
Keyword(1) treecommunication stabilityordered setgraph theory
1st Author's Name Genya Ishigaki
1st Author's Affiliation Soka University(Soka Univ.)
2nd Author's Name Norihiko Shinomiya
2nd Author's Affiliation Soka University(Soka Univ.)
Date 2015-11-20
Paper # CAS2015-47,MSS2015-21
Volume (vol) vol.115
Number (no) CAS-315,MSS-316
Page pp.pp.21-24(CAS), pp.21-24(MSS),
#Pages 4
Date of Issue 2015-11-13 (CAS, MSS)