READA: Redundancy Elimination for Accurate Data Aggregation in Wireless Sensor Networks
- 1
- 2
- 3
Abstract
In monitoring systems, multiple sensor nodes can detect a single target of interest simultaneously and the data collected are usually highly correlated and redundant. If each node sends data to the base station, energy will be wasted and thus the network energy will be depleted quickly. Data aggregation is an important paradigm for compressing data so that the energy of the network is spent efficiently. In this paper, a novel data aggregation algorithm called Redundancy Elimination for Accurate Data Aggregation (READA) has been proposed. By exploiting the range of spatial correlations of data in the network, READA applies a grouping and compression mechanism to remove duplicate data in the aggregated set of data to be sent to the base station without largely losing the accuracy of the final aggregated data. One peculiarity of READA is that it uses a prediction model derived from cached values to confirm whether any outlier is actually an event which has occurred. From the various simulations conducted, it was observed that in READA the accuracy of data has been highly preserved taking into consideration the energy dissipated for aggregating the data
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “Wireless Sensor Networks: A Survey,” Elservier Computer Networks, Vol. 38, No. 4, March 2002, pp. 393-422.
- B. Warneke and K. S. J. Pister, “MEMS for Distributed Wireless Sensor Networks,” 9th International Conference on Electronics, Circuits and Systems, Dubrovnik, 15-18 September 2002.
- J. Kulik, W. R. Heinzelman and H. Balakrishnan, “Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks,” Wireless Networks, Vol. 8, March 2002, pp. 169-185.
- R. Rajagopalan and P. K. Varshney, “Data-Aggregation Techniques in Sensor Networks: A Survey,” IEEE Communication Surveys and Tutorials, Vol. 8, No. 4, December 2006, pp. 48-63.
- X. Li, “A Survey on Data Aggregation in Wireless Sensor Networks,” Project Report for CMPT 765, Spring 2006.
- H. Albert, R. Kravets and I. Gupta, “Building Trees Based On Aggregation Efficiency in Sensor Networks,” Ad Hoc Networks, Vol. 5, No. 8, November 2007, pp. 1317-1328.
- S. R. Madden, M. J. Franklin, J. M. Hellerstein and W. Hong, “TAG: Tiny Aggregation Service for Ad-Hoc Sensor Networks,” Proceedings of the 5th symposium on Operating Systems Design and Implementation, Boston, December 2002.
- E. Fasolo, M. Rossi, J. Widmer and M. Zorzi, “In-network Aggregation Techniques for Wireless Sensor Networks: A Survey,” IEEE Wireless Communications, Vol. 14, No. 2, April 2007, pp. 70-87.
- O. Younis and S. Fahmy, “HEED: A Hybrid, Energy Efficient, Distributed Clustering Approach for Ad-hoc Sensor Networks,” Proceedings of IEEE Transactions on Mobile Computing, Vol. 3, No. 4, October-December 2004, pp. 366-379.
- R. Rajagopalan and P. K. Varshney, “Data-Aggregation Techniques in Sensor Networks: A Survey,” IEEE Communication Surveys and Tutorials, Vol. 8, No. 4, December 2006, pp. 48-63.
- S. Tanachaiwiwat and A. Helmy, “Correlation Analysis for Alleviating Effects of Inserted Data in Wireless Sensor Networks,” Proceedings of the 2nd Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, San Diego, July 2005, pp. 97- 108.
- T. Schoellhammer, B. Greenstein, E. Osterweil, M. Wimbrow and D. Estrin, “Lightweight Temporal Compression of Microclimate Datasets,” 29th Annual IEEE International Conference on Local Computer Networks, Washington, DC, November 2004, pp. 516-524.