Research Of Routing Protocols For Wireless Sensor Networks

Wireless sensor networks, which currently is one of the most hot spot in IT, has a promisingperspective and will have a tremendous impact on each field of human life. Routing technology isan important component of wireless sensor network. Meanwhile, the energy of nodes widelydeployed in wireless sensor networks is limited and non-rechargeable. Therefore, improving energyutilization has been the most important goals in the routing protocol.This paper focuses on the clustering algorithm of WSN router protocol and the effectivemethods of energy utilization. By adjusting the network structure, balancing node energyconsumption and reducing network data traffic, an appropriate routing protocol for wireless sensornetworks is designed to reduce the energy consumption of sensor nodes and to prolong the life cycleof the entire network. The main research and results are as follows:In this thesis, the architectures and features of wireless sensor networks are introduced, andtypical routing protocols of wireless sensor network are analyzed and classified. Then, theadvantages and disadvantages and the general ideas of clustering routing protocols in wirelesssensor network was put forward. Finally an improved algorithm ECWC based on typical clusteringrouting protocol LEACH is proposed.In Chapter IV and Chapter V，two cluster-based routing protocols for wireless sensor networksare proposed for the problem of uneven energy consumption of nodes. The first protocol is theenergy-efficient hierarchical multiple vice-cluster-head algorithm and the other the energy-efficienthierarchical algorithm based on weight and opportunity value.To ameliorate the situation that some nodes die too early due to the uneven energyconsumption for hierarchical routing in wireless sensor networks，the mechanism of cluster headselection and the cluster structure in the EHMVA has been improved. The algorithm introduces theconcept of neighbor distance in the cluster head selection mechanism，uses vice-cluster-headmechanism to share the energy consumption of primary cluster-heads，adds the concept oflink-nodes，sends data according to the errors and extends the stable cluster communication phasesto reduce the frequency of cluster reconstruction. Simulation results demonstrate that the energyconsumption is more even in EHMVA so as to prolong network lifetime effectively.Concerning the deficiencies of low energy adaptive clustering hierarchy (LEACH) routingprotocol that distribution of cluster structure is unreasonable and cluster- head nodes consumeexcessive energy，EHAWO improved the algorithm for cluster head selection phase and stable datatransfer phase.The algorithm elects the nodes within the cluster to share the energy consumption ofcluster-heads，adjusts threshold to improve cluster head election mechanism，sets up routing tree toimprove the routing between clusters and extends the stable cluster communication phases to reducethe frequency of cluster reconstruction. Simulation results demonstrate that the energy consumptionis more even in EHAWO so as to prolong network lifetime effectively. The simulations show that itcan minimize the communication load and maximize the energy saving.