Data Dissemination Performance in Large-Scale Sensor Networks

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of transmissions low. In this paper we develop a model describing the message count in large-scale wireless sensor networks. We focus our attention on the popular Trickle algorithm, which has been proposed as a suitable communication protocol for code maintenance and propagation in wireless sensor networks. Besides providing a mathematical analysis of the algorithm, we propose a generalized version of Trickle, with an additional parameter defining the length of a listen-only period. This generalization proves to be useful for optimizing the design and usage of the algorithm. For single-cell networks we show how the message count increases with the size of the network and how this depends on the Trickle parameters. Furthermore, we derive distributions of inter-broadcasting times and investigate their asymptotic behavior. Our results prove conjectures made in the literature concerning the effect of a listen-only period. Additionally, we develop an approximation for the expected number of transmissions in multi-cell networks. All results are validated by simulations

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

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

Multiple Redundancy Constants with Trickle

International audienceWireless sensor network protocols very often use the Trickle algorithm to govern information dissemination. For example, the widely used IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) uses Trickle to emit control packets. We derive an analytical model of Trickle to take into account multiple redundancy constants and the common lack of synchronization among nodes. Moreover, we demonstrate message count unfairness when Trickle uses a unique global redundancy constant because nodes with less neighbors transmit more often. Consequently, we propose a heuristic algorithm that calculates a redundancy constant for each node as a function of its number of neighbors. Our calculated redundancy constants reduce unfairness among nodes by distributing more equally the number of transmitted messages in the network. Our analytical model is validated by emulations of constrained devices running the Contiki Operating System and its IPv6 networking stack. Furthermore, results very well corroborate the heuristic algorithm improvements

Multiple Redundancy Constants with Trickle

International audienceWireless sensor network protocols very often use the Trickle algorithm to govern information dissemination. For example, the widely used IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) uses Trickle to emit control packets. We derive an analytical model of Trickle to take into account multiple redundancy constants and the common lack of synchronization among nodes. Moreover, we demonstrate message count unfairness when Trickle uses a unique global redundancy constant because nodes with less neighbors transmit more often. Consequently, we propose a heuristic algorithm that calculates a redundancy constant for each node as a function of its number of neighbors. Our calculated redundancy constants reduce unfairness among nodes by distributing more equally the number of transmitted messages in the network. Our analytical model is validated by emulations of constrained devices running the Contiki Operating System and its IPv6 networking stack. Furthermore, results very well corroborate the heuristic algorithm improvements

A Performance Evaluation of RPL with Variations of the Trickle Algorithm

The Internet of Things (IoT) is a worldwide technological revolution, bringing about new challenges in networking and data collection. The Routing Protocol for Low Power and Lossy Networks (RPL) is the industry standard for IoT Wireless Sensor Networks. This project delved into the performance of RPL. It focused on evaluating the performance of four variations of the Trickle timer algorithm, which is a key element in RPL’s functionality, and on the performance of RPL based on multiple parameters of Trickle algorithm. The simulations show ME Trickle generally performs the best under the limited scenarios tested

A Performance Study of RPL with Trickle Algorithm Variants

The Internet of Things (IoT) is a worldwide technological revolution, bringing about new challenges in networking and data collection. The Routing Protocol for Low Power and Lossy Networks (RPL) is the industry standard for IoT Wireless Sensor Networks. This project studied the performance of RPL, focusing on evaluating the performance of four variations of the Trickle timer algorithm. The team performed all tests on a simulated environment using the Cooja network simulator. Overall, our newest proposed algorithm, ME-Trickle produced better results than the other algorithms under conditions of less dense networks. All four Trickle variants demonstrate sensitivity to changes in network configuration and density

A Survey on Trickle Algorithm: Comparative Analysis

Internet of Things (IoT) is an emerging area in the field of wireless communication. Due to its resource constraint environment, IETF gave a standard for IVP6 routing protocol for low power and lossy networks (RPL). The major component of RPL is Trickle algorithm. It is used to control the number of messages exchanged between devices and helps in early network stabilization. Due to its importance, it is crucial for researchers to understand this protocol. The absence of surveys in Trickle Algorithm motivates us to write this paper. In this paper, we compared different Trickle Algorithms based on performance parameters like convergence time, energy consumption, packet delivery ratio and others. Concluding, we can say that it is open research area in the designing parameters of Trickle�s Algorithms and we believe that this survey will be beneficial for researchers in their relevant work