#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (18)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita
- SIROCCO
- 2010

Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of time… (More)

- Sayaka Kamei, Hirotsugu Kakugawa
- SRDS
- 2002

- Hirotsugu Kakugawa, Sayaka Kamei, Toshimitsu Masuzawa
- IEEE Transactions on Parallel and Distributed…
- 2008

The group mutual exclusion problem is a generalization of mutual exclusion problem such that a set of processes in the same group can enter critical section simultaneously. In this paper, we propose a distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. Our algorithm is based on tokens, and a… (More)

- Sayaka Kamei, Hirotsugu Kakugawa
- IEICE Transactions
- 2005

- Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil
- SIROCCO
- 2011

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 to reach a single vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ringshaped networks suggest that there exists a tradeoff… (More)

- Sayaka Kamei, Hirotsugu Kakugawa
- OPODIS
- 2008

- Sayaka Kamei, Hirotsugu Kakugawa
- 2007 IEEE International Parallel and Distributed…
- 2007

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory corruption, and topology change. Because such transient faults occur so frequently in mobile ad hoc networks, distributed algorithms on them… (More)

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 local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the nonatomic CORDA model with asynchronous fair scheduling. In… (More)