Abstract
A population protocol is a computational model based on pairwise interactions and designed for networks of passively mobile finite state agents. In the population protocol model, and also in the models that extend it, the interacting pairs are supposed to be chosen by a theoretical fair scheduler. In this paper, we present the HS Scheduler which is a totally distributed synchronous randomized handshake procedure. We then prove that this randomized handshake procedure can be a probabilistic consistent scheduler for population protocols that is fair with probability 1. By adopting a protocol aware version of the HS Scheduler, we introduce the iterated population protocols model where nodes can stop participating in the protocol’s computation once they reach a final state. We then study the time complexity of the computation of a particular case of this model where a final state is reached in only one computation step. We present some upper bounds that are later validated by simulations results.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abdou, W., Ouled Abdallah, N., Mosbah, M.: ViSiDiA: a Java framework for designing, simulating, and visualizing distributed algorithms. In: IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications (DS-RT), pp. 43–46 (2014)
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM (1980)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 235–253 (2006)
Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3(4), 13 (2008)
Becchetti, L., Bergamini, L., Ficarola, F., Salvatore, F., Vitaletti, A.: First experiences with the implementation and evaluation of population protocols on physical devices. IEEE Int. Conf. Green Comput. Commun. (GreenCom) 2012, 335–342 (2012)
Chatzigiannakis, I., Dolev, S., Fekete, S.P., Michail, O., Spirakis, P.G.: Not all fair probabilistic schedulers are equivalent. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 33–47. Springer, Heidelberg (2009)
Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating logarithmic space machines. In: CoRR (2010). abs/1004.3395
Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated population protocols. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part II (2009)
Métivier, Y., Saheb, N., Zemmari, A.: Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1), 109–128 (2003)
Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Terminating population protocols via some minimal global knowledge assumptions. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 77–89. Springer, Heidelberg (2012)
Ouled Abdallah, N., Hadj Kacem, H., Mosbah, M., Zemmari, A.: Randomized broadcasting in wireless mobile sensor networks. Concurr. Comput. Pract. Exp. 25(2), 203–217 (2013)
Williams, D.: Probability with Martingales. Cambridge University Press, Cambridge (1991)
Zemmari, A.: On handshakes in random graphs. Inf. Process. Lett. 108, 119–123 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Abdallah, N.O., Jmaiel, M., Mosbah, M., Zemmari, A. (2015). A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes. In: Leucker, M., Rueda, C., Valencia, F. (eds) Theoretical Aspects of Computing - ICTAC 2015. ICTAC 2015. Lecture Notes in Computer Science(), vol 9399. Springer, Cham. https://doi.org/10.1007/978-3-319-25150-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-25150-9_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25149-3
Online ISBN: 978-3-319-25150-9
eBook Packages: Computer ScienceComputer Science (R0)