An Efficient Data Aggregation Scheme and Cluster Optimization in Wireless Sensor Networks.
Wireless Sensor Networks is a collection of sensor nodes with sensing, computation and communication capabilities. The sensor nodes are capable of receiving data from the monitoring environment. The sensed data should be gathered efficiently from the sensor nodes and is routed to base station through fixed path. The QoS metrics such as Bandwidth, Latency, Data accuracy, Throughput can also affect the performance of the network lifetime. The effective solution to address this challenge is to utilize the sink node’s mobility to facilitate the data gathering .This technique can reduce energy consumption of the sensor nodes. The usage of mobile sink presents additional challenges such as determining the sink node’s trajectory and cluster formation prior to data collection. Network lifetime is an important issue in an energy constrained sensor networks. The most widely used Expectation maximization (EM) algorithm is used for clustering process and to compute the optimal number of clusters in the network. One of the main problem is the implementation of flooding diffusion which is used to forward interest and discover the routing map that reduces network lifetime and data latency through high energy consumption by the use of AODV(Ad hoc on demand distance vector )routing .