Gracefully Degrading Gathering in Dynamic Rings

Bournat, Marjorie; Dubois, Swan; Petit, Franck

doi:10.1007/978-3-030-03232-6_23

Cited by 11 publications

(7 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [13] the problem of PERPETUAL EXPLORATION (i.e., every node is to be visited infinitely often ) was studied in temporally connected (i.e., may not be always connected but connected over time) graphs. Other problems studied in dynamic graphs include GATHERING [3,21,24], DISPERSION [1,18], PATROLLING [6] etc.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Exploring a Dynamic Ring without Landmark

Das¹,

Bose²,

Sau³

2021

Preprint

View full text Add to dashboard Cite

Consider a group of autonomous mobile computational entities, called agents, arbitrarily placed at some nodes of a dynamic but always connected ring. The agents neither have any knowledge about the size of the ring nor have a common notion of orientation. We consider the EXPLORATION problem where the agents have to collaboratively to explore the graph and terminate, with the requirement that each node has to be visited by at least one agent. It has been shown by Di Luna et al. [Distrib. Comput. 2020] that the problem is solvable by two anonymous agents if there is a single observably different node in the ring called landmark node. The problem is unsolvable by any number of anonymous agents in absence of a landmark node. We consider the problem with non-anonymous agents (agents with distinct identifiers) in a ring with no landmark node. The assumption of agents with distinct identifiers is strictly weaker than having a landmark node as the problem is unsolvable by two agents with distinct identifiers in absence of a landmark node. This setting has been recently studied by Mandal et al. [ALGOSENSORS 2020]. There it is shown that the problem is solvable in this setting by three agents assuming that they have edge crossing detection capability. Edge crossing detection capability is a strong assumption which enables two agents moving in opposite directions through an edge in the same round to detect each other and also exchange information. In this paper we give an algorithm that solves the problem with three agents without the edge crossing detection capability.

show abstract

Section: Related Workmentioning

confidence: 99%

“…For any (u, v) ∈ S, we define φ((u, v)) to be the position of (u, v) in this arrangement. For example, if k = 4, then the elements of S, arranged in lexicographic order, are (1,2), (1,3), (1,4), (2,3), (2,4), (3,4). Therefore, we have φ((2, 4)) = 5 and φ((3, 4)) = 6.…”

mentioning

confidence: 99%

Exploring a Dynamic Ring without Landmark

Das¹,

Bose²,

Sau³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The investigation on the use of mobile agents within dynamic graphs started relatively recently: following the way pursued in the static networks context, these studies focused mainly on the problems of exploration, patrolling and gathering ( Gotoh et al, 2020 ; Mandal, Molla & Moses, 2020 ; Das, Di Luna & Gasieniec, 2019a ; Di Luna et al, 2016 , 2018 ; Ilcinkas, Klasing & Wade, 2014 ; Ilcinkas & Wade, 2013 ), all assuming the 1-interval connected networks. Under weaker models of connectivity, the only problem ever studied, to the best of our knowledge, is a weaker version of the gathering, where all agents but one gather ( Bournat, Dubois & Petit, 2018 ). An up-to-date survey on computing by mobile agents on dynamic graph is in Di Luna (2019) .…”

Section: Introductionmentioning

confidence: 99%

Compacting oblivious agents on dynamic rings

Das

Luna

Mazzei

et al. 2021

PeerJ Computer Science

View full text Add to dashboard Cite

In this paper we investigate dynamic networks populated by autonomous mobile agents. Dynamic networks are networks whose topology can change continuously, at unpredictable locations and at unpredictable times. These changes are not considered to be faults, but rather an integral part of the nature of the system. The agents can autonomously move on the network, with the goal of solving cooperatively an assigned common task. Here, we focus on a specific network: the unoriented ring. More specifically, we study 1-interval connected dynamic rings (i.e., at any time, at most one of the edges might be missing). The agents move according to the widely used Look–Compute–Move life cycle, and can be homogenous (thus identical) or heterogenous (agents are assigned colors from a set of c > 1 colors). For identical agents, their goal is to form a compact segment, where agents occupy a continuous part of the ring and no two agents occupy the same node: we call this the Compact Configuration Problem. In the case of agents with colors, called the Colored Compact Configuration Problem, the goal is to group agents such that each group is formed by all agents having the same color, it occupies a continuous segment of the network, and groups of agents having different colors occupy distinct areas of the network. In this paper we determine the necessary conditions to solve both proposed problems. For all solvable cases, we provide algorithms for both the monochromatic and the colored version of the compact configuration problem. All our algorithms work even for the simplest model where agents have no persistent memory, no communication capabilities and do not agree on a common orientation within the network. To the best of our knowledge this is the first work on the compaction problem in a dynamic network.

show abstract

“…(2013), all assuming the 1-interval connected networks. Under weaker models of connectivity, the only problem ever studied, to the best of our knowledge, is a weaker version of the gathering, where all agents but one gather Bournat et al (2018).…”

mentioning

confidence: 99%

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

2021

View full text Add to dashboard Cite

In this paper we investigate dynamic networks populated by autonomous mobile agents.Dynamic networks are networks whose topology can change continuously, at unpredictable locations and at unpredictable times. These changes are not considered to be faults, but rather an integral part of the nature of the system. The agents can autonomously move on the network, with the goal of solving cooperatively an assigned common task.Here, we focus on a specific network: the unoriented ring. More specifically, we study 1interval connected dynamic rings (i.e., at any time, at most one of the edges might be missing). The agents move according to the widely used Look-Compute-Move life cycle, and can be homogenous (thus identical) or heterogenous (agents are assigned colors from a set of c > 1 colors). For identical agents, their goal is to form a compact segment, where agents occupy a continuous part of the ring and no two agents occupy the same node -we call this the Compact Configuration Problem. In the case of agents with colors, called the Colored Compact Configuration Problem, the goal is to group agents such that each group is formed by all agents having the same color, it occupies a continuous segment of the network, and groups of agents having different colors occupy distinct areas of the network.In this paper we determine the necessary conditions to solve both proposed problems. For all solvable cases, we provide algorithms for both the monochromatic and the colored version of the compact configuration problem. All our algorithms work even for the simplest model where agents have no persistent memory, no communication capabilities and do not agree on a common orientation within the network. To the best of our knowledge this is the first work on the compaction problem in a dynamic network.

show abstract

Gracefully Degrading Gathering in Dynamic Rings

Cited by 11 publications

References 27 publications

Exploring a Dynamic Ring without Landmark

Exploring a Dynamic Ring without Landmark

Compacting oblivious agents on dynamic rings

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

Contact Info

Product

Resources

About