Computational requirements for nano-machines: there is limited space at the bottom

Abstract

Akyildiz et al. envisioned the use of nanonetworks as a new paradigm for computation on a very small scale. Since then, many scientists investigated dependent aspects like nanoscale communication. However, most research omitted specifying the complexity required for their respective scenarios. To close this gap, we analyzed numerous medical scenarios and extracted the formal problems to be solved. We then compared the resulting formal problems using computational complexity theory and displayed them sorted into the classes AC0, NC1 and L. Lastly, we describe the benefits of our results for simulation purposes and to better assess the feasibility of nanonetwork scenarios.