Research Of Energy Density-Based Cluster Routing Protocol For Wireless Sensor Network

Wireless Sensor Networks (WSN) is a hotspot of information technology that brings great influence on people's lives after Internet. The responsibility of routing algorithms at the network layer is to deliver data between source and destination nodes which is vital to wireless sensor network. As a hot research topic of routing technology, cluster-based routing protocols have many advantages, such as network topology management, energy minimization, data aggregation and so on.This paper focuses on the issues of the energy efficiency and balance of cluster-based routing protocols of wireless sensor network. After systematic analysis and summary of some current work on routing algorithms, aiming at solving shortcomings of cluster-based routing algorithms, an Energy Density Adaptive Clustering Hierarchy EDACH is proposed in this paper. The EDACH selects cluster heads periodically according to their residual energy and the density of nodes distribution to make nodes in monitoring region consuming energy uniformly so that network lifetime can be extended and coverage of region monitoring can be enlarged. Simulation results show that the algorithm performs better than LEACH in improvement on the network lifetime and ratio of monitoring coverage in region.