Papers - ABURADA Kentaro
-
Winnyネットワークにおけるクラスタリングを用いたインデックスポイゾニングの検討
油田健太郎, 山場久昭, 朴美娘, 岡崎直宣
研究報告コンピュータセキュリティ（CSEC） 2014 ( 30 ) 1 - 9 2014.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：一般社団法人情報処理学会
現在，P2P ファイル共有ネットワークが世界中で利用されている．しかし，その多くはファイルの流通制御をもたないため，著作権侵害ファイルの流通やコンピュータウイルスによる個人情報の流出などが社会問題となっている．その解決策としてインデックスポイゾニングと呼ばれるファイル流通制御方式が研究されている．しかし，P2P ファイル共有ネットワークへインデックスポイゾニングを適用する際に，トラフィックの増大やインデックスの汚染などの問題が発生することが確認されている．そこで本論文では，ファイルの流通制御を低下させることなく，それらの問題を解決する手法として，動的なクラスタリングを提案することで従来手法を改善し，その一部を Winny ネットワーク向けに実装することで，提案手法の有効性を評価する．
-
Winnyネットワークにおけるクラスタリングを用いたインデックスポイゾニングの検討
油田健太郎, 山場久昭, 朴美娘, 岡崎直宣
研究報告インターネットと運用技術（IOT） 2014 ( 30 ) 1 - 9 2014.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：一般社団法人情報処理学会
現在，P2P ファイル共有ネットワークが世界中で利用されている．しかし，その多くはファイルの流通制御をもたないため，著作権侵害ファイルの流通やコンピュータウイルスによる個人情報の流出などが社会問題となっている．その解決策としてインデックスポイゾニングと呼ばれるファイル流通制御方式が研究されている．しかし，P2P ファイル共有ネットワークへインデックスポイゾニングを適用する際に，トラフィックの増大やインデックスの汚染などの問題が発生することが確認されている．そこで本論文では，ファイルの流通制御を低下させることなく，それらの問題を解決する手法として，動的なクラスタリングを提案することで従来手法を改善し，その一部を Winny ネットワーク向けに実装することで，提案手法の有効性を評価する．
-
Proposal of a puzzle authentication method with shoulder-surfing attack resistance
Park M., Kita Y., Aburada K., Okazaki N.
Proceedings - 2014 International Conference on Network-Based Information Systems, NBiS 2014 495 - 500 2014.1
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Proceedings - 2014 International Conference on Network-Based Information Systems, NBiS 2014
© 2014 IEEE. Recently, mobile terminals such as smartphones have come into widespread use. Most of such mobile terminals store several types of important data, such as personal information. Therefore, in order to prevent data theft, it is necessary to lock and unlock terminals using a personal authentication method such as personal identification numbers (PINs). However, most existing authentication methods have a common problem, referred to as shoulder-surfing in which authentication information is covertly obtained by peeking over the shoulder of a user as he/she completes the authentication sequence. In this paper, we propose a puzzle authentication method that is very simple and sufficiently secure, even when the authentication sequence is being watched. This method uses a grid-based authentication scheme in which a user selects four out of 16 panels, and four out of 16 positions. We also implemented the proposed method on a mobile terminal and evaluated it through experiments and questionnaire surveys.
DOI： 10.1109/NBiS.2014.87
-
Investigation of the routing method based on the number of neighbor nodes
Aburada K., Park M., Okazaki N.
2014 7th International Conference on Mobile Computing and Ubiquitous Networking, ICMU 2014 103 - 104 2014
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：2014 7th International Conference on Mobile Computing and Ubiquitous Networking, ICMU 2014
In ad hoc networks, due to the mobility of nodes, radio wave interference, and limited resources, such as batteries, communication links are unstable and restricted. In this paper, we propose the neighbors-based routing (NBR) protocol by constructing paths in an area in which a large number of nodes exists. Simulations confirm that the proposed protocol has higher connectivity and a lower control overhead than existing protocols in topologies in which nodes move. © 2014 IEEE.
-
Proposal of a Zone Disjoint Multi-path Routing for ad hoc networks
Aburada K., Eto M., Okazaki N., Park M.
8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 2010.9
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
Many researches are going on in ad hoc networks and several routing protocols have been proposed. However, these protocols are "single- path" protocols which construct only one route. In ad hoc networks, due to limitation of battery capacity and mobility of nodes, communication links are unstable. Therefore, "multi-path" protocols are desired for constructing "robust" routes. Additionally, in considering the case where interference spreads to a certain area, each path is desired to be away from other paths to some degree. In this paper, we introduce the concept of "zone", and propose a Zone Disjoint Multi-path Routing Protocol, called ZDMR, for constructing multi-path routes which disjoint each other in a zone level. Our simulations confirm that this protocol has a higher connectivity than existing protocols.
-
An evaluation of Zone Disjoint Multi-path Routing in ad hoc networks
ETO Masaru, ABURADA Kentaro, OKAZAKI Naonobu
72 ( 0 ) 137 - 138 2010.3
Language：Japanese Publishing type：Research paper (scientific journal)
-
A Study of circulation technique of cluster head using restructuring of cluster
OBANA Shiho, ABURADA Kentaro, OKAZAKI Naonobu
72 ( 0 ) 133 - 134 2010.3
Language：Japanese Publishing type：Research paper (scientific journal)
-
A study of the routing method based on the number of neighbor nodes in ad hoc networks
INABA Kengo, ABURADA Kentaro, OKAZAKI Naonobu
72 ( 0 ) 135 - 136 2010.3
Language：Japanese Publishing type：Research paper (scientific journal)
-
ABURADA Kentaro, KAWACHI Kosuke, OKAZAKI Naonobu, TOMITA Shigeyuki, PARK Mi Rang
The IEICE transactions on communications B 92 ( 1 ) 88 - 97 2009.1
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers
-
An estimation of a hop-vector-based routing scheme for data-centric sensor networks
SATO Yusuke, ABURADA Kentaro, OKAZAKI Naonobu, TOMITA Shigeyuki
IPSJ SIG technical reports 2008 ( 94 ) 49 - 56 2008.9
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Information Processing Society of Japan (IPSJ)
In this paper, we propose a new routing scheme, HVGF (Hop-Vector based Greedy Forwarding) which doesn't need geographic information for data-centric sensor networks. In this scheme, we introduce n base-points, and assign n-dimensional hop-vector, which consists of number of hops from each base-point to the node, to each node. Then, each node forwards packets greedily based on distance between hop-vectors of the node and of destination. The simulation results show that HVGF works well in the low density networks or networks which contain a large void in the center, compared to existing greedy forwarding scheme using information of real geographical location. We also examine the performance of the proposed scheme concerning various number of base points.
-
Kawachi Kosuke, Sato Yusuke, Aburada Kentaro, Okazaki Naonobu, Tomita Shigeyuki
7 ( 4 ) 47 - 50 2008.8
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Forum on Information Technology
-
Proposal and its evaluations of hierarchical multiple-route routing protocol for ad hoc network
Aburada Kentaro, Takatsuji Shingo, Okazaki Naonobu
Memoirs of the Faculty of Engineering, Miyazaki University 36 273 - 280 2007.8
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Miyazaki University
-
A new routing protocol for data-centric sensor networks
SATO Yusuke, ABURADA Kentaro, OKAZAKI Naonobu, TOMITA Shigeyuki, PARK Mi Rang
IPSJ SIG technical reports 2007 ( 44 ) 125 - 130 2007.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Information Processing Society of Japan (IPSJ)
For sensor networks consisting of battery-powered sensor nodes, power saving is significant challenge. It is effective to reduce the amount of communication for sensor networks where power resource is scarce, because sensor nodes consume energy most in communication. We propose a routing protocol, HVGF (Hop-Vector based Greedy Forwarding), which reduces the amount of communication and doesn't need geographic information. In this method, we introduce n base points, and assign n-dimensional hop-vector consist of number of hops from each base point to each nodes. Then, each node forwards packets greedily based on distance between hop-vectors of the node and destination. The simulation results show that HVGF works well in the low density network or network which contains a large void in the center compared to existing greedy forwarding method using information of real geographical position.
-
A new routing protocol for data-centric sensor networks
SATO Yusuke, ABURADA Kentaro, OKAZAKI Naonobu, TOMITA Shigeyuki, PARK Mi Rang
IEICE technical report 107 ( 39 ) 125 - 130 2007.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers
For sensor networks consisting of battery-powered sensor nodes, power saving is significant challenge. It is effective to reduce the amount of communication for sensor networks where power resource is scarce, because sensor nodes consume energy most in communication. We propose a routing protocol, HVGF (Hop-Vector based Greedy Forwarding), which reduces the amount of communication and doesn't need geographic information. In this method, we introduce n base points, and assign n-dimensional hop-vector consist of number of hops from each base point to each nodes. Then, each node forwards packets greedily based on distance between hop-vectors of the node and destination. The simulation results show that HVGF works well in the low density network or network which contains a large void in the center compared to existing greedy forwarding method using information of real geographical position.
-
Improvement of Information Security with IEEE 802.1X Authentication
ABURADA Kentaro, FUJIMOTO Ryunosuke
Administration 13 ( 3 ) 131 - 145 2007.3
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Prefectural University of Kumamoto
-
A Proposal of Mail Processing based on the GTD Theory in Web2.0 Time
FUJIMOTO Ryunosuke, ABURADA Kentaro
Administration 13 ( 3 ) 19 - 46 2007.3
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Prefectural University of Kumamoto
-
Proposal of a robust zone-based hierarchical routing method for ad hoc networks
Aburada K., Morita K., Okazaki N., Tomita S., Mi R.
2006 Asia-Pacific Conference on Communications, APCC 2006.12
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：2006 Asia-Pacific Conference on Communications, APCC
Ad hoc routing protocols can be divided into two categories. One is proactive schemes, the other is reactive schemes. Two schemes have advantage and disadvantage each other. There are hybrid schemes which are good mix of proactive schemes and reactive schemes. In hybrid schemes, nodes maintain the complete routing information of particular area only. Outside of this area, a node search for a route only when it needs to forward a packet. In consequence, the communication overhead is reduced Zone-based Hierarchical Link State (ZHLS) routing protocol is proposed as a hybrid scheme. However, ZHLS take time to search new route when route is disconnected because it search only one route. In particular, real-time application is severely-impacted by this delay. For this reason, it is necessary to construct multiple routes as backup route. In this paper, we propose Multiple-Route Zone-based Hierarchical Source Routing (called MR-ZHSR) scheme that extends ZHLS routing protocol to construct multi-path routes. © 2006 IEEE.
-
Evaluation of Robust Zone-based Hierarchical Routing Method for Ad Hoc Networks
ABURADA Kentaro, MORITA Kanako, OKAZAKI Naonobu, TOMITA Shigeyuki, PARK Mi Rang
IPSJ SIG technical reports 2006 ( 50 ) 119 - 124 2006.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Information Processing Society of Japan (IPSJ)
A global positioning system (GPS)-based routing protocol, called Zone-based Hierarchical Link State (ZHLS) routing protocol, have been proposed for routing data packets for ad hoc networks. In this protocol, the network is divided into non-overlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: local node and global zone levels. Hierarchical approach reduces the amount of overhead of dynamic changing topology. ZHLS is, however, single-path protocol which detects only one route. In ad hoc networks, due to mobility of nodes and instability of communication links, multi-path protocols are required. In this paper, we propose a Multiple-Route Zone-based Hierarchical Source Routing (called MR-ZHSR) which generates disjoint paths in global zone level. If a disconnected link is detected in the currently used route, the route can be switched to another route without delay for re-routing.
-
Evaluation of Robust Zone-based Hierarchical Routing Method for Ad Hoc Networks
ABURADA Kentaro, MORITA Kanako, OKAZAKI Naonobu, TOMITA Shigeyuki, PARK Mi Rang
IEICE technical report 106 ( 44 ) 119 - 124 2006.5
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers
A global positioning system (GPS)-based routing protocol, called Zone-based Hierarchical Link State (ZHLS) routing protocol, have been proposed for routing data packets for ad hoc networks. In this protocol, the network is divided into non-overlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: local node and global zone levels. Hierarchical approach reduces the amount of overhead of dynamic changing topology. ZHLS is, however, single-path protocol which detects only one route. In ad hoc networks, due to mobility of nodes and instability of communication links, multi-path protocols are required. In this paper, we propose a Multiple-Route Zone-based Hierarchical Source Routing (called MR-ZHSR) which generates disjoint paths in global zone level. If a disconnected link is detected in the currently used route, the route can be switched to another route without delay for re-routing.
-
A Study on Multiple-Route Zone-Based Hierarchical Source Routing for Ad Hoc Networks
Aburada Kentaro, Honda Kouichi, Okazaki Naonobu, Tomita Shigeyuki, Park Mi Rang
Memoirs of the Faculty of Engineering, Miyazaki University 34 235 - 242 2005.8
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Miyazaki University