By Topic

Fast Data Aggregation Algorithm for Minimum Delay in Clustered Ubiquitous Sensor Networks

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
$31 $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

2 Author(s)
Shan Guo Quan ; Sch. of Electr. & Electron. Eng., Yonsei Univ., Seoul ; Young Yong Kim

We propose a time-efficient local data aggregation algorithm that aggregates delay-constrained data within a given time deadline in clustered wireless sensor networks. Our approach consists of two phases. First, we design a zone-based fast data aggregation tree (ZFDAT) to eliminate unnecessary packets being forwarded to many receiver nodes and avoid long detour paths until cluster-head, where cluster-head is local control center to coordinate the data transmissions in the cluster. Next, we propose optimal link scheduling algorithm to minimize aggregation time by given variable length of time slots for all links in the ZFDAT. Our simulation results show that our approach can minimize the aggregation time under energy constraint and outperforms the similar existing algorithms. In particular, our approach distributes the total aggregation time, then it can also reduce the heavy processing load at the cluster-head.

Published in:

Convergence and Hybrid Information Technology, 2008. ICHIT '08. International Conference on

Date of Conference:

28-30 Aug. 2008