SIBATA Masahiro

写真a

Title

Assistant Professor

Laboratory

680-4 Kawazu, Iizuka-shi, Fukuoka

Research Fields, Keywords

distributed system, mobile agent, mobile robot

E-mail

E-mail address

Phone

+81-948-29-7656

Scopus Paper Info  
Total Paper Count: 0  Total Citation Count: 0  h-index: 4

Citation count denotes the number of citations in papers published for a particular year.

Undergraduate Education 【 display / non-display

  • 2012.03   Osaka University   Faculty of Engineering Science   Graduated   JAPAN

Post Graduate Education 【 display / non-display

  • 2017.03  Osaka University  Graduate School, Division of Information Science  Doctoral Program  Completed  JAPAN

  • 2014.03  Osaka University  Graduate School, Division of Information Science  Master's Course  Completed  JAPAN

Degree 【 display / non-display

  • Osaka University -  Ph.D.  2017.03

  • Osaka University -  Master  2014.03

  • Osaka University -  Bachelor  2012.03

Biography in Kyutech 【 display / non-display

  • 2019.04
    -
    Now

    Kyushu Institute of TechnologyFaculty of Computer Science and Systems Engineering   Department of Computer Science and Networks   Assistant Professor  

  • 2017.03
    -
    2019.03

    Kyushu Institute of TechnologyFaculty of Computer Science and Systems Engineering   Department of Computer Science and Electronics   Assistant Professor  

Academic Society Memberships 【 display / non-display

  • 2019.05
    -
    Now
     

    Information Processing Society in Japan (IPSJ)  JAPAN

  • 2019.01
    -
    Now
     

    The Institute of Electronics, Information, and Computer Engineers (IEICS)  JAPAN

Specialized Field (scientific research fund) 【 display / non-display

  • Theory of informatics

  • Computer system

 

Publications (Article) 【 display / non-display

  • A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets

    Kim Y., Shibata M., Sudo Y., Nakamura J., Katayama Y., Masuzawa T.

    Theoretical Computer Science    874   1 - 14   2021.06  [Refereed]

     View Summary

    In this paper, we introduce a new graph structure named an ST-reachable directed acyclic graph which is a directed acyclic graph (DAG) that guarantees reachability (i.e., a directed path exists) from every sender to every target. When an arbitrarily connected undirected graph G=(V,E) and two sets of the vertices, senders S (⊂V) and targets T (⊂V), are given, we consider the construction of a minimal ST-reachable DAG by changing some undirected edges to arcs and removing the remaining edges. In this paper, we present the necessary and sufficient condition under which a minimal ST-reachable DAG can be constructed when |S|≤2 and |T|≤2, and propose a self-stabilizing algorithm for constructing a minimal ST-reachable DAG (if it exists) when an arbitrarily connected undirected graph, S(|S|≤2) and T(|T|≤2) are given. Moreover, our proposed algorithm can detect the non-existence of any ST-reachable DAG if the ST-reachable DAG of the given graph and two sets of vertices, S and T, do not exist.

    DOI Scopus

  • TDMA-based scheduling for multi-hop wireless sensor networks with 3-egress gateway linear topology

    Nguyen Vu Linh, Nguyen Viet Ha, Masahiro Shibata, and Masato Tsuru

    Internet of Things; Engineering Cyber Physical Human Systems , vol.14, 2021      2021.06  [Refereed]

    DOI

  • Gathering of seven autonomous mobile robots on triangular grids

    Shibata M., Ohyabu M., Sudo Y., Nakamura J., Kim Y., Katayama Y.

    2021 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2021 - In conjunction with IEEE IPDPS 2021      566 - 575   2021.06  [Refereed]

     View Summary

    In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes (nodes where a robot exists) constitutes one connected graph, robots reach a configuration such that the maximum distance between two robots is minimized. For the case of seven robots, gathering is achieved when one robot has six adjacent robot nodes (they form a shape like a hexagon). In this paper, we aim to clarify the relationship between the capability of robots and the solvability of gathering on a triangular grid. In particular, we focus on visibility range of robots. To discuss the solvability of the problem in terms of the visibility range, we consider strong assumptions except for visibility range. Concretely, we assume that robots are fully synchronous and they agree on the direction and orientation of the x-axis, and chirality in the triangular grid. In this setting, we first consider the weakest assumption about visibility range, i.e., robots with visibility range 1. In this case, we show that there exists no collision-free algorithm to solve the gathering problem. Next, we extend the visibility range to 2. In this case, we show that our algorithm can solve the problem from any connected initial configuration. Thus, the proposed algorithm is optimal in terms of visibility range.

    DOI Scopus

  • Gathering of seven autonomous mobile robots on triangular grids

    Masahiro Shibata, Masaki Ohyhabu, Yuichi Sudo, Junya Nakamura, Yonghwan Kim, and Yoshiaki Katayama

    Proceedings of the 23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM)      2021.05  [Refereed]

  • Effective Route Scheme of Multicast Probing to Locate High-loss Links in OpenFlow Networks

    Tri Minh Nguyen, Masahiro Shibata, and Masato Tsuru

    IPSJ Journal of Information Processing      2021.02  [Refereed]

    DOI

display all >>

Conference Prsentations (Oral, Poster) 【 display / non-display

  • オイラーグラフの辺素な閉路分解問題の計算困難性

    石井 柊汰, 川原田 隼介, 牧 佑河, 宮野 英次, 輝, 柴田 将拡, 鶴 正人

    電気・情報関係学会九州支部連合大会  2021.09  -  2021.09 

  • Many-to-many file transfers based on multipath multicast with sender coding

    Koki Ito, Masahiro Shibata, and Masato Tsuru

    Technical Report of IEICE (ICM2021-17)  2021.07  -  2021.07 

  • P4-based efficient packet retransmission using in-network cache -Introduction to Coded-MPMC one-to-many transfer-

    Masayuki Kurata, Masahiro Shibata, and Masato Tsuru

    Technical Report of IEICE (IN2020-86)  2021.03  -  2021.03 

  • Algorithms for uniform deployment of mobile agents in dynamic rings

    Masahiro Shibata, Yuichi Sudo, Junya Nakamura, and Yonghwan Kim

    2020.03  -  2020.03 

  • リード・ソロモン符号化複数経路マルチキャスト転送の最適スケジュールを生成するためのブロック割当法

    倉田 真之, 柴田 将拡, 鶴 正人

    火の国情報シンポジウム  2020.03  -  2020.03 

display all >>

Lectures 【 display / non-display

  • Partial gathering and uniform deployment of mobile agents

    Workshop on Distributed Algorithms for Low-Functional Robots   2019.11 

  • 自律的集散のためのモバイルエージェント移動制御アルゴリズム

    第11回DTNとその未来に関するワークショップ   2017.11.17 

  • 自律的集散のためのモバイルエージェント移動アルゴリズム

    日本オペレーションズ・リサーチ学会九州支部 平成29年度第1回講演・研究会   2017.07.15 

  • Uniform deployment of mobile agents in asynchronous unidirectional ring networks

    Workshop on Advanced Distributed Algorithms (WADA)   2016.11.23 

  • Partial gathering and uniform deployment of mobile agents in ring networks

    Move and Computing, 6th Research Meeting on Distributed Computing by Mobile Robots (MAC)   2016.09 

 

Activities of Academic societies and Committees 【 display / non-display

  • 2019.04
    -
    2019.09

    International Conference on Intelligent Networking and Collaborative Systems (INCoS)  

  • 2018.06
    -
    2018.11

    International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)   Publicity chair

  • 2017.04
    -
    Now

    International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)   Program Committee