詳細

谷口　義明 （タニグチ　ヨシアキ）

  • 情報学部 情報学科　教授
Last Updated :2024/05/14

コミュニケーション情報 byコメンテータガイド

  • コメント

    人やモノをセンシングする多数の通信機器からなる無線センサネットワークシステムを効率よく動作させるための研究等に取り組んでいます。

研究者情報

学位

  • 博士（情報科学）（2008年 大阪大学）

ホームページURL

科研費研究者番号

  • 50532579

ORCID ID

Researcher ID

  • E-9638-2010

J-Global ID

プロフィール

  • 2008年大阪大学大学院情報科学研究科博士後期課程修了，博士（情報科学）． 大阪大学サイバーメディアセンター助教，近畿大学理工学部准教授等を経て，2024年より近畿大学情報学部教授． 情報ネットワーク，モバイルコンピューティング，サイバーセキュリティに関する研究に従事． IEEE，情報処理学会，電子情報通信学会，電気学会各会員．

研究キーワード

  • wireless mesh network   ubiquitous network   wireless sensor network   

現在の研究分野（キーワード）

    人やモノをセンシングする多数の通信機器からなる無線センサネットワークシステムを効率よく動作させるための研究等に取り組んでいます。

研究分野

  • ものづくり技術（機械・電気電子・化学工学） / 通信工学
  • 情報通信 / 情報ネットワーク
  • 情報通信 / 計算機システム

経歴

  • 2024年04月 - 現在  近畿大学情報学部教授
  • 2020年04月 - 現在  近畿大学情報学研究所
  • 2016年04月 - 現在  近畿大学大学院総合理工学研究科
  • 2022年04月 - 2024年03月  近畿大学情報学部准教授
  • 2019年10月 - 2023年09月  近畿大学総合情報基盤センター副センター長
  • 2018年04月 - 2022年03月  近畿大学理工学部准教授
  • 2014年04月 - 2018年03月  近畿大学理工学部講師
  • 2008年10月 - 2014年03月  大阪大学大学院情報科学研究科助教
  • 2008年10月 - 2014年03月  大阪大学サイバーメディアセンター助教

研究活動情報

論文

  • LED パネルを用いた BLE アドバタイジングパケットの可視化システム
    秋山周平; 佐伯嶺治; 谷口義明
    電気学会論文誌C 144 8 2024年08月 [査読有り]
  • Slackを用いた初学者向けのCapture The Flag演習システムの開発
    山下達也; 谷口義明
    情報処理学会論文誌 65 7 2024年07月 [査読有り]
  • A device identification method from BLE advertising packets with randomized MAC addresses based on regression of received signal strength
    Shuhei Akiyama; Yoshiaki Taniguchi
    IEICE Communications Express 13 3 64 - 67 2024年03月 [査読有り]
  • 失敗体験から学習する公衆無線LANのセキュリティリスク学習システム
    塩田晃平; 谷口義明; 井口信和
    情報処理学会論文誌 65 3 2024年03月 [査読有り]
  • A synthesized voice discrimination method using characteristic sounds spoken by humans
    Yuya Nuruki; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE Asia 2023 2023年10月 [査読有り]
  • Device location recognition using channel state information in wireless LAN environments
    Yuya Izumoto; Taishin Mabuchi; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE Asia 2023 2023年10月 [査読有り]
  • Device identification in BLE packets from moving devices with randomized MAC addresses
    Shuhei Akiyama; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE Asia 2023 2023年10月 [査読有り]
  • Development of a security diagnosis system for wireless LAN environment
    Yuya Izumoto; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE-TW 2023 2023年07月 [査読有り]
  • クラウド環境を標的とするDDoS攻撃の対策訓練システム
    眞鍋督; 谷口義明; 井口信和
    情報処理学会論文誌：デジタルプラクティス 4 3 2023年07月 [査読有り]
  • Development of a management support system for IoT devices using Wi-Fi channel state information
    Ryota Inaba; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE GCCE 2022 2022年10月 [査読有り]
  • Yoshiaki Taniguchi; Kaito Muto
    IEEJ Transactions on Electrical and Electronic Engineering 17 9 1377 - 1379 2022年09月 [査読有り]
  • A self-organizing noise signal transmission method to make eavesdropping difficult in wireless networks
    Takumi Oyama; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE-TW 2022 2022年07月 [査読有り]
  • 攻撃者視点を取り入れたクロスサイトスクリプティング対策の実践的演習システムの開発と評価
    岸本和理; 谷口義明; 井口信和
    情報処理学会論文誌：教育とコンピュータ 8 2 2022年06月 [査読有り]
  • Yoshiaki Taniguchi; Kohei Morimoto
    IEEJ Transactions on Electrical and Electronic Engineering 17 1 151 - 153 2022年01月 [査読有り]
  • Evaluation of data forwarding methods for fish farm monitoring system with energy harvesting
    Takumi Komura; Yoshiaki Taniguchi
    Proceedings of ICIT 2021 2021年12月 [査読有り]
  • Shuhei Akiyama; Ryoya Morimoto; Yoshiaki Taniguchi
    Proceedings of IEEE ICCE Asia 2021 2021年11月 [査読有り]
  • 江川悠斗; 谷口義明; 井口信和
    情報処理学会論文誌 62 5 1298 - 1306 2021年05月 [査読有り]
  • Yoshiaki Taniguchi; Tomoki Mukaida; Youji Ochi; Nobukazu Iguchi
    Proceedings of IEEE LifeTech 2021 418 - 419 2021年03月 [査読有り]
  • Yoshiaki Taniguchi; Hiroto Masuda
    Proceedings of ICACT 2021 1 - 4 2021年02月 [査読有り]
  • 後安謙吾; 谷口義明; 井口信和
    電子情報通信学会論文誌 J104-D 2 159 - 163 2021年02月 [査読有り]
  • Yutaro Kobayashi; Yoshiaki Taniguchi; Youji Ochi; Nobukazu Iguchi
    Proceedings of IEEE ICCE Asia 2020 123 - 126 2020年11月 [査読有り]
  • Kazuri Kishimoto; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE ICCE-TW 2020 623 - 624 2020年09月 [査読有り]
  • Kohei Yamaura; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE ICCE-TW 2020 625 - 626 2020年09月 [査読有り]
  • Taishin Mabuchi; Yoshiaki Taniguchi; Kimiaki Shirahama
    Proceedings of IEEE ICCE-TW 2020 567 - 568 2020年09月 [査読有り]
  • 湯川誠人; 谷口義明; 井口信和
    電子情報通信学会論文誌 J103-D 8 591 - 602 2020年08月 [査読有り]
  • Yoshiaki Taniguchi; Kansei Oki
    Journal of Communications 15 2 164 - 170 2020年02月 [査読有り]
  • Yuto Egawa; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of ICIT 2019 357 - 361 2019年12月 [査読有り]
  • Yoshiaki Taniguchi
    IEEJ Transactions on Electrical and Electronic Engineering 14 11 1725 - 1726 2019年11月 [査読有り]
  • Yoshiaki Taniguchi; Mizuha Nakayama
    IEEJ Transactions on Electrical and Electronic Engineering 14 8 1275 - 1276 2019年08月 [査読有り]
  • Natsuya Umegawa; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE ICCE-TW 2019 581 - 582 2019年05月 [査読有り]
  • Seiya Hirahata; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE ICCE-TW 2019 397 - 398 2019年05月 [査読有り]
  • Yuto Egawa; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of IEEE ICCE-TW 2019 577 - 578 2019年05月 [査読有り]
  • Yoshiaki Taniguchi; Ryota Uranishi
    IEEJ Transactions on Electrical and Electronic Engineering 14 5 804 - 805 2019年05月 [査読有り]
  • Koji Abe; Masaru Tanaka; Hitoshi Habe; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedigns of ICFSP 2018 105 - 109 2018年09月 [査読有り]
  • Koichi Ishida; Yoshiaki Taniguchi; Nobukazu Iguchi
    IEICE Transactions on Information and Systems E101-D 8 2145 - 2149 2018年08月 [査読有り]
  • Koichi Ishida; Yoshiaki Taniguchi; Nobukazu Iguchi
    IEICE Transactions on Information and Systems E101D 3 808 - 811 2018年03月 [査読有り]
     
    We have proposed a fish-farm monitoring system. In our system, the transmission range of acoustic waves from sensors attached to the undersides of the fish is not omnidirectional because of obstruction from the bodies of the fish. In addition, energy-efficient control is highly important in our system to avoid the need to replace the batteries. In this letter, we propose a data-gathering method for fish-farm monitoring without the use of control packets so that energy-efficient control is possible. Instead, our method uses the transmission-range volume as calculated from the location of the sensor node to determine the timing of packet transmission. Through simulation evaluations, we show that the data-gathering performance of our proposed method is better than that of comparative methods.
  • Hiroki Fujita; Yoshiaki Taniguchi; Nobukazu Iguchi
    2017 IEEE 6th Global Conference on Consumer Electronics, GCCE 2017 2017- 1 - 3 2017年12月 [査読有り]
     
    In this paper, we develop a system to support learning of OpenFlow by visually associating controller configuration information and logical topology. In our system, the constructed topology is visually shown on a touchscreen display and a learner can easily confirm the topology. In addition, a learner can configure the controller by visual and simple operation using the touchscreen display. Therefore, a learner can learn the behavior of the OpenFlow even if the learner is a beginner. Through experimental evaluation, we confirmed that our system can be applied to an OpenFlow network consists of dozens of OpenFlow switches.
  • Koichi Ishida; Yoshiaki Taniguchi; Nobukazu Iguchi
    Proceedings of APWConCSE 2017 159 - 161 2017年12月 [査読有り]
  • Takaaki Matsushita; Yoshiaki Taniguchi
    Proceedings of APWConCSE 2017 55 - 58 2017年12月 [査読有り]
  • Yoshiaki Taniguchi
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100A 11 2547 - 2550 2017年11月 [査読有り]
     
    We have proposed a fish farm monitoring system for the efficient farming of tuna. In our system, energy efficient and adaptive control of sensor node is highly important. In addition, since a sensor node is attached to the fish, the transmission range of sensor node is not omnidirectional. In this paper, we propose a data gathering mechanism for fish farm monitoring by extending a traditional desyncronization mechanism. In our proposed mechanism, by utilizing acknowledgment packets from the sink node, distributed and adaptive timing control of packet transmission is accomplished. In addition, we apply a reassignment mechanism and a sleep mechanism for improving the performance of our proposed mechanism. Through simulation experiments, we show that the performance of our proposed mechanism is higher than that of comparative mechanisms.
  • Yoshiaki Taniguchi; Koji Suganuma; Takaaki Deguchi; Go Hasegawa; Yutaka Nakamura; Norimichi Ukita; Naoki Aizawa; Katsuhiko Shibata; Kazuhiro Matsuda; Morito Matsuoka
    IEEE TRANSACTIONS ON CLOUD COMPUTING 5 2 182 - 192 2017年04月 [査読有り]
     
    In this paper, we propose a novel energy-efficient architecture for software-defined data center infrastructures. In our proposed data center architecture, we include an exhaust heat reuse system that utilizes high-temperature exhaust heat from servers in conditioning humidity and air temperature of office space near the data center. To obtain high-temperature exhaust heat, equipment such as server racks and air conditioners are deployed in tandem so that the aisles are divided into three types: cold, hot, and super-hot. In this paper, to investigate the fundamental characteristics of our proposed data center architecture, we consider various types of data center models and conduct numerical simulations that use results obtained by experiments at an actual data center. Through simulation, we show that the total power consumption by a data center with our proposed architecture is 27 percent lower than that by data center with a conventional architecture. In addition, it is also shown that the proposed tandem equipment arrangement is suitable for obtaining high-temperature exhaust heat and decreasing the total power consumption significantly under a wider range of conditions than in the conventional equipment arrangement.
  • OpenFlowネットワーク移行支援システム
    野村圭太; 谷口義明; 井口信和; 渡辺健次
    情報処理学会論文誌 58 3 672 - 682 2017年03月 [査読有り]
  • Koji Abe; Ryota Shimizu; Hitoshi Habe; Yoshiaki Taniguchi; Nobukazu Iguchi
    ACM International Conference Proceeding Series 6 - 10 2016年11月 [査読有り]
     
    As a method for supporting fish farming, this paper presents a video scene detection when farmed fry start instantaneously in a tank due to environmental stimuli. Although some environmental stimuli such as sound noises or lighting startle the fry and the stimuli bring about the instantaneous response, actual situations around the tanks in which the stimuli occur are unclear in detail. From the fact the fry often die due to crashes to the tank's wall and between the fry by the response, a monitoring system for the fry and situation around the pool could find causes of the stimuli, and it could result in decrease of the death number of the fry. In this research, the fry which swim in a tank are monitored by a video cam- era and the video scenes at the response are detected by a SVM with a feature value which represents fry's acceleration using sequential frames of the moving image. Preparing the moving images which include scenes of the response by fish in a tank, performances of the proposed method were examined. From experimental results, accuracy ratios of the recall and the precision for the scene detection have shown more than 80% on average and 100% under normal illuminances (108.5 lux on average), respectively.
  • Yoshiaki Taniguchi; Hiroyuki Hisamatsu
    International Journal of Simulation: Systems, Science & Technology 17 35 1 - 5 2016年11月 [査読有り]
  • Takuya Yoshida; Yoshiaki Taniguchi
    Information 19 7A 2661 - 2668 International Information Institute 2016年07月 [査読有り]
  • Twitter-based course support system considering relatedness needs
    Hiroyuki Hisamatsu; Yoshiaki Taniguchi
    International Journal of Computer and Information Technology 5 2 174 - 180 2016年03月 [査読有り]
  • 仮想マシンを活用したネットワークセキュリティ学習支援システムの実装と評価
    福山和生; 谷口義明; 井口信和
    情報処理学会論文誌 57 3 931 - 935 2016年03月 [査読有り]
  • Takaaki Deguchi; Yoshiaki Taniguchi; Go Hasegawa; Yutaka Nakamura; Norimichi Ukita; Kazuhiro Matsuda; Morito Matsuoka
    IEICE TRANSACTIONS ON COMMUNICATIONS E99B 2 347 - 355 2016年02月 [査読有り]
     
    In this paper, we propose a workload assignment policy for reducing power consumption by air conditioners in data centers. In the proposed policy, to reduce the air conditioner power consumption by raising the temperature set points of the air conditioners, the temperatures of all server back-planes are equalized by moving workload from the servers with the highest temperatures to the servers with the lowest temperatures. To evaluate the proposed policy, we use a computational fluid dynamics simulator for obtaining airflow and air temperature in data centers, and an air conditioner model based on experimental results from actual data center. Through evaluation, we show that the air conditioners' power consumption is reduced by 10.4% in a conventional data center. In addition, in a tandem data center proposed in our research group, the air conditioners' power consumption is reduced by 53%, and the total power consumption of the whole data center is exhibited to be reduced by 23% by reusing the exhaust heat from the servers.
  • Yoshiaki Taniguchi
    UKSIM-AMSS 10TH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS) 192 - 195 2016年 [査読有り]
     
    In recent years, sensor network technologies have attracted attentions in the field of the primary industry such as the aquaculture industry. We have proposed a fish farm monitoring system for developing efficient farming of tuna. In our monitoring system, a sensor node is attached at fish and its sensing data are gathered at a sink node. In the monitoring environment, the size of fish is varied between 5 cm and 100 cm depending on the age of fish. Therefore, the communication environment is also varied depending on the age. In this paper, we investigate the effect of fish body size on the performance of communication in our monitoring system. Through simulation evaluations, we show that the size of fish significantly affects to the data gathering performance.
  • Koichi Ishida; Yoshiaki Taniguchi; Nobukazu Iguchi
    UKSIM-AMSS 10TH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS) 181 - 185 2016年 [査読有り]
     
    One of the promising sensor network application is for the primary industry and we have proposed a fish farm monitoring system. In our system, sensor data monitored at a fish-mounted sensor node is transmitted to a sink node by using acoustic communication. Since we assume that a sensor node is attached at an abdominal cavity region of fish, the transmission range of acoustic wave is not omni-directional due to obstruction of fish body. In addition, energy efficient control is highly important in our system since it is difficult to replace battery of sensor node. In this paper, we propose a data gathering method taking into account energy efficiency and directional transmission range. In our method, we use the volume of transmission range to determine the timing of packet transmission. Our method does not require control packets for determining its transmission timing. Through simulation evaluations, we show that the data gathering performance of our proposed method is higher than that of comparative methods.
  • Yoshiaki Taniguchi
    International Journal of Simulation: Systems, Science and Technology 17 32 1 - 4 2016年 [査読有り]
     
    In tuna farming, turbidity measurement is highly important since one of the cause of death of tuna is a choking death due to muddy water. In this paper, we consider to use visible light communication modules for estimation of turbidity in underwater environments. If these modules can be used as turbidity meters, additional introduction of dedicated turbidity meters is not necessary. In this paper, through experimental evaluations using off-the-shelf visible light communication modules, we investigate the effect of turbidity on the performance of visible light communication in an underwater environment.
  • Takaya Karasuno; Kazuhiko Masuga; Yoshiaki Taniguchi; Nobukazu Iguchi
    2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS 481 - 482 2016年 [査読有り]
     
    In network education, there are several benefits for conducting cooperative practice among a variety of learning levels of learners. We have proposed a hands-on IP network practice system by constructing a virtual network on a cloud server. In our past study, we introduced a pseudo cooperative practice function to our system so that cooperative practice with a companion agent can be accomplished even if there is no other learner for constructing a group. In this paper, we extend the pseudo cooperative practice function to deal with a variety of learning levels of learners. In our system, the companion agent changes its role automatically depending on the learner's learning level. Through questionnaire investigation, we show the effectiveness of pseudo cooperative practice.
  • Keita Nomura; Yoshiaki Taniguchi; Nobukazu Iguchi; Kenzi Watanabe
    PROCEEDINGS OF 2016 10TH INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT, AND SOFTWARE INTENSIVE SYSTEMS (CISIS) 595 - 598 2016年 [査読有り]
     
    OpenFlow network technologies has attracted attention along with popularization of cloud environment and server virtualization since it enables flexible network configuration. It is expected that existing networks of many organizations will migrate to OpenFlow networks in the future. Since it takes a huge cost to replace all existing network devices to OpenFlow switches, many organizations consider to employ overlay OpenFlow networks where virtual OpenFlow devices are introduced at endpoint servers. In overlay OpenFlow networks, the cost for migration increases according to the number of servers. In this paper, we propose a system for supporting migration to an overlay OpenFlow network. Our proposed system acquires settings of servers in the existing network endpoints and reflects them to the overlay OpenFlow network. Through experimental evaluations, we confirm the behavior of the configuration acquisition function of our proposed system.
  • Yoshiaki Taniguchi; Hiroaki Tsutsumi; Nobukazu Iguchi; Kenzi Watanabe
    Scientific World Journal 2016 1 - 10 2016年 [査読有り]
     
    Software-Defined Networking (SDN) has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator's configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.
  • Yoshiaki Taniguchi; Hiroyuki Hisamatsu
    2016 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, MODELLING AND SIMULATION (ISMS) 356 - 359 2016年 [査読有り]
     
    In the case of cycling at night, it is helpful for cyclist if information on bad road surface condition is obtained autonomously. In this paper, we propose a system for autonomously monitoring road surface condition by using laser light and camera modules. In our system, the laser light module emits grid laser light, and the camera module captures the image of front road area. When our system detects bad road surface condition by processing obtained images, it alerts to the cyclist. In this paper, we apply template matching for detecting obstacles in the front of bicycle. In addition, we implement the system using off-the-shelf node, Raspberry PI, a laser module and a typical bicycle. Through experimental evaluations, we confirm that the monitoring system can detect obstacles in the front of bicycle.
  • Counting pedestrians passing through a line in crowded scenes by extracting optical flows
    Yoshiaki Taniguchi; Miki Mizushima; Go Hasegawa; Hirotaka Nakano; Morito Matsuoka
    Information 19 1 303 - 316 2016年01月 [査読有り]
  • Evaluation of acoustic data communication for fish farm monitoring
    Yoshiaki Taniguchi
    Proceedings of DNCOCO 2015 195 - 199 2015年12月 [査読有り]
  • Yoshiaki Taniguchi; Kodai Nishii; Hiroyuki Hisamatsu
    International Journal of Simulation: Systems, Science and Technology 16 6 1.1 - 1.6 2015年12月 [査読有り]
     
    Monitoring bad road surface condition, such as break, potholes, obstacles, is helpful to prevent accidents in the case of cycling. In this paper, we consider to use low-cost ultrasonic distance sensor for monitoring road surface condition. We design and implement a monitoring system using an off-the-shelf node with a low-cost ultrasonic distance sensor. In the system, ultrasonic signal is periodically emitted to measure the distance from the system to the road so that the road surface condition can be estimated. To limit the sensing region, the ultrasonic distance sensor is covered by a plastic shield plate. Through experimental evaluations, we show that the monitoring system can detect the 360 cm away obstacle on road in the front area of bicycle. In addition, we show that the system also can detect a hole in the front area of bicycle.
  • Takuya Yoshida; Yoshiaki Taniguchi
    Proceedings of ECCS 2015 46 - 53 [情報処理学会関西支部] 2015年11月 [査読有り]
  • Evaluation of interference estimation methods for graph coloring-based link scheduling in wireless relay networks
    Yoshiaki Taniguchi
    Information 18 8 3705 - 3716 2015年08月 [査読有り]
  • Design and evaluation of self-organizing scheduling mechanism adaptive to traffic load for wireless networks
    Yoshiaki Taniguchi; Kyohei Inoue
    Information 18 6A 2503 - 2512 2015年06月 [査読有り]
  • Yoshiaki Taniguchi
    2015 THIRD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, MODELLING AND SIMULATION (AIMS 2015) 408 - 411 2015年 [査読有り]
     
    In undersea environment, development of low-cost communication module is highly important for dissemination of undersea wireless sensor networks. Some undersea wireless sensor network applications do not require high performance communication capability such as transmission distance. If the terrestrial low-cost communication module can be used in the undersea environment, it is possible to use the module in some undersea wireless sensor networks. In this paper, we evaluate the communication capability of a commercially available WiFi device in an undersea environment. In the experiment, we use a mobile access point as a sender node and an Android tablet as a receiver node. Through evaluations, we show that the transmission distance of WiFi device is around 0.1 m in an undersea environment. In addition, we evaluate a fish farm monitoring system based on WiFi modules through simulations.
  • Kazuki Fukuyama; Yoshiaki Taniguchi; Nobukazu Iguchi
    2015 IEEE 4TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE) 21 - 22 2015年 [査読有り]
     
    Education of network security has attracted a lot of attentions due to increasing unauthorized access, lack of engineers who have network security skills, and so on. Although practice using actual computer networks is highly important for network security education, it requires costs to prepare a computer network for practice. We have proposed a network security learning system by constructing a virtual network on one PC so that low-cost, easy and safe practice can be accomplished. In this paper, we introduce an attacker agent that automatically attacks servers in a fixed pattern for supporting practical learning of defense techniques safely on a virtual network.
  • Yoshiaki Taniguchi; Kodai Nishii; Hiroyuki Hisamatsu
    PROCEEDINGS 7TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE, COMMUNICATION SYSTEMS AND NETWORKS CICSYN 2015 31 - 34 2015年 [査読有り]
     
    In the case of cycling at a blind road, at night or cycling by elderly people, it is helpful to prevent accidents if information on bad road surface condition, such as break, potholes, obstacles, bumps, is preliminary obtained. In this paper, we consider to use a low-cost ultrasonic distance sensor attached on a bicycle for monitoring the road surface conditions in the front area. We design and implement a road surface condition monitoring system using an off-the-shelf node Arduino, an ultrasonic distance sensor, and a typical bicycle. In the implemented system, to limit the sensing region, the ultrasonic distance sensor is covered by a plastic shield plate. Through experimental evaluations, we show that the monitoring system can detect the 223 cm away obstacle on road in the front area of moving bicycle.
  • Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E97D 12 3163 - 3170 2014年12月 [査読有り]
     
    As interdomain routing protocol, BGP is fairly simple, and allows plenty of policies based on ISPs' preferences. However, recent studies show that BGP routes are often non-optimal in end-to-end performance, due to technological and economic reasons. To obtain improved end-to-end performance, overlay routing, which can change traffic routing in application layer, has gained attention. However, overlay routing often violates BGP routing policies and harms ISPs' interest. In order to take the advantage of overlay to improve the end-to-end performance, while overcoming the disadvantages, we propose a novel interdomain overlay structure, in which overlay nodes are operated by ISPs within an ISP alliance. The traffic between ISPs within the alliance could be routed by overlay routing, and the other traffic would still be routed by BGP. As economic structure plays very important role in interdomain routing, so we propose an effective and fair charging and pricing scheme within the ISP alliance in correspondence with the overlay routing structure. Finally, we give a simple pricing algorithm, with which ISPs can find the optimal prices in the practice. By mathematical analysis and numerical experiments, we show the correctness and convergence of the pricing algorithm.
  • Shuto Fujii; Yoshiaki Taniguchi; Go Hasegawa; Morito Matsuoka
    SPRINGERPLUS 3 1 - 10 2014年06月 [査読有り]
     
    In this paper, we propose a method for estimating the number of pedestrians walking in opposite directions, as in cases of a shopping street or a sidewalk in a downtown area. The proposed method utilizes a compound-eye sensor that is constructed by placing two binary sensors for the pedestrians' movement direction and multiple binary sensors for the vertical direction of the pedestrians' movement direction. A number of Monte Carlo simulations about the movement of pedestrians are conducted, and the output history of the compound-eye sensor is obtained in each simulation. The simulation scenario with a small difference of the output history of the compound-eye sensor is selected to estimate the number of pedestrians. Evaluation results show that in the field whose width is 8 [m] the relative error in the proposed method is the smallest by using 2 x 8 binary sensors.
  • Design and evaluation of time slot assignment algorithm for IEEE 802.16j relay networks
    Go Hasegawa; Shoichi Takagi; Yoshiaki Taniguchi; Hirotaka Nakano; Morito Matsuoka
    International Journal of Computer Networks 6 3 50 - 65 2014年06月 [査読有り]
  • Modeling and evaluation of a ceiling-mounted compound-eye sensor
    Yoshiaki Taniguchi; Hirotaka Nakano
    Information 17 2 663 - 676 2014年02月 [査読有り]
  • Kohei Higo; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano; Morito Matsuoka
    2014 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT) 437 - 441 2014年 [査読有り]
     
    In IEEE 802.16j relay networks, time division multiple access (TDMA) is adopted for sharing wireless network resources while avoiding radio wave interference. Time slot assignment determines the degree of spatial reuse of wireless network resources and radio interference strength, which affects network performance. The relay network performance is also influenced by various factors, such as background noise level, path loss exponent, density of relay nodes, and transmission signal strength. In this paper, we present the results of multiple regression analysis of IEEE 802.16j relay network throughput. We first summarize the network environment parameters that affect the throughput of relay networks and conduct extensive simulation experiments with various sets of parameter values. From the simulation results, we investigate the relative effect of parameters on throughput performance by multiple regression analysis. The analysis results show that background noise level and path loss exponent are the key parameters for determining relay network throughput. We also obtain a regression equation to estimate the throughput with enough accuracy.
  • Shoichi Takagi; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano; Morito Matsuoka
    2014 SEVENTH INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND UBIQUITOUS NETWORKING (ICMU) 83 - 84 2014年 [査読有り]
     
    In this paper, we propose two heuristic algorithms for time slot assignment in IEEE 802.16j relay networks. In the proposed methods, we calculate an appropriate group of time slots for each link in the network or calculate an appropriate group of links for each time slot. We show that the latter algorithm is better in terms of the balance between the calculation time and network performance.
  • Yoshiaki Taniguchi
    PROCEEDINGS 2014 4TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE WITH APPLICATIONS IN ENGINEERING AND TECHNOLOGY ICAIET 2014 292 - 297 2014年 [査読有り]
     
    In time division multiple access (TDMA) based wireless networks, graph coloring based link scheduling mechanisms are often considered to assign time slots to links. A graph coloring based link scheduling mechanism requires a radio interference estimation method to make a conflict graph from a wireless network topology, and the protocol method is usually used among radio interference estimation methods. In this paper, we propose a radio interference estimation method for wireless relay networks, where the network topology is a tree. Through simulation experiments, we show that the accuracy of radio interference estimation with our proposed method is improved compared to that with the protocol method.
  • Takaaki Deguchi; Yoshiaki Taniguchi; Go Hasegawa; Yutaka Nakamura; Norimichi Ukita; Kazuhiro Matsuda; Morito Matsuoka
    2014 IEEE 3RD INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET) 420 - 425 2014年 [査読有り]
     
    We proposed a workload assignment policy for reducing power consumption by air conditioners in data centers. Power consumption was estimated by computational fluid dynamics for both the conventional equipment arrangement and the tandem arrangement newly developed to reuse the exhaust heat from servers. To reduce the air conditioner power consumption by raising the temperature set points of the air conditioners, the temperatures of all server back-planes were equalized by moving workload from the servers with the highest temperatures to the servers with the lowest temperatures. Consequently, the air conditioners' power consumption was reduced by 10.4% in the conventional arrangement. In the tandem arrangement, the air conditioners' power consumption was reduced by 53%, and also the total power consumption of the whole data center was exhibited to be reduced by 23% by reusing the exhaust heat from the servers.
  • Yoshiaki Taniguchi
    2014 INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS, AND CONTROL TECHNOLOGY (I4CT) 130 - 134 2014年 [査読有り]
     
    Under regular or heavy traffic conditions, contention-free mechanisms such as time division multiple access (TDMA) are considered as under layer mechanisms in wireless networks. In TDMA mechanisms, links are scheduled by assigning different time slots for links that interfere each other. In this paper, we propose a self-organizing link scheduling mechanism for single-hop wireless networks considering traffic load of each wireless link. The proposed mechanism is based on a conventional desynchronization-based TDMA mechanism. Through simulation evaluations, it is shown that our proposed mechanism can schedule links in a self-organizing manner in accordance with traffic load of each link.
  • Yoshiaki Taniguchi; Masahiro Sasabe; Takafumi Watanabe; Hirotaka Nakano
    SCIENTIFIC WORLD JOURNAL 2014 1 - 7 2014年 [査読有り]
     
    We propose a method for tracking multiple pedestrians using a binary sensor network. In our proposed method, sensor nodes are composed of pairs of binary sensors and placed at specific points, referred to as gates, where pedestrians temporarily change their movement characteristics, such as doors, stairs, and elevators, to detect pedestrian arrival and departure events. Tracking pedestrians in each subregion divided by gates, referred to as microcells, is conducted by matching the pedestrian gate arrival and gate departure events using a Bayesian estimation-based method. To improve accuracy of pedestrian tracking, estimated pedestrian velocity and its reliability in a microcell are used for trajectory estimation in the succeeding microcell. Through simulation experiments, we show that the accuracy of pedestrian tracking using our proposed method is improved by up to 35% compared to the conventional method.
  • Pedestrian counting based on the number of salient points considering non-linear effect of occlusions
    Kazuyuki Hashimoto; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano; Morito Matsuoka
    Proceedings of CSECS 2013 26 - 33 2013年12月 [査読有り]
  • Counting pedestrians passing through a line in video sequences based on optical flow extraction
    Miki Mizushima; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano; Morito Matsuoka
    Proceedings of CSECS 2013 129 - 136 2013年12月 [査読有り]
  • Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    Journal of Communications 8 6 389 - 397 2013年06月 [査読有り]
     
    In this paper, we propose self-organizing trans mission and sleep scheduling mechanisms for periodically gathering sensor data at a base station in wireless sensor networks. In our proposed mechanisms, we use a conventional self-organizing communication mechanism based on phase-locking in a pulse-coupled oscillator model to propagate sensor data from the edge of the network to the base station in order of hop counts from the base station. In addition, we propose two mechanisms to avoid collisions among sensor nodes with the same hop count, a randomization-based mechanism and a desynchronizationbased mechanism based on anti-phase synchronization in the pulse-coupled oscillator model. Through simulation experiments, we show that our proposed mechanism significantly improves the data gathering ratio and energy-efficiency in comparison with the conventional mechanism. ©2013 Engineering and Technology Publishing.
  • Effect of radio wave obstruction by obstacles on performance of IEEE 802.16j wireless multi-hop relay networks
    Go Hasegawa; Yuuki Ise; Yoshiaki Taniguchi; Hirotaka Nakano
    International Journal on Advances in Networks and Services 6 1-2 17 - 26 2013年06月 [査読有り]
  • Monte Carlo-based bi-directional pedestrian counting method for compound-eye sensor systems
    Shuto Fujii; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    Journal of Emerging Trends in Computing and Information Sciences 4 48 - 57 2013年04月 [査読有り]
  • Economically efficient interdomain overlay network based on ISP alliance
    Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of ICNS 2013 153 - 159 2013年03月 [査読有り]
  • Pedestrian counting in video sequences based on optical flow clustering
    Shizuka Fujisawa; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    International Journal of Image Processing 7 1 1 - 16 2013年02月 [査読有り]
  • Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E96D 2 193 - 201 2013年02月 [査読有り]
     
    Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
  • Yoshiaki Taniguchi; Masahiro Sasabe; Satoshi Aihara; Hirotaka Nakano
    SCIENTIFIC WORLD JOURNAL 2013 1 - 8 2013年 [査読有り]
     
    We consider a pedestrian tracking system where sensor nodes are placed only at specific points so that the monitoring region is divided into multiple smaller regions referred to as microcells. In the proposed pedestrian tracking system, sensor nodes composed of pairs of binary sensors can detect pedestrian arrival and departure events. In this paper, we focus on pedestrian tracking in microcells. First, we investigate actual pedestrian trajectories in a microcell on the basis of observations using video sequences, after which we prepare a pedestrian mobility model. Next, we propose a method for pedestrian tracking in microcells based on the developed pedestrian mobility model. In the proposed method, we extend the Bayesian estimation to account for time-series information to estimate the correspondence between pedestrian arrival and departure events. Through simulations, we show that the tracking success ratio of the proposed method is increased by 35.8% compared to a combinatorial optimization-based tracking method.
  • Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    IEICE Transactions on Information and Systems E96-D 5 1115 - 1124 2013年 [査読有り]
     
    The Internet is composed of many distinct networks, operated by independent Internet Service Providers (ISPs). The traffic and economic relationships of ISPs are mainly decided by their routing policies. However, in today's Internet, overlay routing, which changes traffic routing at the application layer, is rapidly increasing and this challenges the validity of ISPs' existing agreements. We study here the economic implications of overlay routing for ISPs, using an ISP interconnection business model based on a simple network. We then study the overlay traffic patterns in the network under various conditions. Combining the business model and traffic patterns, we study the ISPs' cost reductions with Bill-and-Keep peering and paid peering. We also discuss the ISPs' incentive to upgrade the network under each peering strategy. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.
  • Tomoya Kitayama; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    International Conference on Information Networking 606 - 611 2013年 [査読有り]
     
    IEEE 802.16j-based wireless relay networks adopt time division multiple access, where time slots are assigned to communication links as transmission opportunities. When we employ adaptive modulation and coding for data transmission on wireless links, the transmission bitrate is affected by the signal to interference and noise ratio. Therefore, algorithms that assign time slots to links are important for enhancing the performance of relay networks. When we employ relay networks to access backhaul networks, the bottleneck link is likely to be located near the gateway node, and dominates the performance of the relay network. In this paper, we propose a time slot-adding algorithm to improve bottleneck link throughput in IEEE 802.16j relay networks. Although we employ an existing method for the initial assignment of time slots to links in the network, we introduce novel algorithm to add more time slots to the bottleneck link. Performance evaluations confirm that the proposed method improves data transfer throuzhput by up to around 30%. © 2013 IEEE.
  • Ryosuke Mine; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA) 107 - 113 2013年 [査読有り]
     
    Time slot assignment algorithms in IEEE 802.16j multi-hop relay networks often assume simple radio interference models based on the distance or the number of hops between nodes for simplicity. However, by using more detailed models that consider the signal to interference plus noise ratio, we expect to obtain more effective time slot assignment which gives higher network performance. In this paper, we evaluate the performance of time slot assignment algorithms based on various radio interference models by considering differences in the radio propagation environment and the use of adaptive modulation and coding. Through performance evaluations, we clarify the effect of the parameter settings in the radio interference models on the network performance. We also demonstrate that by carefully choosing the parameters in the simple models, we can obtain almost the same network performance as from the detailed models.
  • Go Hasegawa; Shinpei Tanaka; Yoshiaki Taniguchi; Hirotaka Nakano
    IEICE TRANSACTIONS ON COMMUNICATIONS E95B 5 1793 - 1801 2012年05月 [査読有り]
     
    In this paper, the authors focus on upstream transmission in TDMA-based IEEE 802.16j and propose two time slot assignment algorithms to decrease end-to-end transmission latency. One of the proposed algorithms assigns time slots considering the hop count from a gateway node, and the other takes the path from the relay node to the gateway node into account. In addition, a restriction in assigning time slots is introduced to reduce the delay at each relay node. The algorithms with the restriction assign later time slots considering the time slot order of links connecting a relay node. The performance of the proposed algorithms is evaluated through simulation experiments from the viewpoints of frame size and end-to-end transmission latency, and it is confirmed that the proposed algorithms achieve small transmission latency regardless of packet generation rate in the network, and decrease the transmission latency by up to 70% compared with the existing algorithm.
  • Evaluation of IEEE 802.16j relay network performance considering obstruction of radio wave propagation by obstacles
    Yuuki Ise; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of ICNS 2012 63 - 68 2012年03月 [査読有り]
  • Node repositioning method based on topology information in IEEE 802.16j relay networks
    Takafumi Shigefuji; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of ICNS 2012 57 - 62 2012年03月 [査読有り]
  • Pedestrian counting in video sequences using optical flow clustering
    Shizuka Fujisawa; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of CSS 2012 51 - 56 2012年03月 [査読有り]
  • Time slot assignment algorithms for reducing transmission latency in IEEE 802.16j multi-hop relay networks
    Go Hasegawa; Rintaro Ishii; Yoshiaki Taniguchi; Hirotaka Nakano
    Journal of Communications and Networking 2 3 2012年03月 [査読有り]
  • Shuto Fujii; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    2012 INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND INDUSTRIAL INFORMATICS (ICCSII) 1 - 6 2012年 [査読有り]
     
    In this paper, we propose a method for estimating the number of pedestrians walking in opposite directions, as in the case of a corridor. The proposed method utilizes a ceiling-mounted compound-eye sensor composed of two binary sensors with partially overlapping sensing regions. The output of the compound-eye sensor is sent to a monitoring server, where a number of Monte Carlo simulations are conducted. The simulation scenario with the smallest difference from the output history of the compound-eye sensor is selected as an estimate of the number of pedestrians. Simulations show that in crowded situations the relative error in the proposed method decreases by up to 45% compared to an existing method.
  • Taniguchi Yoshiaki; Kanzaki Akimitsu; Wakamiya Naoki; Hara Takahiro
    Information and Media Technologies 7 1 448 - 457 Information and Media Technologies Editorial Board 2012年 
    Wireless sensor network technologies have attracted a lot of attention in recent years. In this paper, we propose an energy-efficient data gathering mechanism using traveling wave and spatial interpolation for wireless sensor networks. In our proposed mechanism, sensor nodes schedule their message transmission timing in a fully-distributed manner such that they can gather sensor data over a whole wireless sensor network and transmit that data to a sink node while switching between a sleep state and an active state. In addition, each sensor node determines the redundancy of its sensor data according to received messages so that only necessary sensor data are gathered and transmitted to the sink node. Our proposed mechanism does not require additional control messages and enables both data traffic and control traffic to be drastically reduced. Through simulation experiments, we confirmed that with our proposed mechanism, the number of message transmissions can be reduced by up to 77% and the amount of transmitted data can be reduced by up to 13% compared to a conventional mechanism.
  • Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    14th Asia-Pacific Network Operations and Management Symposium: "Management in the Big Data and IoT Era", APNOMS 2012 - Final Program 1 - 7 2012年 [査読有り]
     
    Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic.We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy. © 2012 IEEE.
  • Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    2012 2nd International Conference on Digital Information Processing and Communications, ICDIPC 2012 84 - 89 2012年 [査読有り]
     
    We propose self-organizing transmission scheduling mechanisms for periodically gathering sensor data at a base station in wireless sensor networks. In our proposed mechanisms, sensor nodes self-organize message transmission and sleep timings. To propagate sensor data from the edge of the network to the base station in order of hop counts from the base station, we use a conventional self-organizing communication mechanism based on phase-locking in a pulse-coupled oscillator model. We propose two mechanisms to avoid collisions among sensor nodes with the same hop count, a randomization-based mechanism and a desynchronization-based mechanism based on anti-phase synchronization in the pulse-coupled oscillator model. Simulation experiments confirm that our mechanism significantly improves the data gathering ratio in comparison with the conventional mechanism. © 2012 IEEE.
  • Go Hasegawa; Shoichi Takemori; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of the 9th International Conference on Information Technology, ITNG 2012 71 - 76 2012年 [査読有り]
     
    In general, wireless mesh networks provides wireless Internet access service to client terminals that exist in the coverage area of the network. In such networks, the coverage area size and its overlap degree have a significant effect on network performance. In order to determine the coverage area size for each node, it is important to use the location information of neighboring nodes. However, such information cannot be always obtained. In the present paper, we introduce the method to determine the coverage area size only by utilizing the distance information estimated from received signal strength. Specifically, in proposed method, each node estimates the relative locations of its neighboring nodes based on the estimated distance information. It then calculates its Voronoi area, and sets its coverage area size based on the shape of Voronoi area. We conduct simulation experiments to evaluate the performance of the proposed method in terms of total covered ratio, coverage overlap, and energy consumption. We confirm that our method can keep more than 99% of total covered ratio regardless of the node density and reduce the energy consumption more than 50% than that of existing method. © 2012 IEEE.
  • Yoshiaki Taniguchi; Akimitsu Kanzaki; Naoki Wakamiya; Takahiro Hara
    Journal of Information Processing 20 1 167 - 176 2012年 [査読有り]
     
    Wireless sensor network technologies have attracted a lot of attention in recent years. In this paper, we propose an energy-efficient data gathering mechanism using traveling wave and spatial interpolation for wireless sensor networks. In our proposed mechanism, sensor nodes schedule their message transmission timing in a fully-distributed manner such that they can gather sensor data over a whole wireless sensor network and transmit that data to a sink node while switching between a sleep state and an active state. In addition, each sensor node determines the redundancy of its sensor data according to received messages so that only necessary sensor data are gathered and transmitted to the sink node. Our proposed mechanism does not require additional control messages and enables both data traffic and control traffic to be drastically reduced. Through simulation experiments, we confirmed that with our proposed mechanism, the number of message transmissions can be reduced by up to 77% and the amount of transmitted data can be reduced by up to 13% compared to a conventional mechanism. © 2012 Information Processing Society of Japan.
  • Gyeongyeon Kang; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E94D 11 2191 - 2200 2011年11月 [査読有り]
     
    In time division multiple access (TDMA)-based wireless mesh networks, interference relationships should be considered when time slots are assigned to links. In graph theory-based time slot assignment algorithms, the protocol interference model is widely used to determine radio interference information, although it is an inaccurate model of actual radio interference. On the other hand, the signal-to-interference-plus-noise-ratio model (SINR model) gives more accurate interference relationships but is difficult to apply to time slot assignment algorithms since the radio interference information cannot be determined before time slot assignment. In this paper, we investigate the effect of the parameters of the protocol interference model on the accuracy of the interference relationships determined using this model. Specifically, after assigning time slots to links based on the protocol interference model with various interference ratios, which is the major parameter of the protocol interference model, we compare the interference relationship among links in the protocol interference and SINR models. Through simulation experiments, we show that accuracy of the protocol interference model is improved by up to 15% by adjusting the interference ratios of the protocol interference model.
  • The implication of overlay routing on ISPs' connecting strategies
    Xun Shao; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    Proceedings of ITC 2011 286 - 293 2011年09月 [査読有り]
  • Masakazu Murata; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E94D 5 1035 - 1044 2011年05月 [査読有り]
     
    In the present paper, we propose an object tracking method called scenario-type hypothesis object tracking. In the proposed method, an indoor monitoring region is divided into multiple closed micro-cells using sensor nodes that can detect objects and their moving directions. Sensor information is accumulated in a tracking server through wireless multihop networks, and object tracking is performed at the tracking server. In order to estimate the trajectory of objects from sensor information, we introduce a novel concept of the virtual world, which consists of virtual micro-cells and virtual objects. Virtual objects are generated, transferred, and deleted in virtual micro-cells according to sensor information. In order to handle specific movements of objects in micro-cells, such as slowdown of passing objects in a narrow passageway, we also consider the generation of virtual objects according to interactions among virtual objects. In addition, virtual objects are generated when the tracking server estimates loss of sensor information in order to decrease the number of object tracking failures. Through simulations, we confirm that the ratio of successful tracking is improved by up to 29% by considering interactions among virtual objects. Furthermore, the tracking performance is improved up to 6% by considering loss of sensor information.
  • Yoshiaki Taniguchi; Tomoya Kitani; Kenji Leibnitz
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS 9 3-4 182 - 191 2011年 [査読有り]
     
    The performance of wireless sensor networks in terms of coverage, connectivity, lifetime and robustness is greatly influenced by the initial physical placement of the sensor nodes. In this paper we propose a novel deployment method for sensor nodes, when a large number of nodes is distributed from the air in a monitoring region that is inaccessible from the ground. In our deployment method, each sensor node is equipped with a parachute and a device to switch between its two falling behaviours (gliding and falling) in the air. After being dropped from midair, sensor nodes stochastically coordinate their falling behaviour in order to distribute themselves uniformly in the monitoring region. In addition, each sensor node exchanges messages with neighbouring nodes while being airborne and it changes its falling behaviour according to the density of the neighbouring nodes in order to reduce non-uniform areas. Through simulation evaluations, we confirm that our proposal can achieve a high uniformity in the placement of the nodes compared to a traditional airdrop method.
  • Gyeongyeon Kang; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    PROCEEDINGS OF THE SEVENTH ADVANCED INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (AICT 2011) 26 - 31 2011年 [査読有り]
     
    Radio interference should be taken into account to assign time slots to links in time division multiple access (TDMA)-based wireless mesh networks. In many graph theory-based time slot assignment algorithms, the protocol interference model is widely used to obtain radio interference information, although this model is considered to be inaccurate when compared with actual radio interference. On the other hand, the signal-to-interference-plus-noise-ratio model (SINR model) is a well-known and accurate model of radio interference. However, the SINR model requires time slot information to obtain radio interference relationship, and thus it is difficult to apply the SINR model to graph theory-based time slot assignment algorithms. In this paper, we extend the protocol interference model to represent radio interference more accurately for wireless mesh networks. To do this, we adjust the interference ratio parameter of the protocol interference model by considering SINR. We propose three methods for adjusting this parameter. Through simulation, it is shown that higher accuracy of the protocol interference model can be achieved by adjusting the interference ratio parameter for each node.
  • Shimpei Tanaka; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    PROCEEDINGS OF THE SEVENTH ADVANCED INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (AICT 2011) 6 - 11 2011年 [査読有り]
     
    In IEEE 802.16j wireless multihop networks, transmission latency from relay nodes to a gateway node is one of the important performance metrics. The transmission latency is mainly affected by a scheduling delay at every relay node, which is determined by algorithms for assigning time slots to wireless links between relay nodes. In this paper, we propose 2 kinds of time slot assignment algorithms for upstream wireless links in IEEE 802.16j multihop networks. One of the proposed algorithms assigns time slots considering the hop count from a gateway node, and the other takes the path from the relay node to the gateway node into account. We evaluated the performance of the proposed algorithms through simulation experiments and confirmed that our algorithms can decrease the upstream latency by up to 15% compared with the existing method, without increasing the average transmission latency of the entire network.
  • Yoshiaki Taniguchi; Akimitsu Kanzaki; Naoki Wakamiya; Takahiro Hara
    2011 International Conference on Communications, Computing and Control Applications, CCCA 2011 1 - 6 2011年 [査読有り]
     
    In this paper, we propose an autonomous and energy-efficient data gathering mechanism with transmission reduction for wireless sensor networks (WSNs). In our proposed mechanism, sensor nodes schedule their message transmission timing in a self-organizing manner such that they can gather sensor data over a whole WSN and transmit that data to a sink node while switching between a sleep state and an active state. In addition, each sensor node determines the redundancy of its sensor data according to overheard messages so that only necessary sensor data are gathered and transmitted to the sink node. Our proposed mechanism does not require additional control messages and enables both data traffic and control traffic to be drastically reduced. Through simulation experiments, we confirmed that the number of message transmissions can be reduced by up to 77% with our proposed mechanism compared to a conventional mechanism. © 2011 IEEE.
  • Service area deployment of IEEE 802.16j wireless relay networks: service area coverage, energy consumption, and resource utilization efficiency
    Shoichi Takemori; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    International Journal on Advances in Internet Technology 3 1-2 43 - 52 2010年09月 [査読有り]
  • Rintaro Ishii; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010 265 - 270 2010年 [査読有り]
     
    In this paper, we propose an assignment algorithm of time slots for wireless links in IEEE 802.16 multi-hop relay networks. The main purpose is to reduce transmission latency between user stations and base stations as well as maintaining total network throughput. The proposed algorithm is based on the existing method, which aims better network throughput and guarantees certain frame length, but changes the order of time slot assignment without network throughput changed to decrease the transmission latency. It also accommodates the weighted time slot assignment, which is consistent with IEEE 802.16j specifications. Performance evaluation is conducted through both of simulation experiments and numerical calculations and confirm that the proposed algorithm can decrease the transmission latency by up to 15% on average compared with the existing random assignment algorithm, and can provide an time slot assignment with smaller transmission latency in shorter calculation time. © 2010 IEEE.
  • Masakazu Murata; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010 200 - 205 2010年 [査読有り]
     
    In recent years, wireless communication technologies such as ZigBee have been developed. By constructing a wireless sensor network from infrared sensors with those wireless technologies, it is possible to track moving objects in a wide monitoring region. In this paper, we propose an object tracking method by dividing a wide monitoring region into small multiple regions called "micro cells". Pair of infrared sensors is placed at borders among micro cells to detect objects and their movement direction, and sensor information are gathered to a tracking server through wireless or wired networks. In our proposed method, the tracking server maintains virtual micro cells and virtual objects which indicate a variety of hypotheses of object trajectories. A virtual object is generated, moved, and removed in virtual micro cells appropriately according to sensor information and interactions among virtual objects, so that the tracking server keeps a number of object trajectory hypotheses for each object. When an object departs from the monitoring region, the virtual object with highest likelihood is selected as the estimated object trajectory. Through preliminary simulation evaluations, we confirm that tracking accuracy is improved up to 1.94 times higher by making virtual objects appropriately. © 2010 IEEE.
  • Masakazu Murata; Yoshiaki Taniguchi; Go Hasegawa; Hirotaka Nakano
    Proceedings of SeNAmI 2009 2009年12月 [査読有り]
  • An airdrop deployment method for sensor nodes with coordinated gliding and falling
    Yoshiaki Taniguchi; Tomoya Kitani; Kenji Leibnitz
    Proceedings of ESSA 2009 41 - 48 2009年04月 [査読有り]
  • Shoichi Takemori; Go Hasegawa; Yoshiaki Taniguchi; Hirotaka Nakano
    3rd International Conference on Mobile Ubiquitous Computing, Systems, Services, and Technologies, UBICOMM 2009 163 - 168 2009年 [査読有り]
     
    In wireless mesh networks based on IEEE 802.16 WiMAX, each mesh node has its own service area that provides wireless Internet access service to client terminals. The network performance degrades due to radio interference when multiple service areas overlap with each other. To avoid this problem, information of the exact location and size of the service area of neighboring mesh nodes is useful for each mesh node to determine its own service area size. However, the availability of the information depends on the topology construction procedure. In this paper, we discuss a method to determine the size of service areas using the information obtained in topology construction based on IEEE 802.16 WiMAX. Specifically, each mesh node estimates the distance to the nearest neighboring node, and sets the service area size based on this distance. Through performance evaluation, we confirm that our method can increase the size of a single-covered area by an average of 32% compared with the existing method, which is the constant service radius, and can reduce the maximum number of overlapped service areas by approximately 50%.© 2009 IEEE.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    Journal of Networks 3 8 16 - 25 2008年 [査読有り]
     
    By applying a proxy mechanism widely used in WWW systems to video streaming systems, low-delay and high-quality video distribution can be accomplished without imposing extra load on the system. The video streaming system proposed in this paper consists of a video server and multiple proxy servers. In our mechanism, proxies communicate with each other and retrieve missing video data from an appropriate server by taking into account transfer delay and offerable quality. In addition, the quality of cached video data is adapted appropriately at a proxy to cope with the client-to-client heterogeneity in terms of the available bandwidth, end-system performance, and user preferences on the perceived video quality. Through simulation experiments, it is shown that our proposed mechanism can provide users with low-delay and high-quality video streaming services. Furthermore, to verify our mechanism, we implement a real system for MPEG-4 video streaming services and show that our proxy caching system can provide users with a continuous video distribution under dynamically changing network conditions. © 2008 Academy Publisher.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata; Takashi Fukushima
    Proceedings of New Technologies, Mobility and Security Conference and Workshops, NTMS 2008 52 - 56 2008年 [査読有り]
     
    In wireless sensor networks (WSNs), the frequency of sensing and data gathering depends on application requirements and surrounding conditions. In this paper, we propose a data gathering scheme adaptive to sensing requirements for WSNs composed of sensor nodes with multiple sensing capabilities. To accomplish self-organizing control, we adopt the response threshold model for adaptive sensing task engagement and the pulse-coupled oscillator model for energy-efficient transmission and sleep scheduling. Through preliminary simulation experiments, we confirm that autonomous and energy-efficient data gathering can be accomplished satisfying dynamically changing sensing requirements. © 2008 ESRGroups.
  • A traveling wave based communication mechanism for wireless sensor networks
    Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    Journal of Networks 2 5 24 - 32 2007年09月 [査読有り]
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    WSEAS Transactions on Communications 6 10 824 - 832 2007年 [査読有り]
     
    In this paper, we propose, design, implement, and evaluate a proxy caching system for MPEG-4 video streaming services for heterogeneous users. In our system, a video stream is divided into blocks for efficient use of the cache buffer and the bandwidth. A proxy retrieves a block from a server, deposits it in its local cache buffer, and provides a requesting client with the block in time. It maintains the cache with limited capacity by replacing unnecessary, cached blocks with a newly retrieved one. It also prefetches video blocks that are expected to be required in the near future. In addition, the proxy server adjusts the quality of block appropriately, because clients are heterogeneous, in terms of the available bandwidth, end-system performance, and so on. Through evaluations, we proved that our proxy caching system could provide users with a continuous and high-quality video streaming service in a heterogeneous environment.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    SENSYS'07: PROCEEDINGS OF THE 5TH ACM CONFERENCE ON EMBEDDED NETWORKED SENSOR SYSTEMS 399 - 400 2007年 [査読有り]
     
    We have proposed a simple and energy-efficient communication mechanism which can organize a variety of communication depending on dynamically changing application requirements. In this demonstration, we show that our mechanism can gather or diffuse information in accordance with application requirements in a dynamic wireless sensor network.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 1 - 6 2007年 [査読有り]
     
    In this paper, we propose and evaluate a self-organizing communication mechanism for wireless sensor networks where a large number of sensor nodes are deployed. To accomplish application-oriented periodic communication without any centralized controls, we adopt traveling wave phenomena of a pulse-coupled oscillator model by regarding sensor nodes as oscillators and emission of radio signals as firing. Through simulation experiments, we confirm that our mechanism delivers sensor information to / from a designated node in a more energy-efficient manner than other method, although it takes time to generate a traveling wave. In addition, we implement our mechanism using MOTE MICAz and verify its practicality. © 2007 IEEE.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    EIGHTH INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS, PROCEEDINGS 562 - + 2007年 [査読有り]
     
    In this paper, we propose a self-organizing communication mechanism for a wireless sensor network where a large number of sensor nodes are deployed. To accomplish application-oriented periodic communication without any centralized controls, we adopt traveling wave phenomena of a pulse-coupled oscillator model by regarding sensor nodes as oscillators and the emission of radio signals as firing. We first investigat conditions of a phase-response curve to attain wave-formed firing patterns regardless of the initial phase of oscillators. We adopte the derived phase-response curve to accomplish the desired form of message propagation through local and mutual interactions among neighboring sensor nodes. Through simulation experiments, we confirm that our mechanism can gather or diffuse information effectively in accordance with the application's requirements.
  • Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata
    APSITT 2005: 6th Asia-Pacific Symposium on Information and Telecommunication Technologies, Proceedings 299 - 304 2005年 [査読有り]
     
    The development of low-cost microsensor equipment having the capability of wireless communications has caused sensor network technology to attract the attention of many researchers and developers. In this paper, we propose a fully-distributed and self-organizing data gathering scheme for a network where a large number of sensor nodes are deployed. To accomplish the periodic data gathering without centralized controls, we adopt the pulse-coupled oscillator model based on biological mutual synchronization such as that observed in flashing fireflies. By adjusting parameters and functions in the model according to application's requirements and conditions surrounding a sensor network, we can control the frequency, the form, and the direction of information propagation which is observed as a wave. In this paper, we show how to organize traveling waves in the model and how to adapt the model to data gathering in sensor networks.
  • Y Taniguchi; N Wakamiya; M Murata
    INTERNET MULTIMEDIA MANAGEMENT SYSTEMS V 5601 288 - 299 2004年 [査読有り]
     
    The proxy mechanism widely used in WWW systems offers low-delay and scalable delivery of data by means of a "proxy server". By applying proxy mechanism to video streaming systems, high-quality and low-delay video distribution can be accomplished without imposing extra load on the system. We have proposed proxy caching mechanisms to accomplish the high-quality and highly-interactive video streaming services. In our proposed mechanisms, proxies communicate with each other, retrieve a missing video data from an appropriate server by taking into account transfer delay and offerable quality. In addition, the quality of cached video data can be adapted appropriately in the proxy to cope with the client-to-client heterogeneity, in terms of the available bandwidth, end-system performance, and user preferences on the perceived video quality. In this paper, to verify the practicality of our mechanisms, we implemented them on a real system for MPEG-4 video streaming services, and conducted experiments. Through evaluations, it was shown that our proxy caching system can provide users with a continuous and high-quality video distribution in accordance with network condition.
  • Implementation and evaluation of proxy caching system for MPEG-4 video streaming with quality adjustment mechanism
    Yoshiaki Taniguchi; Atsushi Ueoka; Naoki Wakamiya; Masayuki Murata; Fumio Noda
    Proceedings of the 5th AEARU Workshop on Web Technology 27 - 34 2003年10月 [査読有り]
  • M Sasabe; Y Taniguchi; N Wakamiya; M Murata; H Miyahara
    IEICE TRANSACTIONS ON COMMUNICATIONS E86B 6 1849 - 1858 2003年06月 [査読有り]
     
    The proxy mechanism widely used in WWW systems offers low-delay data delivery by means of "proxy server." By applying proxy mechanisms to video streaming system, we expect that high-quality and low-delay video distribution can be accomplished without introducing extra load on the system, in addition, it is effective to adapt the quality of cached video data appropriately in the proxy if user requests are diverse due to heterogeneity in terms of the available bandwidth, end-system performance, and user's preferences on the perceived video quality. In this paper, we propose proxy caching mechanisms to accomplish high-quality and low-delay video streaming services. In our proposed system, a video stream is divided into blocks for efficient use of cache buffer. A proxy cache server is assumed to be able to adjust the quality of cached or retrieved video blocks to requests through video filters. We evaluate our proposed mechanisms in terms of the required buffer size, the play-out delay and the video quality through simulation experiments. Furthermore, to verify the practicality of our mechanisms, we implement our proposed mechanisms on a real system and conducted experiments. Through evaluations from several performance aspects, it is shown that our proposed mechanisms can provide users with a low-latency and high-quality video streaming service in a heterogeneous environment.
  • Implementation and evaluation of proxy caching mechanisms with video quality adjustment
    Masahiro Sasabe; Yoshiaki Taniguchi; Naoki Wakamiya; Masayuki Murata; Hideo Miyahara
    Proceedings of ITC-CSCC 2002 121 - 124 2002年07月 [査読有り]

MISC

  • 初学者向けCTF Slackアプリの開発と評価
    山下達也; 谷口義明 電子情報通信学会関西支部 第28回学生会研究発表講演会論文集 2024年03月
  • 施設内におけるBluetooth方向探知機能を用いた人の通過検知システムのための基礎評価
    今尾廉; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2023論文集 117 -118 2023年12月
  • 近畿大学情報学部KDIXにおけるセキュリティ人材育成の取り組み
    谷口義明; 福田洋治; 吉原和明; 広永美喜也; 水谷后宏; 柏崎礼生; 溝渕昭二; 森山真光; 毛利公美; 井口信和 令和5年電気関係学会関西連合大会講演集 212 -213 2023年11月 [招待有り]
  • 環境変動下における自己組織型ノイズ無線通信号の送信手法の評価
    大山拓海; 谷口義明 令和5年度電気・情報関係学会北海道支部連合大会講演集 2023年10月
  • LEDパネルを用いたBLEアドバタイジングパケットの可視化システムの検討
    秋山周平; 佐伯嶺治; 谷口義明 令和5年度電気・情報関係学会北海道支部連合大会講演集 2023年10月
  • 無線LAN環境におけるチャネル状態情報を用いた機器位置の認識に関する検討
    泉本侑哉; 馬渕大泰; 谷口義明 2023年度情報処理学会関西支部支部大会講演集 2023年09月
  • スマートフォンによる受信電波強度を利用したBLE機器の把握支援システムの開発
    稲葉亮太; 谷口義明 2023年度情報処理学会関西支部支部大会講演集 2023年09月
  • 施設内におけるBluetooth方向探知機能を用いた位置推定システムの基礎検討
    今尾廉; 谷口義明; 井口信和 2023年度情報処理学会関西支部支部大会講演集 2023年09月
  • 人間が発する特徴音による合成音声判別システムの検討
    塗木優也; 谷口義明 2023年度電気・情報関係学会九州支部連合大会予稿集 2023年09月
  • ダンス動画から曲情報を検索するシステムの開発
    田中努; 谷口義明 電子情報通信学会関西支部 第27回学生会研究発表講演会論文集 2023年03月
  • スマートフォンからのBLE信号を用いた 出席状況確認アプリの開発
    奥島翔夢; 谷口義明; 井口信和 情報処理学会第85回全国大会講演論文集 2023年03月
  • 計測値の収集を効率化した 無線LAN 通信性能マップ表示システムの開発
    片山赳杜; 谷口義明; 井口信和 情報処理学会第85回全国大会講演論文集 2023年03月
  • BLEパケットの観測に基づくIoT 機器の把握支援システム
    小林佑太郎; 谷口義明 情報処理学会第85回全国大会講演論文集 2023年03月
  • 無線LAN環境のセキュリティ診断システムの開発
    泉本侑哉; 谷口義明 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • 養殖魚モニタリング環境下における残余電力を考慮した情報転送方式の検討
    小村巧; 谷口義明 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • MACアドレスがランダム化されたBLEパケットからの同一機器推定手法の改良と評価
    秋山周平; 谷口義明 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • 大学内Slackワークスペースの運用管理補助エージェントの開発
    山下和真; 坂田志旺; 谷口義明 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • 施設内におけるBLEを用いた混雑度推定システムの評価
    今尾廉; 谷口義明; 井口信和 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • 失敗体験から学習する無線 LAN のセキュリティリスク学習システムの開発
    塩田晃平; 谷口義明; 井口信和 2022年度情報処理学会関西支部支部大会講演集 2022年09月
  • 複合現実空間での協調演習を可能とするネットワーク構築演習システムの実装
    森本健次郎; 谷口義明; 井口信和 教育システム情報学会 2022年度全国大会講演論文集 2022年08月
  • MACアドレスがランダム化されたBLE機器が移動する場合の同一機器推定手法
    秋山周平; 谷口義明 情報処理学会マルチメディア、分散、協調とモバイルシンポジウム2022論文集 2022年07月
  • Unityを用いた密集回避のための狭域的な混雑度可視化システムの開発
    今尾廉; 谷口義明; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • QRコードを用いた出席管理システムの開発
    松本幸大; 谷口義明; 越智洋司; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • チャネル状態情報を用いた IoT 機器の管理支援システムの開発
    稲葉亮太; 谷口義明; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • 攻撃者視点を取り入れたWebアプリケーションセキュリティに関するセキュアプログラミングの実践的演習システムの開発
    岸本和理; 谷口義明; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • ゴールベースシナリオ理論に基づいた無線LAN のセキュリティリスク学習システムの開発
    塩田晃平; 谷口義明; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • 複合現実を用いた協調演習を可能とする ネットワーク演習システムの開発
    森本健次郎; 谷口義明; 井口信和 情報処理学会第84回全国大会講演論文集 2022年03月
  • 無線網における盗聴を困難とするための自己組織型ノイズ無線信号送信手法の改良
    大山拓海; 谷口義明 情報処理学会第84回全国大会講演論文集 2022年03月
  • 移動機器のBLEアドバタイジングパケットからの同一機器推定手法の検討
    秋山周平; 谷口義明 情報処理学会第84回全国大会講演論文集 2022年03月
  • 養殖魚モニタリングのための可視光通信モジュールの改良と評価
    筧浩平; 谷口義明 情報処理学会第84回全国大会講演論文集 2022年03月
  • 複合現実を用いた協調演習を可能とする ネットワーク演習システムの検討
    森本健次郎; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2021論文集 73 -74 2021年11月
  • 無線ネットワークにおいて盗聴を困難とするための自己組織型ノイズ無線信号送信手法の検討
    大山拓海; 大和聖; 谷口義明 2021年度情報処理学会関西支部支部大会講演集 1 -6 2021年09月
  • MACアドレスがランダム化されたBLE機器の同定手法
    秋山周平; 森本涼也; 谷口義明 2021年度情報処理学会関西支部支部大会講演集 1 -7 2021年09月
  • 複合現実を用いたネットワーク演習システムの検討
    森本健次郎; 谷口義明; 井口信和 2021年度情報処理学会関西支部支部大会講演集 1 -2 2021年09月
  • 無線LAN利用者のセキュリティ意識向上を目的とした無線LANセキュリティリスク体験型学習システムの開発
    塩田晃平; 谷口義明; 井口信和 2021年度情報処理学会関西支部支部大会講演集 1 -2 2021年09月
  • 大学キャンパス内混雑度モニタリングシステムの実装と評価
    小林佑太郎; 橋本啓吾; 谷口義明; 越智洋司; 井口信和 2021年度情報処理学会関西支部支部大会講演集 1 -7 2021年09月
  • 養殖魚モニタリングのための可視光通信モジュールの開発と評価
    筧浩平; 水島弘樹; 今中聖尋; 谷口義明 2021年度情報処理学会関西支部支部大会講演集 1 -6 2021年09月
  • エネルギーハーベスティングを考慮した養殖魚モニタリング環境下における情報転送方式の評価
    小村巧; 谷口義明 2021年度情報処理学会関西支部支部大会講演集 1 -7 2021年09月
  • 小型無線端末を用いた大学内ソーシャルディスタンスモニタリングシステムの実装と評価
    小林佑太郎; 谷口義明; 越智洋司; 井口信和 情報処理学会第83回全国大会講演論文集 3 217 -218 2021年03月
  • エネルギーハーベスティングを考慮した養殖魚モニタリングシステム
    小村巧; 谷口義明 情報処理学会第83回全国大会講演論文集 3 215 -216 2021年03月
  • サーバルームにおける複合現実を用いたケーブル長測定システムの開発
    森本健次郎; 谷口義明; 井口信和 情報処理学会第83回全国大会講演論文集 3 73 -74 2021年03月
  • 脆弱なパスワードが設定されたIoT機器の管理及ひパスワード自動変更システムの開発
    塩田晃平; 江川悠斗; 谷口義明; 井口信和 情報処理学会第83回全国大会講演論文集 3 449 -450 2021年03月
  • BLEアドバタイジングパケットを利用した大学キャンパス内の混雑度モニタリングシステム
    向田朋樹; 谷口義明; 越智洋司; 井口信和 電子情報通信学会技術研究報告 120 (315) 63 -68 2021年01月
  • IoT機器一覧表示システムにおける受信電波強度を利用したナビゲーション機能の開発
    江川悠斗; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2020論文集 56 -62 2020年12月 [査読有り]
  • IoT 機器一覧表示システムにおける機器位置特定のためのナビーション機能の開発
    江川悠斗; 谷口義明; 井口信和 2020年度情報処理学会関西支部支部大会講演集 1 -4 2020年09月
  • 複数台のデバイスとのWi-Fiチャネル状態情報を用いた人物認識の検討
    馬渕大泰; 谷口義明; 白浜公章 2020年度情報処理学会関西支部支部大会講演集 1 -5 2020年09月
  • 小型無線端末を用いた大学内ソーシャルディスタンスモニタリングシステムの検討
    小林佑太郎; 谷口義明; 多田昌裕; 波部斉; 越智洋司; 溝渕昭二; 半田久志; 井口信和 2020年度情報処理学会関西支部支部大会講演集 1 -7 2020年09月
  • 動画を用いた生簀内クロマグロ稚魚の尾数推定
    覚野陽生; 阿部孝司; 波部斉; 谷口義明; 井口信和 電子情報通信学会関西支部 第25回学生会研究発表講演会論文集 2020年03月
  • 映像を用いた生簀内クロマグロの尾数計測
    金田彩花; 阿部孝司; 波部斉; 谷口義明; 井口信和; 阿部悟; 鳥澤眞介; 高木力 電子情報通信学会関西支部 第25回学生会研究発表講演会論文集 2020年03月
  • Wi-Fiチャネル状態情報を用いた人物推定の検討
    馬渕大泰; 谷口義明; 白浜公章 情報処理学会第82回全国大会講演論文集 3 285 -286 2020年03月
  • IoT機器一覧表示システムにおける表示アドレスと実際の機器との対応付けを補助する機能の検討
    江川悠斗; 谷口義明; 井口信和 情報処理学会第82回全国大会講演論文集 3 289 -290 2020年03月
  • 任意のBLE機器を水中で使用するための音響通信変換モジュールの開発
    増田裕斗; 谷口義明; 波部斉; 阿部孝司; 井口信和 電子情報通信学会関西支部 第25回学生会研究発表講演会論文集 2020年03月
  • 通信距離に制限のある養殖魚モニタリング環境下における情報転送方式の評価
    小村巧; 首藤誠陽; 谷口義明 電子情報通信学会関西支部 第25回学生会研究発表講演会論文集 2020年03月
  • メガネ型デバイスを用いた視線方向端末とBluetoothイヤホンの自動接続切替システムの開発
    小西佑; 谷口義明 令和元年度電気・情報関連学会中国支部連合大会講演集 1 -2 2019年10月
  • 増田裕斗; 谷口義明; 波部斉; 阿部孝司; 井口信和 2019年度情報処理学会関西支部支部大会講演集 2019 1 -4 2019年09月
  • IoT機器一覧表示システムにおける機器位置の把握支援機能導入の検討
    江川悠斗; 谷口義明; 井口信和 2019年度情報処理学会関西支部支部大会講演集 1 -5 2019年09月
  • 無線LAN内でキャプチャした無線フレームを利用したIoT機器一覧表示システム
    江川悠斗; 谷口義明; 井口信和 情報処理学会第81回全国大会講演論文集 3 111 -112 2019年03月
  • 田中勝; 阿部孝司; 波部斉; 谷口義明; 井口信和 映像情報メディア学会冬季大会講演予稿集(CD-ROM) 2019 2019年
  • トポロジの可視化と直感的なタッチ操作による素早いネットワーク制御を可能とするオーバレイ型 OpenFlowネットワーク運用管理支援システム
    藤田紘生; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2018論文集 40 -40 2018年12月
  • 電磁シールドを用いたIoT機器セキュリティ検証システムの検討
    浮田博揮; 谷口義明; 井口信和 平成30年度電気関係学会関西連合大会講演集 325 -326 2018年12月
  • 田中勝; 阿部孝司; 波部斉; 谷口義明; 井口信和 平成30年電気学会電子・情報・システム部門大会講演論文集 2018 1340 -1341 2018年09月
  • 複数のソナーを用いた養殖魚尾数推定の基礎検討
    大木寛成; 谷口義明 情報処理学会第80回全国大会講演論文集 3 387 -388 2018年03月
  • 電磁シールドを用いた無線LANルータの設定検証システムの提案
    浮田博揮; 谷口義明; 井口信和 情報処理学会第80回全国大会講演論文集 3 195 -196 2018年03月
  • 養殖魚モニタリング環境におけるDTN ルーティング手法を用いた情報収集の基礎評価
    首藤誠陽; 石田晃一; 谷口義明 平成29年度電気関係学会関西連合大会講演集 309 -310 2017年11月
  • 無線LANルータのセキュリティ検証システムの提案
    浮田博揮; 谷口義明; 井口信和 平成29年度電気関係学会関西連合大会講演集 307 -308 2017年11月
  • 無線ネットワークにおける盗聴を困難とするためのノイズ無線信号送信に関する基礎検討
    松下敬昭; 谷口義明 平成29年度電気・情報関係学会九州支部連合大会予稿集 221 -222 2017年09月
  • 田端央; 谷口義明; 井口信和 2017年度情報処理学会関西支部支部大会講演集 1 -4 2017年09月
  • IPネットワーク構築演習支援システムにおける課題自動作成機能の性能評価
    烏野貴也; 谷口義明; 井口信和 教育システム情報学会 2017年度全国大会講演論文集 361 -362 2017年08月
  • 養殖魚モニタリング環境下における情報収集のための データ送信タイミング決定手法の評価
    石田晃一; 谷口義明; 井口信和 情報処理学会第79回全国大会講演論文集 241 -242 2017年03月
  • クラウドを活用したサーバ学習環境構築システムの開発
    浮田博揮; 谷口義明; 井口信和 教育システム情報学会 2016年度学生研究発表会 99 -100 2017年02月
  • IPネットワーク構築演習支援システムにおける課題自動作成機能の実装
    烏野貴也; 谷口義明; 井口信和 教育システム情報学会 2016年度学生研究発表会 101 -102 2017年02月
  • 画像による水の濁度推定
    寺澤佑也; 阿部孝司; 波部斉; 谷口義明; 井口信和 電子情報通信学会関西支部 第22回学生会研究発表講演会論文集 2017年02月
  • ホップバイホップ方式およびオーバーレイ方式に対応したOpenFlowネットワーク移行支援システム
    野村圭太; 谷口義明; 井口信和; 渡辺健次 情報処理学会インターネットと運用技術シンポジウム2016論文集 75 -82 2016年12月 [査読有り]
  • IPネットワーク構築演習支援システムにおける協調学習エージェントの検討
    烏野貴也; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2016論文集 74 2016年12月
  • 石田理佐子; 石田晃一; 谷口義明; 波部斉; 阿部孝司; 井口信和 平成28年度電気関係学会関西連合大会講演集 2016 230 -231 2016年11月
  • 岸田大輔; 阿部孝司; 波部斉; 谷口義明; 井口信和 第26回インテリジェントシステムシンポジウム講演論文集 26th 108 -111 2016年10月
  • 清水涼太; 阿部孝司; 波部斉; 谷口義明; 井口信和 平成28年度電気・情報関係学会九州支部連合大会予稿集 2016 418 -418 2016年09月
  • 石田晃一; 谷口義明; 井口信和 2016年度情報処理学会関西支部支部大会講演集 1 -5 2016年09月
  • 早川諒; 谷口義明; 溝渕昭二; 井口信和 2016年度情報処理学会関西支部支部大会講演集 1 -5 2016年09月
  • 八塚友彦; 谷口義明; 波部斉; 阿部孝司; 井口信和 2016年度情報処理学会関西支部支部大会講演集 1 -5 2016年09月
  • 経路収束を可視化する動的ルーティング学習支援システムの開発
    烏野貴也; 谷口義明; 井口信和 教育システム情報学会 2015年度学生研究発表会 63 -64 2016年03月
  • IPネットワーク構築演習における課題演習を対象とした自動採点システムの検討
    早川諒; 谷口義明; 井口信和 教育システム情報学会 2015年度学生研究発表会 61 -62 2016年03月
  • 養殖魚モニタリング環境下での水中無線通信手法の評価
    石田晃一; 谷口義明 電子情報通信学会関西支部 第21回学生会研究発表講演会論文集 49 2016年03月
  • 既存WiFiアクセスポイントからの受信電波強度を用いた在室人数推定
    吉田拓矢; 谷口義明 情報処理学会第78回全国大会講演論文集 3 415 -416 2016年03月
  • OSPFネットワークの再現を可能とする動的ルーティング学習支援システム
    烏野貴也; 谷口義明; 井口信和 情報処理学会第78回全国大会講演論文集 4 817 -818 2016年03月
  • オーバーレイ型OpenFlowネットワークへの移行支援システムの検討
    野村圭太; 谷口義明; 井口信和; 渡辺健次 情報処理学会インターネットと運用技術シンポジウム2015論文集 44 -49 2015年11月 [査読有り]
  • 仮想マシンを活用したネットワークセキュリティ学習支援システムにおける攻撃者エージェントの実装と評価
    福山和生; 谷口義明; 井口信和 情報処理学会インターネットと運用技術シンポジウム2015論文集 73 -78 2015年11月 [査読有り]
  • 吉田拓矢; 谷口義明 2015年度情報処理学会関西支部支部大会講演集 1 -8 2015年09月
  • 岸田大輔; 阿部孝司; 波部斉; 谷口義明; 井口信和 平成27年電気学会電子・情報・システム部門大会講演論文集 2015 1293 -1296 2015年08月
  • ルータの設定をOpenFlowネットワークへ反映可能とするシステムの開発
    野村圭太; 堤啓彰; 谷口義明; 井口信和 情報処理学会第77回全国大会講演論文集 3 359 -360 2015年03月
  • 無線ネットワークにおける自己組織型重み付きスケジューリング
    井上紘兵; 谷口義明 電子情報通信学会関西支部 第20回学生会研究発表講演会論文集 34 2015年03月
  • TDMA型無線網におけるリンクスケジューリングのための電波干渉推定手法の評価
    伊礼泊正敏; 谷口義明 電子情報通信学会関西支部 第20回学生会研究発表講演会論文集 35 2015年03月
  • 超音波距離センサを用いた自転車安全運転支援システムの一検討
    西井広大; 谷口義明 電子情報通信学会関西支部 第20回学生会研究発表講演会論文集 73 2015年03月
  • OpenFlowネットワークモニタリングシステムの開発
    堤啓彰; 谷口義明; 井口信和; 渡辺健次 情報処理学会インターネットと運用技術シンポジウム2014論文集 23 -30 2014年12月 [査読有り]
  • 仮想マシンを活用したネットワークセキュリティ学習支援システムにおける攻撃者エージェントの検討
    福山和生; 谷口義明; 井口信和 電子情報通信学会技術研究報告 114 (305) 37 -42 2014年11月
  • 藤井崇渡; 谷口義明; 長谷川剛; 松岡茂登 電子情報通信学会技術研究報告 113 (472) 67 -72 2014年03月
  • 菅沼孝二; 出口孝明; 谷口義明; 長谷川剛; 中村泰; 浮田宗伯; 松田和浩; 松岡茂登 電子情報通信学会技術研究報告 113 (472) 185 -190 2014年03月
  • 出口孝明; 谷口義明; 長谷川剛; 中村泰; 浮田宗伯; 松田和浩; 松岡茂登 電子情報通信学会技術研究報告 113 (472) 191 -196 2014年03月
  • 肥後恒平; 長谷川剛; 谷口義明; 中野博隆; 松岡茂登 電子情報通信学会技術研究報告 113 (472) 231 -236 2014年03月
  • 高木祥一; 長谷川剛; 谷口義明; 中野博隆; 松岡茂登 電子情報通信学会技術研究報告 113 (472) 237 -242 2014年03月
  • オプティカルフロー検出に基づく混雑環境下における仮想ゲート通過人数推定手法
    水嶋未来; 谷口義明; 長谷川剛; 中野博隆; 松岡茂登 画像電子学会第269回研究会講演予稿集 133 -139 2014年02月
  • 坪内佑樹; 長谷川 剛; 谷口義明; 中野博隆; 松岡茂登 電子情報通信学会技術研究報告 113 (244) 67 -72 2013年10月
  • 藤井崇渡; 谷口義明; 長谷川剛; 中野博隆; 松岡茂登 電子情報通信学会技術研究報告 113 (132) 183 -188 2013年07月
  • オクルージョンが与える影響を考慮した動画像中の特徴点数に基づく歩行者数計測手法
    橋本和幸; 谷口義明; 長谷川剛; 中野博隆 第41回画像電子学会年次大会予稿集 1 -5 2013年06月
  • 北山智也; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (464) 13 -18 2013年03月
  • 三根量輔; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (464) 343 -348 2013年03月
  • Xun Shao; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (492) 13 -18 2013年03月
  • 田上拓弥; 谷口義明; 長谷川剛; 中野博隆 画像電子学会第264回研究会講演予稿集 264 37 -44 2013年02月
  • 北山智也; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (231) 47 -52 2012年10月
  • 高木祥一; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (231) 53 -58 2012年10月
  • 三根量輔; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (218) 37 -42 2012年09月
  • Xun Shao; 長谷川 剛; 谷口 義明; 中野 博隆 研究報告インターネットと運用技術（IOT） 2012 (6) 1 -6 2012年05月
  • Xun Shao; 長谷川 剛; 谷口 義明; 中野 博隆 研究報告コンピュータセキュリティ（CSEC） 2012 (6) 1 -6 2012年05月
  • Xun Shao; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 112 (22) 121 -126 2012年05月
  • 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 112 (30) 1 -6 2012年05月
  • 藤澤志寿加; 長谷川剛; 谷口義明; 中野博隆 画像電子学会第260回研究会講演予稿集 260 123 -129 2012年03月
  • 重藤隆文; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 111 (468) 345 -350 2012年03月
  • 伊勢悠輝; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 111 (469) 157 -162 2012年03月
  • 藤井崇渡; 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 112 (111) 13 -18 2012年
  • Yoshiaki Taniguchi; Akimitsu Kanzaki; Naoki Wakamiya; Takahiro Hara 情報処理学会論文誌 52 (12) 10p 2011年12月
  • IEEE 802.16jネットワークにおける障害物による電波遮断の影響を考慮した性能評価
    伊勢悠輝; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会第9回QoSワークショップ予稿集 1 -2 2011年11月
  • オプティカルフローのクラスタリングによる通行人数のリアルタイム計測手法
    藤澤志寿加; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会第9回QoSワークショップ予稿集 1 -2 2011年11月
  • 北山智也; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 111 (67) 13 -18 2011年05月
  • Xun Shao; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 111 (43) 13 -18 2011年05月
  • 今城健太郎; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (455) 93 -98 2011年03月
  • 姜京延; 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 110 (448) 145 -150 2011年03月
  • 竹森翔一; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (448) 187 -192 2011年03月
  • 田中慎平; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (448) 181 -186 2011年03月
  • 谷口義明; 神崎映光; 若宮直紀; 原隆浩 情報処理学会研究報告 2011-DPS-146 (39) 1 -7 2011年03月
  • 重藤隆文; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会第8回QoSワークショップ予稿集 1 -2 2010年11月
  • 田中慎平; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (240) 49 -54 2010年10月
  • 姜京延; 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 110 (240) 55 -60 2010年10月
  • 伊勢悠輝; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (191) 61 -66 2010年09月
  • 竹森翔一; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 110 (18) 37 -42 2010年04月
  • 足利えりか; 谷口義明; 長谷川剛; 中野博隆 画像電子学会第250回研究会講演予稿集 129 -136 2010年03月
  • 村田将一; 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 109 (449) 157 -162 2010年03月
  • 石井倫太郎; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 109 (449) 199 -204 2010年03月
  • 石井倫太郎; 長谷川剛; 谷口義明; 中野博隆 電子情報通信学会技術研究報告 109 (228) 65 -70 2009年11月
  • 谷口義明; 合田幸裕; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 109 (276) 17 -22 2009年11月
  • 村田将一; 谷口義明; 長谷川剛; 中野博隆 電子情報通信学会技術研究報告 109 (228) 59 -64 2009年10月
  • 木谷友哉; 谷口義明 電子情報通信学会技術研究報告 108 (457) 499 -504 2009年03月
  • 谷口義明; 若宮直紀; 村田正幸; 福島高司 電子情報通信学会技術研究報告 108 (138) 105 -110 2008年07月
  • 谷口義明; 若宮直紀; 村田正幸 電子情報通信学会技術研究報告 107 (146) 1 -6 2007年07月
  • 谷口 義明; 若宮 直紀; 村田 正幸 電子情報通信学会技術研究報告. NS, ネットワークシステム 106 (167) 17 -20 2006年07月
  • 谷口 義明; 若宮 直紀; 村田 正幸 電子情報通信学会技術研究報告. IN, 情報ネットワーク 103 (650) 13 -18 2004年02月
  • 谷口 義明; 上岡 功司; 若宮 直紀; 村田 正幸; 野田 文雄 電子情報通信学会技術研究報告. NS, ネットワークシステム 103 (122) 45 -48 2003年06月
  • 谷口 義明; 笹部 昌弘; 若宮 直紀; 村田 正幸; 宮原 秀夫 電子情報通信学会技術研究報告. CQ, コミュニケーションクオリティ 102 (191) 41 -46 2002年07月
  • 谷口 義明; 笹部 昌弘; 若宮 直紀; 村田 正幸; 宮原 秀夫 映像情報メディア学会技術報告 26 (0) 41 -46 2002年

受賞

  • 2021年03月 TCJ 2020年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2020年08月 TCJ 2019年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2019年08月 TCJ 2018年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2018年08月 TCJ 2017年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2018年02月 IEEE関西支部 メダル受賞
     
    受賞者: 谷口義明
  • 2017年08月 TCJ 2016年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2017年02月 IEEE Senior Member
     
    受賞者: 谷口義明
  • 2016年09月 情報処理学会 シニア会員
     
    受賞者: 谷口義明
  • 2016年08月 TCJ 2015年度優秀インストラクタ賞
     
    受賞者: 谷口義明
  • 2015年10月 IEEE GCCE 2015 Student Paper Award
     
    受賞者: Kazuki Fukuyama;Yoshiaki Taniguchi;Nobukazu Iguchi
  • 2015年06月 情報処理学会 学会活動貢献賞
     
    受賞者: 近畿大学理工学部情報学科
  • 2012年09月 電子情報通信学会通信ソサイエティ 活動功労賞
     
    受賞者: 谷口義明
  • 2012年03月 CSS 2012 Best Paper Award
     
    受賞者: Shizuka Fujisawa;Go Hasegawa;Yoshiaki Taniguchi;Hirotaka Nakano
  • 2011年05月 AICT 2011 Best Paper Award
     international_society 
    受賞者: Gyeongyeon Kang;Yoshiaki Taniguchi;Go Hasegawa;Hirotaka Nakano
  • 2009年11月 UBICOMM 2009 Best Paper Award
     international_society 
    受賞者: Shoichi Takemori;Go Hasegawa;Yoshiaki Taniguchi;Hirotaka Nakano

共同研究・競争的資金等の研究課題

  • 日本学術振興会：科学研究費 基盤研究(C)
    研究期間 : 2023年04月 -2027年03月 
    代表者 : 谷口 義明
  • 養殖場モニタリングのための水中通信方式の開発
    日本学術振興会：科学研究費 基盤研究(C)
    研究期間 : 2019年04月 -2023年03月 
    代表者 : 谷口義明
  • 水棲生物モニタリングのためのセンサ情報収集手法の開発
    日本学術振興会：科学研究費 基盤研究(C)
    研究期間 : 2016年04月 -2019年03月 
    代表者 : 谷口義明
  • 無線網性能向上のための実用的かつ高精度な電波干渉推定手法の開発
    日本学術振興会：科学研究費 基盤研究(C)
    研究期間 : 2013年04月 -2016年03月 
    代表者 : 谷口義明
  • 日本学術振興会：科学研究費 若手研究(B)
    研究期間 : 2011年04月 -2013年03月 
    代表者 : 谷口義明
     
    本研究課題では、センサネットワークにおける、環境変動への適応性が高く電力消費の少ないデータ収集を実現するため、生物の同期メカニズムをモデル化したパルス結合振動子モデルを応用したセンサネットワーク制御手法を提案した。パルス結合振動子モデルにおける位相ロッキング状態および逆相同期状態の2つの同期状態を応用した、センサネットワークのためのデータ収集方式の検討および評価を行った。シミュレーション評価の結果、提案手法を用いることにより、従来手法と比べて低い消費電力、高いデータ収集率を達成できることを示した。
  • 文部科学省：科学研究費 若手研究(B)
    研究期間 : 2009年04月 -2011年03月 
    代表者 : 谷口義明
     
    近年、センサネットワーク技術が大きな注目を集めている。センサネットワークの性能はセンサ端末の初期配置に大きく影響される。本研究では、大量のセンサ端末を一度に空中で散布する際に、センサ端末の一様な初期配置を実現するためのセンサ端末散布法を提案した。提案手法では、空中落下中に自身の落下挙動を切替可能なセンサ端末を想定する。周囲センサ端末との通信結果に基づき落下挙動の切替えタイミングを適切に制御することにより、センサ端末を観測領域に均等に落下させる。シミュレーション評価の結果、提案手法を用いることにより、カバレッジの高いセンサ端末配置を実現できることを示した。
  • 文部科学省：科学研究費 特定領域研究
    研究期間 : 2008年04月 -2011年03月 
    代表者 : 下條真司
     
    近年、いたる所に設置されたセンサデバイスがネットワークを介して大量のデータを送受信する環境が整いつつあり、これらのユビキタスネットワークコンテンツを有効利用するサービスの実現が期待されている。我々は、発生したセンサデータを集め、ネットワーク上で管理し、またサービス提供時には必要なデータを探し出し、探し出したデータを解析するといった一連の処理を効率よく行うために必要な技術について研究開発を行った。

委員歴

  • 2023年04月 - 現在   情報処理学会 モバイルコンピューティングと新社会システム研究会   特任委員
  • 2023年05月 - 2025年05月   情報処理学会 関西支部   幹事
  • 2019年04月 - 2023年03月   情報処理学会 モバイルコンピューティングと新社会システム研究会   運営委員
  • 2017年04月 - 2019年03月   電気学会   都市マルチエージェント・シミュレーション統合手法検討協同研究委員会 委員
  • 2015年04月 - 2019年03月   情報処理学会 モバイルコンピューティングとパーベイシブシステム研究会   特任委員
  • 2016年06月 - 2018年06月   電子情報通信学会 関西支部   支部委員
  • 2013年06月 - 2017年06月   画像電子学会   代議員
  • 2013年04月 - 2017年06月   電子情報通信学会 知的環境とセンサネットワーク研究会   専門委員
  • 2014年11月 - 2016年10月   電気学会 省エネルギー都市の設計・評価に向けたマルチエージェント・シミュレーションと全体最適化技法協同研究委員会   委員
  • 2011年04月 - 2015年03月   情報処理学会 モバイルコンピューティングとユビキタス通信研究会   運営委員
  • 2012年05月 - 2013年05月   電子情報通信学会 アドホックネットワーク研究会   専門委員

担当経験のある科目

  • サイバーセキュリティプロジェクト1近畿大学 情報学部 情報学科
  • ネットワーク演習2近畿大学 情報学部 情報学科
  • 組み込みシステム近畿大学 情報学部 情報学科
  • モバイル通信近畿大学 情報学部 情報学科
  • 知的通信網特論近畿大学 大学院総合理工学研究科 エレクトロニクス系工学専攻
  • ネットワーク技術I近畿大学 理工学部 情報学科
  • ネットワーク演習III近畿大学 理工学部 情報学科
  • センサシステム近畿大学 理工学部 情報学科
  • 通信工学近畿大学 理工学部 情報学科
  • プログラミング実習I近畿大学 理工学部 情報学科
  • 情報システムプロジェクトII近畿大学 理工学部 情報学科
  • 情報実習II近畿大学 理工学部 情報学科
  • ネットワーク演習II近畿大学 理工学部 情報学科
  • プログラミング実習II近畿大学 理工学部 情報学科
  • 暗号と情報セキュリティ近畿大学 理工学部 情報学科
  • セキュリティPBL演習I奈良先端科学技術大学院大学 情報科学研究科
  • 情報探索入門大阪大学 全学共通教育機構
  • 情報科学実験C大阪大学 基礎工学部 情報科学科
  • プログラミングA大阪大学 基礎工学部 情報科学科
  • 情報ネットワーク学演習I大阪大学 大学院情報科学研究科 情報ネットワーク学専攻

その他

  • 2020年04月 - 2021年03月  IoT機器を安全に利用・管理するための無線通信セキュリティ基礎技術の開発 
    近畿大学学内研究助成金 研究種目：奨励研究助成金 課題番号：SR08
  • 2016年04月 - 2017年03月  情報通信技術を用いた二輪車の安全運転支援に関する研究 
    近畿大学学内研究助成金 研究種目：奨励研究助成金 課題番号：SR02

その他のリンク

researchmap


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.