TrickleTree: A Gossiping Approach To Fast Staggered Scheduling For Data Gathering Wireless Sensor Networks
Files in This Item:
|TrickleTree_A_Gossiping_Approach_To_Fast_Staggered_Scheduling_For_Data_Gathering_Wireless_Sensor_Networks.PDF||191.75 kB||Adobe PDF||Download|
|Title:||TrickleTree: A Gossiping Approach To Fast Staggered Scheduling For Data Gathering Wireless Sensor Networks||Authors:||Bober, Wojciech
Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/7079||Date:||25-Jul-2010||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 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 the neighborhood discovery and scheduling steps. To reduce message overhead, TrickleTree uses adaptive gossiping. The behavior of the proposed approach is evaluated in simulation. The results show up to 90% reduction in schedule setup time and a 50% reduction of duty cycle compared to a flooding approach.||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2010 IEEE||Keywords:||Wireless sensor networks;Staggered schedule;Schedule construction;Schedule dissemination||DOI:||10.1109/SENSORCOMM.2010.40||Language:||en||Status of Item:||Peer reviewed||Conference Details:||4th International Conference on Sensor Technologies and Applications (SENSORCOMM), Venice/Mestre, Italy, 18 - 25 July, 2010|
|Appears in Collections:||Computer Science Research Collection|
CASL 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.