By Topic

Modeling the Message Count of the Trickle Algorithm in a Steady-State, Static Wireless Sensor Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hamidreza Kermajani ; Entel Dept., Universitat Politecnica de Catalunya (UPC), and i2Cat Foundation, Castelldefels, 08860, Spain ; Carles Gomez ; Mostafa Hesami Arshad

Trickle is a transmission scheduling algorithm developed for wireless sensor networks. The Trickle algorithm determines whether (and when) a message can be transmitted. Therefore, Trickle operation is critical for performance parameters such as energy consumption and available bandwidth. This letter presents an analytical model for the message count of a static Trickle-based network under steady state conditions, as a function of a parameter called the redundancy constant and the average node degree. The model presented is validated by simulation results.

Published in:

IEEE Communications Letters  (Volume:16 ,  Issue: 12 )