Research Of Energy-Saving Routing Algorithm For Wireless Sensor Network

With the rapid development of low-power wireless communication technology, sensor technology, MEMS technology and embedded systems technology, wireless sensor networks as a new technology of information acquisition and processing is gradually changing our lives. Wireless sensor network is a multi-hop, self-organizing wireless network, every node in which can transmit data and communicate with each other. Wireless sensor network nodes can detect and perceive environmental information. A sensor node usually has four components, including sensing module, a processor module, a wireless communication module, power management module.The biggest problem in the development of wireless sensor network is energy limited. We can save energy consumption from two aspects, which are the energy consumption of information processing and the energy consumption of data transmission. IC has now reached22-nanometer process, information acquisition and processing power consumption can be improved relatively small, but there is a great routing protocol research space. The traditional routing algorithms minimize the average delay between nodes by distance vector or link state, without considering the problem of energy consumption. Flat routing protocols lack the optimal management of communication resources, with complex of self-organization algorithms, have many routing hops and the slow reaction to changes in network topology. It has not been able to adapt to the development of large-scale wireless sensor networks. Hierarchical routing protocol reduces the amount of data transmitted over the network through the cluster head collection data, is a very good solution to these problems. LEACH is the typical hierarchical routing protocol in wireless sensor networks. There are many improved versions on the basis LEACH agreement, such as LEACH-C protocol, PEGSIS protocol, the TEEN protocol.This paper introduces the background of wireless sensor networks, research status of wireless sensor networks. And then, this paper discusses the architecture of wireless sensor network node, architecture and features of network, the key technologies of wireless sensor network routing protocol, described and compared with a variety of typical routing protocol. In connection with disadvantage of LEACH, such as uneven distribution of cluster head, unreasonable mechanism of cluster head selection, the communication between base cluster head and station by single hop, we proposed the improved algorithm, called LEACH-DT (LEACH-Dynamic threshold). LEACH-DT makes full use of the characteristic of sufficient energy in base station. The base station calculates the optimal number of cluster head node based on the energy and density of nodes, select the cluster head nodes and then Broadcasting to the entire network. As the energy in cluster head is less than the Energy threshold, the cluster head executes node cluster head rotation in the cluster. When rotating, we must take the position and energy of the nodes into account. Also, we use multi-hop communication between cluster heads and base stations. In this stage, we construct shortest path tree of the cluster heads by Dijkstra algorithm. Through using multi-hop transmission to the base station, there is effectively reducing the energy consumption and to ensure that the network load balancing. Proven by the simulation experiment, LEACH-DT algorithm balances the energy consumption of each network node, reduces energy consumption, delays the time of death of the first node, extend the life time of the network, improve the network throughput.