TrickleTree: A Gossiping Approach To Fast And Collision Free Staggered Scheduling
Files in This Item:
|TrickleTree_A_Gossiping_Approach_To_Fast_And_Collision_Free_Staggered_Scheduling.pdf||536.08 kB||Adobe PDF||Download|
|Title:||TrickleTree: A Gossiping Approach To Fast And Collision Free Staggered Scheduling||Authors:||Bober, Wojciech
Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/7163||Date:||Sep-2011||Abstract:||In recent years, data gathering has received significant attention as an application of Wireless Sensor Networks (WSNs). Staggered data tree based protocols have been shown to be successful in reducing energy consumption in data gathering scenarios. An important part of staggered protocols is the process of schedule construction. In order to minimize energy consumption, this process must be fast. In this paper, we present TrickleTree, a fast distributed protocol for establishing staggered and collision free communication schedule. TrickleTree has three functions: to establish routes, i.e., construct a data gathering tree, to establish a staggered communication schedule, i.e, assign time slots to links, and to disseminate the maximal tree depth in the network. To minimize network setup time, TrickleTree combines neighborhood discovery and schedule construction into one step. To ensure that good neighbors are discovered before a node joins the network, TrickleTree uses a rating mechanism. Collisions during node association are reduced by using association slots. To increase the message delivery rate with small message overhead, TrickleTree uses adaptive gossiping. We provide a formal analysis of the protocol properties i.e., collision free scheduling and termination. The behavior of the proposed approach is evaluated in simulation. The results show up to 90% in a reduction in schedule setup time and a 50% reduction of duty cycle compared to a flooding approach.||Funding Details:||Enterprise Ireland||Type of material:||Journal Article||Publisher:||International Academy, Research, and Industry Association (IARIA)||Journal:||International Journal on Advances in Networks and Services (IJANS)||Volume:||4||Issue:||1&2||Start page:||81||End page:||91||Copyright (published version):||2011 the authors||Keywords:||Wireless sensor networks; Staggered schedule; Schedule construction; Fast association; Collisions reduction; Association ranking||Other versions:||http://www.iariajournals.org/networks_and_services/tocv4n12.html||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.