講演名 2014-11-21
The construction of an in-tree by local centrality measure for balanced routing
,
PDFダウンロードページ PDFダウンロードページへ
抄録(和)
抄録(英) This paper deals with a basic model of wireless communication network. There the selection of neighboring nodes is fundamental in distance vector-based routing. For balanced routing, we minimize overload of node defined as the maximum of node relay number. To this end, we have proposed to select the next hop that provides the least centrality measurement obtained from local graphs. As a communication model, we have so far assumed the situation where all nodes communicate with one another. This paper deals with different situation where one designated node termed sink collect data from all the other nodes along directed paths, which is a model of sensor network. Besides this paper deals with two typical cases. One case is that sink is located providing diameter of its underlying graph structure, while the other is located providing radius. For both cases, simulation experiments say that degree and betweeenness provide best results to minimize the maximum node relay number among centrality measures. However, they also say that the sink node providing radius does not always provide the minimum of such maximum number, which is provided by nodes around that sink.
キーワード(和)
キーワード(英) sensor network structure / distance vector routing / min-max relay number / sink location
資料番号 CAS2014-99,MSS2014-63
発行日

研究会情報
研究会 CAS
開催期間 2014/11/13(から1日開催)
開催地(和)
開催地(英)
テーマ(和)
テーマ(英)
委員長氏名(和)
委員長氏名(英)
副委員長氏名(和)
副委員長氏名(英)
幹事氏名(和)
幹事氏名(英)
幹事補佐氏名(和)
幹事補佐氏名(英)

講演論文情報詳細
申込み研究会 Circuits and Systems (CAS)
本文の言語 ENG
タイトル(和)
サブタイトル(和)
タイトル(英) The construction of an in-tree by local centrality measure for balanced routing
サブタイトル(和)
キーワード(1)(和/英) / sensor network structure
第 1 著者 氏名(和/英) / Yoshihiro Kaneko
第 1 著者 所属(和/英)
Faculty of Engineering, Gifu University
発表年月日 2014-11-21
資料番号 CAS2014-99,MSS2014-63
巻番号(vol) vol.114
号番号(no) 312
ページ範囲 pp.-
ページ数 5
発行日