A New Routing Algorithm for Performance improvement of Wireless Sensor Networks

In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.