Abstract
Efficient data routing is a critical enabler of future nanonet-working applications. Such nano-routing schemes must account for highly lossy wireless channel conditions, non-unique identifiers and limited processing capabilities at the nanon-odes comprising the network. The present study proposes a novel addressing and routing scheme fit for 3D nanonetworks. Initially, a geo-addressing process is applied within the network. Subsequently, it is shown that every node can deduce whether it is located on the linear path connecting a communicating node-pair. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
