Probability-based path discovery protocol for electromagnetic nano-networks
Rights accessOpen Access
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
One of the major challenges for nano-network is the forfeit of communication protocols to exploit the potential communication between nano-machines forming fully operational nano-network. Because nano-machines face some restrictions such as limited processing power and confined computing capabilities, up-to-date nano-machines cannot perceive partial or full routing tables, which are the main decision-makers for data routing in legacy communication networks. The reason is that creating and updating routing tables continuously require adequate processing power with sufficient memory and computing capabilities, which is not the case of nano-nodes. So, new innovative routing schemes have to be proposed for nano-networks to deal with such extremely low resources. This paper focuses on decoupling the routing intelligence from nano-network towards a computational architecture using Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies by externalizing routing decisions and complex computations from nano-nodes to be fully compiled externally. Moreover, the paper proposes a probability-based path discovery protocol denoted by (PBPD) for electromagnetic nano-nodes suitable for dynamic nano-network applications. The performance of the proposed protocol is evaluated and compared with other routing protocols discussed in the literature. The proposed scheme provides low energy consumption inside nano-nodes and low computational complexity thanks to SDN/NFV system.
© <2020>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitationAkram Galal; Hesselbach, X. Probability-based path discovery protocol for electromagnetic nano-networks. "Computer networks", 19 Juny 2020, vol. 174, p. 107246:1-107246:20.