EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


13508 Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks
Home Policy Brochure Browse Search User Area Contact Help

Durmaz Incel, O. and Krishnamachari, B. (2008) Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks. In: 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON '08., 16-20 June 2008, San Francisco, USA. pp. 569-577. IEEE Computer Society. ISBN 978-1-4244-1777-3

Full text available as:

PDF

263 Kb
Open Access



Official URL: http://dx.doi.org/10.1109/SAHCN.2008.74

Exported to Metis

Abstract

What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using realistic simulation models to address this question. We begin by considering TDMA scheduling on a single channel, reducing the original problem to minimizing the number of time slots needed to schedule each link of the aggregation tree. The second technique is to combine the scheduling with transmission power control to reduce the effects of interference. To better cope with interference, we then study the impact of utilizing multiple frequency channels by introducing a simple receiver-based frequency and time scheduling approach. We find that for networks of about a hundred nodes, the use of multi-frequency scheduling can suffice to eliminate most of the interference. The data collection rate then becomes limited not by interference, but by the maximum degree of the routing tree. Therefore we consider finally how the data collection rate can be further enhanced by the use of degree-constrained routing trees. Considering deployments at different densities, we show that these enhancements can improve the streaming aggregated data collection by as much as 10 times compared to the baseline of single-channel data collection over non-degree constrained routing trees. Addition to our primary conclusion, in the frequency scheduling domain we evaluate the impact of different interference models on the scheduling performance and give topology-specific bounds on time slot and frequency channel requirements.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-PS: Pervasive Systems
Research Program:CTIT-WiSe: Wireless and Sensor Systems
Research Project:Smart Surroundings
ID Code:13508
Status:Published
Deposited On:25 September 2008
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item