On Network Correlated Data Gathering Attribute Aware Potential Based Dynamic Routing In Networks

International Journal of Communication and Media Science

© 2015 by SSRG - IJCMS Journal

Volume 2 Issue 1

Year of Publication : 2015

Authors : R.Nithya, Dr.K.Prasanth, B.Meenalosani, S.Manimegalai, S.Ambal and G.Abirami

10.14445/2349641X/IJCMS-V2I1P101

How to Cite?

R.Nithya, Dr.K.Prasanth, B.Meenalosani, S.Manimegalai, S.Ambal and G.Abirami, "On Network Correlated Data Gathering Attribute Aware Potential Based Dynamic Routing In Networks," SSRG International Journal of Communication and Media Science, vol. 2,  no. 1, pp. 1-5, 2015. Crossref, https://doi.org/10.14445/2349641X/IJCMS-V2I1P101

Abstract:

Network without any data collusions. Here, we are transmitting the data in the form of encrypted packets through network to destination without any misplacement of data packets .To fulfilling that, data aggregation is used. Data aggregation has been widely recognized as an efficient method to reduce energy consumption in wireless sensor networks, which can support a wide range of applications such as monitoring temperature, humidity, level, speed etc. The data sampled by the same kind of sensors have much redundancy since the sensor nodes are usually quite dense in wireless sensor networks. To make data aggregation more efficient, the packets with the same attribute, defined as the identifier of different data sampled by different sensors such as temperature sensors, humidity sensors, etc., should be gathered together. However, to recognize that the present data aggregation mechanisms did not take packet attribute into consideration. In this paper, we take the lead in introducing packet attribute into data aggregation and propose an Attribute-aware Data Aggregation mechanism using Dynamic Routing (ADADR) which can make packets with the same attribute convergent as much as possible and therefore improve the efficiency of data aggregation.

Keywords:

Dynamic Routing , Data Gathering Attribute

References:

[1] R. Szewczyk, A. Mainwaring, J. Polaster, and D. Culler, “An Analysis of a Large Scale Habitat Monitoring Application,” Proc. ACM Int’l Conf. Embedded Networked Sensor Systems
(SenSys), 2004.
[2] M. Hefeeda and M. Bagheri, “Forest Fire Modeling and Early Detection Using Wireless Sensor Networks,” Ad Hoc and Sensor Wireless Networks, vol. 7, nos. 3/4, pp. 169-224, Apr. 2009.
[3] Q. Fang, F. Zhao, and L. Guibas, “Lightweight Sensing and Communication Protocols for Target Enumeration and Aggregation,” Proc. Fourth Int’l ACM Symp. Mobile Ad Hoc Networking and Computing, 2003.
[4] D.L. Hall and J. Llinas, “An Introduction to Multisensor Data Fusion,” Proc. IEEE, vol. 85, no. 1, pp. 6-23, Jan. 1997.
[5] D. Li, K. Wong, Y.H. Hu, and A. Sayeed, “Detection, Classification and Tracking of Targets in Distributed Sensor Networks,” IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 17-29, Mar. 2002.
[6] T. Clouqueur, K.K. Saluja, and P. Ramanathan, “Fault Tolerance in Collaborative Sensor Networks for Target Detection,” IEEE Trans. Computer, vol. 53, no. 2, pp. 320-333, Mar. 2004.
[7] X. Sheng and Y.H. Hu, “Energy Based Acoustic Source Localization,” Proc. IEEE Int’l Conf. Information Processing in Sensor Networks, pp. 285-300, 2003.
[8] M. Ding, X. Cheng, and G. Xue, “Aggregation Tree Construction in Sensor Networks,” Proc. IEEE 58th Vehicular Technology Conf.pp. 2168-2172, Oct. 2003.
[9] H.O. Tan and I. Korpeoglu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks,” SIGMOD Record, vol. 32, no. 4, pp. 66-71, Dec. 2003.
[10] J. Li, A. Deshpande, and S. Khuller, “On Computing Compression Trees for Data Collection in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2010.
[11] W. Zhang and G. Cao, “DCTC: Dynamic Convoy Tree-based Collaboration for Target Tracking in Sensor Networks,” Ad Hoc and Sensor Wireless Networks, vol. 3, pp. 1689-1701, Sept. 2004.