Abstrato

Tree Based Data Aggregation Algorithm to Increase the Lifetime of Wireless Sensor Network

P.Parthasarathy, R.Karthickeyan

Wireless sensor networks are becoming increasingly important in recent years due to their ability to detect and convey real time information for many civilian and military applications. The most important challenge faced by WSNs is battery-limited lifetime of the network. Physically replacing batteries is infeasible in most real-life deployments of WSNs. Longer lifetime of the devices can be achieved by reducing the delay and the energy consumption. Hence this project aims to reduce energy during delay on collection of data, and hence by this process gathering information by sensor nodes is achieved. There are strong needs to develop wireless sensor networks algorithms with optimization priorities biased to aspects besides energy saving. In order to minimize delays in the data collection process of wireless sensornetworks, clustering is used. This exploits use of clustering for reducing the delayduring data collection process. The two network formation algorithms, centralized top-down and decentralized bottom-up clustering is considered and analyzed for shortening delays in the data collection process for Single and Multiple-cluster network structure. Cluster data fusion and routing algorithms are considered with data packets generated by sensor nodes.