Study On The Energy-efficient Routing Algorithm For Wireless Sensor Network Based On Cluster Structure Improvement

Wireless sensor networks(WSN) is a new method of collecting data and all important creative project in computer network area, wireless sensor networks have a variety of applications including military surveillance, environmental monitoring, medical treatments, and commercial business.Since the sensor nodes are power-constrained, energy efficient protocols need to be designed to prolong the lifetime of networks. Sensor networks with better performance in scalability and energy efficiency than flat routing protocols, which makes them the major routing protocols for wireless sensor networks. Thus, to the classical clustering routing protocol of wireless sensor network LEACH protocol is studied and the simulation, due to the random selection of cluster head, there are inevitably some shortcomings such as unreasonable cluster head and uneven energy consumption of sensor nodes. This paper analyzes the shortage of the traditional algorithm LEACH. We propose effective data gathering and energy efficient clustering scheme (EDGE) which ensures the equal distribution of cluster head responsibility among the sensor nodes and better suits the periodic data gathering applications.Our approach selects cluster head based on three metrics. We also propose two hop communication by selecting one gateway node. We simulate EDGE with two hop communication and without two hop communication. Simulation results shows that our approach significantly improve the network lifetime.Based on systematic analysis of relative works on cluster-based routing protocols, respectively for heterogeneous networks, this dissertation focuses on cluster head selection mechanism and low energy data transmission in cluster-based routing protocols. We study the performance improvements brought by SEP、DEEC compared to LEACH. We also point out shortcomings of SEP, DEEC. We propose the improved algorithm DCEH based on DEEC for the limitations of SEP and DEEC. This algorithm introduces a weighted factor λ. Adjusting the value of λ we can optimize the election probability of a advanced node and this can prolong the lifetime of the network. We simulate DCEH algorithm with MATLAB at the case in the two-level heterogeneous networks.We study the relationship between heterogeneous parameters a,m, and the network lifetime, and the optimal value of λ under specific a, m. We also analyze the relationship between a and m. Simulation results show that results show that the DCEH algorithm provides longer lifetime and higher throughput than the current important clustering protocols in heterogeneous environments.