DocumentCode
166468
Title
DA-DCT: Data Aggregation Using Discrete Cosine Transform in Wireless Sensor Networks
Author
Kideok Kwon ; Hyunwoo Ju ; Younghwan Yoo
Author_Institution
Dept. of Comput. Eng., Pusan Nat. Univ., Busan, South Korea
fYear
2014
fDate
13-16 May 2014
Firstpage
251
Lastpage
254
Abstract
A recent trend in the data aggregation research is to utilize an optimal or suboptimal tree. These approaches, however, have high computational complexity, and the tree must be reconstructed whenever the topology changes. To avoid this overhead, the proposed method does not use any data aggregation tree. In our method, each sensor sends aggregated data with an aggregation period and receive buffer size computed by itself leveraging DCT (Discrete Cosine Transform) analysis. Based on the DCT analysis of packet arrival rate, sensors select the period and buffer size that are suitable for themselves. Finally, a simple simulation is used to assess the usefulness of DCT in WSNs (Wireless Sensor Networks). The simulation results show that the proposed method decreases the number of transmissions by about 70 percent without much overhead.
Keywords
computational complexity; discrete cosine transforms; trees (mathematics); wireless sensor networks; DA-DCT; DCT analysis; WSNs; buffer size; computational complexity; data aggregation; discrete cosine transform; optimal tree; packet arrival rate; suboptimal tree; wireless sensor networks; Computational complexity; Data models; Discrete cosine transforms; Energy consumption; Frequency-domain analysis; Topology; Wireless sensor networks; Data Aggregation; Discrete Cosine Transform; Wireless Senor Network;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications Workshops (WAINA), 2014 28th International Conference on
Conference_Location
Victoria, BC
Print_ISBN
978-1-4799-2652-7
Type
conf
DOI
10.1109/WAINA.2014.50
Filename
6844646
Link To Document