Papers
Topics
Authors
Recent
Search
2000 character limit reached

Toward a Wired Ad Hoc Nanonetwork

Published 20 Nov 2019 in cs.ET and cs.NI | (1911.08674v2)

Abstract: Nanomachines promise to enable new medical applications, including drug delivery and real time chemical reactions' detection inside the human body. Such complex tasks need cooperation between nanomachines using a communication network. Wireless Ad hoc networks, using molecular or electromagnetic-based communication have been proposed in the literature to create flexible nanonetworks between nanomachines. In this paper, we propose a Wired Ad hoc NanoNETwork (WANNET) model design using actin-based nano-communication. In the proposed model, actin filaments self-assembly and disassembly is used to create flexible nanowires between nanomachines, and electrons are used as carriers of information. We give a general overview of the application layer, Medium Access Control (MAC) layer and a physical layer of the model. We also detail the analytical model of the physical layer using actin nanowire equivalent circuits, and we present an estimation of the circuit component's values. Numerical results of the derived model are provided in terms of attenuation, phase and delay as a function of the frequency and distances between nanomachines. The maximum throughput of the actin-based nanowire is also provided, and a comparison between the maximum throughput of the proposed WANNET, vs other proposed approaches is presented. The obtained results prove that the proposed wired ad hoc nanonetwork can give a very high achievable throughput with a smaller delay compared to other proposed wireless molecular communication networks.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.