by Liaskos C., Tsioliaridou A., Ioannidis S., Kantartzis N., Pitsillides A.
(Access related resources below: )

This work belongs to the Nanonetworking research track.

A Deployable Routing System for Nanonetworks [[[Liaskosdeployable]]]

Abstract: Nanonetworks comprise numerous wireless nodes, assembled at micro-to-nano scale. The unique manufacturing challenges and cost considerations of these networks make for minimal complexity solutions at all network layers. From a networking aspect, packet retransmissions should be kept minimal, while ensuring communication between any two nanonodes. In addition, assigning unique addresses to nanonodes is not straightforward, since it can entail a prohibitively high number of packet exchanges. Thus, efficient data routing is considered an open issue in nanonetworking. The present paper proposes a routing system which can be dynamically deployed within a nanonetwork. Static, dense topologies with numerous, identical nodes are examined. These attributes are especially important in the context of recently proposed applications of nanonetworks. The proposed scheme incurs a trivial setup overhead and requires integer processing capabilities only. Once deployed, it operates efficiently, inducing lower packet retransmission rates than related schemes. 

In a nutshell

The objective of the new scheme is to be dynamically deployable around a selected point, enforcing a system of non-unique addresses as well.

The novel scheme relies on an earlier observation [[[Liaskos2015promise]]]. According to it, in a full flood of packets, certain nodes achieve better reception statistics than others. This can serve as a classification of the nodes. The best-receiving nodes form patterns which depend on the transmission radius of the nodes. 

The scheme combines classification results produced by smaller and larger radii (left inset below) to deploy a system of rings and sectors (right inset below). Packets can then be routed over the combined system, driven by their distance in hops from the beacon "O" at the center. 



  • This study introduced a deployable routing system (DEROUS) for ad hoc nanonetworks.
  • DEROUS dynamically forms a quasi-radial coordinate system around a given beacon point.
  • Emphasis is placed on low complexity and memory requirements.
  • Each node is assumed to have integer processing capabilites only.


This work was partially supported by the EU Horizon 2020 VirtuWind project (Grant no. EU 671648).

Reference & Resources

Powered by CMSimple| Template:| Login