Next Article in Journal
Parallelized Swarm Intelligence Approach for Solving TSP and JSSP Problems
Next Article in Special Issue
Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case
Previous Article in Journal
Special Issue on Ensemble Learning and Applications

Dynamic Ring Exploration with (H,S) View †

Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan
Nara Institute of Science and Technology, 8916-5 Takayamacho, Ikoma, Nara 630-0101, Japan
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in the proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Pisa, Italy, 22–25 October 2019.
Algorithms 2020, 13(6), 141;
Received: 22 April 2020 / Revised: 8 June 2020 / Accepted: 9 June 2020 / Published: 12 June 2020
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the exploration of dynamic networks with complete information or with no information about network changes has been studied, an agent with partial information about the network changes has not been considered yet despite its practical importance. In this paper, we consider the exploration of dynamic networks by a single agent with partial information about network changes. To the best of our knowledge, this is the very first work to investigate the exploration problem with such partial information. As a first step in this research direction, we focus on 1-interval connected rings as dynamic networks in this paper. We assume that the single agent has partial information called the ( H , S ) view by which it always knows whether or not each of the links within H hops is available in each of the next S time steps. In this setting, we show that H + S n and S n / 2 (n is the size of the network) are necessary and sufficient conditions to explore 1-interval connected rings. Moreover, we investigate the upper and lower bounds of the exploration time. It is proven that the exploration time is O ( n 2 ) for n / 2 S < 2 H 1 , O ( n 2 / H + n H ) for S max ( n / 2 , 2 H 1 ) , O ( n 2 / H + n log H ) for S n 1 , and Ω ( n 2 / H ) for any S where H = min ( H , n / 2 ) . View Full-Text
Keywords: distributed algorithms; dynamic networks; 1-interval connected rings; mobile agent; exploration distributed algorithms; dynamic networks; 1-interval connected rings; mobile agent; exploration
Show Figures

Figure 1

MDPI and ACS Style

Gotoh, T.; Sudo, Y.; Ooshita, F.; Masuzawa, T. Dynamic Ring Exploration with (H,S) View. Algorithms 2020, 13, 141.

AMA Style

Gotoh T, Sudo Y, Ooshita F, Masuzawa T. Dynamic Ring Exploration with (H,S) View. Algorithms. 2020; 13(6):141.

Chicago/Turabian Style

Gotoh, Tsuyoshi, Yuichi Sudo, Fukuhito Ooshita, and Toshimitsu Masuzawa. 2020. "Dynamic Ring Exploration with (H,S) View" Algorithms 13, no. 6: 141.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop