5 citations · 16 across the 15 of their papers we have counts for
20 papers · 1 filter
The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata +1
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any…
Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols
Haruki Kanaya, Ryota Eguchi, Taisho Sasada +2
We address the self-stabilizing exact majority problem in the population protocol model, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta (2004). In this model, there a…
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei +4
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights…
Meeting Times of Non-atomic Random Walks
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue +1
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undir…
A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States
Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita +1
We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given an integer satisfying , whe…
Gathering despite a linear number of weakly Byzantine agents
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist agents with unique identifiers (IDs) in th…
Population Protocols for Graph Class Identification Problems
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication g…
Terminating grid exploration with myopic luminous robots
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue
We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and lumi…
Asynchronous Gathering in a Torus
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +2
We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them…
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue +1
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular,…
Self-stabilizing Graph Exploration by a Single Agent
Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei
In this paper, we present two self-stabilizing algorithms that enable a single (mobile) agent to explore graphs. Starting from any initial configuration, \ie regardless of the init…
Gathering with a strong team in weakly Byzantine environments
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of agents with unique identifiers (IDs), an…
Gathering on Rings for Myopic Asynchronous Robots with Lights
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +2
We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring-shaped networks. Different from most work using the Look-Compute-Move (LCM) mod…
Uniform Partition in Population Protocol Model under Weak Fairness
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue
We focus on a uniform partition problem in a population protocol model. The uniform partition problem aims to divide a population into k groups of the same size, where k is a given…
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)
Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama +2
Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. O…
Logarithmic Expected-Time Leader Election in Population Protocol Model
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi +2
In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough kn…
Ring Exploration with Myopic Luminous Robots
Fukuhito Ooshita, Sébastien Tixeuil
We investigate exploration algorithms for autonomous mobile robots evolving in uniform ring-shaped networks. Different from the usual Look-Compute-Move (LCM) model, we consider two…
Partial Gathering of Mobile Agents in Asynchronous Rings
Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita +2
In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is…
Gathering an even number of robots in an odd ring without global multiplicity detection
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +1
We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only…
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +1
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate…