Energy Priority Of The Wireless Sensor Network Routing Algorithm

Wireless Sensor Network(WSN),as a new technology, combines the logical information world with the objective physical world and has greatly changed the interactive way between human beings and nature. It has been praised as one of the three hi-tech industries which are going to be popular in the future world. It is easy to fix up and acquires the connecting ability of ad hoc and efficiency. With the sensor, embedded calculation, network and wireless communication combined together, it is a completely new technology in information acquirement and processing. Besides, as a new network without infrastructure, it is able to oordinately inspect and sense various environments and collect the information from them as well as the object being inspected. After that, it is able to process the collected information and send them to the users. Originally it was applied to the military field, but the lower-cost sensor node has been able to be used in many areas such as space exploration, radiation detection, early warning of flood, management of fields, biology community observation, tracking the mobile objects, survey of the environment and meteorology,the intelligent transportation and intelligent residence.WSN have much differences from the traditional network communication technology, and one of the essential problem is the energy consumption of sensor nodes. Lowering the energy consumption of sensor nodes must be realized on each layer in protocol stack, and this article concentrate on the WSN routing protocol. At first, we studied the hardware framework, the network protocol structure and the characteristics of different classifications in WSN; and then, after analyzing and comparing the routing protocol directed to the wireless sensor network put forward by other countries, we designed the energy efficience routing algorithm CRUAM based on these idea.CRUAM algorithm put forward by this article is based on the idea of LEACH algorithm, which divides the algorithm into three parts: clustering, data transmission and Intra-cluster Head Rotatin. In the first part, the energy information of node has been thoroughly taken into account to make the cluster head be changed adaptively. During the Data Transmission, the sink node partition the progress into several rounds, and the cluster head assign a time slot to each cluster member. At the end of each Round, the cluster head initiates an intra-cluster head rotating to disperse the overload of heads, which is based on node energy and the distance to sink node. In the process of emulation, the algorithm mentioned above has undergone the emulational analysis and it has proved that the said algorithm functions well in balancing the energy of the nodes, improving the energy consuming efficiency, increasing the reliability of cluster head node transmit data and prolonging the lives time of the networks. The algorithm suit for the wireless sensor networks that can't move, and it has higher performance compared with the former LEACH algorithm.