Researches On Data Fusion For Hierarchical Clustering In Wireless Sensor Networks

As the result of combination of sensor, micro-electronics and wireless communication technologies, wireless sensor network has become an active branch of computer science. It has been widely applied to military and civil applications. It consists of a large number of low-cost, low-power and tiny sensor nodes, which have some computing and self-organizing capabilities. Sensor nodes usually carry limited power sources, which are difficult to replace owing to their working environment. Therefore, the primary problem for wireless sensor network is how to determine the most efficient way of conserving the energy of power source to maximize its lifetime.Most of recent energy conserving algorithms are based on layered network model, which only focus on the individual layer issues and ignore the importance of interworking between different layers in a wireless sensor network. Such single layer approach results in inefficacy and wastes source. Sensor node in the energy, the limited computing power, so the transmission of redundant data to a certain extent, excessive energy consumption, and data aggregation technology can eliminate data redundancy and reduce the number of transmissions, so as to reduce the burden on network bandwidth and the thousands on million packet processing brought about by energy depletion.In this paper, we research hierarchical routing and data aggregation technology, we present a hierarchical algorithm based on communication range restraining clustering. It first study single-level Protocol based on communication range restraining clustering and then father node is selected in every layer in terms of communication range restraining to reduce the number of data package transmission. The hierarchical algorithm based on communication range restraining clustering algorithm is compared with EEUC by simulation in OMNET++. The simulation results show that the protocol significantly reduce the energy consumption for data collection in wireless sensor networks, demonstrate that the features good practicability, robustness and ensures low energy consumption and variable network topological structure.Secondly, a stratification based on energy aggregation in order to build a tree method, The algorithm uses multi-hop routing, select the source node to the target path of nodes sharing the longest shortest path allows each node can save energy. This protocol and the performance of routing LEACH a comparative analysis has greatly improved the performance of the protocol.