Dynamic Cluster Head Rotation for Data Aggregation in Wireless Sensor Networks

Routing algorithms are driving the growth of the data transmission in wireless sensor network. Many algorithms proposed for efficient data transferring. This paper uses the scenario and node distribution across the battle field in India. This paper uses clustering algorithms to send the data over different geographic region. During the battle, data gathering and data aggregation to base station is important and critical task. Based on event, clustering algorithm used. This paper assumes that sensor node uniformly distributed and coordinates of the base station and nodes are known. This paper is essential to enable the cluster head based selection scheme used in battle field and the performance of proposed protocol compute intensive and can significantly benefit over the other scheme. Proposed scheme having better data gathering, throughput, packet delivery ratio, and energy, control over head and lifetime than the AODV scheme. The proposed scheme is implemented and stimulated with AODV in NS2.33 simulation shows protocol performance gains in the better over the AODV for lifetime of network and guaranteed data transmission.