Presentation 2015-06-17
The characteristic of routes selected by degree centrality-aware distance vector routing
Yoshihiro Kaneko,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the research area of ad-hoc network, distance vector-type routing is fundamental. This network requires no fixed infrastructure, which is composed of terminals that communicate with each other as well as relay data like a router. Still now so many improvements for such routing type have been proposed, which probably continue hereafter. For load balancing, we have proposed to apply node centrality measure, to one of the most popular routing protocol Destination-Sequenced Distance Vector DSDV and shown its validity through network simulator ns-3. Our proposal idea is to avoid nodes structurally located in the central area as far as possible. However, its effectiveness seems yet limited at present and dependent on adopted centrality measure. In order to develop our proposal, the first thing to do is to clarify properties of obtained routes by our proposal. Thus, in this report, we observe obtained routes through 60 network models with link density 5 to 10%. Usually, distance vector-type routing happens to select just one route from many candidates, while our proposal selects one from few candidates, which is shown first in this report. Next, we locate central nodes by three node centrality measures such as closeness, degree and betweenness. As a result, we show that betweenness centrality measure always provides a single central node, which we regard as central node in this report. Then we show how far relay nodes on selected routes are from such central node. Out of those three measures, we finally show that degree centrality-aware routing provides routes with most distant relay nodes from central nodes on average.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) distance vector-type routingcloseness centralitydegree centralitybetweenness centrality
Paper # CAS2015-8,VLD2015-15,SIP2015-39,MSS2015-8
Date of Issue 2015-06-10 (CAS, VLD, SIP, MSS)

Conference Information
Committee MSS / CAS / SIP / VLD
Conference Date 2015/6/17(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Otaru University of Commerce
Topics (in Japanese) (See Japanese page)
Topics (in English) System, signal processing and related topics
Chair Satoshi Yamane(Kanazawa Univ.) / Satoshi Tanaka(Murata) / Osamu Houshuyama(NEC) / Yusuke Matsunaga(Kyushu Univ.)
Vice Chair Morikazu Nakamura(Univ. of Ryukyus) / Toshihiko Takahashi(Niigata Univ.) / Makoto Nakashizuka(Chiba Inst. of Tech.) / Masahiro Okuda(Univ. of Kitakyushu) / Takashi Takenana(NEC)
Secretary Morikazu Nakamura(Yamaguchi Univ.) / Toshihiko Takahashi(Toshiba) / Makoto Nakashizuka(Hitachi) / Masahiro Okuda(Tohoku Univ.) / Takashi Takenana(NEC)
Assistant Hideki Kinjo(Okinawa Univ.) / Toshihiro Tachibana(Shonan Inst. of Tech.) / Yohei Nakamura(Hitachi) / Takamichi Miyata(Chiba Inst. of Tech.) / Ittetsu Taniguchi(Ritsumeikan Univ.)

Paper Information
Registration To Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Circuits and Systems / Technical Committee on Signal Processing / Technical Committee on VLSI Design Technologies
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) The characteristic of routes selected by degree centrality-aware distance vector routing
Sub Title (in English)
Keyword(1) distance vector-type routingcloseness centralitydegree centralitybetweenness centrality
1st Author's Name Yoshihiro Kaneko
1st Author's Affiliation Gifu University(Gifu Univ.)
Date 2015-06-17
Paper # CAS2015-8,VLD2015-15,SIP2015-39,MSS2015-8
Volume (vol) vol.115
Number (no) CAS-87,VLD-88,SIP-89,MSS-90
Page pp.pp.43-48(CAS), pp.43-48(VLD), pp.43-48(SIP), pp.43-48(MSS),
#Pages 6
Date of Issue 2015-06-10 (CAS, VLD, SIP, MSS)