consistent & trivial routing approach for in- network aggregation in wireless sensor network

D.P.Dhame,P.R.Jagdale,H.S.Kadam,D.B.Nanaware

Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology

ISSN: 2321-3337          Impact Factor:1.521         Volume:5         Issue:3         Year: 22 March,2015         Pages:384-390

International Journal of Advanced Research in Computer Science Engineering and Information Technology

Abstract

A wireless sensor network (WSNs) consists of many sensor nodes and these networks are deployed in different applications for monitoring environmental conditions. These sensor nodes are limited energy which limit the lifetime of a sensor network. In WSN’s nodes are densely located, so there is duplication of data as multiple nodes sensing same event. Such duplication of data is responsible for wastage of node energy. Since energy saving is one of the important issues. So, data aggregation, data fusion should be used for saving energy. Data aggregation is effective method. It eliminate redundancy and to minimize the number of transmission. In this paper we present an efficient, trivial data aggregation strategy based on tree & cluster formation which eliminates such data duplication and improves node energy, efficiency & provides the best aggregation quality when compared to other existing systems, regarding scalability, communication cost, delivery efficiency, aggregation rate and aggregated data delivery rate. These node structures are then used to route packets to sink in an efficient manner. This helps in building efficient wireless sensor network.

Kewords

Data Aggregation, Information Fusion, In- Network Aggregation, Routing Protocol, Routing Tree.

Reference

[1] Leandro Villas, Azzedine Boukerche1, Heitor S. Ramos, ―DRINA: A Lightweight and Reliable Routing Approach for in-Network Aggregation in Wireless Sensor Networks Wireless Sensors, 2012. [2] E. F. Nakamura, A. A. F. Loureiro, and A. C. Frery, ―Information fusion for wireless sensor networks: Methods, models, and classifications, ACM Computing Surveys, vol. 39, no. 3, pp. 1/9–55, 2007. [3] H. S. Abdel Salam and S. Olariu, ―A lightweight skeleton construction algorithm for self-organizing sensor networks in ICC. IEEE, 2009, pp. 1–5. [4] E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, ―In-network aggregation techniques for wireless sensor networks: a survey, Wireless Communications, IEEE, vol. 14, no. 2, pp. 70–87, April 2007. [5] A. Boukerche, Algorithms and Protocols for Wireless Sensor Networks. Wiley-IEEE Press, 2008. [6] J. Al-Karaki and A. Kamal, ―Routing techniques in wireless sensor networks: a survey, Wireless Communications, IEEE, vol. 11, no. 6, pp. 6–28, Dec.2004 [7] F. Hu, X. Cao, and C. May, ―Optimized scheduling for data aggregation in wireless sensor networks, in ITCC ’05: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’05) - Volume II. Washington, DC, USA: IEEE Computer Society, 2005, pp. 557–561 [8] L.A. Villas, A. Boukerche, R. B. Araujo, and A. A. Loureiro, ―A reliable and data aggregation aware routing protocol for wireless sensor networks, in Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, ser. MSWiM 09. New York, NY, USA: ACM, 2009, pp. 245–252.