1 - 4 of 4 articles
We address the question of the weakest failure detector to circumvent the impossibility of
-renaming in a system of up to
participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest...
We consider the problem of leader election (LE) in single-hop radio networks with synchronized time slots for transmitting and receiving messages. We assume that the actual number n of processes is unknown, while the size u of the ID space is known, but is possibly much larger. We consider two...
Chatzigiannakis et al. (Lect Notes Comput Sci 5734:56–76, 2009) extended the Population Protocol (PP) of Angluin et al. (2004) and introduced the Mediated Population Protocol (MPP) by introducing an extra memory on every agent-to-agent communication link (i.e., edge), in order to model more...
In this paper we provide a protocol solving the problem of gathering of identical autonomous systems (aka ants) on a circle. In our biologically inspired model the autonomous systems are unable to communicate directly, instead they employ the mechanism of pheromone marking. The gathering on a...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.