Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks

Shan Guo Quan, Young Yong Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008
Pages327-333
Number of pages7
DOIs
Publication statusPublished - 2008 Nov 17
Event2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 - Daejeon, Korea, Republic of
Duration: 2008 Aug 282008 Aug 29

Other

Other2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008
CountryKorea, Republic of
CityDaejeon
Period08/8/2808/8/29

Fingerprint

Sensor networks
Agglomeration
Scheduling algorithms
Data communication systems
Wireless sensor networks
Processing

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Cite this

Quan, S. G., & Kim, Y. Y. (2008). Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. In Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 (pp. 327-333). [4622846] https://doi.org/10.1109/ICHIT.2008.247
Quan, Shan Guo ; Kim, Young Yong. / Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008. 2008. pp. 327-333
@inproceedings{8e0e3f48e1af408580718a5989c20785,
title = "Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks",
abstract = "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.",
author = "Quan, {Shan Guo} and Kim, {Young Yong}",
year = "2008",
month = "11",
day = "17",
doi = "10.1109/ICHIT.2008.247",
language = "English",
isbn = "9780769533285",
pages = "327--333",
booktitle = "Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008",

}

Quan, SG & Kim, YY 2008, Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. in Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008., 4622846, pp. 327-333, 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008, Daejeon, Korea, Republic of, 08/8/28. https://doi.org/10.1109/ICHIT.2008.247

Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. / Quan, Shan Guo; Kim, Young Yong.

Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008. 2008. p. 327-333 4622846.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks

AU - Quan, Shan Guo

AU - Kim, Young Yong

PY - 2008/11/17

Y1 - 2008/11/17

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=55849130352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55849130352&partnerID=8YFLogxK

U2 - 10.1109/ICHIT.2008.247

DO - 10.1109/ICHIT.2008.247

M3 - Conference contribution

SN - 9780769533285

SP - 327

EP - 333

BT - Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008

ER -

Quan SG, Kim YY. Fast data aggregation algorithm for minimum delay in clustered ubiquitous sensor networks. In Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008. 2008. p. 327-333. 4622846 https://doi.org/10.1109/ICHIT.2008.247