Volume 4, Issue 1, July 2014, Pages 47–53
Aarthi. T1 and Pritha. T2
1 PG Student, Department of Computer Science and Engineering, Tagore Institute of Engineering and Technology, Attur-636112, Tamilnadu, India
2 PG Student, Department of Computer Applications, Dhanalakshmi Srinivasan Arts and Science College for Women, Perambalur-621212, Tamilnadu, India
Original language: English
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Wireless Sensor Networks (WSNs) are networks that consist of sensors which are used to monitor physical or environmental conditions. The resources especially energy in WSNs are limited. Data sampled by sensor nodes have redundancy, data aggregation becomes an effective method to reduce amount of data that need to send to base station. Data Aggregation is the process of aggregating the data from distributed sensors to eliminate redundant transmission and provide fused information to the base station. The existing schemes, Attribute aware Data Aggregation (ADA) make the packets with the same attribute convergent for an efficient aggregation. ADA scheme is based on the concept of potential in physics and pheromone in ant colony. The overhead is that different depth values with respect to different sinks need to be maintained by nodes. In this paper to ensure the packets reach the sink at last Dynamic Scheduling (DS) is proposed. Dynamic Scheduling is implemented using the currently available information without the necessity of predicting the future.
Author Keywords: Data aggregation, Redundancy, Potential, Packets, Transmission.
Aarthi. T1 and Pritha. T2
1 PG Student, Department of Computer Science and Engineering, Tagore Institute of Engineering and Technology, Attur-636112, Tamilnadu, India
2 PG Student, Department of Computer Applications, Dhanalakshmi Srinivasan Arts and Science College for Women, Perambalur-621212, Tamilnadu, India
Original language: English
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Wireless Sensor Networks (WSNs) are networks that consist of sensors which are used to monitor physical or environmental conditions. The resources especially energy in WSNs are limited. Data sampled by sensor nodes have redundancy, data aggregation becomes an effective method to reduce amount of data that need to send to base station. Data Aggregation is the process of aggregating the data from distributed sensors to eliminate redundant transmission and provide fused information to the base station. The existing schemes, Attribute aware Data Aggregation (ADA) make the packets with the same attribute convergent for an efficient aggregation. ADA scheme is based on the concept of potential in physics and pheromone in ant colony. The overhead is that different depth values with respect to different sinks need to be maintained by nodes. In this paper to ensure the packets reach the sink at last Dynamic Scheduling (DS) is proposed. Dynamic Scheduling is implemented using the currently available information without the necessity of predicting the future.
Author Keywords: Data aggregation, Redundancy, Potential, Packets, Transmission.
How to Cite this Article
Aarthi. T and Pritha. T, “Implementation of Energy Efficient Scheduling - Based Data Aggregation through Dynamic Routing in Wireless Sensor Networks,” International Journal of Innovation and Scientific Research, vol. 4, no. 1, pp. 47–53, July 2014.
