963 Hits in 4.4 sec

Mobile Agents and Exploration [chapter]

Evangelos Kranakis, Danny Krizanc
2008 Encyclopedia of Algorithms  
[14] ) when the k mobile agents use indistinguishable pebbles (one per mobile agent) to mark their position in an n node ring. Memory Time Kranakis et al.  ...  Mobile agents. Mobile agents are autonomous, intelligent computer software that can move within a network.  ... 
doi:10.1007/978-0-387-30162-4_242 fatcat:vwrs2es3pzdf3ia4njuaifsu6m

Mobile Agents Rendezvous in spite of a Malicious Agent [article]

Shantanu Das, Flaminia L. Luccio, Euripides Markou
2016 arXiv   pre-print
We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network.  ...  For ring networks, our algorithms solve rendezvous in all feasible instances of the problem, while we show that rendezvous is impossible for an even number of agents in unoriented rings.  ...  study the rendezvous problem in bidirectional rings with a malicious agent M .  ... 
arXiv:1410.4772v2 fatcat:v5yufmksyjejflbytvjfrag7wm

Multiple Agents RendezVous in a Ring in Spite of a Black Hole [chapter]

Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2004 Lecture Notes in Computer Science  
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site.  ...  In this paper we consider k anonymous, asynchronous mobile agents in an anonymous ring of size n with a black hole; the agents are aware of the existence, but not of the location of such a danger.  ...  The modified protocol Shadow for unoriented rings terminates in at most 8(n − 2) time steps.  ... 
doi:10.1007/978-3-540-27860-3_6 fatcat:7inmldlvdvajro7tjcoqubostq

Cooperating Mobile Agents [chapter]

Sukumar Ghosh, Anurag Dasgupta
2012 Mobile Agents in Networking and Distributed Computing  
Deploying multiple mobile agents cooperating with one another can add a new dimension to distributed applications.  ...  The id is unnecessary if there is a single agent, but is essential to distinguish between multiple agents in the same system. 2.  ...  Multiple Agents Rendezvous in a Ring in Spite of a Black Hole The rendezvous problem requires all the agents to gather at the same node.  ... 
doi:10.1002/9781118135617.ch5 fatcat:wifipc6og5hh3oqcenhemqmrfq

Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs [chapter]

Fukuhito Ooshita, Ajoy K. Datta, Toshimitsu Masuzawa
2017 Lecture Notes in Computer Science  
We investigate self-stabilizing rendezvous algorithms for two synchronous mobile agents.  ...  The rendezvous algorithms make two mobile agents meet at a single node, starting from arbitrary initial locations and arbitrary initial states.  ...  Introduction Background In the rendezvous problem, two mobile agents (or simply, agents) initially located at different nodes must eventually meet at a single node.  ... 
doi:10.1007/978-3-319-69084-1_2 fatcat:qwz4pqfwtncafen6eiuv5sqspa

Computing with Mobile Agents in Distributed Networks [chapter]

Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum
2007 Handbook of Parallel Computing  
Research of the third author was supported in part by PAPIIT-UNAM. References  ...  Acknowledgements Research of the first author was supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) and MITACS (Mathematics of Information Technology and Complex  ...  Consider a ring of n nodes and a set A of k ≥ 2 mobile agents traversing the nodes of this ring.  ... 
doi:10.1201/9781420011296.ch8 fatcat:eyr4zqq2qrb43b5kvcofx2jfuq

Move-optimal gossiping among mobile agents

Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2008 Theoretical Computer Science  
In mobile-agent-based systems, gossip is a fundamental task in cooperation among mobile agents.  ...  While rendezvous algorithms, which require that all agents rendezvous on a node at the same time, can achieve this requirement, it takes excessive cost for our objective.  ...  When multiple agents on a node execute their operations, the operations are sequentially executed in an arbitrary order.  ... 
doi:10.1016/j.tcs.2007.11.007 fatcat:pmxrxsul35cutaisrrvvs6s5vu

Fast Rendezvous with Advice [article]

Avery Miller, Andrzej Pelc
2014 arXiv   pre-print
We study the minimum amount of information that has to be available a priori to the agents to achieve rendezvous in optimal time Θ(D).  ...  Two mobile agents, starting from different nodes of an n-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous.  ...  This distributed task is known as rendezvous and has received a lot of attention in the literature. Agents can be any mobile autonomous entities.  ... 
arXiv:1407.1428v2 fatcat:tkavgdm7gbdi3mcvez2d4gnhda

Rendezvous of Mobile Agents without Agreement on Local Orientation [chapter]

Jérémie Chalopin, Shantanu Das
2010 Lecture Notes in Computer Science  
The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions.  ...  A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem.  ...  The leader election problem in message-passing systems is equivalent to the rendezvous problem in the mobile agent model [7] .  ... 
doi:10.1007/978-3-642-14162-1_43 fatcat:76vbt2j34banpogws4fx7najda

Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks [article]

Avery Miller, Andrzej Pelc
2015 arXiv   pre-print
Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds.  ...  A natural benchmark for both time and cost of rendezvous in a network is the number of edge traversals needed for visiting all nodes of the network, called the exploration time.  ...  These mobile entities might represent human-made objects, such as software agents in computer networks or mobile robots navigating in a network of corridors in a mine.  ... 
arXiv:1508.02471v1 fatcat:i5letegrmrakjpe5srpduwqlnu


Paola Flocchini, Leszek A. Gąsieniec
2008 Theoretical Computer Science  
The next contribution, by Chalopin, deals with the problems of election and rendezvous of mobile agents when labels of the agents are distinct but mutually incomparable.  ...  The paper by Blin, Fraigniaud, Nisse and Vial describes a distributed algorithm for a team of mobile agents with logarithmic memory to decontaminate an arbitrary asynchronous network.  ...  Leszek A. G ąsieniec * Department of Computer Science, University of Liverpool, Liverpool, United Kingdom E-mail address:  ... 
doi:10.1016/j.tcs.2008.02.002 fatcat:53fsjxpjebcsnl4hkznnsllkpu

Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty [chapter]

Jérémie Chalopin, Shantanu Das, Peter Widmayer
2013 Search Theory  
In this scenario, the objective is to solve rendezvous whenever deterministically feasible, while optimizing on the amount of movement by the agents or the memory required (for the nodes or the agents)  ...  in the worst case.  ...  Moreover, in a symmetric environment (e.g. a ring with agents placed equidistant apart) each agent may need to make O(n) moves before it can detect the impossibility of rendezvous.  ... 
doi:10.1007/978-1-4614-6825-7_12 fatcat:fgzs2jlvjzdxhlyodiyfrtp3dq

Synchronous rendezvous of very-low-range wireless agents

Michael M. Zavlanos
2010 49th IEEE Conference on Decision and Control (CDC)  
In this paper, we address the problem of temporal synchronization of a team of mobile agents on a set of rendezvous points defined by the nodes of a bipartite network.  ...  Temporal synchronization relies on distributed agreement protocols on the travel times and waiting times at the rendezvous points, and when integrated with the agents' motion, results in a hybrid multi-agent  ...  CONCLUSIONS In this paper, we addressed the problem of synchronous rendezvous of a team of mobile agents on the nodes of a bipartite network.  ... 
doi:10.1109/cdc.2010.5717014 dblp:conf/cdc/Zavlanos10 fatcat:taryqxkolraezotc43p7qns37i

A virtual infrastructure based on honeycomb tessellation for data dissemination in multi-sink mobile wireless sensor networks

Ayşegül Tüysüz Erman, Arta Dilo, Paul Havinga
2012 EURASIP Journal on Wireless Communications and Networking  
In this article, we propose a virtual infrastructure and a data dissemination protocol exploiting this infrastructure, which considers dynamic conditions of multiple sinks and sources.  ...  In such scenarios, reliable data dissemination of events is very important, as well as the efficiency in handling the mobility of both sinks and event sources.  ...  Pursuit-evasion games (PEG) [13] is a sensor network system that detects an uncooperative mobile agent, evader, and assists an autonomous mobile robot called the pursuer in capturing the evader.  ... 
doi:10.1186/1687-1499-2012-17 fatcat:asncyfdkfzebthxnkn5d2ommkq

Multi-robot exploration and rendezvous on graphs

Malika Meghjani, Gregory Dudek
2012 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems  
This ranking criterion associates a cost for visiting a rendezvous location and gives an expected reward of finding other agents.  ...  We propose a ranking criterion for selecting the order in which potential rendezvous locations will be visited.  ...  A survey of results for mobile agent rendezvous is given in [5] .  ... 
doi:10.1109/iros.2012.6386049 dblp:conf/iros/MeghjaniD12 fatcat:ei4blmzehbfbngcmkpctbqqvt4
« Previous Showing results 1 — 15 out of 963 results