Rendezvous and Election of Mobile Agents: Impact of Sense of Direction

Barrière, Lali; Flocchini, Paola; Fraigniaud, Pierre; Santoro, Nicola

doi:10.1007/s00224-005-1223-5

Cited by 50 publications

(41 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The agents start from their initial configuration and may gain some knowledge on the topology of the graph only as a result of its path traversals. The task to be performed varies and may include exploration [2,12,20,26], map construction [10,14,18], gathering [13,19,32,40] or leader election [5,6,28]. In this work we focus on the task of capturing a fast fugitive hiding in the graph.…”

Section: Introductionmentioning

confidence: 99%

Distributed graph searching with a sense of direction

2014

View full text Add to dashboard Cite

In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function ω provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least ω(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has ω ≡ 1. We assume that with a graph G to be searched, there is associated a partition (V 1 , . . . , V t ) of its vertex set such that edges are allowed only within each V i and between two consecutive V i 's. We provide an algorithm for distributed monotone connected edge searching of such graphs, where the searchers are initially placed on an arbitrary vertex of G and have no a priori knowledge on G, but they have a sense of direction that lets them recognize whether an edge incident to already explored vertex in V i leads to a vertex in one of V i−1 , V i or V i+1 . Starting from any vertex the algorithm uses at most 3·max i=1,...,t ω(V i )+1 searchers, where ω(V i ) = v∈V i ω(v). We also prove that this algorithm is best possible up to a small additive constant, that is, each distributed searching algorithm in worst case must use 3 · max i=1,...,t ω(V i ) − 1 searchers for some graphs.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed graph searching with a sense of direction

2014

View full text Add to dashboard Cite

show abstract

“…Other investigations on cooperative solutions of problems by mobile agents include the studies on rendezvous (e.g., see [2,3,16,36,49]), election (e.g., see [8,6]), and decontamination [7].…”

Section: Related Workmentioning

confidence: 99%

Searching for a black hole in arbitrary networks: optimal mobile agents protocols

et al. 2006

Self Cite

View full text Add to dashboard Cite

Consider a networked environment, supporting mobile agents, where there is a black hole: a harmful host that disposes of visiting agents upon their arrival, leaving no observable trace of such a destruction. The black hole search problem is the one of assembling a team of asynchronous mobile agents, executing the same protocol and communicating by means of whiteboards, to successfully identify the location of the black hole; we are concerned with solutions that are generic (i.e., topology-independent). We establish tight bounds on the size of the team (i.e., the number of agents), and the cost (i.e., the number of moves) of a size-optimal solution protocol. These bounds depend on the a priori knowledge the agents have about the network, and on the consistency of the local labellings. In particular, we prove that: with topological ignorance ∆ + 1 agents are needed and suffice, and the cost is Θ(n 2 ), where ∆ is the maximal degree of a node and n is the number of nodes in the network; with topological ignorance but in presence of sense of direction only two agents suffice and the cost is Θ(n 2 ); and with complete topological knowledge only two agents suffice and the cost is Θ(n log n). All the upper-bound proofs are constructive.

show abstract

“…Reversely, once all the agents have gathered in some place, the first agent that writes on the whiteboard of this place is elected, whereas all the others become non-elected. There exists a large variety of results for these problems in the mobile agent setting assuming different properties of the environment [2,4,5,10,11]. The election problem has also been extensively studied in the distributed setting, and particularly in anonymous networks, where the processes do not have distinct labels [1,6,9,13].…”

Section: Introductionmentioning

confidence: 99%

Election in the Qualitative World

Chalopin

2006

Structural Information and Communication Complexity

View full text Add to dashboard Cite

Abstract. In [3], Barrière et al. consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment, it either states that the problem cannot be solved in this environment, or it successfully elects a leader. In this paper, we give a positive answer to this question. We also give a characterization of the distributed mobile environments where the election problem can be solved.

show abstract

Rendezvous and Election of Mobile Agents: Impact of Sense of Direction

Cited by 50 publications

References 34 publications

Distributed graph searching with a sense of direction

Distributed graph searching with a sense of direction

Searching for a black hole in arbitrary networks: optimal mobile agents protocols

Election in the Qualitative World

Contact Info

Product

Resources

About