History-based consistency algorithm for the trickle-timer with low-power and lossy networks

Firas A. Albalas, Haneen Taamneh, Wail E. Mardini

Abstract


Recently, the Internet of Things (IoT) has become an important concept which has changed the vision of the Internet with the appearance of IPv6 over Low Power and Lossy networks (6LoWPAN). However, these 6LoWPANs have many drawbacks because of the use of many devices with limited resources; therefore, suitable protocols such as the Routing Protocol for Low Power and Lossy Networks (RPL) were developed, and one of RPL's main components is the Trickle Timer Algorithm, used to control and maintain the routing traffic frequency caused by a set of control messages. However, the Trickle Timer suffered from the short-listen problem which was handled by adding the listen-only period mechanism. This addition increased the delay in propagating transmissions and resolving the inconsistency in the network. However, to solve this problem we proposed the History Based Consistency Algorithm (HBC), which eliminates the listen-only period based on the consistency period of the network. The proposed algorithm showed very good results. We measured the performance of HBC trickle in terms of convergence time; which was mainly affected, the power consumption and the Packet Delivery Ratio (PDR). We made a comparison between the original Trickle Timer, the E-Trickle, the Optimized Trickle and our HBC Trickle algorithm. The PDR and the Power consumption showed in some cases better results under the HBC trickle compared to other trickle timers and in other cases the results were very close to the original trickle indicating the efficiency of the proposed trickle in choosing optimal routes when sending messages.

Keywords


internet of things; lossy networks; low power; trickle timer; wireless sensor networks;



DOI: http://doi.org/10.11591/ijece.v11i3.pp%25p
Total views : 0 times


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

ISSN 2088-8708, e-ISSN 2722-2578