Assessment of RPL Performance with Trickle Algorithm Variants

Abstract

The world of networking has gradually changed from wireless networks to smart networks. The main reason for the evolution of wireless networks is the increase in mobility, flexibility and simple installation. Even though there are some advantages in wireless networks there are some drawbacks too. The main drawback is the power consumption problem and packet loss during transmission. To reduce these problems Routing Protocol (RPL) is introduced. RPL helps in the quick creation of routes in a network which reduces the problem of power consumption. RPL is able to achieve this task by implementing an algorithm called Trickle algorithm in it. In RPL protocol, Trickle algorithm is the major element. With the use of the Trickle algorithm, nodes will exchange information efficiently. This paper contains a survey and analysis of various trickle algorithms which are designed by considering different parameters. Its implementation was done on 20, 30 and 40 nodes. Experimental analysis was done by using Cooja 3.0 simulator. Performance of RPL was studied through the Standard Trickle, Trickle-F, Elastic Trickle and I-Trickle algorithms. The testing process of algorithms is done using measures like PDR and Power Consumption. The results from the experimental analysis were compared by using the standard trickle algorithm