Abstract
Akyildiz et al. envisioned the use of nanonetworks as a new paradigm for computation on a very small scale. Since then, many scientists researched dependent aspects like nanoscale communication. However, most research omitted specifying the computational 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 AC 0, NC 1 and L. Lastly, we describe the benefits of our results for simulation purposes and to better assess the feasibility of nanonetwork scenarios.
Original language | English |
---|---|
Title of host publication | 4th ACM International Conference on Nanoscale Computing and Communication 2017 (ACM NanoCom'17) |
Number of pages | 6 |
Place of Publication | Washington DC, USA |
Publisher | ACM |
Publication date | 27.09.2017 |
Pages | 11:1-11:6 |
ISBN (Print) | 978-1-4503-4931-4 |
DOIs | |
Publication status | Published - 27.09.2017 |
Event | NanoCom '17 Proceedings of the 4th ACM International Conference on Nanoscale Computing and Communication - Washington, United States Duration: 27.09.2017 → 29.09.2017 |