Abstract
A computational model of molecularly communicating mobile nanomachines is defined. Nanomachines are modeled by a variant of finite-state automata—so-called timed probabilistic automata—augmented by a severely restricted communication mechanism capturing the main features of molecular communication. We show that for molecular communication among such motile machines an asynchronous stochastic protocol originally designed for wireless (radio) communication in so-called amorphous computers with static computational units can also be used. We design an algorithm that using the previous protocol, randomness and timing delays selects with a high probability a leader from among sets of anonymous candidates. This enables a probabilistic simulation of one of the simplest known model of a programmable computer—so-called counter automaton—proving that networks of mobile nanomachines possess universal computing power.
This research was carried out within the institutional research plan AV0Z10300504 and partially supported by the GA ČR grant No. 1ET100300419 and GD201/ 05/H014.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adar, R., Benenson, Y., Linshiz, G., Rozner, A., Tishby, N., Shapiro, E.: Stochastic computing with biomolecular automata. Proc. Natl. Acad. Sci. USA 101, 9960–9965 (2004)
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Bath, J., Turberfield, A.J.: DNA nanomachines. Nature nanotechnology 2, 275–284 (2007)
Hiyama, S., Moritani, Y., Suda, T., Egashira, R., Enomoto, A., Moore, M., Nakano, T.: Molecular Communication. In: Proc. of the 2005 NSTI Nanotechnology Conference (2005)
Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance Analysis of Probabilistic Timed Automata using Digital Clocks. In: Formal Methods in System Design, vol. 29, pp. 37–78. Springer, Heidelberg (2006)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
Wiedermann, J., Petrů, L.: On the Universal Computing Power of Amorphous Computing Systems. Published online in Theory of Computing Systems, January 27. Springer, New York (2009)
Wiedermann, J., Petrů, L.: Communicating Mobile Nano-Machines and Their Computational Power. Technical Report V-1024, Institute of Computer Science, Prague, May 2008, accessible from the web pages of the institute
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wiedermann, J., Petrů, L. (2009). Communicating Mobile Nano-Machines and Their Computational Power. In: Cheng, M. (eds) Nano-Net. NanoNet 2008. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02427-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-02427-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02426-9
Online ISBN: 978-3-642-02427-6
eBook Packages: Computer ScienceComputer Science (R0)