Research On Energy-efficient Routing Algorithm For Wireless Sensor Networks

As the development of wireless cmmunication, embedded computing technology and micro-electro-mechanical systems technology, Wireless Sensor Networks(WSN) has aroused widespread concern.WSN which consists of a number of sensor nodes deployed in the monitoring area, is a multi-hop and self-organizing network system by radio communications and it can be used in the fields of military, environmental protection, traffic,medical treatment,and disaster warning,etc.In WSN,sensor nodes rely on battery power supply. The energy of the nodes is very limited, and can't be complemented in most situations.So how to use energy efficiently becomes an important research topic,and to design energy-efficient routing protocols is an important method to save energy consumption.Based on the purpose of use energy efficiently and prolong the network lifetime, this paper research on routing algorithm in WSN.At the beginning,the architecture, characteristic,and application of WSN are introduced;And then,existing routing protocols are classified and the main idea, advantage and disadvantage of typical routing protocols in WSN are analyzed in detail;Base on the work,summarizes the requirements for designing energy-efficient routing protocols.The work in this paper includes:Firstly, an Energy-efficient Clustering Algorithm in Heterogeneous sensor networks(ECAH)was proposed which in the model composed by different types of nodes.In this algorithm,the value of every node's available energy is mapped into time delay, so the nodes with larger energy was selected as cluster head;Establish a routing tree between the cluster heads for data transmission.In each round, predestines cluster head depend on available energy, energy consumption speed, and distance with current cluster head to apply to the heterogeneous sensor networks.It saves the energy, prolonging network lifetime.With the simulation in OMNeT++, comparing with REECR and LEACH, results show ECAH have better energy efficiency and prolong the network lifetime efficiently.Secondly, a QoS and energy balancing routing algorithm(QERA) was proposed aiming at such drawbacks in some existing QoS routing protocols as local high energy consumption in network and short lifetime.The algorithm base on minimum hop routing algorithm,constructing the minimum hop field and the local rout table with the message flooding;Distinguish between real-time and non real-time data services; The source node choose the node for next hop from local rout table to meet the QoS requirements and the node with larger energy, reducing the nodes with litter energy to forward a low number, and balance the network energy consumption.Simulation results show that, QERA not only reduces the average delay of packet transmission, but also prolong the network lifetime.