Packet Routing in 3D Nanonetworks: A Lightweight, Linear-path Scheme
This work addresses the challenge of packet routing in 3D nanonetworks with severe hardware limitations, offering a lightweight, stateless solution for material monitoring applications.
The paper proposes an addressing and routing scheme for static 3D nanonetworks that uses virtual coordinates from multiple anchor point sets (viewports) and a linear-path routing method where nodes determine if they lie on the segment between sender and receiver using integer calculations. Simulations show the scheme outperforms related approaches in terms of energy efficiency and path diversity.
Packet routing in nanonetworks requires novel approaches, which can cope with the extreme limitations posed by the nano-scale. Highly lossy wireless channels, extremely limited hardware capabilities and non-unique node identifiers are among the restrictions. The present work offers an addressing and routing solution for static 3D nanonetworks that find applications in material monitoring and programmatic property tuning. The addressing process relies on virtual coordinates from multiple, alternative anchor point sets that act as \emph{viewports}. Each viewport offers different address granularity within the network space, and its selection is optimized by a packet sending node using a novel heuristic. Regarding routing, each node can deduce whether it is located on the linear segment connecting the sender to the recipient node. This deduction is made using integer calculations, node-local information and in a stateless manner, minimizing the computational and storage overhead of the proposed scheme. Most importantly, the nodes can regulate the width of the linear path, thus trading energy efficiency (redundant transmissions) for increased path diversity. This trait can enable future adaptive routing schemes. Extensive evaluation via simulations highlights the advantages of the novel scheme over related approaches.