カネミツ　ヒデヒロ   Hidehiro Kanemitsu   金光　永煥    所属   コンピュータサイエンス学部 コンピュータサイエンス学科    職種   専任講師
言語種別	英語
発行・発表の年月	2019/03
形態種別	国際会議論文
査読	査読あり
標題	MPR Selection and Routing Algorithm Based on Link Disconnection Prediction and Hop Count in OLSR Protocol
執筆形態	共著
掲載誌名	Proc. NCSP 2019
掲載区分	国外
出版社・発行元	RISP
巻・号・頁	pp.335-338
総ページ数	4 pages
著者・共著者	Wataru Nagata, Masaki Hanada, Hidehiro Kanemitsu, Hideo Suzuki, and Yasuo Nagai
概要	Recently, several routing protocols have been proposed anddeveloped for MANETs, such as Optimized Link State Rout-ing (OLSR). OLSR is one of well-known proactive protocolsfor MANETs. Fundamental functions of OLSR are Multi-point Relay (MPR) selection and routing table calculation.MPR selection and routing table calculation based on linkdisconnection prediction are important to improve networkperformance. From such background, in [1], the authors pro-posed and evaluated Multipoint Relay (MPR) selection androuting algorithm based on the link disconnection predictioncaused by the node mobility. In this proposed routing algo-rithm, each node recalculates the routing table assuming thatthe link between nodes is disconnected before the link dis-connection between nodes actually occurs. Therefore, thereis a possibility that routes with longer hop-count are selectedon the routing table.In this paper, we propose MPR selection and routing algo-rithm based on link disconnection prediction and hop-countlimitation. In this proposed routing algorithm, each node re-calculates the routing table assuming that the link betweennodes is disconnected if the link disconnection between nodesis predicted. In addition, the hop-count of each route of therouting table which is constructed by the proposed routing al-gorithm is limited within H hops longer than the hop-countof the original route of OLSR. In experimental evaluation, weshow that OLSR with the proposed MPR selection and rout-ing algorithm outperforms the original OLSR in terms of thenetwork performance.