Number of the records: 1  

Communicating Mobile Nano-Machines and Their Computational Power

  1. 1.
    SYSNO ASEP0327440
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleCommunicating Mobile Nano-Machines and Their Computational Power
    TitleMobilní komunikační nano-mašiny a jejich výpočetní síla
    Author(s) Wiedermann, Jiří (UIVT-O) RID, SAI, ORCID
    Petrů, L. (CZ)
    Source TitleNano-Net. Revised Selected Papers. - Berlin : Springer, 2009 / Cheng M. - ISBN 978-3-642-02426-9
    Pagess. 123-130
    Number of pages8 s.
    ActionNano-Net 2008. International Conference on Nano-Networks /3./
    Event date14.09.2008-16.09.2008
    VEvent locationBoston
    CountryUS - United States
    Event typeWRD
    Languageeng - English
    CountryDE - Germany
    Keywordsmolecular communication ; nanomachines ; timed probabilistic automata ; communication protocol ; universal computing
    Subject RIVIN - Informatics, Computer Science
    R&D Projects1ET100300419 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    GD201/05/H014 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000302583300021
    EID SCOPUS79959288661
    DOI10.1007/978-3-642-02427-6_21
    AnnotationA 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.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.