Routing Algorithm Based On Energy Strategy For Wireless Sensor Networks

Wireless sensor network (WSN) is a novel technology about acquiring and processing information, it will be applied widely. Normally, the wireless sensor network consists of large numbers of micro sensor nodes, which are low-cost, low-power consumption and having the ability of apperceiving, processing and storing data, and wireless communication. The networks will be self-organized by the nodes inside. Since the nodes are small devices, they are typically equipped with battery. So the life of nodes mostly depends on the battery. How to reduce the energy consumption and extend the life of the network as long as possible will come forth in the front of network researchers when they consider the routing protocols for wireless sensor networks. This paper focuses on studying the clustering algorithm and the methods to use the node's energy efficiently. The main research and results are as follows:(1) Two kinds of hierarchical clustering algorithms are proposed in this paper. That is, centralized clustering algorithm and distributed clustering algorithm. Both of them are realized in the two hierarchy type. Two algorithms will be introduced separately. For the centralized clustering algorithm, the concept of logical node identifier is put forward. With the sink nodes, the sensor nodes could get the information about their logical node identifiers, header locations and the value of radius to clustering. Then, the nodes could exchange messages to the neighboring nodes to make sure who are headers, who are members. And the clusters are organized eventually. For the distributed clustering algorithm, the priority of a node is decided by the residential energy itself has and the number of its neighboring nodes. The nodes that have more residual energy and larger neighboring nodes number will broad the message to compete the cluster header earlier than the other nodes. And then, the processes to organize clusters started. This policy considering both the node residual energy and network connectivity can effectively reduce the number of clusters organized.(2) A new energy based on routing algorithm for wireless sensor networks (EBRA) is proposed in this paper The EBRA adopts multi-hop communication model to send out messages, based on the cluster headers selected by the centralized cluster algorithm or the distributed clustering algorithm. The realization of the EBRA will through three main steps, routing building, data transmission and routing maintenance. When a node has data to send, it will check its routing table, choose the minimal energy consumption for communication, and then send the data. The node who receives the data will do the same operation, until the data is sent to the sink node. Also, the EBRA contains an improved method for request-response data transmission mode. A continuous flag is introduced to identify whether a node could send data continuously. So the performance of data transmission will be enhanced, and as same for the rapid response capability of nodes for emergency data appears.(3) Two clustering algorithm are implemented respectively according to network simulation tools NS2.28. The simulation results tested for EBRA in the different scenarios are recorded and compared with those in the LEACH. And the analysis of the results indicates that the EBRA routing algorithm can save the energy consumption, extend the network life cycle effectively. At the same time, it could improve the throughput of the network and the data transmission.