Number of the records: 1  

Communicating Mobile Nano-Machines and Their Computational Power

  1. 1.
    0327440 - ÚI 2010 RIV DE eng C - Conference Paper (international conference)
    Wiedermann, Jiří - Petrů, L.
    Communicating Mobile Nano-Machines and Their Computational Power.
    [Mobilní komunikační nano-mašiny a jejich výpočetní síla.]
    Nano-Net. Revised Selected Papers. Berlin: Springer, 2009 - (Cheng, M.), s. 123-130. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 3. ISBN 978-3-642-02426-9.
    [Nano-Net 2008. International Conference on Nano-Networks /3./. Boston (US), 14.09.2008-16.09.2008]
    R&D Projects: GA AV ČR 1ET100300419; GA ČR(CZ) GD201/05/H014
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : molecular communication * nanomachines * timed probabilistic automata * communication protocol * universal computing
    Subject RIV: IN - Informatics, Computer Science

    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.

    Je navržen výpočetní model molekulárně komunikujících mobilních nano-mašin. Nano-mašiny jsou modelovány pomocí jistého druhu konečných automatů - tzv. probabilistických automatů s časovačem. Tyto automaty jsou dále rozšířeny o jednoduchý, značně omezený komunikační mechanismus jenž modeluje hlavní rysy molekulární komunikace. Hlavním výsledkem je důkaz univerzální výpočetní síly sítí skládajících se ze shora popsaných výpočetních elementů.
    Permanent Link: http://hdl.handle.net/11104/0174258

     
     
Number of the records: 1  

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