Modified OCABTR based Hierarchical Two Level Data Aggregation in Wireless Sensor Networks
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 3
Abstract
In Wireless Sensor Network (WSN), it is necessary to optimize the energy of the sensor node. Each sensor node is equipped with a battery which is used for sensing and processing the data. Cluster based data aggregation and transmission reduce the communication overload by eliminating the redundant data transmission. In this paper, an energy efficient hierarchical data aggregation technique based on Optimized Cluster Algorithm Based on Target Routing (OCABTR) is proposed. In this approach, data aggregation is performed twice in order to reduce the data size so that network life time can be increased. Genetic algorithm is used for self-organizing the nodes into clusters based on the nodes sensing the similar targets and cluster head election is performed based on the cost and energy of the node. Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol is used. The proposed technique is simulated using Network Simulator and various performances have been studied.
Authors and Affiliations
J. Rejina Parvin , Dr. C. Vasanthanayaki
Keywords
Related Articles
- EP ID EP135060
- DOI -
- Views 107
- Downloads 0
PRODUCTIVE CO PROCESSOR DESIGN BASED ON PROGRAM BENCHMARK
The objective of this paper is to design a methodology where many co-processors are accessed by the processor in array mode. By using co processor, the work on the multi core processor gets reduced by accessing it in arr...
Dynamic Approach for Data Scrubbing Process
It is very difficult to over-emphasize the benefits of accurate data. Errors in data are generally the most expensive aspect of data entry, costing the users even much more compared to the original data entry. Unfortunat...
Intelligent Data Compression Approach in Multidimensional Data Warehouse
The problem with MOLAP is that large tables should be loaded in main memory, which can slow the system, even saturate the memory. In this work, we present a new compression method, called BTC, for multidimensional data w...
Efficient Storage Reduction of Frequency of Items in Vertical Data Layout
The digital databases are immersed with large amount of data. The explosive growth of massive amounts of data leads to space complexity, performance degradation, scalability and time complexity. We cannot stop the incomi...
Graph based Approach and Clustering of Patterns (GACP) for Sequential Pattern Mining
The sequential pattern mining generates the sequential patterns. It can be used as the input of another program for retrieving the information from the large collection of data. It requires a large amount of memory as we...