{"title":"Design and Implementation of an Adaptable Trickle Algorithm for Amelioration of RPL Usage in Internet of Things Networks","authors":"J. Kumar, D. Suresh","doi":"10.1166/JCTN.2021.9382","DOIUrl":null,"url":null,"abstract":"The efficient message routing is highly challenging in terms of low power and lossy networks (loT) for transmission of data with overhead and delay. The protocols used for routing need to be designed such that they should be working efficiently. Efficiency in calculated in terms of\n energy and delivery of packets. RPL protocol is also designed with the aim of making these two parameters efficient. Even then it contains drawbacks. Trickle algorithm is designed with a goal to reduce the drawbacks in RPL. Trickle algorithm is used in RPL protocols for creation of routes\n between nodes in the network with different intervals. Unfortunately, there exists some more downsides for the trickle algorithm, which made design of several algorithms inorder to analyse different drawbacks. In this paper, on analysing different types of trickle algorithms and locating the\n drawback in every algorithm, a novel algorithm is designed which helps in reduction of the drawbacks that are found. The description of this algorithm along with the simulation results done using Cooja 3.0 simulator is also discussed in this paper. The Simulation of the algorithm that is newly\n designed is done by assuming a network with different count of nodes and comparing the results with the previously introduced Trickle algorithms.","PeriodicalId":15416,"journal":{"name":"Journal of Computational and Theoretical Nanoscience","volume":"18 1","pages":"1186-1193"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Theoretical Nanoscience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1166/JCTN.2021.9382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Chemistry","Score":null,"Total":0}
引用次数: 0
Abstract
The efficient message routing is highly challenging in terms of low power and lossy networks (loT) for transmission of data with overhead and delay. The protocols used for routing need to be designed such that they should be working efficiently. Efficiency in calculated in terms of
energy and delivery of packets. RPL protocol is also designed with the aim of making these two parameters efficient. Even then it contains drawbacks. Trickle algorithm is designed with a goal to reduce the drawbacks in RPL. Trickle algorithm is used in RPL protocols for creation of routes
between nodes in the network with different intervals. Unfortunately, there exists some more downsides for the trickle algorithm, which made design of several algorithms inorder to analyse different drawbacks. In this paper, on analysing different types of trickle algorithms and locating the
drawback in every algorithm, a novel algorithm is designed which helps in reduction of the drawbacks that are found. The description of this algorithm along with the simulation results done using Cooja 3.0 simulator is also discussed in this paper. The Simulation of the algorithm that is newly
designed is done by assuming a network with different count of nodes and comparing the results with the previously introduced Trickle algorithms.