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 language | English |
|---|---|
| Title of host publication | Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 |
| Pages | 327-333 |
| Number of pages | 7 |
| DOIs | |
| Publication status | Published - 2008 Nov 17 |
| Event | 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 - Daejeon, Korea, Republic of Duration: 2008 Aug 28 → 2008 Aug 29 |
Publication series
| Name | Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 |
|---|
Other
| Other | 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 |
|---|---|
| Country | Korea, Republic of |
| City | Daejeon |
| Period | 08/8/28 → 08/8/29 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Information Systems
Cite this
}
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 (Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008).Research output: Chapter in Book/Report/Conference proceeding › Conference 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
AN - SCOPUS:55849130352
SN - 9780769533285
T3 - Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008
SP - 327
EP - 333
BT - Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008
ER -