CFP last date
20 May 2024
Reseach Article

An Approach to Develop Fast and Efficient Routing for In-Network Aggregation

by Vishal Vitthal Bandgar, A. S. Bhatlavande, G.a.fattepurkar, Supriya A. Shegdar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 13
Year of Publication: 2015
Authors: Vishal Vitthal Bandgar, A. S. Bhatlavande, G.a.fattepurkar, Supriya A. Shegdar
10.5120/19249-0909

Vishal Vitthal Bandgar, A. S. Bhatlavande, G.a.fattepurkar, Supriya A. Shegdar . An Approach to Develop Fast and Efficient Routing for In-Network Aggregation. International Journal of Computer Applications. 109, 13 ( January 2015), 23-26. DOI=10.5120/19249-0909

@article{ 10.5120/19249-0909,
author = { Vishal Vitthal Bandgar, A. S. Bhatlavande, G.a.fattepurkar, Supriya A. Shegdar },
title = { An Approach to Develop Fast and Efficient Routing for In-Network Aggregation },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 13 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 23-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number13/19249-0909/ },
doi = { 10.5120/19249-0909 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:44:42.905348+05:30
%A Vishal Vitthal Bandgar
%A A. S. Bhatlavande
%A G.a.fattepurkar
%A Supriya A. Shegdar
%T An Approach to Develop Fast and Efficient Routing for In-Network Aggregation
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 13
%P 23-26
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Huge scale thick Remote Sensor Networks (Wsns) will be progressively sent in distinctive classes of uses for precise checking. Because of the high thickness of hubs in these networks, it is likely that excess information will be caught by adjacent hubs when sensing an occasion. Since vitality preservation is a key issue in Wsns, information combination and aggregation ought to be misused in request to spare vitality. For this situation, excess information can be accumulated at halfway hubs lessening the size and number of traded messages and, accordingly, diminishing correspondence expenses and vitality utilization. In this work, we propose a novel Information. Directing for In-System Aggregation, called DRINA, that has some key viewpoints, for example, a diminished number of messages for setting up a steering tree, expanded number of covering courses, high aggregation rate, and dependable information aggregation and transmission. The proposed DRINA calculation was widely contrasted with two other known arrangements: the Data Combination based Part Task (Infra) and Briefest Way Tree (SPT) calculations. Our results demonstrate obviously that the directing tree constructed by DRINA gives the best aggregation quality when contrasted with these different calculations. The acquired results demonstrate that our proposed arrangement beats these arrangements in diverse situations and in distinctive key perspectives needed by Wsns.

References
  1. Leandro Aparecido Villas, Azzedine Boukerche, Heitor Soares Ramos, Horacio A. B. Fernandes de Oliveira, Regina Borges de Araujo, and Antonio Alfredo Ferreira Loureiro, "DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks", IEEE TRANSACTIONS ON COMPUTERS, VOL. 62, NO. 4, APRIL 2013.
  2. E. Cohen and H. Kaplan, "Spatially-Decaying Aggregation Over a Network: Model and Algorithms," in ACM SIGMOD 2004, Paris, France, Jun. 2004.
  3. A. Sharaf, J. Beaver, A. Labrinidis, and K. Chrysanthis, "Balancing energy efficiency and quality of aggregate data in sensor networks," The VLDB Journal, vol. 13, no. 4, pp. 384–403, Dec. 2004.
  4. E. Cayirci, "Data Aggregation and Dilution by modulus addressing in wireless sensor networks," IEEE Communications Letters, vol. 7, no. 8, pp. 355–357, Aug. 2003.
  5. T. Abdelzaher, T. He, and J. Stankovic, "Feedback control of data aggregation in sensor networks," in IEEE CDC 2004, Atlantis, Paradise Island, Bahamas, Dec. 2004.
  6. S. Nath, P. B. Gibbons, Z. R. Anderson, and S. Seshan, "Synopsis Diffusion for Robust Aggregation in Sensor Networks," in ACM SenSys 2004, Baltimore, MD, US, Nov. 2004.
  7. F. Hu, X. Cao, and C. May, "Optimized Scheduling for Data Aggregation in Wireless Sensor Networks," Proc. Int'l Conf. Information Technology: Coding and Computing (ITCC '05), pp. 557-561, 2005.
  8. I. Solis and K. Obraczka, "The Impact of Timing in Data Aggregation for Sensor Networks," IEEE Int'l Conf. Comm. ,vol. 6, pp. 3640-3645, June 2004.
  9. B. Krishnamachari, D. Estrin, and S. B. Wicker, "The Impact of Data Aggregation in Wireless Sensor Networks," Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCSW '02), pp. 575-578, 2002.
  10. J. Al-Karaki, R. Ul-Mustafa, and A. Kamal, "Data Aggregation in Wireless Sensor Networks—Exact and Approximate Algorithms," Proc. High Performance Switching and Routing Workshop (HPSR '04), pp. 241-245, 2004.
  11. G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in Graphs," Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '00), pp. 770-779, 2000.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless sensor networks Routing protocol in-network aggregation.